TeamsCode Summer 2024 Advanced Division

11 problems from TeamsCode Summer 2024 Advanced Division (contest 105284), difficulty -. 1/11 solutions verified against sample I/O.

11 items

TeamsCode Summer 2024 Advanced Division

Special | 11 problems | 1/11 verified | Difficulty - | 19m 36s

# Problem Rating Tags Accepted Time ✓
A P!=NP 1m 27s ✓
B Monkey Arrays 1m 36s
C Monkey Math Tree 1m 30s
D Kawaii the Rinbot 1m 39s
E Waymo orzorzorz 1m 34s
F Stage 4 1m 30s
G Ifrit Tile 1m 38s
H Thomas Sometimes Hides His Feelings in C++ 2m 29s
I Flappy Deer 1m 43s
J Grid Product 2m 48s
K The Astral Express 1m 42s
Practice › Codeforces Solutions › TeamsCode Summer 2024 Advanced Division ›

CF 105284J - Grid Product

We are given a grid of upper bounds, and we consider all integer grids of the same size where each cell is chosen independently within its allowed range. For each such choice of grid values, we compute a score formed from row sums and column sums.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › TeamsCode Summer 2024 Advanced Division ›

CF 105284K - The Astral Express

We are given a one-dimensional universe made of segments arranged in a line. Each segment has a value, initially either +1 or -1 depending on whether it lies in the left half or the right half of the array.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › TeamsCode Summer 2024 Advanced Division ›

CF 105284I - Flappy Deer

We are simulating a character that moves strictly from left to right on an infinite grid. Time advances in discrete steps, and at every step the x-coordinate increases by one, while the y-coordinate can change by at most one unit up or down.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › TeamsCode Summer 2024 Advanced Division ›

CF 105284G - Ifrit Tile

We are given a tree with $n$ nodes. Each of $m$ colors corresponds to a fixed simple path in this tree, defined by two endpoints $si$ and $ti$. Think of each color as a group of tokens that would occupy every node on that path when active.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › TeamsCode Summer 2024 Advanced Division ›

CF 105284F - Stage 4

We start with a single integer value and process a sequence of operations. Each element in the permutation gives us a binary choice: either we add that number to the current value, or we flip a single bit of the current value using XOR with a power of two determined by the…
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › TeamsCode Summer 2024 Advanced Division ›

CF 105284E - Waymo orzorzorz

Jason starts from an empty text and wants to end up with a text consisting of the string "orz" repeated at least $N$ times.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › TeamsCode Summer 2024 Advanced Division ›

CF 105284D - Kawaii the Rinbot

We are given a fixed external database that can be thought of as a long ordered list of anime titles, each sitting on a specific line number starting from 1.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › TeamsCode Summer 2024 Advanced Division ›

CF 105284B - Monkey Arrays

We are given an array and three distinguished values, $X$, $Y$, and $K$, with the ordering $Y < K < X$. For each test case, we need to count subarrays where two extremal conditions hold simultaneously: within the subarray, the maximum value must be exactly $X$, the minimum…
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › TeamsCode Summer 2024 Advanced Division ›

CF 105284C - Monkey Math Tree

We are given a path graph with nodes numbered from 1 to n, where each node is connected to its immediate neighbors. Then each node i is independently kept with probability 1/i and removed with probability 1 − 1/i.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › TeamsCode Summer 2024 Advanced Division ›

CF 105284H - Thomas Sometimes Hides His Feelings in C++

We are given an even number of indices, each representing a character trope. Between every ordered pair of tropes we have a directed value, which may be negative one meaning the relationship is forbidden, or a nonzero modular value otherwise.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › TeamsCode Summer 2024 Advanced Division ›

CF 105284A - P!=NP

We are asked to count integer pairs $(n, p)$ where $p$ is constrained to lie between $0$ and $P$, and two arithmetic conditions involving multiplication and factorial-like behavior must both hold.
codeforces competitive-programming Jun 23, 2026