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 |
|---|---|---|---|---|---|---|---|---|---|
| 2126 | The Child and Binary Tree | combinatorics divide and conquer fft number theory | Statement | E | Codeforces Round 250 (Div. 1) {438} | PROGRAMMING | Tutorial | 3100 | |
| 1022 | PolandBall and Many Other Balls | combinatorics divide and conquer dp fft math number theory | Statement | G | 8VC Venture Cup 2017 - Elimination Round {755} | PROGRAMMING | 8VC Venture Cup 2017 — Elimination Round [Editorial] | 3100 | |
| 218 | Test Data Generation | combinatorics divide and conquer dp fft math number theory | Statement | F | VK Cup 2017 - Round 3 {773} | PROGRAMMING | VK Cup 2017 Round 3 + Codeforces Round #412 -- Tutorial | 3400 |