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 |
|---|---|---|---|---|---|---|---|---|---|
| 3612 | Maple and Tree Beauty (Hard Version) | bitmasks brute force dfs and similar divide and conquer dp fft trees | Statement | C2 | Codeforces Round 1048 (Div. 1) {2138} | PROGRAMMING | 750.0 | Codeforces Round 1048 (Div. 1, Div. 2) Editorial | |
| 5753 | Maple and Tree Beauty (Easy Version) | dfs and similar dp graphs trees | Statement | C1 | Codeforces Round 1048 (Div. 1) {2138} | PROGRAMMING | 1250.0 | Codeforces Round 1048 (Div. 1, Div. 2) Editorial | |
| 265 | Perfect Cut | *special dp greedy | Statement | E | Kotlin Heroes: Episode 13 {2141} | PROGRAMMING | Kotlin Heroes 13 Editorial | ||
| 1117 | Bracket Groups | constructive algorithms dp strings | Statement | F | Educational Codeforces Round 182 (Rated for Div. 2) {2144} | PROGRAMMING | Educational Codeforces Round 182 Editorial | ||
| 12241 | Rabbits | 2-sat dp graphs greedy implementation | Statement | C | Codeforces Global Round 29 (Div. 1 + Div. 2) {2147} | PROGRAMMING | 1500.0 | ||
| 23907 | Same Difference | brute force dp strings | Statement | A | Codeforces Round 1064 (Div. 2) {2166} | PROGRAMMING | 500.0 | Codeforces Round 1064 (Div. 1, Div. 2) Editorial | |
| 7771 | Rae Taylor and Trees (hard version) | binary search constructive algorithms data structures dp dsu implementation trees | Statement | F | Codeforces Round 1065 (Div. 3) {2171} | PROGRAMMING | Codeforces Round 1065 (Div. 3) Editorial | ||
| 12531 | Rae Taylor and Trees (easy version) | binary search data structures dp dsu greedy implementation trees | Statement | D | Codeforces Round 1065 (Div. 3) {2171} | PROGRAMMING | Codeforces Round 1065 (Div. 3) Editorial | ||
| 1218 | Jumping Man | combinatorics data structures dp trees | Statement | F | Hello 2026 {2183} | PROGRAMMING | 2750.0 | ||
| 2100 | Little String (Hard Version) | binary search combinatorics dp greedy math number theory | Statement | D2 | Codeforces Round 1075 (Div. 2) {2189} | PROGRAMMING | 750.0 | Codeforces Round 1075 (Div. 2) Editorial | |
| 4294 | Little String (Easy Version) | combinatorics dp math | Statement | D1 | Codeforces Round 1075 (Div. 2) {2189} | PROGRAMMING | 2000.0 | Codeforces Round 1075 (Div. 2) Editorial | |
| 909 | Majority Wins? | dp greedy math strings | Statement | E | Codeforces Round 1075 (Div. 2) {2189} | PROGRAMMING | 2500.0 | Codeforces Round 1075 (Div. 2) Editorial | |
| 11704 | Sub-RBS (Easy Version) | combinatorics constructive algorithms dp greedy strings two pointers | Statement | B1 | Codeforces Round 1073 (Div. 1) {2190} | PROGRAMMING | 750.0 | Codeforces Round 1073 (Div. 1, Div. 2) Editorial | |
| 3425 | Sub-RBS (Hard Version) | combinatorics dp games implementation matrices strings | Statement | B2 | Codeforces Round 1073 (Div. 1) {2190} | PROGRAMMING | 750.0 | Codeforces Round 1073 (Div. 1, Div. 2) Editorial | |
| 1168 | Remove the Grail Tree | dfs and similar dp greedy trees | Statement | H | Codeforces Round 1076 (Div. 3) {2193} | PROGRAMMING | Разбор Codeforces Round 1076 (Div. 3) | ||
| 246 | Fuzzy Concatenation (Hard version) | binary search data structures dp greedy string suffix structures | Statement | E2 | Codeforces Round 1079 (Div. 1) {2196} | PROGRAMMING | 1000.0 | Tutorial | |
| 1266 | Operation Permutation | combinatorics dp math probabilities | Statement | G | Codeforces Round 1084 (Div. 3) {2200} | PROGRAMMING | Codeforces Round 1084 (Div. 3) Editorial | ||
| 1787 | Simons and Dividing the Rhythm | dp string suffix structures strings | Statement | E | Codeforces Round 1083 (Div. 2) {2205} | PROGRAMMING | 2500.0 | Tutorial | |
| 2047 | A Trivial String Problem | dp strings | Statement | E | Codeforces Round 1087 (Div. 2) {2209} | PROGRAMMING | 2250.0 | Codeforces Round 1087 (Div. 2) Editorial | |
| 3304 | Reserved Reversals | constructive algorithms dp greedy | Statement | D | Codeforces Round 1095 (Div. 2) {2226} | PROGRAMMING | 2000.0 | Codeforces Round 1095 (Div. 2) Editorial | |
| 243 | Wowee Binary String | combinatorics dp strings | Statement | H | Spectral::Cup 2026 Round 2 (Codeforces Round 1100, Div. 1 + Div. 2) {2229} | PROGRAMMING | 4000.0 | Spectral::Cup 2026 Round 2 (Codeforces Round 1100, Div. 1 + Div. 2) Editorial | |
| 16543 | An Alternative Way | dp greedy math | Statement | D | Codeforces Round 1107 (Div. 3) {2241} | PROGRAMMING | Codeforces Round 1107 (Div. 3) Editorial | ||
| 1540 | Product of Closures | bitmasks brute force constructive algorithms dp greedy implementation math | Statement | E | Educational Codeforces Round 192 (Rated for Div. 2) {2242} | PROGRAMMING | 155047 | ||
| 7767 | Two Digit Strings | dp greedy strings | Statement | D | Educational Codeforces Round 192 (Rated for Div. 2) {2242} | PROGRAMMING | 155047 | ||
| 8722 | Masha and the Garland | data structures dp strings | Statement | E | Codeforces Round 1109 (Div. 3) {2244} | PROGRAMMING | Codeforces Round 1109 (Div. 3) Editorial | ||
| 29576 | Iskander and Drawings | dp games greedy strings | Statement | A | Codeforces Round 1109 (Div. 3) {2244} | PROGRAMMING | Codeforces Round 1109 (Div. 3) Editorial | ||
| 146 | No Balance Left | dp math | Statement | G | Codeforces Round 1113 (Div. 2) {2248} | PROGRAMMING | 3500.0 | Codeforces Round 1113 (Div. 2) Editorial |