Codeforces Round 603 (Div. 2)

5 problems from Codeforces Round 603 (Div. 2) (contest 1263), difficulty 1100-2400. 3/5 solutions verified against sample I/O.

5 items

Codeforces Round 603 (Div. 2)

Div. 2 | 5 problems | 3/5 verified | Difficulty 1100-2400 | 23m 35s

# Problem Rating Tags Accepted Time ✓
A Sweet Problem 1100 math 17,223 2m 33s ✓
B PIN Codes 1400 greedy, implementation 11,810 4m 12s
C Everyone is a Winner! 1400 binary-search, math, meet-in-the-middle 14,661 11m 38s
E Editor 2100 data-structures, implementation 2,974 3m 28s ✓
F Economic Difficulties 2400 data-structures, dfs-and-similar, dp 951 1m 44s ✓
Practice › Codeforces Solutions › Codeforces Round 603 (Div. 2) ›

CF 1263C - Everyone is a Winner!

We are given a fixed amount of resource, think of it as a pile of $n$ identical units that will be split equally among some unknown number of participants $k$.
codeforces competitive-programming binary-search math meet-in-the-middle number-theory Jun 15, 2026
Practice › Codeforces Solutions › Codeforces Round 603 (Div. 2) ›

CF 1263E - Editor

We are maintaining a text editor that supports three kinds of operations: moving a cursor left or right along a growing line, and overwriting the character at the current cursor position.
codeforces competitive-programming data-structures implementation Jun 15, 2026
Practice › Codeforces Solutions › Codeforces Round 603 (Div. 2) ›

CF 1263B - PIN Codes

We are given several small collections of 4-digit strings, where each string represents a PIN code attached to a bank card. Within each test case, we may modify digits of these PIN codes, where a single operation changes one position of one code to a different digit.
codeforces competitive-programming greedy implementation Jun 15, 2026
Practice › Codeforces Solutions › Codeforces Round 603 (Div. 2) ›

CF 1263F - Economic Difficulties

We have two independent electrical grids in a palace, each forming a rooted tree with node 1 as the head. The trees supply electricity to devices through their leaves.
codeforces competitive-programming data-structures dfs-and-similar dp flows graphs trees Jun 11, 2026
Practice › Codeforces Solutions › Codeforces Round 603 (Div. 2) ›

CF 1263A - Sweet Problem

We are given three piles of candies: red, green, and blue. Each pile has a certain number of candies, represented by integers $r$, $g$, and $b$. Every day, Tanya eats exactly two candies, but they must be of different colors.
codeforces competitive-programming math Jun 11, 2026