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 |
|---|---|---|---|---|---|---|---|---|---|
| 1319 | Geometry Horse | greedy implementation sortings two pointers | Statement | C | Codeforces Round 115 {175} | PROGRAMMING | 1600 | ||
| 3548 | Multitasking | greedy implementation sortings two pointers | Statement | B | Codeforces Round 225 (Div. 2) {384} | PROGRAMMING | 1500 | ||
| 8286 | USB vs. PS/2 | greedy implementation sortings two pointers | Statement | B | Educational Codeforces Round 17 {762} | PROGRAMMING | 1400 | ||
| 16062 | Dominated Subarray | greedy implementation sortings strings two pointers | Statement | C | Educational Codeforces Round 76 (Rated for Div. 2) {1257} | PROGRAMMING | Educational Codeforces Round 76 Editorial | 1200 | |
| 4282 | Kate and imperfection | greedy implementation math number theory sortings two pointers | Statement | F | Codeforces Round 632 (Div. 2) {1333} | PROGRAMMING | 2500.0 | Codeforces Round #632 (Div. 2) editorial |