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
< 1 2Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 11298 | Rabbits | 2-sat dp graphs greedy implementation | Statement | C | Codeforces Global Round 29 (Div. 1 + Div. 2) {2147} | PROGRAMMING | 1500.0 | ||
| 3895 | Monotone Subsequence | brute force constructive algorithms dp graphs interactive math | Statement | E | Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) {2152} | PROGRAMMING | 3000.0 | Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) Editorial | |
| 1755 | Victorious Coloring (Easy Version) | dp graphs | Statement | H1 | Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) {2152} | PROGRAMMING | 4000.0 | Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) Editorial | |
| 2864 | Locked Out | binary search data structures dp graphs greedy implementation two pointers | Statement | D | Pinely Round 5 (Div. 1 + Div. 2) {2161} | PROGRAMMING | 2250.0 | ||
| 6069 | Fibonacci Paths | data structures dp geometry graphs sortings | Statement | D | Codeforces Round 1070 (Div. 2) {2176} | PROGRAMMING | 2000.0 | Codeforces Round 1070 (Div.2) Editorial | |
| 4214 | Cherry Tree | dfs and similar dp graphs trees | Statement | F | Codeforces Round 1072 (Div. 3) {2184} | PROGRAMMING | Codeforces Round 1072 (Div. 3) Editorial | ||
| 2840 | The Turtle Strikes Back | dp graphs greedy | Statement | E | Codeforces Round 1078 (Div. 2) {2194} | PROGRAMMING | 2500.0 | Codeforces Round #1078 Editorial | |
| 2917 | Parabola Independence | dp graphs math | Statement | F | Codeforces Round 1080 (Div. 3) {2195} | PROGRAMMING | Codeforces Round 1080 (Div. 3) Editorial | ||
| 3881 | Interactive Graph (Simple Version) | combinatorics dfs and similar dp graphs interactive | Statement | C1 | Codeforces Round 1079 (Div. 1) {2196} | PROGRAMMING | 750.0 | Tutorial | |
| 2721 | Interactive Graph (Hard Version) | combinatorics dfs and similar dp graphs interactive | Statement | C2 | Codeforces Round 1079 (Div. 1) {2196} | PROGRAMMING | 750.0 | Tutorial | |
| 496 | Grid Path | dp graphs matrices | Statement | G | Educational Codeforces Round 188 (Rated for Div. 2) {2204} | PROGRAMMING | Educational Codeforces Round 188 Editorial | ||
| 315 | Hanabi | data structures dp flows graph matchings graphs greedy | Statement | F | Codeforces Round 1085 (Div. 1 + Div. 2) {2207} | PROGRAMMING | 3250.0 | Codeforces Round 1085 (Div. 1 + Div. 2) Editorial | |
| 1965 | 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 | |
| 5174 | Good Schedule | dp graphs greedy two pointers | Statement | D | Educational Codeforces Round 190 (Rated for Div. 2) {2230} | PROGRAMMING | Educational Codeforces Round 190 — Editorial | ||
| 1139 | Graph Cutting | dfs and similar dp trees | Statement | E | Codeforces Round 1099 (Div. 2) {2231} | PROGRAMMING | 2500.0 | ||
| 382 | Shortest GCD Paths | dp graphs math number theory shortest paths | Statement | F | Educational Codeforces Round 191 (Rated for Div. 2) {2233} | PROGRAMMING | |||
| 599 | Hunting the Beast | combinatorics dp graphs | Statement | D | Codeforces Round 1105 (Div. 1) {2239} | PROGRAMMING | 2000.0 | ||
| 5738 | Fair and Square | combinatorics dp graphs math number theory trees | Statement | E | Codeforces Round 1107 (Div. 3) {2241} | PROGRAMMING |