Codeforces Round 523 (Div. 2)

6 problems from Codeforces Round 523 (Div. 2) (contest 1061), difficulty 800-2600. 3/6 solutions verified against sample I/O.

6 items

Codeforces Round 523 (Div. 2)

Div. 2 | 6 problems | 3/6 verified | Difficulty 800-2600 | 30m 19s

# Problem Rating Tags Accepted Time ✓
A Coins 800 greedy, implementation, math 24,100 1m 58s ✓
B Views Matter 1400 greedy, implementation, sortings 7,642 5m 49s ✓
C Multiplicity 1700 data-structures, dp, implementation 10,709 3m 7s
D TV Shows 2000 data-structures, greedy, implementation 2,560 3m 52s
E Politics 2600 flows, graphs 603 6m 52s ✓
F Lost Root 2400 interactive, probabilities 886 8m 41s
Practice › Codeforces Solutions › Codeforces Round 523 (Div. 2) ›

CF 1061F - Lost Root

We are given a tree that is known to be a perfect $k$-ary tree, meaning it has a root, every internal node has exactly $k$ children, and all leaves are at the same depth.
codeforces competitive-programming interactive probabilities Jun 15, 2026
Practice › Codeforces Solutions › Codeforces Round 523 (Div. 2) ›

CF 1061E - Politics

We are given two different spanning trees over the same set of cities. Each tree represents how one candidate organizes the country, with a chosen root city acting as their capital.
codeforces competitive-programming flows graphs Jun 15, 2026
Practice › Codeforces Solutions › Codeforces Round 523 (Div. 2) ›

CF 1061D - TV Shows

We are given a collection of time intervals, each representing a TV show that occupies a continuous range of minutes. The key constraint is that a single TV cannot be used to watch two shows whose intervals overlap in time.
codeforces competitive-programming data-structures greedy implementation sortings Jun 15, 2026
Practice › Codeforces Solutions › Codeforces Round 523 (Div. 2) ›

CF 1061B - Views Matter

We are given several vertical stacks of blocks placed side by side. Each position $i$ has a stack of height $ai$. From above, the camera only cares whether a position is occupied or empty, so every column contributes exactly one visible cell as long as it has at least one block.
codeforces competitive-programming greedy implementation sortings Jun 15, 2026
Practice › Codeforces Solutions › Codeforces Round 523 (Div. 2) ›

CF 1061C - Multiplicity

We are asked to count how many subsequences of a given array are “valid” under a position-based divisibility rule.
codeforces competitive-programming data-structures dp implementation math number-theory Jun 15, 2026
Practice › Codeforces Solutions › Codeforces Round 523 (Div. 2) ›

CF 1061A - Coins

We are given a collection of coin denominations that includes every integer value from 1 up to n, and we are allowed to use any number of coins of any of these values.
codeforces competitive-programming greedy implementation math Jun 15, 2026