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 |
|---|---|---|---|---|---|---|---|---|---|
| 2289 | Two Heaps | combinatorics constructive algorithms greedy implementation math sortings | Statement | B | Codeforces Round 205 (Div. 2) {353} | PROGRAMMING | 1800 | ||
| 2258 | Wilbur and Points | combinatorics greedy sortings | Statement | C | Codeforces Round 331 (Div. 2) {596} | PROGRAMMING | 1700 | ||
| 7008 | Leha and Function | combinatorics greedy math number theory sortings | Statement | A | Codeforces Round 429 (Div. 1) {840} | PROGRAMMING | Editorial | 1300 |