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 |
|---|---|---|---|---|---|---|---|---|---|
| 22465 | Chat Order | *special binary search constructive algorithms data structures sortings | Statement | B | VK Cup 2016 - Qualification Round 1 {637} | PROGRAMMING | 1500 | ||
| 175 | Almost Certainly | *special constructive algorithms data structures sortings | Statement | D | XVIII Open Olympiad in Informatics - Final Stage, Day 2 (Unrated, Online Mirror, IOI rules) {1940} | PROGRAMMING |