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 |
|---|---|---|---|---|---|---|---|---|---|
| 1766 | Nikita and Order Statistics | chinese remainder theorem fft math | Statement | E | Codeforces Round 488 by NEAR (Div. 1) {993} | PROGRAMMING | Codeforces Round #488 editorial | 2300 | |
| 211 | Epic Convolution | chinese remainder theorem fft math number theory | Statement | H | Mail.Ru Cup 2018 Round 1 {1054} | PROGRAMMING | Editorial | 3400 |