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 |
|---|---|---|---|---|---|---|---|---|---|
| 1080 | Clusterization Counting | combinatorics dp ds fft graphs | Statement | G | Grakn Forces 2020 {1408} | PROGRAMMING | 3000.0 | Grakn Forces -- Editorial | |
| 647 | AquaMoon and Permutations | combinatorics constructive algorithms graph matchings graphs | Statement | C | Codeforces Round 732 (Div. 1) {1545} | PROGRAMMING | 1500.0 | Codeforces Round #732 Editorial | 2800 |
| 639 | Occurrences | combinatorics dp ds fft graphs | Statement | F | Educational Codeforces Round 114 (Rated for Div. 2) {1574} | PROGRAMMING | 95188 | ||
| 662 | Swaps | combinatorics graphs | Statement | G | Pinely Round 2 (Div. 1 + Div. 2) {1863} | PROGRAMMING | 2750.0 | ||
| 203 | Cacti Symphony | combinatorics dfs and similar dp graphs | Statement | E | Codeforces Round 908 (Div. 1) {1893} | PROGRAMMING | 2750.0 | Codeforces Round 908 (Div. 1, Div, 2) Editorial | |
| 4785 | Non-academic Problem | combinatorics dfs and similar ds graphs | Statement | F | Codeforces Round 954 (Div. 3) {1986} | PROGRAMMING | 130762 |