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 |
|---|---|---|---|---|---|---|---|---|---|
| 3463 | Fox and Card Game | games greedy sortings | Statement | C | Codeforces Round 228 (Div. 1) {388} | PROGRAMMING | Codeforces Round #228 — Editorial | 2000 | |
| 3166 | Naming Company | games greedy sortings | Statement | C | Tinkoff Challenge - Final Round (Codeforces Round 414, rated, Div. 1 + Div. 2) {794} | PROGRAMMING | 1800 |