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 | |
6574 | 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 |