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 |
|---|---|---|---|---|---|---|---|---|---|
| 293 | Jumping Through the Array | data structures graphs two pointers | Statement | F | Codeforces Round 755 (Div. 1, based on Technocup 2022 Elimination Round 2) {1588} | PROGRAMMING | 3750.0 | Editorial for Technocup 2022 — Elimination Round 2 and Codeforces Round #755 (Div. 1, Div. 2) | 3500 |
| 6824 | Game Master | data structures dfs and similar dp graphs greedy two pointers | Statement | C | Codeforces Round 758 (Div.1 + Div. 2) {1608} | PROGRAMMING | 1000.0 | Editorial of Codeforces Round #758 (Div.1 + Div. 2) | |
| 321 | MCMF? | data structures flows graphs greedy sortings two pointers | Statement | F | Codeforces Round 793 (Div. 2) {1682} | PROGRAMMING | 2750.0 | Codeforces Round #793 (Div. 2) Editorial | |
| 3368 | Vlad and the Mountains | data structures ds graphs implementation sortings trees two pointers | Statement | G | Codeforces Round 888 (Div. 3) {1851} | PROGRAMMING | 118667 | ||
| 505 | Turtle and Three Sequences | data structures dp graphs greedy meet-in-the-middle probabilities two pointers | Statement | F | Codeforces Round 968 (Div. 2) {2003} | PROGRAMMING | 2500.0 | ||
| 32 | Affectionate Arrays (Hard Version) | data structures dp graphs greedy math shortest paths two pointers | Statement | I2 | Good Bye 2024: 2025 is NEAR {2053} | PROGRAMMING | 2000.0 |