与‘比赛-codeforces’有关的日志

Codeforces Educational Round 36(Rated for Div. 2) (3/7)

maksyuki 发表于 比赛 分类,标签:
0
Codeforces Educational Round 36(Rated for Div. 2) (3/7)

A Garden

Luba thinks about watering her garden. The garden can be represented as a segment of length k. Luba has got n buckets, the i-th bucket allows her to water some continuous subsegment of garden of length exactly ai each hour. Luba can't wate >>继续阅读

Codeforces Round Hello 2018 (4/8)

maksyuki 发表于 比赛 分类,标签:
0
Codeforces Round Hello 2018 (4/8)

A Modular Exponentiation

The following problem is well-known: given integers n and m, calculate,

where 2n = 2·2·...·2 (n factors), and denotes the remainder of division of x by y.

You are asked to solve the "reverse" problem. Given integers n a >>继续阅读

Codeforces Round #456(Div.2) (2/5)

maksyuki 发表于 比赛 分类,标签:
0
Codeforces Round #456(Div.2) (2/5)

A Tricky Alchemy

During the winter holidays, the demand for Christmas balls is exceptionally high. Since it's already 2018, the advances in alchemy allow easy and efficient ball creation by utilizing magic crystals.

Grisha needs to obtain some ye >>继续阅读

Codeforces Round #340(Div.2) (4/5)

maksyuki 发表于 比赛 分类,标签:
0
Codeforces Round #340(Div.2) (4/5)

A Elephant

An elephant decided to visit his friend. It turned out that the elephant's house is located at point 0 and his friend's house is located at point x(x > 0) of the coordinate line. In one step the elephant >>继续阅读

Codeforces Round #336(Div.2) (1/5) (Div.1) (0/5)

maksyuki 发表于 比赛 分类,标签:
0
Codeforces Round #336(Div.2) (1/5) (Div.1) (0/5)

A Saitama Destroys Hotel

Saitama accidentally destroyed a hotel again. To repay the hotel company, Genos has volunteered to operate an elevator in one of its other hotels. The elevator is special — it starts on the top floor, can only move down, an >>继续阅读

Codeforces Round #334(Div.2) (3/5) (Div.1) (1/5)

maksyuki 发表于 比赛 分类,标签:
0
Codeforces Round #334(Div.2) (3/5) (Div.1) (1/5)

A Uncowed Forces

Kevin Sun has just finished competing in Codeforces Round #334! The round was 120 minutes long and featured five problems with maximum point values of 500, 1000, 1500, 2000, and 2500, respectively. Despite the challenging tasks, Ke >>继续阅读

Codeforces Round #333(Div.2) (5/5) (Div.1) (3/5)

maksyuki 发表于 比赛 分类,标签:
0
Codeforces Round #333(Div.2) (5/5) (Div.1) (3/5)

A Two Bases

After seeing the "ALL YOUR BASE ARE BELONG TO US" meme for the first time, numbers X and Y realised that they have different bases, which complicated their relations. >>继续阅读

Codeforces Round #329(Div.2) (2/5)

maksyuki 发表于 比赛 分类,标签:
0
Codeforces Round #329(Div.2) (2/5)

 A 2Char

Andrew often reads articles in his favorite magazine 2Char. The main feature of these articles is that each of >>继续阅读

Codeforces Round #324(Div.2) (2/5)

maksyuki 发表于 比赛 分类,标签:
0
Codeforces Round #324(Div.2) (2/5)

A Olesya and Rodion

Olesya loves numbers consisting of n digits, and Rodion only likes numbers that are divisible by t. Find some number that satisfies both of them.Your task is: given the n and t print an integer strictly larger than zero consisti >>继续阅读

Codeforces Round #323(Div.2) (2/5) (Div.1) (0/5)

maksyuki 发表于 比赛 分类,标签:
0
Codeforces Round #323(Div.2) (2/5) (Div.1) (0/5)

A Asphalting Roads

City X consists of n vertical and n horizontal infinite roads, forming n × n intersections. Roads (both vertical and horizontal) are numbered from 1 to n, and the intersections >>继续阅读

Codeforces Round #322(Div.2) (4/6)

maksyuki 发表于 比赛 分类,标签:
0
Codeforces Round #322(Div.2) (4/6)

A Vasya the Hipster

One day Vasya the Hipster decided to count how many socks he had. It turned out that he had a red socks and bblue socks. According to the latest fashion, hipsters should wear the socks of different colors: a red one on the left >>继续阅读

Codeforces Round #321(Div.2) (2/5)

maksyuki 发表于 比赛 分类,标签:
0
Codeforces Round #321(Div.2) (2/5)

A Kefa and First Steps

Kefa decided to make some money doing business on the Internet for exactly n days. He knows that on the i-th day (1 ≤ i ≤ n) he makes ai money. Kefa loves progress, that's why he wants to know the length of the maximum non-de >>继续阅读

Codeforces Round #319(Div.2) (4/5) (Div.1) (2/5)

maksyuki 发表于 比赛 分类,标签:
0
Codeforces Round #319(Div.2) (4/5) (Div.1) (2/5)

>>继续阅读

Codeforces Round #318(Div.2) (4/5) (Div.1) (2/5)

maksyuki 发表于 比赛 分类,标签:
0
Codeforces Round #318(Div.2) (4/5) (Div.1) (2/5)

>>继续阅读

Codeforces Round #317(Div.2) (3/5) (Div.1) (1/5)

maksyuki 发表于 比赛 分类,标签:
0
Codeforces Round #317(Div.2) (3/5) (Div.1) (1/5)

A. Arrays

You are given two arrays A and B consisting of integers, sorted in non-decreasing order. Check whether it is possible to >>继续阅读

Codeforces Round #312(Div.2) (2/5)

maksyuki 发表于 比赛 分类,标签:
0
Codeforces Round #312(Div.2) (2/5)

>>继续阅读