Rutgers University Programming Contest Spring 2026 - Open Division
14 problems from Rutgers University Programming Contest Spring 2026 - Open Division (contest 106414), difficulty -. 7/14 solutions verified against sample I/O.
Rutgers University Programming Contest Spring 2026 - Open Division
Special | 14 problems | 7/14 verified | Difficulty - | 14m 36s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Fold Distance | 45s | ||||
| B | The String Only Contains a, b, and c | 26s | ||||
| C | Cakenap Sort | 1m 31s | ✓ | |||
| D | Doubting Thomas | 23s | ||||
| E | BABA IS LOCKED | 46s | ✓ | |||
| F | Approximate Three Sum | 1m 3s | ✓ | |||
| G | Longest Step-function Subsequence | 37s | ✓ | |||
| H | NP-hard Problem | 1m 13s | ||||
| I | Ultimate Nim | 23s | ||||
| J | Superset Polygon | 49s | ✓ | |||
| K | Grid Coloring | 17s | ||||
| L | MEXpected Value | 37s | ✓ | |||
| M | XORzocity | 5m 18s | ||||
| N | Primemas | 28s | ✓ |
CF 106414M - XORzocity
Codeforces 106414M: XORzocity
CF 106414N - Primemas
We need build an integer array with a given length. The only requirement is that every pair of different positions has a prime number as its sum. The values themselves only need to stay inside the allowed range, and any valid construction is accepted.
CF 106414L - MEXpected Value
We are given an array consisting of non-negative integers. From this array we repeatedly form a random selection process over elements or substructures (typically a random permutation or a uniformly chosen subset).
CF 106414J - Superset Polygon
The task is a constructive geometry problem. We receive a set of distinct lattice points and must output the vertices of any simple lattice polygon whose boundary visits every given point.
CF 106414H - NP-hard Problem
I can write the editorial, but I need one clarification first: the problem statement section in your prompt is empty, and the title alone is not enough to safely reconstruct the intended solution.
CF 106414K - Grid Coloring
I can’t write a correct editorial for this yet because the actual problem statement is missing. Right now I only see the title “Grid Coloring”, but none of the details that define: - what the grid looks like (dimensions, initial state) - what “coloring” operations are…
CF 106414I - Ultimate Nim
I can’t responsibly write a correct full editorial yet because the exact statement of Codeforces 106414I - Ultimate Nim is not present in the data we retrieved, and the contest page only shows an interactive description without the actual rules in a stable, complete form.
CF 106414G - Longest Step-function Subsequence
The task is to find the longest subsequence of an array that has exactly one value change. The chosen elements must first contain one value A repeated one or more times, then another distinct value B repeated one or more times.
CF 106414F - Approximate Three Sum
We are given a list of integers and a target value. The task is to choose any three distinct elements from the list such that the sum of those three numbers is as close as possible to the target.
CF 106414E - BABA IS LOCKED
We have an n by m grid. A path starts at the bottom-left cell and must finish at the top-right cell. At every move, the path may go one cell up, one cell left, or one cell right. It can never go down and it can never step on a cell twice.
CF 106414C - Cakenap Sort
We are given a permutation, meaning every number from 1 to n appears exactly once. An operation takes some prefix of the current array, reverses that prefix, and then moves the whole modified prefix to the end of the array. The task is not to minimize the number of operations.
CF 106414D - Doubting Thomas
I can’t reliably write a correct editorial for this yet because the actual problem statement is missing from your prompt.
CF 106414A - Fold Distance
I can write the full editorial in that format, but the problem statement is missing. The sections under “Problem Statement”, “Input”, and “Output” are empty, and I do not have enough information to determine what “Fold Distance” asks for, the constraints…