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 |
---|---|---|---|---|---|---|---|---|---|
2911 | Euclid's nightmare | dfs and similar ds graphs math | Statement | F | Good Bye 2020 {1466} | PROGRAMMING | 1750.0 | Good Bye 2020 Editorial | |
130 | Organizing a Music Festival | dfs and similar math | Statement | I | Codeforces Global Round 15 {1552} | PROGRAMMING | 3750.0 | Editorial of Global Round 15 | |
7022 | Hidden Permutations | dfs and similar interactive math | Statement | C | Hello 2022 {1621} | PROGRAMMING | 1500.0 | ||
530 | Sum of Matchings | dfs and similar greedy implementation math | Statement | E | Educational Codeforces Round 124 (Rated for Div. 2) {1651} | PROGRAMMING | Educational Codeforces Round 124 Editorial | ||
18473 | Forever Winter | dfs and similar graphs math | Statement | F | Codeforces Round 871 (Div. 4) {1829} | PROGRAMMING | Codeforces Round 871 (Div. 4) Editorial | 1300 | |
6575 | Selling a Menagerie | dfs and similar ds graphs implementation math | Statement | F | Codeforces Round 895 (Div. 3) {1872} | PROGRAMMING | Codeforces Round 895 (Div. 3) Editorial |