Educational Codeforces Round 116 (Rated for Div. 2)

Solutions for Educational Codeforces Round 116 (Rated for Div. 2) (contest 1606). 2/6 problems verified against sample I/O. Difficulty range: 900-2800.

6 items

Educational Codeforces Round 116 (Rated for Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 2/6 | Rating range: 900-2800 | Time: 15m 29s

Problem Name Rating Tags Solve Time Verified
A AB Balance 900 strings 1m 30s ✗
B Update Files 1100 greedy, implementation, math 1m 19s ✓
C Banknotes 1400 greedy, number-theory 7m 46s ✗
D Red-Blue Matrix 2400 brute-force, constructive-algorithms, implementation 1m 42s ✗
E Arena 2100 combinatorics, dp, math 1m 32s ✓
F Tree Queries 2800 brute-force, dp, trees 1m 40s ✗
Practice › Codeforces Solutions › Educational Codeforces Round 116 (Rated for Div. 2) ›

CF 1606C - Banknotes

Thank you for providing the input and expected output. Now we can carefully diagnose why the previous solution is producing wrong numbers. From the sample input and output, the problem seems to be: - We are given n test cases.
codeforces competitive-programming greedy number-theory Jun 10, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 116 (Rated for Div. 2) ›

CF 1606F - Tree Queries

We are given a rooted tree where vertex 1 is fixed as the root. Each vertex has a set of children defined by the rooted structure. For a query consisting of a vertex v and a cost parameter k, we are allowed to delete any vertices except the root and v.
codeforces competitive-programming brute-force dp trees Jun 10, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 116 (Rated for Div. 2) ›

CF 1606E - Arena

We are choosing an initial health value for each of $n$ heroes, where each value is an integer between $1$ and $x$. After that, the game evolves deterministically: in every round, each living hero simultaneously deals 1 damage to every other living hero.
codeforces competitive-programming combinatorics dp math Jun 10, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 116 (Rated for Div. 2) ›

CF 1606D - Red-Blue Matrix

The task starts with a matrix of numbers where each row can later be assigned one of two labels, red or blue. After this labeling, we also choose a vertical split point that cuts the matrix into a left block of columns and a right block of columns.
codeforces competitive-programming brute-force constructive-algorithms implementation sortings Jun 10, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 116 (Rated for Div. 2) ›

CF 1606A - AB Balance

We are working with a binary string made only of characters a and b. From this string, we look at adjacent pairs of characters. Every time we see the pattern ab, we count it once, and every time we see ba, we also count it once.
codeforces competitive-programming strings Jun 10, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 116 (Rated for Div. 2) ›

CF 1606B - Update Files

We are asked to determine the minimum time required to copy an operating system update from a single initially updated computer to all the computers in a network.
codeforces competitive-programming greedy implementation math Jun 10, 2026