Review the problem statement from Codeforces (link will open a new tab). When you've matched your problem, go to the solutions.
Search on plain tags, ratings, names, and problem text. Example: brute force or binary search
Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 1203 | Красивая команда | *special combinatorics math | Statement | C | VK Cup 2018 - Квалификация 2 {929} | PROGRAMMING | Разбор VK Cup 2018 — Квалификация 2 | 2000 | |
| 75 | Chess Rush | *special combinatorics dp implementation math | Statement | C | Central-European Olympiad in Informatics, CEOI 2020, Day 2 (IOI, Unofficial Mirror Contest, Unrated) {1403} | PROGRAMMING | CEOI 2020 Online Mirror — Day 2 Tutorial | ||
| 89 | Sum of MEX | *special combinatorics data structures dp math | Statement | H | Kotlin Heroes: Episode 14 {2199} | PROGRAMMING | 151783 | ||
| 140 | Self-Produced Sequences | *special combinatorics math | Statement | F | Kotlin Heroes: Episode 14 {2199} | PROGRAMMING | 151783 |