CerealCodes III Novice Division

10 problems from CerealCodes III Novice Division (contest 105309), difficulty -. 3/10 solutions verified against sample I/O.

10 items

CerealCodes III Novice Division

Special | 10 problems | 3/10 verified | Difficulty - | 17m 25s

#	Problem	Time	✓
A	World's Hardest Math Problem II	1m 19s	✓
B	Simple Arrays	2m 31s	✓
C	Shiori Novella's 3D Showcase	1m 31s
D	Cereal Grids III (Easy Version)	1m 25s
E	Red Pandaships	1m 57s
F	Yet Another Count the Pairs Satisfying a Condition Problem	1m 10s	✓
G	Red Pandacakes	2m 15s
H	Easy palindrome question	1m 24s
I	Range Flips	2m 26s
J	Red Pandatrees	1m 27s

Practice › Codeforces Solutions › CerealCodes III Novice Division ›

CF 105309I - Range Flips

We are given two strings of equal length, and we are allowed to modify the first string using operations that act on contiguous segments. Each operation chooses a segment and applies one of two fixed transformations to every character in that segment.

Practice › Codeforces Solutions › CerealCodes III Novice Division ›

CF 105309J - Red Pandatrees

We are given an unrooted tree on $n$ nodes and a target permutation of its nodes. The final goal is to transform the tree, through a sequence of global “re-rooting shuffles”, into a rooted line-shaped tree such that a DFS starting from the root visits nodes exactly in the…

Practice › Codeforces Solutions › CerealCodes III Novice Division ›

CF 105309G - Red Pandacakes

We are given a circle of pancake stores. Each store holds some number of pancakes, and all stores are arranged in a cycle so that moving past the last store wraps back to the first. Two players interact with this circle.

Practice › Codeforces Solutions › CerealCodes III Novice Division ›

CF 105309E - Red Pandaships

We are given several test cases. In each test case, there are $n$ red pandas arranged in a circle and $k$ initial pairs of pandas already connected by non-intersecting chords.

Practice › Codeforces Solutions › CerealCodes III Novice Division ›

CF 105309F - Yet Another Count the Pairs Satisfying a Condition Problem

We are given a permutation of length $n$, meaning every value from $1$ to $n$ appears exactly once in the array. Each index $i$ has a value $ai$, and we can think of the permutation as defining a one-to-one mapping between positions and values.

Practice › Codeforces Solutions › CerealCodes III Novice Division ›

CF 105309B - Simple Arrays

We are given an array where every element is either 0, 1, or 2. We are allowed to independently flip the sign of any elements. After choosing signs, we want to know whether it is possible to make the total sum of the array equal to zero.

Practice › Codeforces Solutions › CerealCodes III Novice Division ›

CF 105309C - Shiori Novella's 3D Showcase

The grid can be seen as a board of binary tiles. Each cell contains either a 0 or a 1, and we are allowed to flip a cell, turning 0 into 1 or 1 into 0. The goal is to modify the grid so that no two neighboring cells, horizontally or vertically, share the same value.

Practice › Codeforces Solutions › CerealCodes III Novice Division ›

CF 105309D - Cereal Grids III (Easy Version)

We are asked to construct an $n times n$ binary grid using exactly $k$ ones and $n^2 - k$ zeros. The only requirement on the grid is structural: when we look at all rows as binary strings and all columns as binary strings, the number of distinct rows plus the number of…

Practice › Codeforces Solutions › CerealCodes III Novice Division ›

CF 105309H - Easy palindrome question

We are given a sequence of length $n$, where each position represents how many problems a friend solved on that day. Some values are already known, some are unknown and marked as $-1$, meaning they can be freely chosen. We are also given two types of constraints.

Practice › Codeforces Solutions › CerealCodes III Novice Division ›

CF 105309A - World's Hardest Math Problem II

We are asked to construct any number of a given length $n$, where $2 le n le 6$, such that two conditions hold simultaneously. First, the number must be rotationally symmetric under a 180-degree rotation.