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 |
|---|---|---|---|---|---|---|---|---|---|
| 233 | Star Trek | *special combinatorics dfs and similar dp games graphs matrices trees | Statement | C | Central-European Olympiad in Informatics, CEOI 2020, Day 1 (IOI, Unofficial Mirror Contest, Unrated) {1402} | PROGRAMMING | Editorial | ||
| 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 | ||
| 64 | Inverse Problem | *special combinatorics dp | Statement | I | Kotlin Heroes: Episode 9 (Unrated, T-Shirts + Prizes!) {1910} | PROGRAMMING | 123261 | ||
| 89 | Sum of MEX | *special combinatorics data structures dp math | Statement | H | Kotlin Heroes: Episode 14 {2199} | PROGRAMMING | 151783 |