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 |
|---|---|---|---|---|---|---|---|---|---|
| 1539 | Complete the MST | data structures dfs and similar ds graphs greedy math | Statement | C | Codeforces Round 715 (Div. 1) {1508} | PROGRAMMING | 1500.0 | Codeforces Round #715 Editorial | |
| 483 | Gregor and the Two Painters | data structures graphs math | Statement | E | Codeforces Round 736 (Div. 1) {1548} | PROGRAMMING | 3500.0 | Codeforces Round 736 Editorial | |
| 10152 | Where is the Pizza? | data structures dfs and similar ds graphs implementation math | Statement | C | Codeforces Round 788 (Div. 2) {1670} | PROGRAMMING | 1750.0 | Tutorial | 1400 |
| 479 | Digital Village (Extreme Version) | data structures dp graphs greedy math | Statement | E3 | Codeforces Round 977 (Div. 2, based on COMPFEST 16 - Final Round) {2021} | PROGRAMMING | 1000.0 |