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 |
|---|---|---|---|---|---|---|---|---|---|
| 3258 | 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 | |
| 10980 | 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 | |
| 17546 | Sorting Game | games greedy | Statement | A | Codeforces Round 1073 (Div. 1) {2190} | PROGRAMMING | 500.0 | Codeforces Round 1073 (Div. 1, Div. 2) Editorial | |
| 974 | 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 | |
| 243 | Median Permutation | combinatorics | Statement | E | Codeforces Round 1073 (Div. 1) {2190} | PROGRAMMING | 2750.0 | Codeforces Round 1073 (Div. 1, Div. 2) Editorial | |
| 99 | Maximize Determinant | graphs | Statement | G | Codeforces Round 1073 (Div. 1) {2190} | PROGRAMMING | 3750.0 | Codeforces Round 1073 (Div. 1, Div. 2) Editorial | |
| 1319 | 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 | |
| 20291 | MEX Reordering | constructive algorithms sortings | Statement | B | Codeforces Round 1073 (Div. 2) {2191} | PROGRAMMING | 1000.0 | Codeforces Round 1073 (Div. 1, Div. 2) Editorial | |
| 28163 | Array Coloring | constructive algorithms | Statement | A | Codeforces Round 1073 (Div. 2) {2191} | PROGRAMMING | 500.0 | Codeforces Round 1073 (Div. 1, Div. 2) Editorial | |
| 2166 | 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 | |
| 18336 | String Rotation Game | brute force strings | Statement | A | Codeforces Round 1081 (Div. 2) {2192} | PROGRAMMING | 500.0 | Codeforces Round 1081 (Div. 2) Editorial | |
| 15081 | Flipping Binary String | constructive algorithms strings | Statement | B | Codeforces Round 1081 (Div. 2) {2192} | PROGRAMMING | 1000.0 | Codeforces Round 1081 (Div. 2) Editorial | |
| 179 | Fish Fight | dp math probabilities | Statement | F | Codeforces Round 1081 (Div. 2) {2192} | PROGRAMMING | 3000.0 | Codeforces Round 1081 (Div. 2) Editorial | |
| 3700 | 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 | |
| 11456 | 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 | |
| 30573 | Reverse a Permutation | greedy | Statement | B | Codeforces Round 1076 (Div. 3) {2193} | PROGRAMMING | Разбор Codeforces Round 1076 (Div. 3) | ||
| 29339 | Replace and Sum | greedy | Statement | C | Codeforces Round 1076 (Div. 3) {2193} | PROGRAMMING | Разбор Codeforces Round 1076 (Div. 3) | ||
| 1082 | Remove the Grail Tree | dfs and similar dp greedy trees | Statement | H | Codeforces Round 1076 (Div. 3) {2193} | PROGRAMMING | Разбор Codeforces Round 1076 (Div. 3) | ||
| 15522 | Product Queries | dp math number theory | Statement | E | Codeforces Round 1076 (Div. 3) {2193} | PROGRAMMING | Разбор Codeforces Round 1076 (Div. 3) | ||
| 8742 | Pizza Delivery | dp greedy | Statement | F | Codeforces Round 1076 (Div. 3) {2193} | PROGRAMMING | Разбор Codeforces Round 1076 (Div. 3) | ||
| 2296 | Paths in a Tree | dfs and similar interactive sortings trees | Statement | G | Codeforces Round 1076 (Div. 3) {2193} | PROGRAMMING | Разбор Codeforces Round 1076 (Div. 3) | ||
| 21984 | Monster Game | binary search sortings two pointers | Statement | D | Codeforces Round 1076 (Div. 3) {2193} | PROGRAMMING | Разбор Codeforces Round 1076 (Div. 3) | ||
| 43258 | DBMB and the Array | brute force math | Statement | A | Codeforces Round 1076 (Div. 3) {2193} | PROGRAMMING | Разбор Codeforces Round 1076 (Div. 3) | ||
| 2734 | The Turtle Strikes Back | dp graphs greedy | Statement | E | Codeforces Round 1078 (Div. 2) {2194} | PROGRAMMING | 2500.0 | Codeforces Round #1078 Editorial | |
| 8179 | Table Cut | constructive algorithms greedy | Statement | D | Codeforces Round 1078 (Div. 2) {2194} | PROGRAMMING | 2000.0 | Codeforces Round #1078 Editorial | |
| 11194 | Secret message | bitmasks math | Statement | C | Codeforces Round 1078 (Div. 2) {2194} | PROGRAMMING | 1750.0 | Codeforces Round #1078 Editorial | |
| 19057 | Offshores | greedy implementation math | Statement | B | Codeforces Round 1078 (Div. 2) {2194} | PROGRAMMING | 1000.0 | Codeforces Round #1078 Editorial | |
| 24349 | Lawn Mower | math | Statement | A | Codeforces Round 1078 (Div. 2) {2194} | PROGRAMMING | 500.0 | Codeforces Round #1078 Editorial | |
| 176 | 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 | |
| 916 | 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 | |
| 36265 | Sieve of Erato67henes | math | Statement | A | Codeforces Round 1080 (Div. 3) {2195} | PROGRAMMING | Codeforces Round 1080 (Div. 3) Editorial | ||
| 2803 | Parabola Independence | dp graphs math | Statement | F | Codeforces Round 1080 (Div. 3) {2195} | PROGRAMMING | Codeforces Round 1080 (Div. 3) Editorial | ||
| 1092 | 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 | ||
| 8912 | Idiot First Search | dfs and similar dp trees | Statement | E | Codeforces Round 1080 (Div. 3) {2195} | PROGRAMMING | Codeforces Round 1080 (Div. 3) Editorial | ||
| 25571 | Heapify 1 | implementation | Statement | B | Codeforces Round 1080 (Div. 3) {2195} | PROGRAMMING | Codeforces Round 1080 (Div. 3) Editorial | ||
| 21135 | Dice Roll Sequence | dp greedy | Statement | C | Codeforces Round 1080 (Div. 3) {2195} | PROGRAMMING | Codeforces Round 1080 (Div. 3) Editorial | ||
| 490 | 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 | ||
| 14081 | Absolute Cinema | math | Statement | D | Codeforces Round 1080 (Div. 3) {2195} | PROGRAMMING | Codeforces Round 1080 (Div. 3) Editorial | ||
| 3719 | Interactive Graph (Simple Version) | combinatorics dfs and similar dp graphs interactive | Statement | C1 | Codeforces Round 1079 (Div. 1) {2196} | PROGRAMMING | 750.0 | Tutorial | |
| 2612 | Interactive Graph (Hard Version) | combinatorics dfs and similar dp graphs interactive | Statement | C2 | Codeforces Round 1079 (Div. 1) {2196} | PROGRAMMING | 750.0 | Tutorial | |
| 110 | Indivisible | constructive algorithms graphs | Statement | F | Codeforces Round 1079 (Div. 1) {2196} | PROGRAMMING | 3500.0 | Tutorial | |
| 16452 | Game with a Fraction | games math | Statement | A | Codeforces Round 1079 (Div. 1) {2196} | PROGRAMMING | 500.0 | Tutorial | |
| 206 | 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 | |
| 291 | 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 | |
| 1030 | Double Bracket Sequence | data structures dp greedy sortings | Statement | D | Codeforces Round 1079 (Div. 1) {2196} | PROGRAMMING | 2250.0 | Tutorial | |
| 8903 | Another Problem about Beautiful Pairs | brute force math two pointers | Statement | B | Codeforces Round 1079 (Div. 1) {2196} | PROGRAMMING | 750.0 | Tutorial | |
| 23300 | Friendly Numbers | brute force math | Statement | A | Codeforces Round 1079 (Div. 2) {2197} | PROGRAMMING | 500.0 | ||
| 16345 | Array and Permutation | implementation sortings two pointers | Statement | B | Codeforces Round 1079 (Div. 2) {2197} | PROGRAMMING | 1000.0 | ||
| 1025 | Two Towers | *special greedy math | Statement | B | Kotlin Heroes: Episode 14 {2199} | PROGRAMMING | 151783 | ||
| 297 | Two Arrays | *special math | Statement | D | Kotlin Heroes: Episode 14 {2199} | PROGRAMMING | 151783 | ||
| 188 | Supersequence | *special binary search greedy | Statement | E | Kotlin Heroes: Episode 14 {2199} | PROGRAMMING | 151783 | ||
| 95 | Sum of MEX | *special combinatorics data structures dp math | Statement | H | Kotlin Heroes: Episode 14 {2199} | PROGRAMMING | 151783 | ||
| 37 | Strange Process | *special | Statement | I | Kotlin Heroes: Episode 14 {2199} | PROGRAMMING | 151783 | ||
| 157 | Self-Produced Sequences | *special combinatorics math | Statement | F | Kotlin Heroes: Episode 14 {2199} | PROGRAMMING | 151783 | ||
| 462 | Minesweeper | *special constructive algorithms greedy | Statement | C | Kotlin Heroes: Episode 14 {2199} | PROGRAMMING | 151783 | ||
| 61 | Jammer | *special math | Statement | G | Kotlin Heroes: Episode 14 {2199} | PROGRAMMING | 151783 | ||
| 1497 | Game | *special | Statement | A | Kotlin Heroes: Episode 14 {2199} | PROGRAMMING | 151783 | ||
| 22752 | Specialty String | brute force greedy strings | Statement | C | Codeforces Round 1084 (Div. 3) {2200} | PROGRAMMING | Codeforces Round 1084 (Div. 3) Editorial | ||
| 480 | 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 | ||
| 12430 | Portal | greedy sortings | Statement | D | Codeforces Round 1084 (Div. 3) {2200} | PROGRAMMING | Codeforces Round 1084 (Div. 3) Editorial | ||
| 1087 | Operation Permutation | combinatorics dp math probabilities | Statement | G | Codeforces Round 1084 (Div. 3) {2200} | PROGRAMMING | Codeforces Round 1084 (Div. 3) Editorial | ||
| 3035 | Mooclear Reactor 2 | data structures greedy implementation sortings | Statement | F | Codeforces Round 1084 (Div. 3) {2200} | PROGRAMMING | Codeforces Round 1084 (Div. 3) Editorial | ||
| 29382 | Eating Game | greedy | Statement | A | Codeforces Round 1084 (Div. 3) {2200} | PROGRAMMING | Codeforces Round 1084 (Div. 3) Editorial | ||
| 8591 | Divisive Battle | games greedy math number theory | Statement | E | Codeforces Round 1084 (Div. 3) {2200} | PROGRAMMING | Codeforces Round 1084 (Div. 3) Editorial | ||
| 26497 | Deletion Sort | greedy sortings | Statement | B | Codeforces Round 1084 (Div. 3) {2200} | PROGRAMMING | Codeforces Round 1084 (Div. 3) Editorial | ||
| 2072 | 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 | |
| 5143 | Recollect Numbers | constructive algorithms | Statement | B | Codeforces Round 1082 (Div. 1) {2201} | PROGRAMMING | 1250.0 | Codeforces Round 1082 (Div. 1, Div. 2) Complete Editorial | |
| 281 | 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 | |
| 413 | 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 | |
| 5276 | 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 | |
| 11510 | 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 | |
| 69 | 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 | |
| 814 | 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 | |
| 288 | 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 | |
| 16813 | Parkour Design | math | Statement | A | Codeforces Round 1082 (Div. 2) {2202} | PROGRAMMING | 750.0 | Codeforces Round 1082 (Div. 1, Div. 2) Complete Editorial | |
| 296 | 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 | |
| 11698 | ABAB Construction | greedy implementation | Statement | B | Codeforces Round 1082 (Div. 2) {2202} | PROGRAMMING | 1250.0 | Codeforces Round 1082 (Div. 1, Div. 2) Complete Editorial | |
| 18744 | Towers of Boxes | math | Statement | A | Educational Codeforces Round 187 (Rated for Div. 2) {2203} | PROGRAMMING | Educational Codeforces Round 187 Editorial | ||
| 7484 | Test Generator | binary search bitmasks greedy math | Statement | C | Educational Codeforces Round 187 (Rated for Div. 2) {2203} | PROGRAMMING | Educational Codeforces Round 187 Editorial | ||
| 1471 | 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 | ||
| 5715 | 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 | ||
| 430 | 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 | ||
| 15145 | Beautiful Numbers | dp greedy math | Statement | B | Educational Codeforces Round 187 (Rated for Div. 2) {2203} | PROGRAMMING | Educational Codeforces Round 187 Editorial | ||
| 1289 | 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 | ||
| 4966 | 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 | ||
| 18424 | Spring | math | Statement | C | Educational Codeforces Round 188 (Rated for Div. 2) {2204} | PROGRAMMING | Educational Codeforces Round 188 Editorial | ||
| 20334 | Right Maximum | greedy | Statement | B | Educational Codeforces Round 188 (Rated for Div. 2) {2204} | PROGRAMMING | Educational Codeforces Round 188 Editorial | ||
| 22448 | Passing the Ball | brute force | Statement | A | Educational Codeforces Round 188 (Rated for Div. 2) {2204} | PROGRAMMING | Educational Codeforces Round 188 Editorial | ||
| 424 | Grid Path | dp graphs matrices | Statement | G | Educational Codeforces Round 188 (Rated for Div. 2) {2204} | PROGRAMMING | Educational Codeforces Round 188 Editorial | ||
| 9400 | Alternating Path | dfs and similar graphs | Statement | D | Educational Codeforces Round 188 (Rated for Div. 2) {2204} | PROGRAMMING | Educational Codeforces Round 188 Editorial | ||
| 679 | 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 | |
| 8213 | Simons and Posting Blogs | greedy sortings | Statement | C | Codeforces Round 1083 (Div. 2) {2205} | PROGRAMMING | 1250.0 | Tutorial | |
| 17860 | Simons and Making It Beautiful | brute force constructive algorithms | Statement | A | Codeforces Round 1083 (Div. 2) {2205} | PROGRAMMING | 500.0 | Tutorial | |
| 1641 | Simons and Dividing the Rhythm | dp string suffix structures strings | Statement | E | Codeforces Round 1083 (Div. 2) {2205} | PROGRAMMING | 2500.0 | Tutorial | |
| 215 | Simons and Diophantus Equation | bitmasks brute force data structures number theory | Statement | G | Codeforces Round 1083 (Div. 2) {2205} | PROGRAMMING | 3250.0 | Tutorial | |
| 16785 | Simons and Cakes for Success | implementation math | Statement | B | Codeforces Round 1083 (Div. 2) {2205} | PROGRAMMING | 750.0 | Tutorial | |
| 5197 | 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 | |
| 1192 | Worldwide Playlist | Statement | J | 2026 ICPC Asia Pacific Championship - Online Mirror (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2206} | PROGRAMMING | Tutorial (PDF) | |||
| 705 | 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) | ||
| 1737 | 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) | ||
| 399 | Subtree Removal Game | games | Statement | B | 2026 ICPC Asia Pacific Championship - Online Mirror (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2206} | PROGRAMMING | Tutorial (PDF) | ||
| 968 | Reflect Sort | number theory | Statement | H | 2026 ICPC Asia Pacific Championship - Online Mirror (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2206} | PROGRAMMING | Tutorial (PDF) | ||
| 441 | Parallel Sums | data structures | Statement | E | 2026 ICPC Asia Pacific Championship - Online Mirror (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2206} | PROGRAMMING | Tutorial (PDF) | ||
| 49 | Onion | Statement | L | 2026 ICPC Asia Pacific Championship - Online Mirror (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2206} | PROGRAMMING | Tutorial (PDF) | |||
| 441 | 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) | ||
| 177 | Growth Factor | Statement | I | 2026 ICPC Asia Pacific Championship - Online Mirror (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2206} | PROGRAMMING | Tutorial (PDF) | |||
| 99 | Extra Transition | Statement | G | 2026 ICPC Asia Pacific Championship - Online Mirror (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2206} | PROGRAMMING | Tutorial (PDF) | |||
| 51 | Deformed Balance | Statement | M | 2026 ICPC Asia Pacific Championship - Online Mirror (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2206} | PROGRAMMING | Tutorial (PDF) | |||
| 120 | Compare Suffixes | interactive | Statement | A | 2026 ICPC Asia Pacific Championship - Online Mirror (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2206} | PROGRAMMING | Tutorial (PDF) | ||
| 291 | 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) | ||
| 5925 | 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 | |
| 165 | Toothless | constructive algorithms | Statement | G | Codeforces Round 1085 (Div. 1 + Div. 2) {2207} | PROGRAMMING | 3750.0 | Codeforces Round 1085 (Div. 1 + Div. 2) Editorial | |
| 6178 | 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 | |
| 911 | 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 | |
| 1726 | 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 | |
| 287 | 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 | |
| 2181 | 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 | |
| 43 | 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 | |
| 60 | 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 | |
| 55 | 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 | |
| 14283 | 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 | |
| 1946 | 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 | |
| 4462 | 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 | |
| 11793 | Stamina and Tasks | dp greedy math | Statement | C | Codeforces Round 1086 (Div. 2) {2208} | PROGRAMMING | 1250.0 | Tutorial | |
| 14294 | Cyclists | games greedy implementation sortings | Statement | B | Codeforces Round 1086 (Div. 2) {2208} | PROGRAMMING | 1000.0 | Tutorial | |
| 449 | Counting Cute Arrays | combinatorics dp | Statement | E | Codeforces Round 1086 (Div. 2) {2208} | PROGRAMMING | 3000.0 | Tutorial | |
| 21062 | Bingo Candies | constructive algorithms math | Statement | A | Codeforces Round 1086 (Div. 2) {2208} | PROGRAMMING | 500.0 | Tutorial | |
| 5604 | Ghostfires | constructive algorithms greedy | Statement | D | Codeforces Round 1087 (Div. 2) {2209} | PROGRAMMING | 1750.0 | Codeforces Round 1087 (Div. 2) Editorial | |
| 22448 | Flip Flops | greedy | Statement | A | Codeforces Round 1087 (Div. 2) {2209} | PROGRAMMING | 500.0 | Codeforces Round 1087 (Div. 2) Editorial | |
| 11266 | Find the Zero | constructive algorithms interactive | Statement | C | Codeforces Round 1087 (Div. 2) {2209} | PROGRAMMING | 1500.0 | Codeforces Round 1087 (Div. 2) Editorial | |
| 441 | 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 | |
| 1883 | A Trivial String Problem | dp strings | Statement | E | Codeforces Round 1087 (Div. 2) {2209} | PROGRAMMING | 2250.0 | Codeforces Round 1087 (Div. 2) Editorial | |
| 20383 | Array | geometry greedy | Statement | B | Codeforces Round 1087 (Div. 2) {2209} | PROGRAMMING | 750.0 | Codeforces Round 1087 (Div. 2) Editorial | |
| 18548 | Simply Sitting on Chairs | greedy | Statement | B | Codeforces Round 1089 (Div. 2) {2210} | PROGRAMMING | 1000.0 | Codeforces Round 1089 (Div. 2) Editorial | |
| 342 | 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 | |
| 23524 | 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 | |
| 2151 | 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 | |
| 240 | 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 | |
| 2281 | 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 | |
| 13667 | 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 | |
| 303 | 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 | |
| 908 | 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 | |
| 12294 | 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 | |
| 109 | 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 | ||
| 967 | 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 | |
| 3919 | 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 | |
| 9773 | 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 | |
| 16972 | 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 | |
| 3074 | 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 | |
| 311 | You Are a Robot | *special | Statement | I | April Fools Day Contest 2026 {2214} | PROGRAMMING | April Fools Day Contest 2026 Editorial | ||
| 3603 | Special Problem | *special brute force games | Statement | J | April Fools Day Contest 2026 {2214} | PROGRAMMING | April Fools Day Contest 2026 Editorial | ||
| 1073 | Shortest Paths | *special shortest paths | Statement | E | April Fools Day Contest 2026 {2214} | PROGRAMMING | April Fools Day Contest 2026 Editorial | ||
| 10358 | Odd One Out | *special | Statement | A | April Fools Day Contest 2026 {2214} | PROGRAMMING | April Fools Day Contest 2026 Editorial | ||
| 981 | Numbers | *special | Statement | F | April Fools Day Contest 2026 {2214} | PROGRAMMING | April Fools Day Contest 2026 Editorial | ||
| 4354 | Neural Feud | *special | Statement | D | April Fools Day Contest 2026 {2214} | PROGRAMMING | April Fools Day Contest 2026 Editorial | ||
| 1654 | Double Vision | *special | Statement | H | April Fools Day Contest 2026 {2214} | PROGRAMMING | |||
| 6721 | Are You Smiling? | *special | Statement | B | April Fools Day Contest 2026 {2214} | PROGRAMMING | April Fools Day Contest 2026 Editorial | ||
| 763 | Anomaly | *special | Statement | G | April Fools Day Contest 2026 {2214} | PROGRAMMING | April Fools Day Contest 2026 Editorial | ||
| 1885 | And? | *special | Statement | C | April Fools Day Contest 2026 {2214} | PROGRAMMING | April Fools Day Contest 2026 Editorial | ||
| 192 | 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 | |
| 1174 | 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 | |
| 64 | Research | games | Statement | F | Codeforces Round 1092 (Unrated, Div. 1, Based on THUPC 2026 — Finals) {2215} | PROGRAMMING | 4000.0 | 152930 | |
| 727 | 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 | |
| 66 | Maze | trees | Statement | G | Codeforces Round 1092 (Unrated, Div. 1, Based on THUPC 2026 — Finals) {2215} | PROGRAMMING | 5000.0 | 152930 | |
| 3214 | 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 | |
| 133 | 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 | |
| 4501 | THU Packing Puzzle | greedy | Statement | B | Codeforces Round 1092 (Unrated, Div. 2, Based on THUPC 2026 — Finals) {2216} | PROGRAMMING | 1000.0 | 152930 | |
| 5357 | Course Wishes | greedy | Statement | A | Codeforces Round 1092 (Unrated, Div. 2, Based on THUPC 2026 — Finals) {2216} | PROGRAMMING | 500.0 | 152930 | |
| 23704 | The Equalizer | Statement | A | Codeforces Round 1091 (Div. 2) and CodeCraft 26 {2217} | PROGRAMMING | 500.0 | Tutorial | ||
| 811 | Interval Game | bitmasks combinatorics dp games greedy math probabilities | Statement | F | Codeforces Round 1091 (Div. 2) and CodeCraft 26 {2217} | PROGRAMMING | 2750.0 | Tutorial | |
| 11277 | Grid Covering | math number theory | Statement | C | Codeforces Round 1091 (Div. 2) and CodeCraft 26 {2217} | PROGRAMMING | 1500.0 | Tutorial | |
| 3593 | Flip the Bit (Hard Version) | greedy implementation math | Statement | D | Codeforces Round 1091 (Div. 2) and CodeCraft 26 {2217} | PROGRAMMING | 1500.0 | Tutorial | |
| 17388 | Flip the Bit (Easy Version) | greedy implementation | Statement | B | Codeforces Round 1091 (Div. 2) and CodeCraft 26 {2217} | PROGRAMMING | 1000.0 | Tutorial | |
| 405 | Down the Pivot | combinatorics trees | Statement | G | Codeforces Round 1091 (Div. 2) and CodeCraft 26 {2217} | PROGRAMMING | 3250.0 | Tutorial | |
| 2312 | Definitely Larger | binary search constructive algorithms data structures greedy | Statement | E | Codeforces Round 1091 (Div. 2) and CodeCraft 26 {2217} | PROGRAMMING | 2000.0 | Tutorial | |
| 244 | Closer | dp | Statement | H | Codeforces Round 1091 (Div. 2) and CodeCraft 26 {2217} | PROGRAMMING | 3750.0 | Tutorial | |
| 15622 | 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 | ||
| 8225 | The 67th Tree Problem | constructive algorithms implementation trees | Statement | F | Codeforces Round 1090 (Div. 4) {2218} | PROGRAMMING | Codeforces Round 1090 (Div. 4) Editorial | ||
| 28723 | The 67th Permutation Problem | constructive algorithms greedy math | Statement | C | Codeforces Round 1090 (Div. 4) {2218} | PROGRAMMING | Codeforces Round 1090 (Div. 4) Editorial | ||
| 19928 | The 67th OEIS Problem | greedy math number theory | Statement | D | Codeforces Round 1090 (Div. 4) {2218} | PROGRAMMING | Codeforces Round 1090 (Div. 4) Editorial | ||
| 4096 | 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 | ||
| 38180 | The 67th Integer Problem | brute force games implementation math | Statement | A | Codeforces Round 1090 (Div. 4) {2218} | PROGRAMMING | Codeforces Round 1090 (Div. 4) Editorial | ||
| 36690 | The 67th 6-7 Integer Problem | greedy math | Statement | B | Codeforces Round 1090 (Div. 4) {2218} | PROGRAMMING | Codeforces Round 1090 (Div. 4) Editorial | ||
| 113 | Weird Chessboard | constructive algorithms math | Statement | E | Codeforces Round 1093 (Div. 1) {2219} | PROGRAMMING | 3000.0 | Codeforces Round 1093 (Div. 1, Div. 2) Editorial | |
| 3476 | 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 | |
| 3879 | 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 | |
| 471 | MEX Replacement on Tree | Statement | D | Codeforces Round 1093 (Div. 1) {2219} | PROGRAMMING | 2250.0 | Codeforces Round 1093 (Div. 1, Div. 2) Editorial | ||
| 9705 | 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 | |
| 1298 | 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 | |
| 13204 | OIE Excursion | greedy | Statement | B | Codeforces Round 1093 (Div. 2) {2220} | PROGRAMMING | 1000.0 | Tutorial | |
| 19347 | Blocked | greedy sortings | Statement | A | Codeforces Round 1093 (Div. 2) {2220} | PROGRAMMING | 500.0 | Tutorial | |
| 190 | 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 | |
| 2165 | 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 | |
| 3553 | 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 | |
| 5322 | 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 | |
| 128 | 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 | |
| 664 | 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 | |
| 11019 | 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 | |
| 8008 | 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 | |
| 785 | 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 | |
| 24 | 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 | |
| 297 | 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 | |
| 74 | 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 | |
| 6303 | 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 | |
| 2981 | 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 | |
| 7096 | 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 | |
| 10079 | 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 | |
| 671 | 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 | ||
| 229 | Simple Problem | graphs number theory | Statement | G | Educational Codeforces Round 189 (Rated for Div. 2) {2225} | PROGRAMMING | Tutorial | ||
| 12502 | Red-Black Pairs | dp greedy | Statement | C | Educational Codeforces Round 189 (Rated for Div. 2) {2225} | PROGRAMMING | Tutorial | ||
| 7316 | Exceptional Segments | bitmasks brute force math | Statement | D | Educational Codeforces Round 189 (Rated for Div. 2) {2225} | PROGRAMMING | Tutorial | ||
| 1184 | Covering Points with Circles | constructive algorithms data structures geometry probabilities | Statement | E | Educational Codeforces Round 189 (Rated for Div. 2) {2225} | PROGRAMMING | Tutorial | ||
| 19501 | A Number Between Two Others | math | Statement | A | Educational Codeforces Round 189 (Rated for Div. 2) {2225} | PROGRAMMING | Tutorial | ||
| 15511 | Alternating String | brute force greedy | Statement | B | Educational Codeforces Round 189 (Rated for Div. 2) {2225} | PROGRAMMING | Tutorial | ||
| 160 | Stop Spot | strings trees | Statement | G | Codeforces Round 1095 (Div. 2) {2226} | PROGRAMMING | 2500.0 | Codeforces Round 1095 (Div. 2) Editorial | |
| 2734 | Reserved Reversals | constructive algorithms dp greedy | Statement | D | Codeforces Round 1095 (Div. 2) {2226} | PROGRAMMING | 2000.0 | Codeforces Round 1095 (Div. 2) Editorial | |
| 878 | 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 | |
| 6881 | 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 | |
| 225 | Inversion Invasion | math number theory | Statement | F | Codeforces Round 1095 (Div. 2) {2226} | PROGRAMMING | 2500.0 | Codeforces Round 1095 (Div. 2) Editorial | |
| 12300 | Everything Everywhere | greedy math number theory | Statement | B | Codeforces Round 1095 (Div. 2) {2226} | PROGRAMMING | 750.0 | Codeforces Round 1095 (Div. 2) Editorial | |
| 13549 | Disturbing Distribution | greedy math | Statement | A | Codeforces Round 1095 (Div. 2) {2226} | PROGRAMMING | 500.0 | Codeforces Round 1095 (Div. 2) Editorial | |
| 19561 | Snowfall | constructive algorithms math | Statement | C | Codeforces Round 1096 (Div. 3) {2227} | PROGRAMMING | Codeforces Round 1096 (Div. 3) — Editorial | ||
| 23708 | Party Monster | greedy | Statement | B | Codeforces Round 1096 (Div. 3) {2227} | PROGRAMMING | Codeforces Round 1096 (Div. 3) — Editorial | ||
| 11401 | 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 | ||
| 26030 | Koshary | implementation math | Statement | A | Codeforces Round 1096 (Div. 3) {2227} | PROGRAMMING | Codeforces Round 1096 (Div. 3) — Editorial | ||
| 3634 | 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 | ||
| 7884 | 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 | ||
| 1376 | Fallen Leaves | dfs and similar dp trees | Statement | H | Codeforces Round 1096 (Div. 3) {2227} | PROGRAMMING | Codeforces Round 1096 (Div. 3) — Editorial | ||
| 1814 | Drowning | binary search data structures math | Statement | G | Codeforces Round 1096 (Div. 3) {2227} | PROGRAMMING | Codeforces Round 1096 (Div. 3) — Editorial | ||
| 2364 | Sanae, Cross and Color | data structures implementation | Statement | D | Codeforces Round 1098 (Div. 2) {2228} | PROGRAMMING | 2500.0 | Codeforces Round 1098 (Div. 2) Editorial | |
| 14546 | Remilia Plays Soku | games implementation | Statement | B | Codeforces Round 1098 (Div. 2) {2228} | PROGRAMMING | 750.0 | Codeforces Round 1098 (Div. 2) Editorial | |
| 272 | 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 | |
| 19067 | Marisa Steals Reimu's Takeout | greedy implementation | Statement | A | Codeforces Round 1098 (Div. 2) {2228} | PROGRAMMING | 500.0 | Codeforces Round 1098 (Div. 2) Editorial | |
| 5039 | Cirno and Number (Hard Version) | greedy implementation | Statement | C2 | Codeforces Round 1098 (Div. 2) {2228} | PROGRAMMING | 1000.0 | Codeforces Round 1098 (Div. 2) Editorial | |
| 6859 | 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 | |
| 249 | 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 | |
| 514 | Amanojaku and Sequence (Easy Version) | combinatorics math | Statement | E1 | Codeforces Round 1098 (Div. 2) {2228} | PROGRAMMING | 2000.0 | Codeforces Round 1098 (Div. 2) Editorial | |
| 135 | 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 | |
| 7126 | 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 | |
| 13000 | 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 | |
| 117 | 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 | |
| 15421 | 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 | |
| 260 | 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 | |
| 4274 | 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 | |
| 856 | 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 | |
| 1546 | 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 | |
| 14863 | 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 | |
| 18883 | Optimal Purchase | implementation math | Statement | A | Educational Codeforces Round 190 (Rated for Div. 2) {2230} | PROGRAMMING | Educational Codeforces Round 190 — Editorial | ||
| 1135 | 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 | ||
| 4007 | Good Schedule | dp graphs greedy two pointers | Statement | D | Educational Codeforces Round 190 (Rated for Div. 2) {2230} | PROGRAMMING | Educational Codeforces Round 190 — Editorial |