Solutions are presented as using the least memory and the fastest execution time. It also takes the top 10 most recent solutions from each language. If you want to limit to a specific index, click the "Solved" button and go to that problem.
ContestId |
Name |
Phase |
Frozen |
Duration (Seconds) |
Relative Time |
Start Time |
|---|---|---|---|---|---|---|
| 2260 | Educational Codeforces Round 194 (Rated for Div. 2) | SYSTEM_TEST | False | 7200 | 55484 | Sept. 8, 2026, 2:35 p.m. |
Solved |
Index |
Name |
Type |
Tags |
Rating |
|---|---|---|---|---|---|
| ( 14393 ) | A | Monocarp's Contest | PROGRAMMING | implementation | |
| ( 11038 ) | B | Monocarp and Projects | PROGRAMMING | math | |
| ( 6450 ) | C | Maximize XOR, Minimize Operations | PROGRAMMING | bitmasks greedy | |
| ( 2327 ) | D | Signs of Prefix Sums | PROGRAMMING | brute force constructive algorithms dfs and similar dp | |
| ( 821 ) | E | Cyclic Balance | PROGRAMMING | constructive algorithms math | |
| ( 184 ) | F | Edge Three-Coloring | PROGRAMMING | bitmasks brute force dfs and similar dsu graphs trees | |
| ( 11 ) | G | Sortable Permutations | PROGRAMMING | brute force combinatorics math number theory |
No solutions yet.