Codeforces Round 748 (Div. 3)

8 problems from Codeforces Round 748 (Div. 3) (contest 1593), difficulty 800-2200. 5/8 solutions verified against sample I/O.

8 items

Codeforces Round 748 (Div. 3)

Div. 3 | 8 problems | 5/8 verified | Difficulty 800-2200 | 21m 56s

# Problem Rating Tags Accepted Time ✓
A Elections 800 math 41,525 1m 48s ✓
B Make it Divisible by 25 900 dfs-and-similar, dp, greedy 40,606 2m 52s ✓
C Save More Mice 1000 binary-search, greedy 27,878 2m 45s
D1 All are Same 1100 math, number-theory 21,797 1m 34s ✓
D2 Half of Same 1900 brute-force, math, number-theory 5,567 2m 7s ✓
E Gardener and Tree 1600 brute-force, data-structures, dfs-and-similar 14,723 1m 35s ✓
F Red-Black Number 2100 dfs-and-similar, dp, implementation 2,656 2m 16s
G Changing Brackets 2200 constructive-algorithms, data-structures, dp 1,889 6m 59s
Practice › Codeforces Solutions › Codeforces Round 748 (Div. 3) ›

CF 1593B - Make it Divisible by 25

We are given a number written in decimal form, and we are allowed to delete digits one by one from anywhere in the number. After each deletion, the remaining digits close up, and any leading zeros disappear automatically.
codeforces competitive-programming dfs-and-similar dp greedy math Jun 14, 2026
Practice › Codeforces Solutions › Codeforces Round 748 (Div. 3) ›

CF 1593G - Changing Brackets

We are given a string made of four types of brackets: round (, ) and square [ , ]. Each query gives a substring, and for that substring we want to know the cheapest way to turn it into a valid bracket sequence. We are allowed to perform two kinds of transformations.
codeforces competitive-programming constructive-algorithms data-structures dp greedy Jun 14, 2026
Practice › Codeforces Solutions › Codeforces Round 748 (Div. 3) ›

CF 1593C - Save More Mice

We are given a line segment with three types of entities: a cat starting at position 0, a hole at position n, and several mice positioned strictly between them. Time advances in discrete seconds.
codeforces competitive-programming binary-search greedy Jun 14, 2026
Practice › Codeforces Solutions › Codeforces Round 748 (Div. 3) ›

CF 1593F - Red-Black Number

We are given a number as a string of digits and two divisors, A and B. The task is to color each digit either red or black such that the number formed by the red digits is divisible by A, the number formed by the black digits is divisible by B, and both colors are used at…
codeforces competitive-programming dfs-and-similar dp implementation math meet-in-the-middle Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 748 (Div. 3) ›

CF 1593E - Gardener and Tree

We are given an unrooted tree and a repeated pruning process. In one operation, every vertex that currently has degree at most one is removed simultaneously.
codeforces competitive-programming brute-force data-structures dfs-and-similar greedy implementation trees Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 748 (Div. 3) ›

CF 1593D2 - Half of Same

We start with a small array of integers. We are allowed to repeatedly pick any positions and subtract the same positive integer $k$ from those chosen elements, any number of times and independently per position.
codeforces competitive-programming brute-force math number-theory Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 748 (Div. 3) ›

CF 1593D1 - All are Same

We are given several independent test cases. In each test case there is an array of even length. We are allowed to repeatedly pick any position and subtract a fixed positive integer $k$ from that element.
codeforces competitive-programming math number-theory Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 748 (Div. 3) ›

CF 1593A - Elections

We are given three candidates in an election, each with a current number of votes: $a$, $b$, and $c$. The task is to determine, independently for each candidate, how many additional votes they would need to ensure they are the winner.
codeforces competitive-programming math Jun 10, 2026