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 2 3 ... 43 44 45 46 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 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 | |
| 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 | |
| 18529 | Sorting Game | games greedy | Statement | A | Codeforces Round 1073 (Div. 1) {2190} | PROGRAMMING | 500.0 | Codeforces Round 1073 (Div. 1, Div. 2) Editorial | |
| 1037 | Prufer Vertex | combinatorics dsu number theory probabilities trees | Statement | D | Codeforces Round 1073 (Div. 1) {2190} | PROGRAMMING | 2250.0 | Codeforces Round 1073 (Div. 1, Div. 2) Editorial | |
| 267 | Median Permutation | combinatorics | Statement | E | Codeforces Round 1073 (Div. 1) {2190} | PROGRAMMING | 2750.0 | Codeforces Round 1073 (Div. 1, Div. 2) Editorial | |
| 108 | Maximize Determinant | graphs | Statement | G | Codeforces Round 1073 (Div. 1) {2190} | PROGRAMMING | 3750.0 | Codeforces Round 1073 (Div. 1, Div. 2) Editorial | |
| 1377 | Comparable Permutations | binary search greedy interactive sortings two pointers | Statement | C | Codeforces Round 1073 (Div. 1) {2190} | PROGRAMMING | 1750.0 | Codeforces Round 1073 (Div. 1, Div. 2) Editorial | |
| 21167 | MEX Reordering | constructive algorithms sortings | Statement | B | Codeforces Round 1073 (Div. 2) {2191} | PROGRAMMING | 1000.0 | Codeforces Round 1073 (Div. 1, Div. 2) Editorial | |
| 28996 | Array Coloring | constructive algorithms | Statement | A | Codeforces Round 1073 (Div. 2) {2191} | PROGRAMMING | 500.0 | Codeforces Round 1073 (Div. 1, Div. 2) Editorial | |
| 2322 | Swap to Rearrange | constructive algorithms dfs and similar graph matchings graphs greedy strings | Statement | E | Codeforces Round 1081 (Div. 2) {2192} | PROGRAMMING | 2250.0 | Codeforces Round 1081 (Div. 2) Editorial | |
| 19128 | String Rotation Game | brute force strings | Statement | A | Codeforces Round 1081 (Div. 2) {2192} | PROGRAMMING | 500.0 | Codeforces Round 1081 (Div. 2) Editorial | |
| 16152 | Flipping Binary String | constructive algorithms strings | Statement | B | Codeforces Round 1081 (Div. 2) {2192} | PROGRAMMING | 1000.0 | Codeforces Round 1081 (Div. 2) Editorial | |
| 204 | Fish Fight | dp math probabilities | Statement | F | Codeforces Round 1081 (Div. 2) {2192} | PROGRAMMING | 3000.0 | Codeforces Round 1081 (Div. 2) Editorial | |
| 4030 | Cost of Tree | data structures dfs and similar dp trees | Statement | D | Codeforces Round 1081 (Div. 2) {2192} | PROGRAMMING | 1750.0 | Codeforces Round 1081 (Div. 2) Editorial | |
| 12406 | All-in-one Gun | binary search greedy math | Statement | C | Codeforces Round 1081 (Div. 2) {2192} | PROGRAMMING | 1250.0 | Codeforces Round 1081 (Div. 2) Editorial | |
| 31537 | Reverse a Permutation | greedy | Statement | B | Codeforces Round 1076 (Div. 3) {2193} | PROGRAMMING | Разбор Codeforces Round 1076 (Div. 3) | ||
| 30740 | Replace and Sum | greedy | Statement | C | Codeforces Round 1076 (Div. 3) {2193} | PROGRAMMING | Разбор Codeforces Round 1076 (Div. 3) | ||
| 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) | ||
| 16460 | Product Queries | dp math number theory | Statement | E | Codeforces Round 1076 (Div. 3) {2193} | PROGRAMMING | Разбор Codeforces Round 1076 (Div. 3) | ||
| 9481 | Pizza Delivery | dp greedy | Statement | F | Codeforces Round 1076 (Div. 3) {2193} | PROGRAMMING | Разбор Codeforces Round 1076 (Div. 3) | ||
| 2439 | Paths in a Tree | dfs and similar interactive sortings trees | Statement | G | Codeforces Round 1076 (Div. 3) {2193} | PROGRAMMING | Разбор Codeforces Round 1076 (Div. 3) | ||
| 23122 | Monster Game | binary search sortings two pointers | Statement | D | Codeforces Round 1076 (Div. 3) {2193} | PROGRAMMING | Разбор Codeforces Round 1076 (Div. 3) | ||
| 44821 | DBMB and the Array | brute force math | Statement | A | Codeforces Round 1076 (Div. 3) {2193} | PROGRAMMING | Разбор Codeforces Round 1076 (Div. 3) | ||
| 2923 | The Turtle Strikes Back | dp graphs greedy | Statement | E | Codeforces Round 1078 (Div. 2) {2194} | PROGRAMMING | 2500.0 | Codeforces Round #1078 Editorial | |
| 8825 | Table Cut | constructive algorithms greedy | Statement | D | Codeforces Round 1078 (Div. 2) {2194} | PROGRAMMING | 2000.0 | Codeforces Round #1078 Editorial | |
| 11825 | Secret message | bitmasks math | Statement | C | Codeforces Round 1078 (Div. 2) {2194} | PROGRAMMING | 1750.0 | Codeforces Round #1078 Editorial | |
| 20223 | Offshores | greedy implementation math | Statement | B | Codeforces Round 1078 (Div. 2) {2194} | PROGRAMMING | 1000.0 | Codeforces Round #1078 Editorial | |
| 25273 | Lawn Mower | math | Statement | A | Codeforces Round 1078 (Div. 2) {2194} | PROGRAMMING | 500.0 | Codeforces Round #1078 Editorial | |
| 233 | Again Trees... (hard version) | bitmasks data structures dfs and similar dp fft trees | Statement | F2 | Codeforces Round 1078 (Div. 2) {2194} | PROGRAMMING | 1750.0 | Codeforces Round #1078 Editorial | |
| 999 | Again Trees... (Easy Version) | bitmasks dfs and similar dp fft trees | Statement | F1 | Codeforces Round 1078 (Div. 2) {2194} | PROGRAMMING | 1750.0 | Codeforces Round #1078 Editorial | |
| 38272 | Sieve of Erato67henes | math | Statement | A | Codeforces Round 1080 (Div. 3) {2195} | PROGRAMMING | Codeforces Round 1080 (Div. 3) Editorial | ||
| 2984 | Parabola Independence | dp graphs math | Statement | F | Codeforces Round 1080 (Div. 3) {2195} | PROGRAMMING | Codeforces Round 1080 (Div. 3) Editorial | ||
| 1179 | Idiot First Search and Queries | binary search data structures graphs trees | Statement | G | Codeforces Round 1080 (Div. 3) {2195} | PROGRAMMING | Codeforces Round 1080 (Div. 3) Editorial | ||
| 9665 | Idiot First Search | dfs and similar dp trees | Statement | E | Codeforces Round 1080 (Div. 3) {2195} | PROGRAMMING | Codeforces Round 1080 (Div. 3) Editorial | ||
| 27086 | Heapify 1 | implementation | Statement | B | Codeforces Round 1080 (Div. 3) {2195} | PROGRAMMING | Codeforces Round 1080 (Div. 3) Editorial | ||
| 22430 | Dice Roll Sequence | dp greedy | Statement | C | Codeforces Round 1080 (Div. 3) {2195} | PROGRAMMING | Codeforces Round 1080 (Div. 3) Editorial | ||
| 522 | Codeforces Heuristic Contest 001 | brute force constructive algorithms geometry implementation | Statement | H | Codeforces Round 1080 (Div. 3) {2195} | PROGRAMMING | Codeforces Round 1080 (Div. 3) Editorial | ||
| 15051 | Absolute Cinema | math | Statement | D | Codeforces Round 1080 (Div. 3) {2195} | PROGRAMMING | Codeforces Round 1080 (Div. 3) Editorial | ||
| 3952 | Interactive Graph (Simple Version) | combinatorics dfs and similar dp graphs interactive | Statement | C1 | Codeforces Round 1079 (Div. 1) {2196} | PROGRAMMING | 750.0 | Tutorial | |
| 2791 | Interactive Graph (Hard Version) | combinatorics dfs and similar dp graphs interactive | Statement | C2 | Codeforces Round 1079 (Div. 1) {2196} | PROGRAMMING | 750.0 | Tutorial | |
| 125 | Indivisible | constructive algorithms graphs | Statement | F | Codeforces Round 1079 (Div. 1) {2196} | PROGRAMMING | 3500.0 | Tutorial | |
| 17714 | Game with a Fraction | games math | Statement | A | Codeforces Round 1079 (Div. 1) {2196} | PROGRAMMING | 500.0 | Tutorial | |
| 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 | |
| 317 | Fuzzy Concatenation (Easy Version) | binary search bitmasks brute force data structures greedy string suffix structures | Statement | E1 | Codeforces Round 1079 (Div. 1) {2196} | PROGRAMMING | 2000.0 | Tutorial | |
| 1090 | Double Bracket Sequence | data structures dp greedy sortings | Statement | D | Codeforces Round 1079 (Div. 1) {2196} | PROGRAMMING | 2250.0 | Tutorial | |
| 9545 | Another Problem about Beautiful Pairs | brute force math two pointers | Statement | B | Codeforces Round 1079 (Div. 1) {2196} | PROGRAMMING | 750.0 | Tutorial | |
| 24233 | Friendly Numbers | brute force math | Statement | A | Codeforces Round 1079 (Div. 2) {2197} | PROGRAMMING | 500.0 | ||
| 17161 | Array and Permutation | implementation sortings two pointers | Statement | B | Codeforces Round 1079 (Div. 2) {2197} | PROGRAMMING | 1000.0 | ||
| 1240 | Two Towers | *special greedy math | Statement | B | Kotlin Heroes: Episode 14 {2199} | PROGRAMMING | 151783 | ||
| 334 | Two Arrays | *special math | Statement | D | Kotlin Heroes: Episode 14 {2199} | PROGRAMMING | 151783 | ||
| 192 | Supersequence | *special binary search greedy | Statement | E | Kotlin Heroes: Episode 14 {2199} | PROGRAMMING | 151783 | ||
| 104 | Sum of MEX | *special combinatorics data structures dp math | Statement | H | Kotlin Heroes: Episode 14 {2199} | PROGRAMMING | 151783 | ||
| 43 | Strange Process | *special | Statement | I | Kotlin Heroes: Episode 14 {2199} | PROGRAMMING | 151783 | ||
| 183 | Self-Produced Sequences | *special combinatorics math | Statement | F | Kotlin Heroes: Episode 14 {2199} | PROGRAMMING | 151783 | ||
| 563 | Minesweeper | *special constructive algorithms greedy | Statement | C | Kotlin Heroes: Episode 14 {2199} | PROGRAMMING | 151783 | ||
| 66 | Jammer | *special math | Statement | G | Kotlin Heroes: Episode 14 {2199} | PROGRAMMING | 151783 | ||
| 1765 | Game | *special | Statement | A | Kotlin Heroes: Episode 14 {2199} | PROGRAMMING | 151783 | ||
| 24713 | Specialty String | brute force greedy strings | Statement | C | Codeforces Round 1084 (Div. 3) {2200} | PROGRAMMING | Codeforces Round 1084 (Div. 3) Editorial | ||
| 545 | Six Seven | divide and conquer math number theory strings trees | Statement | H | Codeforces Round 1084 (Div. 3) {2200} | PROGRAMMING | Codeforces Round 1084 (Div. 3) Editorial | ||
| 13726 | Portal | greedy sortings | Statement | D | Codeforces Round 1084 (Div. 3) {2200} | PROGRAMMING | Codeforces Round 1084 (Div. 3) Editorial | ||
| 1266 | Operation Permutation | combinatorics dp math probabilities | Statement | G | Codeforces Round 1084 (Div. 3) {2200} | PROGRAMMING | Codeforces Round 1084 (Div. 3) Editorial | ||
| 3335 | Mooclear Reactor 2 | data structures greedy implementation sortings | Statement | F | Codeforces Round 1084 (Div. 3) {2200} | PROGRAMMING | Codeforces Round 1084 (Div. 3) Editorial | ||
| 31739 | Eating Game | greedy | Statement | A | Codeforces Round 1084 (Div. 3) {2200} | PROGRAMMING | Codeforces Round 1084 (Div. 3) Editorial | ||
| 9505 | Divisive Battle | games greedy math number theory | Statement | E | Codeforces Round 1084 (Div. 3) {2200} | PROGRAMMING | Codeforces Round 1084 (Div. 3) Editorial | ||
| 28428 | Deletion Sort | greedy sortings | Statement | B | Codeforces Round 1084 (Div. 3) {2200} | PROGRAMMING | Codeforces Round 1084 (Div. 3) Editorial | ||
| 2257 | Rigged Bracket Sequence | combinatorics dp | Statement | C | Codeforces Round 1082 (Div. 1) {2201} | PROGRAMMING | 1750.0 | Codeforces Round 1082 (Div. 1, Div. 2) Complete Editorial | |
| 5540 | Recollect Numbers | constructive algorithms | Statement | B | Codeforces Round 1082 (Div. 1) {2201} | PROGRAMMING | 1250.0 | Codeforces Round 1082 (Div. 1, Div. 2) Complete Editorial | |
| 325 | Monotone Monochrome Matrices (Medium Version) | data structures | Statement | F1 | Codeforces Round 1082 (Div. 1) {2201} | PROGRAMMING | 2750.0 | Codeforces Round 1082 (Div. 1, Div. 2) Complete Editorial | |
| 476 | Monotone Monochrome Matrices (Hard Version) | data structures | Statement | F2 | Codeforces Round 1082 (Div. 1) {2201} | PROGRAMMING | 1500.0 | Codeforces Round 1082 (Div. 1, Div. 2) Complete Editorial | |
| 5644 | Lost Civilization (Hard Version) | data structures dp | Statement | A2 | Codeforces Round 1082 (Div. 1) {2201} | PROGRAMMING | 500.0 | Codeforces Round 1082 (Div. 1, Div. 2) Complete Editorial | |
| 12457 | Lost Civilization (Easy Version) | data structures | Statement | A1 | Codeforces Round 1082 (Div. 1) {2201} | PROGRAMMING | 750.0 | Codeforces Round 1082 (Div. 1, Div. 2) Complete Editorial | |
| 81 | Codeforces Heuristic Contest 1001 | constructive algorithms | Statement | G | Codeforces Round 1082 (Div. 1) {2201} | PROGRAMMING | 5000.0 | Codeforces Round 1082 (Div. 1, Div. 2) Complete Editorial | |
| 871 | Binary Not Search and Queries | data structures greedy implementation | Statement | D | Codeforces Round 1082 (Div. 1) {2201} | PROGRAMMING | 2250.0 | Codeforces Round 1082 (Div. 1, Div. 2) Complete Editorial | |
| 306 | ABBA Counting | fft math number theory strings | Statement | E | Codeforces Round 1082 (Div. 1) {2201} | PROGRAMMING | 3000.0 | Codeforces Round 1082 (Div. 1, Div. 2) Complete Editorial | |
| 17596 | Parkour Design | math | Statement | A | Codeforces Round 1082 (Div. 2) {2202} | PROGRAMMING | 750.0 | Codeforces Round 1082 (Div. 1, Div. 2) Complete Editorial | |
| 331 | Monotone Monochrome Matrices (Easy Version) | data structures | Statement | G1 | Codeforces Round 1082 (Div. 2) {2202} | PROGRAMMING | 2750.0 | Codeforces Round 1082 (Div. 1, Div. 2) Complete Editorial | |
| 12778 | ABAB Construction | greedy implementation | Statement | B | Codeforces Round 1082 (Div. 2) {2202} | PROGRAMMING | 1250.0 | Codeforces Round 1082 (Div. 1, Div. 2) Complete Editorial | |
| 20099 | Towers of Boxes | math | Statement | A | Educational Codeforces Round 187 (Rated for Div. 2) {2203} | PROGRAMMING | Educational Codeforces Round 187 Editorial | ||
| 8138 | Test Generator | binary search bitmasks greedy math | Statement | C | Educational Codeforces Round 187 (Rated for Div. 2) {2203} | PROGRAMMING | Educational Codeforces Round 187 Editorial | ||
| 1548 | Probabilistic Card Game | binary search data structures math ternary search | Statement | E | Educational Codeforces Round 187 (Rated for Div. 2) {2203} | PROGRAMMING | Educational Codeforces Round 187 Editorial | ||
| 6233 | Divisibility Game | brute force games greedy number theory | Statement | D | Educational Codeforces Round 187 (Rated for Div. 2) {2203} | PROGRAMMING | Educational Codeforces Round 187 Editorial | ||
| 472 | Binary Search with One Swap | binary search divide and conquer dp hashing math | Statement | F | Educational Codeforces Round 187 (Rated for Div. 2) {2203} | PROGRAMMING | Educational Codeforces Round 187 Editorial | ||
| 16637 | Beautiful Numbers | dp greedy math | Statement | B | Educational Codeforces Round 187 (Rated for Div. 2) {2203} | PROGRAMMING | Educational Codeforces Round 187 Editorial | ||
| 1378 | Sum of Fractions | binary search combinatorics greedy math two pointers | Statement | F | Educational Codeforces Round 188 (Rated for Div. 2) {2204} | PROGRAMMING | Educational Codeforces Round 188 Editorial | ||
| 5311 | Sum of Digits (and Again) | brute force constructive algorithms math | Statement | E | Educational Codeforces Round 188 (Rated for Div. 2) {2204} | PROGRAMMING | Educational Codeforces Round 188 Editorial | ||
| 20050 | Spring | math | Statement | C | Educational Codeforces Round 188 (Rated for Div. 2) {2204} | PROGRAMMING | Educational Codeforces Round 188 Editorial | ||
| 21504 | Right Maximum | greedy | Statement | B | Educational Codeforces Round 188 (Rated for Div. 2) {2204} | PROGRAMMING | Educational Codeforces Round 188 Editorial | ||
| 23705 | Passing the Ball | brute force | Statement | A | Educational Codeforces Round 188 (Rated for Div. 2) {2204} | PROGRAMMING | Educational Codeforces Round 188 Editorial | ||
| 607 | Grid Path | dp graphs matrices | Statement | G | Educational Codeforces Round 188 (Rated for Div. 2) {2204} | PROGRAMMING | Educational Codeforces Round 188 Editorial | ||
| 10260 | Alternating Path | dfs and similar graphs | Statement | D | Educational Codeforces Round 188 (Rated for Div. 2) {2204} | PROGRAMMING | Educational Codeforces Round 188 Editorial | ||
| 738 | Simons and Reconstructing His Roads | constructive algorithms data structures dsu graphs meet-in-the-middle | Statement | F | Codeforces Round 1083 (Div. 2) {2205} | PROGRAMMING | 2750.0 | Tutorial | |
| 8885 | Simons and Posting Blogs | greedy sortings | Statement | C | Codeforces Round 1083 (Div. 2) {2205} | PROGRAMMING | 1250.0 | Tutorial | |
| 18769 | Simons and Making It Beautiful | brute force constructive algorithms | Statement | A | Codeforces Round 1083 (Div. 2) {2205} | PROGRAMMING | 500.0 | Tutorial | |
| 1787 | Simons and Dividing the Rhythm | dp string suffix structures strings | Statement | E | Codeforces Round 1083 (Div. 2) {2205} | PROGRAMMING | 2500.0 | Tutorial | |
| 239 | Simons and Diophantus Equation | bitmasks brute force data structures number theory | Statement | G | Codeforces Round 1083 (Div. 2) {2205} | PROGRAMMING | 3250.0 | Tutorial | |
| 17747 | Simons and Cakes for Success | implementation math | Statement | B | Codeforces Round 1083 (Div. 2) {2205} | PROGRAMMING | 750.0 | Tutorial | |
| 5771 | Simons and Beating Peaks | data structures divide and conquer dp greedy implementation trees | Statement | D | Codeforces Round 1083 (Div. 2) {2205} | PROGRAMMING | 1750.0 | Tutorial | |
| 1493 | Worldwide Playlist | Statement | J | 2026 ICPC Asia Pacific Championship - Online Mirror (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2206} | PROGRAMMING | Tutorial (PDF) | |||
| 820 | Upside Down Dijkstra | dfs and similar | Statement | C | 2026 ICPC Asia Pacific Championship - Online Mirror (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2206} | PROGRAMMING | Tutorial (PDF) | ||
| 2240 | Time Display Stickers | binary search | Statement | K | 2026 ICPC Asia Pacific Championship - Online Mirror (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2206} | PROGRAMMING | Tutorial (PDF) | ||
| 504 | Subtree Removal Game | games | Statement | B | 2026 ICPC Asia Pacific Championship - Online Mirror (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2206} | PROGRAMMING | Tutorial (PDF) | ||
| 1474 | Reflect Sort | number theory | Statement | H | 2026 ICPC Asia Pacific Championship - Online Mirror (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2206} | PROGRAMMING | Tutorial (PDF) | ||
| 516 | Parallel Sums | data structures | Statement | E | 2026 ICPC Asia Pacific Championship - Online Mirror (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2206} | PROGRAMMING | Tutorial (PDF) | ||
| 75 | Onion | Statement | L | 2026 ICPC Asia Pacific Championship - Online Mirror (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2206} | PROGRAMMING | Tutorial (PDF) | |||
| 502 | Minesweeper String | fft number theory | Statement | F | 2026 ICPC Asia Pacific Championship - Online Mirror (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2206} | PROGRAMMING | Tutorial (PDF) | ||
| 239 | Growth Factor | Statement | I | 2026 ICPC Asia Pacific Championship - Online Mirror (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2206} | PROGRAMMING | Tutorial (PDF) | |||
| 115 | Extra Transition | Statement | G | 2026 ICPC Asia Pacific Championship - Online Mirror (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2206} | PROGRAMMING | Tutorial (PDF) | |||
| 58 | Deformed Balance | Statement | M | 2026 ICPC Asia Pacific Championship - Online Mirror (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2206} | PROGRAMMING | Tutorial (PDF) | |||
| 151 | Compare Suffixes | interactive | Statement | A | 2026 ICPC Asia Pacific Championship - Online Mirror (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2206} | PROGRAMMING | Tutorial (PDF) | ||
| 351 | Christmas Tree Un-decoration | data structures dp trees | Statement | D | 2026 ICPC Asia Pacific Championship - Online Mirror (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2206} | PROGRAMMING | Tutorial (PDF) | ||
| 6547 | Where's My Water? | data structures divide and conquer implementation | Statement | C | Codeforces Round 1085 (Div. 1 + Div. 2) {2207} | PROGRAMMING | 1500.0 | Codeforces Round 1085 (Div. 1 + Div. 2) Editorial | |
| 228 | Toothless | constructive algorithms | Statement | G | Codeforces Round 1085 (Div. 1 + Div. 2) {2207} | PROGRAMMING | 3750.0 | Codeforces Round 1085 (Div. 1 + Div. 2) Editorial | |
| 6710 | One Night At Freddy's | games greedy sortings | Statement | B | Codeforces Round 1085 (Div. 1 + Div. 2) {2207} | PROGRAMMING | 1250.0 | Codeforces Round 1085 (Div. 1 + Div. 2) Editorial | |
| 994 | N-MEX (Counting Version) | combinatorics math | Statement | E2 | Codeforces Round 1085 (Div. 1 + Div. 2) {2207} | PROGRAMMING | 1000.0 | Codeforces Round 1085 (Div. 1 + Div. 2) Editorial | |
| 1850 | N-MEX (Constructive Version) | constructive algorithms greedy | Statement | E1 | Codeforces Round 1085 (Div. 1 + Div. 2) {2207} | PROGRAMMING | 1750.0 | Codeforces Round 1085 (Div. 1 + Div. 2) Editorial | |
| 331 | 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 | |
| 2333 | Boxed Like a Fish | dfs and similar dp games trees | Statement | D | Codeforces Round 1085 (Div. 1 + Div. 2) {2207} | PROGRAMMING | 2250.0 | Codeforces Round 1085 (Div. 1 + Div. 2) Editorial | |
| 54 | Bowser's Castle (Medium Version) | constructive algorithms divide and conquer interactive trees two pointers | Statement | H2 | Codeforces Round 1085 (Div. 1 + Div. 2) {2207} | PROGRAMMING | 1000.0 | Codeforces Round 1085 (Div. 1 + Div. 2) Editorial | |
| 73 | Bowser's Castle (Hard Version) | constructive algorithms divide and conquer interactive trees two pointers | Statement | H3 | Codeforces Round 1085 (Div. 1 + Div. 2) {2207} | PROGRAMMING | 1500.0 | Codeforces Round 1085 (Div. 1 + Div. 2) Editorial | |
| 62 | Bowser's Castle (Easy Version) | binary search constructive algorithms divide and conquer greedy interactive trees | Statement | H1 | Codeforces Round 1085 (Div. 1 + Div. 2) {2207} | PROGRAMMING | 3250.0 | Codeforces Round 1085 (Div. 1 + Div. 2) Editorial | |
| 15143 | 1-1 | greedy strings | Statement | A | Codeforces Round 1085 (Div. 1 + Div. 2) {2207} | PROGRAMMING | 750.0 | Codeforces Round 1085 (Div. 1 + Div. 2) Editorial | |
| 2127 | Tree Orientation (Hard Version) | data structures dfs and similar dsu graphs greedy matrices sortings trees | Statement | D2 | Codeforces Round 1086 (Div. 2) {2208} | PROGRAMMING | 1250.0 | Tutorial | |
| 4887 | Tree Orientation (Easy Version) | constructive algorithms dfs and similar dsu graphs greedy trees | Statement | D1 | Codeforces Round 1086 (Div. 2) {2208} | PROGRAMMING | 1250.0 | Tutorial | |
| 12898 | Stamina and Tasks | dp greedy math | Statement | C | Codeforces Round 1086 (Div. 2) {2208} | PROGRAMMING | 1250.0 | Tutorial | |
| 15275 | Cyclists | games greedy implementation sortings | Statement | B | Codeforces Round 1086 (Div. 2) {2208} | PROGRAMMING | 1000.0 | Tutorial | |
| 492 | Counting Cute Arrays | combinatorics dp | Statement | E | Codeforces Round 1086 (Div. 2) {2208} | PROGRAMMING | 3000.0 | Tutorial | |
| 22258 | Bingo Candies | constructive algorithms math | Statement | A | Codeforces Round 1086 (Div. 2) {2208} | PROGRAMMING | 500.0 | Tutorial | |
| 5990 | Ghostfires | constructive algorithms greedy | Statement | D | Codeforces Round 1087 (Div. 2) {2209} | PROGRAMMING | 1750.0 | Codeforces Round 1087 (Div. 2) Editorial | |
| 23654 | Flip Flops | greedy | Statement | A | Codeforces Round 1087 (Div. 2) {2209} | PROGRAMMING | 500.0 | Codeforces Round 1087 (Div. 2) Editorial | |
| 12070 | Find the Zero | constructive algorithms interactive | Statement | C | Codeforces Round 1087 (Div. 2) {2209} | PROGRAMMING | 1500.0 | Codeforces Round 1087 (Div. 2) Editorial | |
| 477 | Dynamic Values And Maximum Sum | data structures greedy implementation trees | Statement | F | Codeforces Round 1087 (Div. 2) {2209} | PROGRAMMING | 3000.0 | Codeforces Round 1087 (Div. 2) Editorial | |
| 2047 | A Trivial String Problem | dp strings | Statement | E | Codeforces Round 1087 (Div. 2) {2209} | PROGRAMMING | 2250.0 | Codeforces Round 1087 (Div. 2) Editorial | |
| 21898 | Array | geometry greedy | Statement | B | Codeforces Round 1087 (Div. 2) {2209} | PROGRAMMING | 750.0 | Codeforces Round 1087 (Div. 2) Editorial | |
| 19907 | Simply Sitting on Chairs | greedy | Statement | B | Codeforces Round 1089 (Div. 2) {2210} | PROGRAMMING | 1000.0 | Codeforces Round 1089 (Div. 2) Editorial | |
| 388 | Binary Strings are Simple? | constructive algorithms dsu interactive number theory | Statement | E | Codeforces Round 1089 (Div. 2) {2210} | PROGRAMMING | 2750.0 | Codeforces Round 1089 (Div. 2) Editorial | |
| 24989 | A Simple Sequence | constructive algorithms dp greedy number theory | Statement | A | Codeforces Round 1089 (Div. 2) {2210} | PROGRAMMING | 500.0 | Codeforces Round 1089 (Div. 2) Editorial | |
| 2311 | A Simple RBS Problem | constructive algorithms strings trees | Statement | D | Codeforces Round 1089 (Div. 2) {2210} | PROGRAMMING | 2250.0 | Codeforces Round 1089 (Div. 2) Editorial | |
| 277 | A Simple Problem | binary search greedy math trees | Statement | F | Codeforces Round 1089 (Div. 2) {2210} | PROGRAMMING | 3500.0 | Codeforces Round 1089 (Div. 2) Editorial | |
| 2445 | A Simple GCD Problem (Hard Version) | dp greedy number theory | Statement | C2 | Codeforces Round 1089 (Div. 2) {2210} | PROGRAMMING | 1000.0 | Codeforces Round 1089 (Div. 2) Editorial | |
| 14863 | A Simple GCD Problem (Easy Version) | greedy number theory | Statement | C1 | Codeforces Round 1089 (Div. 2) {2210} | PROGRAMMING | 1250.0 | Codeforces Round 1089 (Div. 2) Editorial | |
| 348 | Rational Bubble Sort | geometry greedy | Statement | G | Nebius Round 2 (Codeforces Round 1088, Div. 1 + Div. 2) {2211} | PROGRAMMING | 3250.0 | Nebius Round 2 and Codeforces Round 1088 Editorial | |
| 1045 | Minimum Path Cover | dp interactive number theory trees | Statement | E | Nebius Round 2 (Codeforces Round 1088, Div. 1 + Div. 2) {2211} | PROGRAMMING | 2500.0 | Nebius Round 2 and Codeforces Round 1088 Editorial | |
| 13184 | Mickey Mouse Constructive | greedy math | Statement | B | Nebius Round 2 (Codeforces Round 1088, Div. 1 + Div. 2) {2211} | PROGRAMMING | 1250.0 | Nebius Round 2 and Codeforces Round 1088 Editorial | |
| 126 | Median Deletion | Statement | H | Nebius Round 2 (Codeforces Round 1088, Div. 1 + Div. 2) {2211} | PROGRAMMING | 4000.0 | Nebius Round 2 and Codeforces Round 1088 Editorial | ||
| 1041 | Learning Binary Search | combinatorics divide and conquer dp | Statement | F | Nebius Round 2 (Codeforces Round 1088, Div. 1 + Div. 2) {2211} | PROGRAMMING | 3000.0 | Nebius Round 2 and Codeforces Round 1088 Editorial | |
| 4260 | Equal Multisets (Hard Version) | greedy | Statement | C2 | Nebius Round 2 (Codeforces Round 1088, Div. 1 + Div. 2) {2211} | PROGRAMMING | 1000.0 | Nebius Round 2 and Codeforces Round 1088 Editorial | |
| 10640 | Equal Multisets (Easy Version) | binary search greedy | Statement | C1 | Nebius Round 2 (Codeforces Round 1088, Div. 1 + Div. 2) {2211} | PROGRAMMING | 1250.0 | Nebius Round 2 and Codeforces Round 1088 Editorial | |
| 17953 | Antimedian Deletion | implementation math | Statement | A | Nebius Round 2 (Codeforces Round 1088, Div. 1 + Div. 2) {2211} | PROGRAMMING | 500.0 | Nebius Round 2 and Codeforces Round 1088 Editorial | |
| 3369 | AND-array | bitmasks combinatorics math | Statement | D | Nebius Round 2 (Codeforces Round 1088, Div. 1 + Div. 2) {2211} | PROGRAMMING | 2000.0 | Nebius Round 2 and Codeforces Round 1088 Editorial | |
| 328 | You Are a Robot | *special | Statement | I | April Fools Day Contest 2026 {2214} | PROGRAMMING | April Fools Day Contest 2026 Editorial | ||
| 3713 | Special Problem | *special brute force games | Statement | J | April Fools Day Contest 2026 {2214} | PROGRAMMING | April Fools Day Contest 2026 Editorial | ||
| 1123 | Shortest Paths | *special shortest paths | Statement | E | April Fools Day Contest 2026 {2214} | PROGRAMMING | April Fools Day Contest 2026 Editorial | ||
| 10743 | Odd One Out | *special | Statement | A | April Fools Day Contest 2026 {2214} | PROGRAMMING | April Fools Day Contest 2026 Editorial | ||
| 1085 | Numbers | *special | Statement | F | April Fools Day Contest 2026 {2214} | PROGRAMMING | April Fools Day Contest 2026 Editorial | ||
| 4483 | Neural Feud | *special | Statement | D | April Fools Day Contest 2026 {2214} | PROGRAMMING | April Fools Day Contest 2026 Editorial | ||
| 1801 | Double Vision | *special | Statement | H | April Fools Day Contest 2026 {2214} | PROGRAMMING | |||
| 6944 | Are You Smiling? | *special | Statement | B | April Fools Day Contest 2026 {2214} | PROGRAMMING | April Fools Day Contest 2026 Editorial | ||
| 812 | Anomaly | *special | Statement | G | April Fools Day Contest 2026 {2214} | PROGRAMMING | April Fools Day Contest 2026 Editorial | ||
| 1987 | And? | *special | Statement | C | April Fools Day Contest 2026 {2214} | PROGRAMMING | April Fools Day Contest 2026 Editorial | ||
| 231 | Star Map | constructive algorithms data structures geometry greedy | Statement | E | Codeforces Round 1092 (Unrated, Div. 1, Based on THUPC 2026 — Finals) {2215} | PROGRAMMING | 3000.0 | 152930 | |
| 1329 | RReeppeettiittiioonn | binary search brute force implementation math number theory | Statement | B | Codeforces Round 1092 (Unrated, Div. 1, Based on THUPC 2026 — Finals) {2215} | PROGRAMMING | 1250.0 | 152930 | |
| 98 | Research | games | Statement | F | Codeforces Round 1092 (Unrated, Div. 1, Based on THUPC 2026 — Finals) {2215} | PROGRAMMING | 4000.0 | 152930 | |
| 888 | Oriented Journey | bitmasks communication constructive algorithms graphs hashing interactive trees | Statement | C | Codeforces Round 1092 (Unrated, Div. 1, Based on THUPC 2026 — Finals) {2215} | PROGRAMMING | 1750.0 | 152930 | |
| 91 | Maze | trees | Statement | G | Codeforces Round 1092 (Unrated, Div. 1, Based on THUPC 2026 — Finals) {2215} | PROGRAMMING | 5000.0 | 152930 | |
| 3943 | Interval Mod | constructive algorithms dp greedy math | Statement | A | Codeforces Round 1092 (Unrated, Div. 1, Based on THUPC 2026 — Finals) {2215} | PROGRAMMING | 750.0 | 152930 | |
| 174 | EXPloration, EXPloitation, and Gain Some EXPerience! | bitmasks brute force dp greedy implementation | Statement | D | Codeforces Round 1092 (Unrated, Div. 1, Based on THUPC 2026 — Finals) {2215} | PROGRAMMING | 2750.0 | 152930 | |
| 5522 | THU Packing Puzzle | greedy | Statement | B | Codeforces Round 1092 (Unrated, Div. 2, Based on THUPC 2026 — Finals) {2216} | PROGRAMMING | 1000.0 | 152930 | |
| 6391 | Course Wishes | greedy | Statement | A | Codeforces Round 1092 (Unrated, Div. 2, Based on THUPC 2026 — Finals) {2216} | PROGRAMMING | 500.0 | 152930 | |
| 25396 | The Equalizer | Statement | A | Codeforces Round 1091 (Div. 2) and CodeCraft 26 {2217} | PROGRAMMING | 500.0 | Tutorial | ||
| 921 | Interval Game | bitmasks combinatorics dp games greedy math probabilities | Statement | F | Codeforces Round 1091 (Div. 2) and CodeCraft 26 {2217} | PROGRAMMING | 2750.0 | Tutorial | |
| 12186 | Grid Covering | math number theory | Statement | C | Codeforces Round 1091 (Div. 2) and CodeCraft 26 {2217} | PROGRAMMING | 1500.0 | Tutorial | |
| 3868 | Flip the Bit (Hard Version) | greedy implementation math | Statement | D | Codeforces Round 1091 (Div. 2) and CodeCraft 26 {2217} | PROGRAMMING | 1500.0 | Tutorial | |
| 18776 | Flip the Bit (Easy Version) | greedy implementation | Statement | B | Codeforces Round 1091 (Div. 2) and CodeCraft 26 {2217} | PROGRAMMING | 1000.0 | Tutorial | |
| 460 | Down the Pivot | combinatorics trees | Statement | G | Codeforces Round 1091 (Div. 2) and CodeCraft 26 {2217} | PROGRAMMING | 3250.0 | Tutorial | |
| 2539 | Definitely Larger | binary search constructive algorithms data structures greedy | Statement | E | Codeforces Round 1091 (Div. 2) and CodeCraft 26 {2217} | PROGRAMMING | 2000.0 | Tutorial | |
| 291 | Closer | dp | Statement | H | Codeforces Round 1091 (Div. 2) and CodeCraft 26 {2217} | PROGRAMMING | 3750.0 | Tutorial | |
| 17719 | The 67th XOR Problem | binary search bitmasks brute force trees | Statement | E | Codeforces Round 1090 (Div. 4) {2218} | PROGRAMMING | Codeforces Round 1090 (Div. 4) Editorial | ||
| 9351 | The 67th Tree Problem | constructive algorithms implementation trees | Statement | F | Codeforces Round 1090 (Div. 4) {2218} | PROGRAMMING | Codeforces Round 1090 (Div. 4) Editorial | ||
| 31641 | The 67th Permutation Problem | constructive algorithms greedy math | Statement | C | Codeforces Round 1090 (Div. 4) {2218} | PROGRAMMING | Codeforces Round 1090 (Div. 4) Editorial | ||
| 22204 | The 67th OEIS Problem | greedy math number theory | Statement | D | Codeforces Round 1090 (Div. 4) {2218} | PROGRAMMING | Codeforces Round 1090 (Div. 4) Editorial | ||
| 4730 | The 67th Iteration of "Counting is Fun" | dfs and similar implementation math | Statement | G | Codeforces Round 1090 (Div. 4) {2218} | PROGRAMMING | Codeforces Round 1090 (Div. 4) Editorial | ||
| 43575 | The 67th Integer Problem | brute force games implementation math | Statement | A | Codeforces Round 1090 (Div. 4) {2218} | PROGRAMMING | Codeforces Round 1090 (Div. 4) Editorial | ||
| 41360 | The 67th 6-7 Integer Problem | greedy math | Statement | B | Codeforces Round 1090 (Div. 4) {2218} | PROGRAMMING | Codeforces Round 1090 (Div. 4) Editorial | ||
| 161 | Weird Chessboard | constructive algorithms math | Statement | E | Codeforces Round 1093 (Div. 1) {2219} | PROGRAMMING | 3000.0 | Codeforces Round 1093 (Div. 1, Div. 2) Editorial | |
| 3866 | Unique Values (Hard version) | binary search constructive algorithms divide and conquer interactive math | Statement | B2 | Codeforces Round 1093 (Div. 1) {2219} | PROGRAMMING | 500.0 | Codeforces Round 1093 (Div. 1, Div. 2) Editorial | |
| 4301 | Unique Values (Easy version) | binary search divide and conquer interactive | Statement | B1 | Codeforces Round 1093 (Div. 1) {2219} | PROGRAMMING | 750.0 | Codeforces Round 1093 (Div. 1, Div. 2) Editorial | |
| 550 | MEX Replacement on Tree | Statement | D | Codeforces Round 1093 (Div. 1) {2219} | PROGRAMMING | 2250.0 | Codeforces Round 1093 (Div. 1, Div. 2) Editorial | ||
| 11068 | Grid L | brute force math number theory | Statement | A | Codeforces Round 1093 (Div. 1) {2219} | PROGRAMMING | 500.0 | Codeforces Round 1093 (Div. 1, Div. 2) Editorial | |
| 1494 | Coloring a Red Black Tree | dp greedy probabilities trees | Statement | C | Codeforces Round 1093 (Div. 1) {2219} | PROGRAMMING | 1750.0 | Codeforces Round 1093 (Div. 1, Div. 2) Editorial | |
| 15078 | OIE Excursion | greedy | Statement | B | Codeforces Round 1093 (Div. 2) {2220} | PROGRAMMING | 1000.0 | Tutorial | |
| 21537 | Blocked | greedy sortings | Statement | A | Codeforces Round 1093 (Div. 2) {2220} | PROGRAMMING | 500.0 | Tutorial | |
| 229 | Statistics on Tree | binary search brute force dfs and similar divide and conquer graphs trees | Statement | G | Spectral::Cup 2026 Round 1 (Codeforces Round 1094, Div. 1 + Div. 2) {2222} | PROGRAMMING | 3500.0 | Spectral::Cup 2026 Round 1 (Codeforces Round 1094, Div. 1 + Div. 2) Editorial | |
| 2423 | Seek the Truth | binary search bitmasks interactive | Statement | E | Spectral::Cup 2026 Round 1 (Codeforces Round 1094, Div. 1 + Div. 2) {2222} | PROGRAMMING | 2250.0 | Spectral::Cup 2026 Round 1 (Codeforces Round 1094, Div. 1 + Div. 2) Editorial | |
| 4153 | Permutation Construction | constructive algorithms sortings | Statement | D | Spectral::Cup 2026 Round 1 (Codeforces Round 1094, Div. 1 + Div. 2) {2222} | PROGRAMMING | 2000.0 | Spectral::Cup 2026 Round 1 (Codeforces Round 1094, Div. 1 + Div. 2) Editorial | |
| 6346 | Median Partition | dp | Statement | C | Spectral::Cup 2026 Round 1 (Codeforces Round 1094, Div. 1 + Div. 2) {2222} | PROGRAMMING | 1500.0 | Spectral::Cup 2026 Round 1 (Codeforces Round 1094, Div. 1 + Div. 2) Editorial | |
| 160 | Counting Sort? | combinatorics dp | Statement | H | Spectral::Cup 2026 Round 1 (Codeforces Round 1094, Div. 1 + Div. 2) {2222} | PROGRAMMING | 4000.0 | Spectral::Cup 2026 Round 1 (Codeforces Round 1094, Div. 1 + Div. 2) Editorial | |
| 748 | Building Tree | divide and conquer dsu graphs implementation | Statement | F | Spectral::Cup 2026 Round 1 (Codeforces Round 1094, Div. 1 + Div. 2) {2222} | PROGRAMMING | 3000.0 | Spectral::Cup 2026 Round 1 (Codeforces Round 1094, Div. 1 + Div. 2) Editorial | |
| 12552 | A Wonderful Contest | math | Statement | A | Spectral::Cup 2026 Round 1 (Codeforces Round 1094, Div. 1 + Div. 2) {2222} | PROGRAMMING | 500.0 | Spectral::Cup 2026 Round 1 (Codeforces Round 1094, Div. 1 + Div. 2) Editorial | |
| 9177 | Artistic Balance Tree | greedy sortings | Statement | B | Spectral::Cup 2026 Round 1 (Codeforces Round 1094, Div. 1 + Div. 2) {2222} | PROGRAMMING | 1250.0 | Spectral::Cup 2026 Round 1 (Codeforces Round 1094, Div. 1 + Div. 2) Editorial | |
| 955 | Zhily and Signpost | binary search chinese remainder theorem dfs and similar math number theory trees | Statement | C | Codeforces Round 1097 (Div. 1, Based on Zhili Cup 2026) {2223} | PROGRAMMING | 1500.0 | Codeforces Round 1097 (Div. 1, Div2, Based on Zhili Cup 2026) Tutorial | |
| 65 | Zhily and Permutation | data structures divide and conquer trees | Statement | E | Codeforces Round 1097 (Div. 1, Based on Zhili Cup 2026) {2223} | PROGRAMMING | 3500.0 | Codeforces Round 1097 (Div. 1, Div2, Based on Zhili Cup 2026) Tutorial | |
| 375 | Zhily and Cycle | graphs greedy | Statement | D | Codeforces Round 1097 (Div. 1, Based on Zhili Cup 2026) {2223} | PROGRAMMING | 2500.0 | Codeforces Round 1097 (Div. 1, Div2, Based on Zhili Cup 2026) Tutorial | |
| 114 | Zhily and Colorful Strings | divide and conquer fft math | Statement | F | Codeforces Round 1097 (Div. 1, Based on Zhili Cup 2026) {2223} | PROGRAMMING | 4500.0 | Codeforces Round 1097 (Div. 1, Div2, Based on Zhili Cup 2026) Tutorial | |
| 8203 | Zhily and Bracket Swapping | constructive algorithms greedy | Statement | A | Codeforces Round 1097 (Div. 1, Based on Zhili Cup 2026) {2223} | PROGRAMMING | 500.0 | Codeforces Round 1097 (Div. 1, Div2, Based on Zhili Cup 2026) Tutorial | |
| 3907 | Zhily and Barknights | binary search data structures dp math sortings two pointers | Statement | B | Codeforces Round 1097 (Div. 1, Based on Zhili Cup 2026) {2223} | PROGRAMMING | 750.0 | Codeforces Round 1097 (Div. 1, Div2, Based on Zhili Cup 2026) Tutorial | |
| 9452 | Zhily and Mex and Max | constructive algorithms greedy math sortings | Statement | B | Codeforces Round 1097 (Div. 2, Based on Zhili Cup 2026) {2224} | PROGRAMMING | 750.0 | Codeforces Round 1097 (Div. 1, Div2, Based on Zhili Cup 2026) Tutorial | |
| 12219 | Zhily and Array Operating | constructive algorithms greedy | Statement | A | Codeforces Round 1097 (Div. 2, Based on Zhili Cup 2026) {2224} | PROGRAMMING | 500.0 | Codeforces Round 1097 (Div. 1, Div2, Based on Zhili Cup 2026) Tutorial | |
| 784 | String Cutting | binary search brute force greedy hashing string suffix structures strings | Statement | F | Educational Codeforces Round 189 (Rated for Div. 2) {2225} | PROGRAMMING | Tutorial | ||
| 275 | Simple Problem | graphs number theory | Statement | G | Educational Codeforces Round 189 (Rated for Div. 2) {2225} | PROGRAMMING | Tutorial | ||
| 14451 | Red-Black Pairs | dp greedy | Statement | C | Educational Codeforces Round 189 (Rated for Div. 2) {2225} | PROGRAMMING | Tutorial | ||
| 8546 | Exceptional Segments | bitmasks brute force math | Statement | D | Educational Codeforces Round 189 (Rated for Div. 2) {2225} | PROGRAMMING | Tutorial | ||
| 1318 | Covering Points with Circles | constructive algorithms data structures geometry probabilities | Statement | E | Educational Codeforces Round 189 (Rated for Div. 2) {2225} | PROGRAMMING | Tutorial | ||
| 22105 | A Number Between Two Others | math | Statement | A | Educational Codeforces Round 189 (Rated for Div. 2) {2225} | PROGRAMMING | Tutorial | ||
| 17726 | Alternating String | brute force greedy | Statement | B | Educational Codeforces Round 189 (Rated for Div. 2) {2225} | PROGRAMMING | Tutorial | ||
| 205 | Stop Spot | strings trees | Statement | G | Codeforces Round 1095 (Div. 2) {2226} | PROGRAMMING | 2500.0 | Codeforces Round 1095 (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 | |
| 1088 | Mental Monumental (Hard Version) | data structures greedy math | Statement | E | Codeforces Round 1095 (Div. 2) {2226} | PROGRAMMING | 2500.0 | Codeforces Round 1095 (Div. 2) Editorial | |
| 8373 | Mental Monumental (Easy Version) | binary search data structures greedy math two pointers | Statement | C | Codeforces Round 1095 (Div. 2) {2226} | PROGRAMMING | 1500.0 | Codeforces Round 1095 (Div. 2) Editorial | |
| 295 | Inversion Invasion | math number theory | Statement | F | Codeforces Round 1095 (Div. 2) {2226} | PROGRAMMING | 2500.0 | Codeforces Round 1095 (Div. 2) Editorial | |
| 15112 | Everything Everywhere | greedy math number theory | Statement | B | Codeforces Round 1095 (Div. 2) {2226} | PROGRAMMING | 750.0 | Codeforces Round 1095 (Div. 2) Editorial | |
| 15867 | Disturbing Distribution | greedy math | Statement | A | Codeforces Round 1095 (Div. 2) {2226} | PROGRAMMING | 500.0 | Codeforces Round 1095 (Div. 2) Editorial | |
| 23416 | Snowfall | constructive algorithms math | Statement | C | Codeforces Round 1096 (Div. 3) {2227} | PROGRAMMING | Codeforces Round 1096 (Div. 3) — Editorial | ||
| 28446 | Party Monster | greedy | Statement | B | Codeforces Round 1096 (Div. 3) {2227} | PROGRAMMING | Codeforces Round 1096 (Div. 3) — Editorial | ||
| 14574 | Palindromex | binary search brute force constructive algorithms data structures greedy implementation two pointers | Statement | D | Codeforces Round 1096 (Div. 3) {2227} | PROGRAMMING | Codeforces Round 1096 (Div. 3) — Editorial | ||
| 32235 | Koshary | implementation math | Statement | A | Codeforces Round 1096 (Div. 3) {2227} | PROGRAMMING | Codeforces Round 1096 (Div. 3) — Editorial | ||
| 4598 | It Just Keeps Going Sideways | data structures dp greedy math | Statement | F | Codeforces Round 1096 (Div. 3) {2227} | PROGRAMMING | Codeforces Round 1096 (Div. 3) — Editorial | ||
| 10098 | It All Went Sideways | binary search data structures dp greedy | Statement | E | Codeforces Round 1096 (Div. 3) {2227} | PROGRAMMING | Codeforces Round 1096 (Div. 3) — Editorial | ||
| 1751 | Fallen Leaves | dfs and similar dp trees | Statement | H | Codeforces Round 1096 (Div. 3) {2227} | PROGRAMMING | Codeforces Round 1096 (Div. 3) — Editorial | ||
| 2304 | Drowning | binary search data structures math | Statement | G | Codeforces Round 1096 (Div. 3) {2227} | PROGRAMMING | Codeforces Round 1096 (Div. 3) — Editorial | ||
| 2931 | Sanae, Cross and Color | data structures implementation | Statement | D | Codeforces Round 1098 (Div. 2) {2228} | PROGRAMMING | 2500.0 | Codeforces Round 1098 (Div. 2) Editorial | |
| 17372 | Remilia Plays Soku | games implementation | Statement | B | Codeforces Round 1098 (Div. 2) {2228} | PROGRAMMING | 750.0 | Codeforces Round 1098 (Div. 2) Editorial | |
| 357 | Momoyo and the Network | binary search dfs and similar divide and conquer dp trees | Statement | F | Codeforces Round 1098 (Div. 2) {2228} | PROGRAMMING | 3500.0 | Codeforces Round 1098 (Div. 2) Editorial | |
| 22158 | Marisa Steals Reimu's Takeout | greedy implementation | Statement | A | Codeforces Round 1098 (Div. 2) {2228} | PROGRAMMING | 500.0 | Codeforces Round 1098 (Div. 2) Editorial | |
| 6382 | Cirno and Number (Hard Version) | greedy implementation | Statement | C2 | Codeforces Round 1098 (Div. 2) {2228} | PROGRAMMING | 1000.0 | Codeforces Round 1098 (Div. 2) Editorial | |
| 8265 | Cirno and Number (Easy Version) | binary search brute force dp implementation | Statement | C1 | Codeforces Round 1098 (Div. 2) {2228} | PROGRAMMING | 1500.0 | Codeforces Round 1098 (Div. 2) Editorial | |
| 325 | Amanojaku and Sequence (Hard Version) | combinatorics data structures implementation math | Statement | E2 | Codeforces Round 1098 (Div. 2) {2228} | PROGRAMMING | 1500.0 | Codeforces Round 1098 (Div. 2) Editorial | |
| 637 | Amanojaku and Sequence (Easy Version) | combinatorics math | Statement | E1 | Codeforces Round 1098 (Div. 2) {2228} | PROGRAMMING | 2000.0 | Codeforces Round 1098 (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 | |
| 8881 | We Be Flipping (Hard Version) | constructive algorithms | Statement | C2 | Spectral::Cup 2026 Round 2 (Codeforces Round 1100, Div. 1 + Div. 2) {2229} | PROGRAMMING | 1250.0 | Spectral::Cup 2026 Round 2 (Codeforces Round 1100, Div. 1 + Div. 2) Editorial | |
| 16126 | We Be Flipping (Easy Version) | constructive algorithms | Statement | C1 | Spectral::Cup 2026 Round 2 (Codeforces Round 1100, Div. 1 + Div. 2) {2229} | PROGRAMMING | 750.0 | Spectral::Cup 2026 Round 2 (Codeforces Round 1100, Div. 1 + Div. 2) Editorial | |
| 236 | The Endians | dp trees | Statement | I | Spectral::Cup 2026 Round 2 (Codeforces Round 1100, Div. 1 + Div. 2) {2229} | PROGRAMMING | 5000.0 | Spectral::Cup 2026 Round 2 (Codeforces Round 1100, Div. 1 + Div. 2) Editorial | |
| 18880 | Slimes on a Line | brute force greedy math | Statement | A | Spectral::Cup 2026 Round 2 (Codeforces Round 1100, Div. 1 + Div. 2) {2229} | PROGRAMMING | 500.0 | Spectral::Cup 2026 Round 2 (Codeforces Round 1100, Div. 1 + Div. 2) Editorial | |
| 367 | Roadworks | data structures dp | Statement | G | Spectral::Cup 2026 Round 2 (Codeforces Round 1100, Div. 1 + Div. 2) {2229} | PROGRAMMING | 3250.0 | Spectral::Cup 2026 Round 2 (Codeforces Round 1100, Div. 1 + Div. 2) Editorial | |
| 5378 | Me When Median Problem | binary search greedy | Statement | D | Spectral::Cup 2026 Round 2 (Codeforces Round 1100, Div. 1 + Div. 2) {2229} | PROGRAMMING | 2000.0 | Spectral::Cup 2026 Round 2 (Codeforces Round 1100, Div. 1 + Div. 2) Editorial | |
| 1137 | Load Unbalancing | binary search bitmasks dp greedy implementation | Statement | F | 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 | |
| 2048 | 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 | |
| 18735 | Absolute Cinema | greedy math | Statement | B | Spectral::Cup 2026 Round 2 (Codeforces Round 1100, Div. 1 + Div. 2) {2229} | PROGRAMMING | 750.0 | Spectral::Cup 2026 Round 2 (Codeforces Round 1100, Div. 1 + Div. 2) Editorial | |
| 23777 | Optimal Purchase | implementation math | Statement | A | Educational Codeforces Round 190 (Rated for Div. 2) {2230} | PROGRAMMING | Educational Codeforces Round 190 — Editorial | ||
| 1529 | Minimum Influence | binary search data structures geometry greedy implementation math sortings two pointers | Statement | E | Educational Codeforces Round 190 (Rated for Div. 2) {2230} | PROGRAMMING | Educational Codeforces Round 190 — Editorial | ||
| 5445 | Good Schedule | dp graphs greedy two pointers | Statement | D | Educational Codeforces Round 190 (Rated for Div. 2) {2230} | PROGRAMMING | Educational Codeforces Round 190 — Editorial |