Review the problem statement from Codeforces (link will open a new tab). When you've matched your problem, go to the solutions.
Get exact match for tags using this format, eg: [u'brute force', 'dp']
Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 10492 | Pashmak and Parmida's problem | data structures divide and conquer sortings | Statement | D | Codeforces Round 261 (Div. 2) {459} | PROGRAMMING | Codeforces Round #261 Editorial | 1800 | |
| 4938 | Imbalanced Array | data structures divide and conquer ds sortings | Statement | D | Educational Codeforces Round 23 {817} | PROGRAMMING | 52638 | 2000 | |
| 4339 | Moving Points | data structures divide and conquer implementation sortings | Statement | F | Codeforces Round 624 (Div. 3) {1311} | PROGRAMMING | 74224 | 2100 |