Codeforces Round 592 (Div. 2)

7 problems from Codeforces Round 592 (Div. 2) (contest 1244), difficulty 800-2400. 2/7 solutions verified against sample I/O.

7 items

Codeforces Round 592 (Div. 2)

Div. 2 | 7 problems | 2/7 verified | Difficulty 800-2400 | 32m 42s

# Problem Rating Tags Accepted Time ✓
A Pens and Pencils 800 math 20,065 2m 33s
B Rooms and Staircases 1000 brute-force, implementation 17,542 2m 33s
C The Football Season 2000 brute-force, math, number-theory 8,285 5m 25s
D Paint the Tree 1800 brute-force, constructive-algorithms, dp 8,299 2m 52s ✓
E Minimizing Difference 2000 binary-search, constructive-algorithms, greedy 6,401 7m 31s
F Chips 2300 constructive-algorithms, implementation 1,633 5m 14s ✓
G Running in Pairs 2400 constructive-algorithms, greedy, math 1,529 6m 34s
Practice › Codeforces Solutions › Codeforces Round 592 (Div. 2) ›

CF 1244G - Running in Pairs

We are given two groups of runners, each group containing the integers from 1 to n. We must arrange each group into a permutation, one for the first track and one for the second track.
codeforces competitive-programming constructive-algorithms greedy math Jun 15, 2026
Practice › Codeforces Solutions › Codeforces Round 592 (Div. 2) ›

CF 1244E - Minimizing Difference

We are given a list of integers and a limited budget of unit operations. Each operation lets us pick a single element and move it by exactly one step, either up or down.
codeforces competitive-programming binary-search constructive-algorithms greedy sortings ternary-search two-pointers Jun 15, 2026
Practice › Codeforces Solutions › Codeforces Round 592 (Div. 2) ›

CF 1244F - Chips

We are given a circular arrangement of cells, each cell holding either white or black. The system evolves in discrete steps, and each cell updates its color by looking at a fixed local neighborhood: itself and its two adjacent cells on the circle.
codeforces competitive-programming constructive-algorithms implementation Jun 15, 2026
Practice › Codeforces Solutions › Codeforces Round 592 (Div. 2) ›

CF 1244C - The Football Season

We are given a season summary for a football team, but instead of individual match results, only aggregated information is known. The team played exactly $n$ matches and accumulated a total of $p$ points.
codeforces competitive-programming brute-force math number-theory Jun 15, 2026
Practice › Codeforces Solutions › Codeforces Round 592 (Div. 2) ›

CF 1244B - Rooms and Staircases

We are given a building with two parallel rows of rooms, one row per floor, and each row has $n$ rooms arranged left to right. From any room, movement is allowed horizontally to adjacent rooms on the same floor.
codeforces competitive-programming brute-force implementation Jun 15, 2026
Practice › Codeforces Solutions › Codeforces Round 592 (Div. 2) ›

CF 1244A - Pens and Pencils

Polycarp has two types of work tomorrow: writing lectures and drawing during practical classes. For lectures he must use pens, and each pen can be used for a limited number of lectures before it dries out.
codeforces competitive-programming math Jun 15, 2026
Practice › Codeforces Solutions › Codeforces Round 592 (Div. 2) ›

CF 1244D - Paint the Tree

We are given a tree where each node must be assigned one of three colors, and each assignment has a cost depending on the chosen color.
codeforces competitive-programming brute-force constructive-algorithms dp graphs implementation trees Jun 13, 2026