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 |
|---|---|---|---|---|---|---|---|---|---|
| 1211 | Famil Door and Roads | combinatorics data structures dfs and similar dp probabilities trees | Statement | E | Codeforces Round 343 (Div. 2) {629} | PROGRAMMING | Editorial of Codeforces Round #343 (Div.2) | 2400 | |
| 7016 | Number of Simple Paths | combinatorics data structures dfs and similar dsu graphs trees | Statement | E | Codeforces Round 686 (Div. 3) {1454} | PROGRAMMING | Codeforces Round #686 (Div. 3) Editorial | ||
| 884 | Pairs of Paths | combinatorics data structures trees | Statement | F | Codeforces Round 703 (Div. 2) {1486} | PROGRAMMING | 3000.0 | Codeforces Round #703 (Div. 2) Editorial | |
| 2352 | MEX Tree | combinatorics constructive algorithms data structures dfs and similar math trees | Statement | D | Codeforces Round 721 (Div. 2) {1527} | PROGRAMMING | 2250.0 | Tutorial | 2400 |
| 645 | Electrical Efficiency | combinatorics data structures dp number theory trees | Statement | E | COMPFEST 14 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1725} | PROGRAMMING | Tutorial | ||
| 710 | Segment Covering | brute force combinatorics constructive algorithms data structures trees | Statement | G | Polynomial Round 2022 (Div. 1 + Div. 2, Rated, Prizes!) {1774} | PROGRAMMING | 3250.0 | Polynomial Round 2022 (Div. 1 + Div. 2) Editorial | |
| 3139 | Guess Game | bitmasks combinatorics constructive algorithms data structures games math probabilities strings trees | Statement | E | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) {1864} | PROGRAMMING | 2000.0 | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) Editorial | |
| 2320 | Fenwick Tree | bitmasks brute force combinatorics data structures dp math trees | Statement | C | Codeforces Round 942 (Div. 1) {1967} | PROGRAMMING | 1250.0 | Tutorial | 2300 |
| 1357 | Splittable Permutations | combinatorics data structures dfs and similar greedy math trees | Statement | E | Educational Codeforces Round 166 (Rated for Div. 2) {1976} | PROGRAMMING | Educational Codeforces Round 166 Editorial | ||
| 955 | Counting Is Not Fun (Hard Version) | combinatorics data structures dfs and similar dsu trees | Statement | F2 | Codeforces Round 1000 (Div. 2) {2063} | PROGRAMMING | 1500.0 | Codeforces Round 1000 (Div. 2) — Editorial | |
| 1218 | Jumping Man | combinatorics data structures dp trees | Statement | F | Hello 2026 {2183} | PROGRAMMING | 2750.0 | ||
| 2050 | Deconstruction Tree | combinatorics data structures dp graphs trees | Statement | E | Spectral::Cup 2026 Round 2 (Codeforces Round 1100, Div. 1 + Div. 2) {2229} | PROGRAMMING | 2500.0 | Spectral::Cup 2026 Round 2 (Codeforces Round 1100, Div. 1 + Div. 2) Editorial |