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 |
|---|---|---|---|---|---|---|---|---|---|
| 3914 | Playlist | data structures ds implementation | Statement | D | Технокубок 2021 - Финал {1482} | PROGRAMMING | 2000.0 | Technocup 2021: Final Round and Codeforces Round #709 — tutorial | |
| 3959 | Koxia and Game | data structures dfs and similar ds games graph matchings graphs implementation | Statement | D | Good Bye 2022: 2023 is NEAR {1770} | PROGRAMMING | 1500.0 | Good Bye 2022 -- Editorial | |
| 1582 | Maximize the Largest Component (Hard Version) | data structures dfs and similar ds implementation | Statement | H2 | Codeforces Round 952 (Div. 4) {1985} | PROGRAMMING | Codeforces Round 952 (Div. 4) Editorial |