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 |
|---|---|---|---|---|---|---|---|---|---|
| 1023 | Minimum Sum | divide and conquer geometry sortings | Statement | J | School Regional Team Contest, Saratov, 2011 {120} | PROGRAMMING | Tutorial for school regional team contest of Saratov | 2000 | |
| 1039 | Paint Tree | constructive algorithms divide and conquer geometry sortings trees | Statement | C | Codeforces Round 124 (Div. 1) {196} | PROGRAMMING | Разбор задач | 2400 | |
| 4152 | Points on Plane | constructive algorithms divide and conquer geometry greedy sortings | Statement | C | Codeforces Round 319 (Div. 1) {576} | PROGRAMMING | Editorial Codeforces Round #319 | 2300 | |
| 2629 | Divide Square | data structures divide and conquer geometry implementation sortings | Statement | E | Codeforces Round 665 (Div. 2) {1401} | PROGRAMMING | 2500.0 | Codeforces Round #665 (Div. 2) Editorial |