CerealCodes II Novice

9 problems from CerealCodes II Novice (contest 104521), difficulty -. 2/9 solutions verified against sample I/O.

9 items

CerealCodes II Novice

Special | 9 problems | 2/9 verified | Difficulty - | 17m 2s

# Problem Rating Tags Accepted Time ✓
A World's Hardest Math Problem 1m 8s ✓
B Palindromicity 2m 16s
C Reordering Red Pandas 1m 39s
D Allen's Xor(z) 1m 33s
E Cascading Sums 1m 39s ✓
F Cereal Trees III 3m 16s
G Panda-monium 1m 59s
H Asteroid Trek 2m 3s
I Pollination 1m 29s
Practice › Codeforces Solutions › CerealCodes II Novice ›

CF 104521I - Pollination

We are given a square grid of size $(2n+1) times (2n+1)$ with a distinguished center cell. All cells whose Manhattan distance from the center is between 1 and $n$ are considered active cells, called petals. The center cell itself is not part of the region we need to cover.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › CerealCodes II Novice ›

CF 104521F - Cereal Trees III

This failure is not algorithmic. It is purely an input parsing bug. The program assumes every test input begins with: But the failing input is: So the first token is already part of a test case, not the number of test cases.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › CerealCodes II Novice ›

CF 104521H - Asteroid Trek

Two people start outside a line of asteroids: Jesse starts just before the first asteroid, and Jerry starts just after the last one. Each asteroid has a fixed size, and both players move step by step toward each other until they end up on the same asteroid.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › CerealCodes II Novice ›

CF 104521G - Panda-monium

We are given a rooted tree where every node contains a panda, and all pandas must eventually travel toward the root along unique tree paths.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › CerealCodes II Novice ›

CF 104521E - Cascading Sums

We are given a function that transforms a positive integer by repeatedly taking its decimal prefixes and summing them.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › CerealCodes II Novice ›

CF 104521D - Allen's Xor(z)

We are given an array of integers, and we are allowed to repeatedly perform a very specific transformation: pick two different positions in the array and pick an integer mask x, then apply XOR with x to both selected elements.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › CerealCodes II Novice ›

CF 104521B - Palindromicity

We are building a binary string of length n, and we want it to differ from its reverse in exactly k positions. For each position i, we compare the character at i with the character at its mirrored position n-i+1.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › CerealCodes II Novice ›

CF 104521C - Reordering Red Pandas

We are given a set of red pandas, but instead of knowing their positions on the line, we are only given how far apart each pair of pandas is. Separately, we are also given a sorted list of actual coordinates on the number line.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › CerealCodes II Novice ›

CF 104521A - World's Hardest Math Problem

We are given a small integer $x$, and we are allowed to add another integer $y$ where $0 le y le 100$. From this shifted value $n = x + y$, we compute two numbers: $n^2$ and $n^3$.
codeforces competitive-programming Jun 30, 2026