Codeforces Round 619 (Div. 2)

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

6 items

Codeforces Round 619 (Div. 2)

Div. 2 | 6 problems | 3/6 verified | Difficulty 800-2600 | 22m 8s

# Problem Rating Tags Accepted Time ✓
A Three Strings 800 implementation, strings 20,108 2m 46s ✓
B Motarack's Birthday 1500 binary-search, greedy, ternary-search 14,969 4m 39s
C Ayoub's function 1700 binary-search, combinatorics, greedy 9,875 2m 53s
D Time to Run 2000 constructive-algorithms, graphs, implementation 4,236 5m 58s ✓
E Nanosoft 2500 binary-search, data-structures, dp 1,613 4m 15s
F Super Jaber 2600 dfs-and-similar, graphs, implementation 1,414 1m 37s ✓
Practice › Codeforces Solutions › Codeforces Round 619 (Div. 2) ›

CF 1301E - Nanosoft

We are given a colored grid where each cell is one of four colors. Inside this grid, we are asked many independent queries.
codeforces competitive-programming binary-search data-structures dp implementation Jun 16, 2026
Practice › Codeforces Solutions › Codeforces Round 619 (Div. 2) ›

CF 1301D - Time to Run

The grid in this problem can be viewed as a directed version of the standard rectangular lattice where every pair of horizontally or vertically adjacent cells is connected by two opposite directed edges.
codeforces competitive-programming constructive-algorithms graphs implementation Jun 16, 2026
Practice › Codeforces Solutions › Codeforces Round 619 (Div. 2) ›

CF 1301B - Motarack's Birthday

We are given an array of length $n$ where some positions contain fixed integers and some positions are marked as missing. All missing positions will be filled with a single chosen value $k$.
codeforces competitive-programming binary-search greedy ternary-search Jun 16, 2026
Practice › Codeforces Solutions › Codeforces Round 619 (Div. 2) ›

CF 1301A - Three Strings

We are given three strings of equal length. Think of them as three rows of characters aligned in columns. At each column position, we are allowed to perform exactly one operation: we pick either the character in the third string and swap it with the character in the first…
codeforces competitive-programming implementation strings Jun 16, 2026
Practice › Codeforces Solutions › Codeforces Round 619 (Div. 2) ›

CF 1301F - Super Jaber

We are given a rectangular grid where every cell represents a city, and each city has one of a small number of colors.
codeforces competitive-programming dfs-and-similar graphs implementation shortest-paths Jun 11, 2026
Practice › Codeforces Solutions › Codeforces Round 619 (Div. 2) ›

CF 1301C - Ayoub's function

There is not enough information to diagnose the bug or provide a corrected solution. The sample with expected output appears to belong to a string construction problem, but you have not provided: - the problem statement, - the original Python solution, - or even the name of…
codeforces competitive-programming binary-search combinatorics greedy math strings Jun 11, 2026