CerealCodes II Intermediate

11 problems from CerealCodes II Intermediate (contest 104522), difficulty -. 2/11 solutions verified against sample I/O.

11 items

CerealCodes II Intermediate

Special | 11 problems | 2/11 verified | Difficulty - | 21m 29s

#	Problem	Time	✓
A	World's Hardest Math Problem	1m	✓
B	Cascading Sums	1m 28s	✓
C	Cereal Trees III	3m 15s
D	Mismatched Material	1m 54s
E	Panda-monium	1m 29s
F	Candy Machine	1m 39s
G	Jack-o'-Lanterns	1m 47s
H	Pollination	1m 35s
I	Friend Groups	1m 50s
J	Aquamist	2m 2s
K	Roses	3m 30s

Practice › Codeforces Solutions › CerealCodes II Intermediate ›

CF 104522K - Roses

This failure is a direct consequence of the previous “mode-splitting” fix being incorrect. Your program is now doing this: If input has 2 integers → treat as arithmetic problem and print derived formula Otherwise → treat as stack simulation For the input: you…

Practice › Codeforces Solutions › CerealCodes II Intermediate ›

CF 104522J - Aquamist

We start with a collection of stacks, each stack having a fixed capacity of $m$. Initially, stacks $1$ through $n-1$ are perfectly uniform: stack $i$ contains exactly $m$ blocks, and every block inside it carries label $i$. The last stack is empty.

Practice › Codeforces Solutions › CerealCodes II Intermediate ›

CF 104522I - Friend Groups

We are given a tree with an even number of nodes, so every node belongs to exactly one friend pair. Each pair connects two nodes, and we can think of it as a fixed relationship that travels through the tree along the unique simple path between those nodes.

Practice › Codeforces Solutions › CerealCodes II Intermediate ›

CF 104522H - Pollination

We are given a square grid of size $(2n+1) times (2n+1)$ with a single distinguished center cell. All cells whose Manhattan distance from the center is between 1 and $n$ form a “ringed diamond” shape, and every such cell must be covered exactly once.

Practice › Codeforces Solutions › CerealCodes II Intermediate ›

CF 104522G - Jack-o'-Lanterns

We are given a line of pumpkins. Each pumpkin has two attributes: a value that we gain if we eat it, and a radius that determines how far its “light” spreads when we carve it. Over time, we process a fixed sequence of operations indexed from 1 to n.

Practice › Codeforces Solutions › CerealCodes II Intermediate ›

CF 104522F - Candy Machine

We are given a rooted tree, and each edge carries a weight that defines how likely a process moves through that edge. The process starts at the root. Whenever we “activate” a node, we spend one unit of cost, and that node becomes empty.

Practice › Codeforces Solutions › CerealCodes II Intermediate ›

CF 104522C - Cereal Trees III

This is no longer a logic bug. It is a hard input-structure mismatch combined with incorrect consumption of the input stream. The crash: means: your parser assumes more integers exist than were actually provided.

Practice › Codeforces Solutions › CerealCodes II Intermediate ›

CF 104522E - Panda-monium

We are given a rooted tree where every node initially hosts a single panda. The goal is to release pandas over time so that they all eventually move upward toward the root, one step per second once released. A panda at the root does not move further but still counts as released.

Practice › Codeforces Solutions › CerealCodes II Intermediate ›

CF 104522D - Mismatched Material

We are given an array a of length n. We are allowed to change some of its elements. After these changes, we want the array to be compatible with the existence of another array b of length n+1, where every value in a is defined as the maximum of two adjacent values in b.

Practice › Codeforces Solutions › CerealCodes II Intermediate ›

CF 104522B - Cascading Sums

We are working with a transformation from integers to other integers, defined through decimal representation. Take any positive integer and look at all of its prefixes in base 10. Each prefix is formed by cutting the number from the right side, keeping at least one digit.

Practice › Codeforces Solutions › CerealCodes II Intermediate ›

CF 104522A - World's Hardest Math Problem

We are given a starting integer $x$, and we are allowed to adjust it by choosing a small integer $y$ between 0 and 100. After choosing $y$, we compute the number $n = x + y$, then form two values: $n^2$ and $n^3$.