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 |
|---|---|---|---|---|---|---|---|---|---|
| 1427 | Brevity is Soul of Wit | graph matchings | Statement | H | School Regional Team Contest, Saratov, 2011 {120} | PROGRAMMING | 1900 | ||
| 1034 | George and Interesting Graph | graph matchings | Statement | D | Codeforces Round 227 (Div. 2) {387} | PROGRAMMING | Editorial Codeforces Round #227 (Div. 2) | 2700 | |
| 372 | Tree | graph matchings | Statement | D | Codeforces Round 268 (Div. 1) {468} | PROGRAMMING | 13896 | 3000 | |
| 199 | Recover a functional graph | graph matchings | Statement | D | Codeforces Round 381 (Div. 1) {739} | PROGRAMMING | 48582 | 3400 |