Codeforces Round 201 (Div. 1)

5 problems from Codeforces Round 201 (Div. 1) (contest 346), difficulty 1600-3000. 3/5 solutions verified against sample I/O.

5 items

Codeforces Round 201 (Div. 1)

Div. 1 | 5 problems | 3/5 verified | Difficulty 1600-3000 | 6m 17s

# Problem Rating Tags Accepted Time ✓
A Alice and Bob 1600 games, math, number-theory 9,347 1m 22s ✓
B Lucky Common Subsequence 2000 dp, strings 4,258 1m 5s ✓
C Number Transformation II 2200 greedy, math 1,506 35s
D Robot Control 2600 dp, graphs, shortest-paths 841 1m 50s
E Doodle Jump 3000 math, number-theory 293 1m 25s ✓
Practice › Codeforces Solutions › Codeforces Round 201 (Div. 1) ›

CF 346C - Number Transformation II

We start with a number a and want to reduce it down to b using two types of moves. One move simply decreases the current value by 1. The other move is more interesting: we pick one of the given numbers xi and subtract the remainder of the current value when divided by xi.
codeforces competitive-programming greedy math Jun 6, 2026
Practice › Codeforces Solutions › Codeforces Round 201 (Div. 1) ›

CF 346A - Alice and Bob

We start with a finite set of distinct positive integers. Two players alternate turns, and on each turn a player is allowed to take any two existing numbers, compute their absolute difference, and insert that value into the set if it is not already present.
codeforces competitive-programming games math number-theory Jun 6, 2026
Practice › Codeforces Solutions › Codeforces Round 201 (Div. 1) ›

CF 346E - Doodle Jump

We are given a sequence of platform heights generated by a modular arithmetic rule. The x-th platform sits at height (a · x) mod p, where a and p are coprime and we only consider the first n such positions.
codeforces competitive-programming math number-theory Jun 6, 2026
Practice › Codeforces Solutions › Codeforces Round 201 (Div. 1) ›

CF 346D - Robot Control

We are given a directed graph representing a map a robot can traverse. The robot starts at a vertex s and must reach a target vertex t.
codeforces competitive-programming dp graphs shortest-paths Jun 6, 2026
Practice › Codeforces Solutions › Codeforces Round 201 (Div. 1) ›

CF 346B - Lucky Common Subsequence

We are asked to build a sequence that appears as a subsequence of two given strings while avoiding a third string as a contiguous pattern.
codeforces competitive-programming dp strings Jun 6, 2026