Turtle Codes

12 problems from Turtle Codes (contest 104669), difficulty -. 9/12 solutions verified against sample I/O.

12 items

Turtle Codes

Special | 12 problems | 9/12 verified | Difficulty - | 15m 11s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Turtle Art				1m 10s
B	String Shifts				57s	✓
C	Max Permutation				1m 45s
D	Binary Sorting				56s	✓
E	Turnaround				55s	✓
F	Senioritis				1m 15s	✓
G	No Anime				1m 29s	✓
H	Cake				41s	✓
I	2048				1m 23s
J	Keys and the Subtree Permutation (Easy Version)				1m 10s	✓
K	Keys and the Subtree Permutation (Hard Version)				1m 25s	✓
L	Turtle and GCD				2m 5s	✓

Practice › Codeforces Solutions › Turtle Codes ›

CF 104669L - Turtle and GCD

We are given a consecutive segment of integers starting at a and containing b numbers. So the set is a simple interval: a, a+1, ..., a+b-1. We must split this set into two nonempty groups, and then compute the sum of each group.

Practice › Codeforces Solutions › Turtle Codes ›

CF 104669K - Keys and the Subtree Permutation (Hard Version)

The tree gives us a hierarchy of nodes where each node owns a value between 1 and N. For every node, we look at the nodes in its subtree and ask a structural question about the values stored there: whether those values form exactly a permutation of consecutive integers…

Practice › Codeforces Solutions › Turtle Codes ›

CF 104669B - String Shifts

We are given a single string that is known to come from a Caesar-style letter shift applied to some original text. In such a transformation, every character in the original string is moved forward in the alphabet by a fixed number of positions, wrapping around from z back to a.

Practice › Codeforces Solutions › Turtle Codes ›

CF 104669I - 2048

We are given a 4 by 4 board from a simplified 2048 game. Each cell contains either zero or a power-of-two tile. A zero means the cell is empty. The board evolves by applying moves, but unlike the original game, no new tiles ever appear.

Practice › Codeforces Solutions › Turtle Codes ›

CF 104669J - Keys and the Subtree Permutation (Easy Version)

A tree is given with nodes numbered from 1 to N, rooted at node 1. Each node carries a distinct label, and these labels form a permutation of the numbers from 1 to N. For every node, we look at the nodes inside its rooted subtree and collect their labels.

Practice › Codeforces Solutions › Turtle Codes ›

CF 104669G - No Anime

We are dealing with two agents on an infinite 2D grid. One agent, Keys, moves every second by exactly one grid step in one of the four cardinal directions. After moving, Keys leaves a permanent “poster” on the cell he just left.

Practice › Codeforces Solutions › Turtle Codes ›

CF 104669H - Cake

We are given a square cake of side length $N$. The cake is cut from left to right using a sequence of heights defined by a permutation of the integers from $0$ to $N$.

Practice › Codeforces Solutions › Turtle Codes ›

CF 104669F - Senioritis

We are given a group of students, each with a GPA value between 0 and 5. A student is considered “safe” only if their GPA reaches at least 2.8 after possible improvement.

Practice › Codeforces Solutions › Turtle Codes ›

CF 104669E - Turnaround

We are given a non-negative integer and asked to reinterpret it through a transformation on its binary representation. The process is straightforward in description but slightly indirect in execution.

Practice › Codeforces Solutions › Turtle Codes ›

CF 104669D - Binary Sorting

We are given a binary string and we are allowed to pick any contiguous segment and reverse it in one move. After performing several such reversals, we want the string to end up in a form where all zeros appear before all ones.

Practice › Codeforces Solutions › Turtle Codes ›

CF 104669C - Max Permutation

We are given a single number $n$, and we must output a permutation of the integers from $1$ to $n$. For each position $i$, we compute a value formed by multiplying the index and the value placed there, namely $i cdot pi$.

Practice › Codeforces Solutions › Turtle Codes ›

CF 104669A - Turtle Art

The task is purely about formatting output. We are given a single string representing a name, and we must print it exactly as it appears, followed by a fixed ASCII drawing of a turtle. The drawing does not depend on the input at all, only the first line changes.