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 |
|---|---|---|---|---|---|---|---|---|---|
| 415 | Tetris revisited | constructive algorithms graph matchings greedy math | Statement | B | Yandex.Algorithm 2011: Round 2 {86} | PROGRAMMING | Problemset analysis (Yandex, Round 2) | 2100 |