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 |
|---|---|---|---|---|---|---|---|---|---|
| 4341 | Two Sets | 2-sat dfs and similar ds graph matchings greedy | Statement | B | Codeforces Round 268 (Div. 1) {468} | PROGRAMMING | 13896 | 2000 | |
| 674 | Summer Dichotomy | 2-sat data structures dfs and similar greedy | Statement | H | Codeforces Round 300 {538} | PROGRAMMING | 3100 | ||
| 870 | New Language | 2-sat greedy | Statement | C | Codeforces Round 315 (Div. 1) {568} | PROGRAMMING | 2600 | ||
| 617 | The Light Square | 2-sat dfs and similar greedy | Statement | I | Bubble Cup 12 - Finals [Online Mirror, unrated, Div. 1] {1218} | PROGRAMMING | E | 2200 |