Radewoosh+mnbvmar Contest (supported by AIM Tech)

12 problems from Radewoosh+mnbvmar Contest (supported by AIM Tech) (contest 102341), difficulty -. 12/12 solutions verified against sample I/O.

12 items

Radewoosh+mnbvmar Contest (supported by AIM Tech)

Special | 12 problems | 12/12 verified | Difficulty - | 1h 13m

# Problem Rating Tags Accepted Time ✓
A Alakazam 10m 43s ✓
B Bulbasaur 5m 31s ✓
C Cloyster 1m 39s ✓
D Dedenne 6m 33s ✓
E Eevee 11m 20s ✓
F Flaaffy 5m 59s ✓
G Gurdurr 3m 57s ✓
H Hypno 2m 38s ✓
I Infernape 15m 53s ✓
J Jigglypuff 3m 15s ✓
K Kecleon 3m 7s ✓
L Lati@s 2m 41s ✓
Practice › Codeforces Solutions › Radewoosh+mnbvmar Contest (supported by AIM Tech) ›

CF 102341B - Bulbasaur

The graph consists of (n) layers, each containing exactly (k) vertices. Edges only go from layer (i) to layer (i+1). A vine is a directed path, and two vines cannot share either a vertex or an edge.
codeforces competitive-programming Aug 14, 2026
Practice › Codeforces Solutions › Radewoosh+mnbvmar Contest (supported by AIM Tech) ›

CF 102341C - Cloyster

We have an (n times n) grid, and every cell contains a distinct integer representing the shell size of the Cloyster there. The cell with the largest value is the leader. We cannot inspect the whole grid, because values are revealed only when we explicitly query a cell.
codeforces competitive-programming Aug 14, 2026
Practice › Codeforces Solutions › Radewoosh+mnbvmar Contest (supported by AIM Tech) ›

CF 102341H - Hypno

We have a connected undirected graph with up to 200,000 intersections and 200,000 roads. We start at vertex 1 and want to reach vertex n. Traversing a road takes one minute, but every road hides one of two kinds of Hypno.
codeforces competitive-programming Aug 14, 2026
Practice › Codeforces Solutions › Radewoosh+mnbvmar Contest (supported by AIM Tech) ›

CF 102341G - Gurdurr

Each layer can have only one of four stable configurations that matter to the game. A completely intact layer is III. A layer with two blocks is either II. or .II, and these two cases have identical game behavior, so we can treat them as one state.
codeforces competitive-programming Aug 14, 2026
Practice › Codeforces Solutions › Radewoosh+mnbvmar Contest (supported by AIM Tech) ›

CF 102341I - Infernape

For every query, we have several Infernape placed on vertices of one fixed tree. An Infernape at vertex (vi) with power (ri) heats exactly the vertices whose tree distance from (vi) is at most (ri). A vertex is considered good if at least (k-1) of the (k) Infernape heat it.
codeforces competitive-programming Aug 14, 2026
Practice › Codeforces Solutions › Radewoosh+mnbvmar Contest (supported by AIM Tech) ›

CF 102341E - Eevee

There are (k) stacks, each containing one fragment of every one of the (n) stones. Since every stack contains every stone exactly once, each stack is a permutation of (1,ldots,n).
codeforces competitive-programming Aug 14, 2026
Practice › Codeforces Solutions › Radewoosh+mnbvmar Contest (supported by AIM Tech) ›

CF 102341D - Dedenne

We need to assign a distinct nonempty binary codeword to each of (n) words. The code must be prefix-free, so the codewords form the leaves of a binary trie. There is one additional restriction: a codeword may never contain 00.
codeforces competitive-programming Aug 14, 2026
Practice › Codeforces Solutions › Radewoosh+mnbvmar Contest (supported by AIM Tech) ›

CF 102341L - Lati@s

The game looks enormous because one move replaces a single tuple by up to (2^n-1) new tuples, and the initial position already contains (n!) tuples. The useful way to look at it is not as a simulation, but as an impartial game whose positions have Sprague-Grundy values.
codeforces competitive-programming Aug 13, 2026
Practice › Codeforces Solutions › Radewoosh+mnbvmar Contest (supported by AIM Tech) ›

CF 102341K - Kecleon

We maintain a string of lowercase letters that grows only by appending one character to its right end. A query asks for a length (k), and we must count how many substrings of length (k) are exactly equal to the prefix of the whole string of length (k).
codeforces competitive-programming Aug 13, 2026
Practice › Codeforces Solutions › Radewoosh+mnbvmar Contest (supported by AIM Tech) ›

CF 102341J - Jigglypuff

We have an (n times m) grid of lowercase letters. A route starts at the upper-left cell, ends at the lower-right cell, and consists only of moves right and down. Every route visits exactly (n+m-1) cells, so every route produces a string of the same length.
codeforces competitive-programming Aug 13, 2026
Practice › Codeforces Solutions › Radewoosh+mnbvmar Contest (supported by AIM Tech) ›

CF 102341F - Flaaffy

The board stores a five digit decimal number, with leading zeroes allowed. Initially it displays 00000. The hidden number x is guaranteed to lie in the interval [L, R].
codeforces competitive-programming Aug 13, 2026
Practice › Codeforces Solutions › Radewoosh+mnbvmar Contest (supported by AIM Tech) ›

CF 102341A - Alakazam

We have an array of spoon counts, where position i initially contains a[i]. A shuffle l r operation takes every value currently located in the interval [l, r] and randomly permutes those values among the same positions.
codeforces competitive-programming Aug 13, 2026