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 |
|---|---|---|---|---|---|---|---|---|---|
| 721 | Building Forest | data structures ds graphs | Statement | E | Codeforces Round 123 (Div. 2) {195} | PROGRAMMING | 2200 | ||
| 3426 | Mahmoud and a Dictionary | data structures dfs and similar dp ds graphs | Statement | D | Codeforces Round 396 (Div. 2) {766} | PROGRAMMING | 2000 | ||
| 877 | Vladik and Entertaining Flags | data structures ds graphs | Statement | E | Codeforces Round 416 (Div. 2) {811} | PROGRAMMING | Editorial | 2600 | |
| 1363 | Bipartite Checking | data structures ds graphs | Statement | F | Educational Codeforces Round 22 {813} | PROGRAMMING | 52410 | 2600 | |
| 2413 | Envy | data structures ds graphs | Statement | C | Codeforces Round 446 (Div. 1) {891} | PROGRAMMING | 2500 | ||
| 6460 | Connected Components? | data structures dfs and similar ds graphs | Statement | E | Educational Codeforces Round 37 (Rated for Div. 2) {920} | PROGRAMMING | T | 2100 |