Codeforces Round 1013 (Div. 3)

7 problems from Codeforces Round 1013 (Div. 3) (contest 2091), difficulty 800-2300. 5/7 solutions verified against sample I/O.

7 items

Codeforces Round 1013 (Div. 3)

Div. 3 | 7 problems | 5/7 verified | Difficulty 800-2300 | 10m 5s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Olympiad Date	800	greedy, strings	39,020	1m 37s	✓
B	Team Training	800	dp, greedy, sortings	32,696	1m 12s	✓
C	Combination Lock	1000	constructive-algorithms, greedy	28,817	1m 33s
D	Place of the Olympiad	1200	binary-search, greedy, math	23,484	1m 29s	✓
E	Interesting Ratio	1300	brute-force, math, number-theory	19,626	1m 12s	✓
F	Igor and Mountain	1800	binary-search, brute-force, dp	6,156	1m 28s	✓
G	Gleb and Boating	2300	brute-force, constructive-algorithms, data-structures	1,522	1m 34s

Practice › Codeforces Solutions › Codeforces Round 1013 (Div. 3) ›

CF 2091G - Gleb and Boating

Gleb needs to travel along a one-dimensional river segment from position 0 to position $s$ using a kayak. He starts with a given power $k$, and each paddle stroke moves him exactly his current power in the direction he is facing.

Practice › Codeforces Solutions › Codeforces Round 1013 (Div. 3) ›

CF 2091F - Igor and Mountain

We are given a rectangular grid representing a vertical slice of a mountain. Each cell is either empty or contains a hold that Igor can use. The rows are horizontal layers of the mountain, with row 1 at the top and row n at the bottom. The columns are vertical segments.

Practice › Codeforces Solutions › Codeforces Round 1013 (Div. 3) ›

CF 2091E - Interesting Ratio

We are asked to count pairs of integers $(a, b)$ where $1 le a < b le n$ such that the ratio $F(a, b) = frac{text{lcm}(a, b)}{gcd(a, b)}$ is a prime number.

Practice › Codeforces Solutions › Codeforces Round 1013 (Div. 3) ›

CF 2091D - Place of the Olympiad

We are given a rectangular hall with n rows and m spots per row where participants can sit. A total of k participants need seats. Desks that are consecutive in the same row form a bench, and the bench's length is the number of consecutive desks.

Practice › Codeforces Solutions › Codeforces Round 1013 (Div. 3) ›

CF 2091A - Olympiad Date

We are asked to figure out the earliest step at which a specific date, March 1, 2025, can be formed from a sequence of digits drawn one by one.

Practice › Codeforces Solutions › Codeforces Round 1013 (Div. 3) ›

CF 2091C - Combination Lock

We are asked to construct a permutation of numbers from 1 to $n$ with a very specific property: for every cyclic shift of the permutation, there should be exactly one fixed point. A fixed point in a permutation is an index $i$ such that the element at that index equals $i$.

Practice › Codeforces Solutions › Codeforces Round 1013 (Div. 3) ›

CF 2091B - Team Training

We are given a group of students, each with a fixed skill value, and we must split them into teams so that every student belongs to exactly one team. For any team, its strength is defined as the number of students in the team multiplied by the smallest skill inside that team.