Codeforces Beta Round 65 (Div. 2)

5 problems from Codeforces Beta Round 65 (Div. 2) (contest 71), difficulty 800-2200. 4/5 solutions verified against sample I/O.

5 items

Codeforces Beta Round 65 (Div. 2)

Div. 2 | 5 problems | 4/5 verified | Difficulty 800-2200 | 8m 23s

# Problem Rating Tags Accepted Time ✓
A Way Too Long Words 800 strings 502,956 1m 28s ✓
B Progress Bar 1300 implementation, math 5,272 1m 7s ✓
C Round Table Knights 1600 dp, math, number-theory 7,325 1m 40s ✓
D Solitaire 2200 brute-force, implementation 769 2m 18s ✓
E Nuclear Fusion 2200 bitmasks, dp 943 1m 50s
Practice › Codeforces Solutions › Codeforces Beta Round 65 (Div. 2) ›

CF 71A - Way Too Long Words

We are given several lowercase words and must shorten only the ones that are considered "too long". A word is too long if its length is greater than 10. The shortening rule is very specific.
codeforces competitive-programming strings May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 65 (Div. 2) ›

CF 71B - Progress Bar

We are asked to construct a graphical progress bar as an array of squares, where each square has a saturation value. The bar has a total of n squares, and the maximum saturation is k.
codeforces competitive-programming implementation math May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 65 (Div. 2) ›

CF 71C - Round Table Knights

The knights sit on a circle, equally spaced. Each position is marked either 1 for a knight in a good mood or 0 for a knight in a bad mood.
codeforces competitive-programming dp math number-theory May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 65 (Div. 2) ›

CF 71D - Solitaire

We are given a rectangular board filled with playing cards. The board size is at most $17 times 17$, but the total number of placed cards never exceeds 52 because the deck has only 52 regular cards plus two jokers. A valid 3×3 square must satisfy one of two properties: 1.
codeforces competitive-programming brute-force implementation May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 65 (Div. 2) ›

CF 71E - Nuclear Fusion

We are given a set of atoms with known atomic numbers and a target set of atoms we want to produce using fusion. Each fusion operation combines exactly two atoms into one, and the resulting atom’s atomic number is the sum of the two original numbers. We cannot split atoms.
codeforces competitive-programming bitmasks dp May 28, 2026