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 |
|---|---|---|---|---|---|---|---|---|---|
| 2156 | Graph and Queries | data structures dfs and similar ds graphs trees | Statement | D | Codeforces Round 673 (Div. 1) {1416} | PROGRAMMING | 2000.0 | Codeforces Round #673 Editorial | 2600 |
| 696 | Jumping Around | data structures divide and conquer dp ds graphs shortest paths trees | Statement | F | Educational Codeforces Round 111 (Rated for Div. 2) {1550} | PROGRAMMING | Educational Codeforces Round 111 Editorial | ||
| 879 | Good Graph | data structures ds graphs trees | Statement | F | Educational Codeforces Round 112 (Rated for Div. 2) {1555} | PROGRAMMING | 93389 | 2700 | |
| 421 | Air Reform | data structures dfs and similar divide and conquer ds graphs implementation trees | Statement | E | Codeforces Round 775 (Div. 1, based on Moscow Open Olympiad in Informatics) {1648} | PROGRAMMING | 2500.0 | Codeforces Round #775 Editorial | |
| 1583 | DFS Trees | data structures dfs and similar ds graphs greedy trees | Statement | C | Codeforces Round 808 (Div. 1) {1707} | PROGRAMMING | 1250.0 | 104930 | |
| 1678 | There Should Be a Lot of Maximums | data structures dfs and similar ds graphs trees | Statement | E | Codeforces Round 862 (Div. 2) {1805} | PROGRAMMING | 2250.0 | Editorial of Codeforces Round #862 (Div. 2) | |
| 4572 | Microcycle | data structures dfs and similar ds graphs greedy trees | Statement | F | Codeforces Round 923 (Div. 3) {1927} | PROGRAMMING | 125597 | ||
| 893 | Digital Village (Hard Version) | data structures dp ds graphs math trees | Statement | E2 | Codeforces Round 977 (Div. 2, based on COMPFEST 16 - Final Round) {2021} | PROGRAMMING | 750.0 |