Review the problem statement from Codeforces (link will open a new tab). When you've matched your problem, go to the solutions.
Search on plain tags, ratings, names, and problem text. Example: brute force or binary search
Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 4627 | Li Hua and Tree | brute force data structures dfs and similar dp implementation trees | Statement | D | Codeforces Round 864 (Div. 2) {1797} | PROGRAMMING | 1750.0 | Codeforces Round 864 (Div. 2) Editorial | |
| 2632 | Happy Life in University | brute force data structures dfs and similar dp implementation trees | Statement | E | Good Bye 2023 {1916} | PROGRAMMING | 2000.0 | ||
| 565 | 23 Rises Again | brute force data structures dfs and similar dp flows graphs implementation probabilities trees | Statement | H | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) {2127} | PROGRAMMING | 4000.0 | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) Editorial |