Codeforces Round 462 (Div. 2)

2 problems from Codeforces Round 462 (Div. 2) (contest 934), difficulty 1200-1400. 2/2 solutions verified against sample I/O.

2 items

Codeforces Round 462 (Div. 2)

Div. 2 | 2 problems | 2/2 verified | Difficulty 1200-1400 | 2m 40s

# Problem Rating Tags Accepted Time ✓
A A Compatible Pair 1400 brute-force, games 7,600 1m 8s ✓
B A Prosperous Lot 1200 constructive-algorithms, implementation 9,163 1m 32s ✓
Practice › Codeforces Solutions › Codeforces Round 462 (Div. 2) ›

CF 934B - A Prosperous Lot

We are asked to construct a positive integer not exceeding $10^{18}$ such that when it is written in base 10, the total number of “loops” formed by its digits is exactly $k$.
codeforces competitive-programming constructive-algorithms implementation Jun 17, 2026
Practice › Codeforces Solutions › Codeforces Round 462 (Div. 2) ›

CF 934A - A Compatible Pair

Two players are interacting with two arrays of integers. One player owns an array of length n, the other owns an array of length m. Each number represents a lantern’s brightness, and brightness can be positive, negative, or zero. The interaction is adversarial.
codeforces competitive-programming brute-force games Jun 17, 2026