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 |
|---|---|---|---|---|---|---|---|---|---|
| 2925 | Online Courses In BSU | *special dfs and similar graphs implementation | Statement | C | VK Cup 2017 - Qualification 2 {770} | PROGRAMMING | 1900 | ||
| 905 | Dependency management | *special graphs implementation | Statement | C | VK Cup 2018 - Квалификация 1 {928} | PROGRAMMING | 2300 | ||
| 149 | kotlinkotlinkotlinkotlin... | *special graphs implementation strings | Statement | F | Kotlin Heroes: Episode 2 {1211} | PROGRAMMING | Kotlin Heroes: Episode 2 Editorial | 2400 |