Codeforces Round 452 (Div. 2)

2 problems from Codeforces Round 452 (Div. 2) (contest 899), difficulty 800-2100. 2/2 solutions verified against sample I/O.

2 items

Codeforces Round 452 (Div. 2)

Div. 2 | 2 problems | 2/2 verified | Difficulty 800-2100 | 4m 9s

# Problem Rating Tags Accepted Time ✓
A Splitting in Teams 800 constructive-algorithms, greedy, math 11,096 1m 4s ✓
F Letters Removing 2100 data-structures, strings 2,030 3m 5s ✓
Practice › Codeforces Solutions › Codeforces Round 452 (Div. 2) ›

CF 899F - Letters Removing

We are given a string whose characters are indexed from left to right, and a sequence of operations that repeatedly remove certain characters from specified segments of the current string.
codeforces competitive-programming data-structures strings Jun 17, 2026
Practice › Codeforces Solutions › Codeforces Round 452 (Div. 2) ›

CF 899A - Splitting in Teams

We are given several groups of students. Each group has either one student or two students, and these groups are indivisible. The coach wants to form as many teams as possible, where each team must contain exactly three students.
codeforces competitive-programming constructive-algorithms greedy math Jun 17, 2026