Codeforces Round 680 (Div. 2, based on Moscow Team Olympiad)

Solutions for Codeforces Round 680 (Div. 2, based on Moscow Team Olympiad) (contest 1445). 2/2 problems verified against sample I/O. Difficulty range: 800-900.

2 items

Codeforces Round 680 (Div. 2, based on Moscow Team Olympiad)

Type: Div. 2 | Problems: 2 | Verified: 2/2 | Rating range: 800-900 | Time: 2m 54s

Problem Name Rating Tags Solve Time Verified
A Array Rearrangment 800 greedy, sortings 1m 35s ✓
B Elimination 900 greedy, math 1m 19s ✓
Practice › Codeforces Solutions › Codeforces Round 680 (Div. 2, based on Moscow Team Olympiad) ›

CF 1445A - Array Rearrangment

We are given two lists of numbers of equal length, and we are allowed to reorder only the second list. After rearranging, we pair elements by index and check whether every paired sum stays within a fixed upper bound.
codeforces competitive-programming greedy sortings Jun 11, 2026
Practice › Codeforces Solutions › Codeforces Round 680 (Div. 2, based on Moscow Team Olympiad) ›

CF 1445B - Elimination

We are asked to compute the smallest possible cutoff total score for an olympiad elimination stage. Each participant competes in two contests, and the jury only remembers partial information: the 100-th place score in each contest and a lower bound on the other contest's score…
codeforces competitive-programming greedy math Jun 11, 2026