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 |
|---|---|---|---|---|---|---|---|---|---|
| 2124 | Running with Obstacles | *special data structures dp greedy | Statement | D | VK Cup 2016 - Qualification Round 1 {637} | PROGRAMMING | 2000 | ||
| 203 | Number Deletion Game | *special dp games greedy | Statement | G | Kotlin Heroes 5: ICPC Round {1431} | PROGRAMMING | 84563 | ||
| 374 | Fix the String | *special bitmasks dp greedy | Statement | E | Kotlin Heroes: Episode 8 {1571} | PROGRAMMING | Kotlin Heroes 8 Editorial | ||
| 154 | Arithmetic Exercise | *special data structures dp greedy | Statement | B | XIX Open Olympiad in Informatics - Final Stage, Day 1 (Unrated, Online Mirror, IOI rules) {2079} | PROGRAMMING | |||
| 255 | Perfect Cut | *special dp greedy | Statement | E | Kotlin Heroes: Episode 13 {2141} | PROGRAMMING | Kotlin Heroes 13 Editorial |