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 |
|---|---|---|---|---|---|---|---|---|---|
| 543 | Superhero's Job | dfs and similar dp hashing math number theory | Statement | D | VK Cup 2015 - Раунд 3 (неофиц. интернет-трансляция, только Div. 1) {542} | PROGRAMMING | 17697 | 2600 |