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 |
|---|---|---|---|---|---|---|---|---|---|
| 3199 | String Manipulation 1.0 | *special binary search brute force data structures strings | Statement | C | VK Cup 2012 Qualification Round 2 {159} | PROGRAMMING | Simple solution to vk cup Qualification Round 1 and 2 | 2000 | |
| 1000 | Hostname Aliases | *special binary search data structures implementation sortings strings | Statement | C | CROC 2016 - Qualification {644} | PROGRAMMING | 2300 | ||
| 20 | Chainword | *special data structures strings | Statement | H | Kotlin Heroes: Practice 8 {1570} | PROGRAMMING |