Rutgers University Programming Contest Spring 2025

14 problems from Rutgers University Programming Contest Spring 2025 (contest 105813), difficulty -. 10/14 solutions verified against sample I/O.

14 items

Rutgers University Programming Contest Spring 2025

Special | 14 problems | 10/14 verified | Difficulty - | 9m 25s

#	Problem	Time	✓
A	Thomas	43s	✓
B	Stone Jump	35s	✓
C	Maxwell's Tiles	1m 2s	✓
D	Distributive Property	47s	✓
E	1D Super Checkers Solitaire	29s	✓
F	Walkable Strings	1m 11s	✓
G	K-Regular Array	31s	✓
H	Cubist Painting	1m 6s	✓
I	Unfair Game	26s
J	Another Expected Value Problem	23s
K	Pointers	24s
L	Permutation Recovery	42s	✓
M	Subsequence MEX	43s	✓
N	Ramen Packs	23s

Practice › Codeforces Solutions › Rutgers University Programming Contest Spring 2025 ›

CF 105813F - Walkable Strings

We are given an undirected graph whose edges are colored either R or B. A string is called walkable if there exists some walk in the graph whose edge colors, read in order, exactly match the characters of the string. Walks may revisit vertices and edges.

Practice › Codeforces Solutions › Rutgers University Programming Contest Spring 2025 ›

CF 105813C - Maxwell's Tiles

We are given a rectangular wall of size $2m times 2n$, centered at the origin on the integer grid. Each unit square cell is identified by integer coordinates $(x, y)$ inside this rectangle.

Practice › Codeforces Solutions › Rutgers University Programming Contest Spring 2025 ›

CF 105813N - Ramen Packs

I’m missing the actual problem statement for Codeforces 105813N - Ramen Packs, so I can’t safely reconstruct the solution or write a correct editorial without risking hallucination. Please paste the full statement (input, output, constraints, and any samples).

Practice › Codeforces Solutions › Rutgers University Programming Contest Spring 2025 ›

CF 105813K - Pointers

I can’t write a correct editorial for this yet because the actual problem statement is missing. “Codeforces 105813K - Pointers” isn’t enough to reconstruct the task reliably, and anything I invent here would very likely describe the wrong problem entirely.

Practice › Codeforces Solutions › Rutgers University Programming Contest Spring 2025 ›

CF 105813J - Another Expected Value Problem

The problem statement is missing from your prompt, and for a Codeforces expected value problem the exact rules matter down to the last probability detail. Please paste the full statement (or at least the rules, constraints, and what is being expected over).

Practice › Codeforces Solutions › Rutgers University Programming Contest Spring 2025 ›

CF 105813I - Unfair Game

I don’t have the actual problem statement for “Codeforces 105813I - Unfair Game” in your prompt, and the sections for Input/Output are empty.

Practice › Codeforces Solutions › Rutgers University Programming Contest Spring 2025 ›

CF 105813D - Distributive Property

We are working with a dynamic set of integers. The set starts with some initial values, and then it is modified through queries where elements can be toggled in and out.

Practice › Codeforces Solutions › Rutgers University Programming Contest Spring 2025 ›

CF 105813A - Thomas

We are asked to construct a large collection of binary strings of fixed length $n$, with a single restriction on how any two chosen strings may differ. Each string is made of zeros and ones.

Practice › Codeforces Solutions › Rutgers University Programming Contest Spring 2025 ›

CF 105813M - Subsequence MEX

We are given a large integer written as a string of digits, and we are asked to construct another integer $n$ such that a very specific property holds: consider all integers that can be formed by deleting some digits from $n$ while preserving order, and take the set of all…

Practice › Codeforces Solutions › Rutgers University Programming Contest Spring 2025 ›

CF 105813L - Permutation Recovery

We are given two hidden permutations of the same size, call them $a$ and $b$. Instead of seeing them directly, we are given two derived arrays that encode how the two permutations compose with each other in opposite directions.

Practice › Codeforces Solutions › Rutgers University Programming Contest Spring 2025 ›

CF 105813H - Cubist Painting

We are given a rectangular wall that is two rows high and very long in width. A special cube is used as a painting tool.

Practice › Codeforces Solutions › Rutgers University Programming Contest Spring 2025 ›

CF 105813G - K-Regular Array

We are asked to construct an array of length $n$ using integers from $1$ to $k$, with a strong local constraint: every contiguous segment of length $k$ must contain all values from $1$ to $k$ exactly once. This condition is quite restrictive.

Practice › Codeforces Solutions › Rutgers University Programming Contest Spring 2025 ›

CF 105813E - 1D Super Checkers Solitaire

We are working with a one-dimensional board that contains a white piece fixed initially at position -1 and several black pieces placed at distinct integer coordinates on the positive number line.

Practice › Codeforces Solutions › Rutgers University Programming Contest Spring 2025 ›

CF 105813B - Stone Jump

There are stones placed in a line, each stone labeled either L or R. The label defines a directional constraint on how you are allowed to move once you stand on that stone. If you are currently on an L stone, you are allowed to jump to any stone strictly to its left.