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 |
|---|---|---|---|---|---|---|---|---|---|
| 96 | Flow Optimality | constructive algorithms flows math | Statement | E | MemSQL Start[c]UP 2.0 - Round 2 {457} | PROGRAMMING | 3200 | ||
| 187 | Chess Championship | constructive algorithms flows greedy math | Statement | E | Codeforces Round 382 (Div. 1) {736} | PROGRAMMING | 2800 | ||
| 4719 | Vasya And The Matrix | constructive algorithms flows math | Statement | D | Educational Codeforces Round 48 (Rated for Div. 2) {1016} | PROGRAMMING | Разбор Educational Codeforces Round 48 | 1800 |