Codeforces Round 929 (Div. 3)

Solutions for Codeforces Round 929 (Div. 3) (contest 1933). 2/7 problems verified against sample I/O. Difficulty range: 800-2300.

7 items

Codeforces Round 929 (Div. 3)

Type: Div. 3 | Problems: 7 | Verified: 2/7 | Rating range: 800-2300 | Time: 15m 27s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Turtle Puzzle: Rearrange and Negate	800	greedy, math, sortings	3m 17s	✗
B	Turtle Math: Fast Three Task	800	implementation, math, number-theory	1m 43s	✓
C	Turtle Fingers: Count the Values of k	1100	brute-force, implementation, math	1m 41s	✓
D	Turtle Tenacity: Continual Mods	1200	constructive-algorithms, greedy, math	2m 2s	✗
E	Turtle vs. Rabbit Race: Optimal Trainings	1500	binary-search, implementation, math	2m 24s	✗
F	Turtle Mission: Robot and the Earthquake	2100	dfs-and-similar, dp, graphs	2m 16s	✗
G	Turtle Magic: Royal Turtle Shell Pattern	2300	bitmasks, brute-force, combinatorics	2m 4s	✗

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

CF 1933G - Turtle Magic: Royal Turtle Shell Pattern

We are given an $n times m$ grid representing a fortune cookie box. Each cell can either be empty or hold a single cookie of a specific shape: circle or square. Initially, all cells are empty. A sequence of $q$ operations fills certain cells with a specified shape.

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

CF 1933F - Turtle Mission: Robot and the Earthquake

The problem describes a robot navigating a toroidal grid, where the rows wrap cyclically. Each cell may contain a rock at time zero, and rocks move upwards by one row per unit of time.

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

CF 1933E - Turtle vs. Rabbit Race: Optimal Trainings

We are asked to model Isaac's training across multiple running tracks. Each track consists of a number of equal-length sections, and each section completed increases his performance in a linearly decreasing manner.

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

CF 1933D - Turtle Tenacity: Continual Mods

We are given an array of integers, and we need to decide if we can reorder the array such that when we apply modulo operations consecutively from left to right, the final result is not zero.

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

CF 1933A - Turtle Puzzle: Rearrange and Negate

Take the first test case: Tree structure: - If we remove vertex 1, the neighbors are [3,4]. - The previous solution connects 3-4 for cost 1, which is correct. - If we remove vertex 4, neighbors are [1,5].

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

CF 1933B - Turtle Math: Fast Three Task

We are given an array of positive integers. On each move, we can either remove an element entirely from the array or increment an element by one. Our goal is to make the sum of the array divisible by three using as few moves as possible.

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

CF 1933C - Turtle Fingers: Count the Values of k

We are asked to count the number of distinct values $k$ such that we can represent a given number $l$ as $l = k cdot a^x cdot b^y$ for non-negative integers $x$ and $y$.