Review the problem statement from Codeforces (link will open a new tab). When you've matched your problem, go to the solutions.
Search on plain tags, ratings, names, and problem text. Example: brute force or binary search
< 1 2Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 8112 | Prefix Purchase | binary search data structures greedy | Statement | D | CodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!) {1870} | PROGRAMMING | 1750.0 | CodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 578 | Lazy Numbers | binary search math | Statement | F | CodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!) {1870} | PROGRAMMING | 3250.0 | CodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 1493 | wxhtzdy ORO Tree | binary search bitmasks data structures dfs and similar math trees | Statement | G | Codeforces Round 900 (Div. 3) {1878} | PROGRAMMING | Codeforces round #900 (Div.3) Editorial | ||
| 18221 | Fear of the Dark | binary search geometry math | Statement | B | Educational Codeforces Round 156 (Rated for Div. 2) {1886} | PROGRAMMING | Educational Codeforces Round 156 Editorial | ||
| 1306 | Split | binary search data structures divide and conquer math two pointers | Statement | D | Codeforces Round 905 (Div. 1) {1887} | PROGRAMMING | 1250.0 | Codeforces Round #905 (Div. 1, Div. 2, Div. 3) Editorial | |
| 4604 | Suspicious logarithms | binary search brute force implementation math number theory | Statement | D | Codeforces Round 907 (Div. 2) {1891} | PROGRAMMING | 1500.0 | ||
| 8753 | Yet Another Monster Fight | binary search greedy implementation math | Statement | D | Educational Codeforces Round 158 (Rated for Div. 2) {1901} | PROGRAMMING | Educational Codeforces Round 158 Editorial | ||
| 16609 | Getting Points | binary search math | Statement | B | Educational Codeforces Round 159 (Rated for Div. 2) {1902} | PROGRAMMING | Educational Codeforces Round 159 Editorial | ||
| 4714 | Cyclic MEX | binary search constructive algorithms data structures implementation math two pointers | Statement | D | Codeforces Round 915 (Div. 2) {1905} | PROGRAMMING | 2000.0 | Codeforces Round 915 (Div. 2) Editorial | |
| 6590 | Array Repetition | binary search data structures dp implementation math | Statement | D | Codeforces Round 919 (Div. 2) {1920} | PROGRAMMING | 2000.0 | Editorial for Codeforces Round #919 (Div. 2) | |
| 15121 | Vlad and an Odd Ordering | binary search bitmasks data structures dp implementation math number theory | Statement | E | Codeforces Round 928 (Div. 4) {1926} | PROGRAMMING | 126132 | ||
| 5239 | Lonely Mountain Dungeons | binary search brute force data structures greedy math ternary search | Statement | D | Codeforces Round 924 (Div. 2) {1928} | PROGRAMMING | 1750.0 | Codeforces Round 924 Editorial | |
| 17527 | Sasha and the Casino | binary search brute force dp games greedy math | Statement | C | Codeforces Round 926 (Div. 2) {1929} | PROGRAMMING | 1500.0 | Codeforces Round #926 (Div. 2) Editorial. | |
| 13834 | Turtle vs. Rabbit Race: Optimal Trainings | binary search math ternary search | Statement | E | Codeforces Round 929 (Div. 3) {1933} | PROGRAMMING | Codeforces Round 929 (Div. 3) Editorial | ||
| 1682 | Distance Learning Courses in MAC | binary search bitmasks data structures greedy implementation math | Statement | E | Codeforces Round 932 (Div. 2) {1935} | PROGRAMMING | 2500.0 | Codeforces Round #932 (Div. 2) Editorial | |
| 11000 | Exam in MAC | binary search combinatorics math | Statement | D | Codeforces Round 932 (Div. 2) {1935} | PROGRAMMING | 1750.0 | Codeforces Round #932 (Div. 2) Editorial | |
| 3620 | Pinball | binary search implementation math | Statement | B | Codeforces Round 930 (Div. 1) {1936} | PROGRAMMING | 1000.0 | Codeforces Round 930 (Div. 1, Div. 2) Editorial | |
| 15190 | Permutation Counting | binary search greedy implementation math sortings | Statement | A | Codeforces Round 942 (Div. 1) {1967} | PROGRAMMING | 750.0 | Tutorial | 1400 |
| 2607 | Division + LCP (hard version) | binary search brute force data structures dp hashing math string suffix structures strings | Statement | G2 | Codeforces Round 943 (Div. 3) {1968} | PROGRAMMING | 129096 | 2200 | |
| 18638 | Find the Car | binary search math sortings | Statement | E | Codeforces Round 944 (Div. 4) {1971} | PROGRAMMING | Codeforces Round 944 (Div. 4) Editorial | 1500 | |
| 12706 | Circle Perimeter | binary search brute force dfs and similar geometry implementation math | Statement | F | Codeforces Round 944 (Div. 4) {1971} | PROGRAMMING | Codeforces Round 944 (Div. 4) Editorial | 1600 | |
| 17037 | Cat, Fox and the Lonely Array | binary search bitmasks data structures greedy math two pointers | Statement | B | Codeforces Round 945 (Div. 2) {1973} | PROGRAMMING | 1000.0 | Editorial for Codeforces Round #945 (Div. 2) | 1300 |
| 2931 | Chain Queries | binary search data structures dfs and similar implementation trees | Statement | E | Codeforces Round 947 (Div. 1 + Div. 2) {1975} | PROGRAMMING | 2000.0 | editorial_zh.pdf | 2100 |
| 25582 | New Bakery | binary search greedy math ternary search | Statement | B | Codeforces Round 953 (Div. 2) {1978} | PROGRAMMING | 750.0 | 130527 | |
| 10271 | Bouquet (Hard Version) | binary search data structures greedy math sortings two pointers | Statement | B2 | Codeforces Round 961 (Div. 2) {1995} | PROGRAMMING | 500.0 | Video Tutorial | |
| 6438 | Bomb | binary search greedy math | Statement | F | Codeforces Round 962 (Div. 3) {1996} | PROGRAMMING | Codeforces Round 962 (Div. 3) Editorial | ||
| 2304 | Eliminating Balls With Merging (Easy Version) | binary search brute force data structures divide and conquer dp greedy math | Statement | E1 | Codeforces Round 965 (Div. 2) {1998} | PROGRAMMING | 1750.0 | Video Tutorial | |
| 14963 | Ruler (easy version) | binary search interactive ternary search | Statement | G1 | Codeforces Round 964 (Div. 4) {1999} | PROGRAMMING | Video Tutorial | ||
| 11489 | Ruler (hard version) | binary search interactive ternary search | Statement | G2 | Codeforces Round 964 (Div. 4) {1999} | PROGRAMMING | Video Tutorial | ||
| 22120 | The Strict Teacher (Hard Version) | binary search greedy math sortings | Statement | B2 | Codeforces Round 972 (Div. 2) {2005} | PROGRAMMING | 500.0 | Discussion stream (With Hints) | |
| 6782 | Sakurako's Task | binary search brute force greedy math number theory | Statement | G | Codeforces Round 970 (Div. 3) {2008} | PROGRAMMING | Codeforces Round 970 (Div. 3) Editorial | ||
| 3653 | Sakurako's Test | binary search brute force greedy math number theory | Statement | H | Codeforces Round 970 (Div. 3) {2008} | PROGRAMMING | Codeforces Round 970 (Div. 3) Editorial | ||
| 36945 | Longest Good Array | binary search brute force math | Statement | C | Codeforces Round 970 (Div. 3) {2008} | PROGRAMMING | Codeforces Round 970 (Div. 3) Editorial | ||
| 18005 | Klee's SUPER DUPER LARGE Array!!! | binary search math ternary search | Statement | E | Codeforces Round 971 (Div. 4) {2009} | PROGRAMMING | Codeforces Round 971 (Div. 4) Editorial | ||
| 677 | Game in Tree (Easy Version) | binary search data structures games implementation trees | Statement | F1 | Codeforces Round 973 (Div. 2) {2013} | PROGRAMMING | 2000.0 | 134298 | |
| 7615 | Minimize the Difference | binary search data structures greedy implementation math | Statement | D | Codeforces Round 973 (Div. 2) {2013} | PROGRAMMING | 2000.0 | 134298 | |
| 27958 | Robin Hood in Town | binary search divide and conquer greedy math | Statement | C | Codeforces Round 974 (Div. 3) {2014} | PROGRAMMING | Discussion stream (With Hints) | ||
| 246 | Complex Segments (Easy Version) | binary search data structures divide and conquer dsu greedy math sortings | Statement | E1 | Codeforces Round 975 (Div. 1) {2018} | PROGRAMMING | 2250.0 | Editorial of Codeforces Round 975 (Div. 1, Div. 2) | |
| 210 | Complex Segments (Hard Version) | binary search data structures divide and conquer dsu greedy math sortings | Statement | E2 | Codeforces Round 975 (Div. 1) {2018} | PROGRAMMING | 750.0 | Editorial of Codeforces Round 975 (Div. 1, Div. 2) | |
| 5307 | Speedbreaker | binary search dp greedy implementation math two pointers | Statement | B | Codeforces Round 975 (Div. 1) {2018} | PROGRAMMING | 750.0 | Editorial of Codeforces Round 975 (Div. 1, Div. 2) | |
| 22019 | Brightness Begins | binary search math | Statement | B | Codeforces Round 976 (Div. 2) and Divide By Zero 9.0 {2020} | PROGRAMMING | 750.0 | Tutorial for Codeforces Round 976 (Div. 2) and Divide By Zero 9.0 | |
| 6070 | Sums of Segments | binary search data structures dp implementation math | Statement | D | Educational Codeforces Round 171 (Rated for Div. 2) {2026} | PROGRAMMING | Educational Codeforces Round 171 Editorial | ||
| 13551 | Alice's Adventures in Permuting | binary search implementation math | Statement | B | Codeforces Round 986 (Div. 2) {2028} | PROGRAMMING | 1000.0 | Codeforces Round 986 (Div. 2) Editorial | |
| 14282 | Set | binary search greedy math | Statement | A | Refact.ai Match 1 (Codeforces Round 985) {2029} | PROGRAMMING | 750.0 | Refact.ai Match 1 (Codeforces Round 985) Editorial | |
| 16536 | Trinity | binary search math sortings two pointers | Statement | C | Codeforces Round 983 (Div. 2) {2032} | PROGRAMMING | 1250.0 | Codeforces Round 983 (Div. 2) Editorial | |
| 5900 | Yet Another Real Number Problem | binary search brute force data structures dp greedy implementation math two pointers | Statement | D | Codeforces Global Round 27 {2035} | PROGRAMMING | 1500.0 | Codeforces Global Round 27 Editorial | |
| 1989 | Monster | binary search brute force math | Statement | E | Codeforces Global Round 27 {2035} | PROGRAMMING | 2000.0 | Codeforces Global Round 27 Editorial | |
| 1958 | Make It Equal | binary search brute force greedy math | Statement | B | 2024-2025 ICPC, NERC, Southern and Volga Russian Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2038} | PROGRAMMING | 2100 | ||
| 7341 | Bowling Frame | binary search math | Statement | B | 2024 ICPC Asia Taichung Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2041} | PROGRAMMING | Problem Analysis and Hints (PDF) | ||
| 334 | Problem with Queries | binary search brute force data structures | Statement | G | Educational Codeforces Round 173 (Rated for Div. 2) {2043} | PROGRAMMING | Educational Codeforces Round 173 Editorial | ||
| 11466 | Sums on Segments | binary search brute force data structures dp greedy math | Statement | C | Educational Codeforces Round 173 (Rated for Div. 2) {2043} | PROGRAMMING | Educational Codeforces Round 173 Editorial | ||
| 6332 | Easy Demon Problem | binary search brute force math number theory | Statement | F | Codeforces Round 993 (Div. 4) {2044} | PROGRAMMING | Codeforces Round 993 (Div. 4) Editorial | ||
| 18438 | Insane Problem | binary search greedy implementation math | Statement | E | Codeforces Round 993 (Div. 4) {2044} | PROGRAMMING | Codeforces Round 993 (Div. 4) Editorial | ||
| 1621 | Broken Queries | binary search bitmasks interactive | Statement | E | Codeforces Round 994 (Div. 2) {2049} | PROGRAMMING | 2250.0 | Codeforces Round #994 (Div. 2) Editorial | |
| 40463 | Journey | binary search math | Statement | B | Codeforces Round 995 (Div. 3) {2051} | PROGRAMMING | 137623 | ||
| 7807 | Refined Product Optimality | binary search data structures greedy implementation math schedules sortings | Statement | D | Good Bye 2024: 2025 is NEAR {2053} | PROGRAMMING | 1750.0 | Good Bye 2024: 2025 is NEAR Editorial | |
| 2666 | Another Exercise on Graphs (Easy Version) | binary search brute force dp graphs shortest paths | Statement | E1 | Hello 2025 {2057} | PROGRAMMING | 1000.0 | ||
| 2297 | Kevin and Binary String (Easy Version) | binary search brute force data structures dp greedy implementation strings two pointers | Statement | F1 | IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2) {2061} | PROGRAMMING | 2000.0 | IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2) Editorial | |
| 5129 | Game With Triangles | binary search data structures dp greedy math ternary search two pointers | Statement | D | Codeforces Round 1000 (Div. 2) {2063} | PROGRAMMING | 2250.0 | Codeforces Round 1000 (Div. 2) — Editorial | |
| 12606 | Do You Love Your Hero and His Two-Hit Multi-Target Attacks? | binary search constructive algorithms geometry greedy math | Statement | E | Codeforces Round 1006 (Div. 3) {2072} | PROGRAMMING | Codeforces Round 1006 (Div. 3) Editorial | ||
| 14730 | Two Colors | binary search data structures dp math | Statement | C | Educational Codeforces Round 176 (Rated for Div. 2) {2075} | PROGRAMMING | Educational Codeforces Round 176 Editorial | ||
| 9089 | Arcology On Permafrost | binary search brute force constructive algorithms greedy math | Statement | D | Teza Round 1 (Codeforces Round 1015, Div. 1 + Div. 2) {2084} | PROGRAMMING | 1750.0 | 141155 | |
| 19329 | Large Array and Segments | binary search brute force dp greedy math | Statement | B | Educational Codeforces Round 177 (Rated for Div. 2) {2086} | PROGRAMMING | Educational Codeforces Round 177 Editorial | ||
| 1307 | Canteen (Hard Version) | binary search data structures greedy math two pointers | Statement | B2 | Codeforces Round 1012 (Div. 1) {2089} | PROGRAMMING | 500.0 | Codeforces Round 1012 (Div.1, Div. 2, based on THUPC 2025 — Finals) Editorial | |
| 23981 | Place of the Olympiad | binary search greedy math | Statement | D | Codeforces Round 1013 (Div. 3) {2091} | PROGRAMMING | Codeforces Round 1013 (Div. 3) Editorial | ||
| 3883 | La Vaca Saturno Saturnita | binary search brute force math number theory | Statement | H | Codeforces Round 1017 (Div. 4) {2094} | PROGRAMMING | Codeforces Round 1017 (Div. 4) Editorial | ||
| 13622 | Array and GCD | binary search greedy math number theory | Statement | D | Educational Codeforces Round 178 (Rated for Div. 2) {2104} | PROGRAMMING | Educational Codeforces Round 178 Editorial | ||
| 6072 | Wolf | binary search greedy math | Statement | E | Codeforces Round 1020 (Div. 3) {2106} | PROGRAMMING | Codeforces Round 1020 (Div. 3) Editorial | ||
| 12426 | Maximum Subarray Sum | binary search constructive algorithms implementation math | Statement | C | Codeforces Round 1023 (Div. 2) {2107} | PROGRAMMING | 1500.0 | Codeforces Round 1023 (Div 2) Editorial | |
| 2462 | Needle in a Numstack | binary search brute force interactive math | Statement | D | Codeforces Round 1022 (Div. 2) {2108} | PROGRAMMING | 2250.0 | Codeforces Round 1022 Editorial | |
| 284 | Penguin Steps | binary search dfs and similar flows graphs shortest paths | Statement | F | Codeforces Round 1025 (Div. 2) {2109} | PROGRAMMING | 3000.0 | Codeforces Round 1025 (Div. 2) Editorial | |
| 5610 | Small Operations | binary search bitmasks brute force dfs and similar dp math number theory sortings | Statement | F | Codeforces Round 1027 (Div. 3) {2114} | PROGRAMMING | 143268 | ||
| 43999 | Square Year | binary search brute force math | Statement | A | Codeforces Round 1027 (Div. 3) {2114} | PROGRAMMING | 143268 | ||
| 22633 | Retaliation | binary search math | Statement | D | Codeforces Round 1029 (Div. 3) {2117} | PROGRAMMING | Codeforces Round 1029 (Div. 3) Editorial | ||
| 2562 | Red Light, Green Light (Hard version) | binary search dfs and similar dp dsu graphs implementation number theory | Statement | D2 | Codeforces Round 1030 (Div. 2) {2118} | PROGRAMMING | 1000.0 | Codeforces Round 1030 (Div. 2) Editorial | |
| 15296 | MEX Count | binary search data structures greedy sortings two pointers | Statement | E | Codeforces Round 1034 (Div. 3) {2123} | PROGRAMMING | Codeforces Round 1034 (Div. 3) Editorial | ||
| 124 | Inter Active (Hard Version) | binary search bitmasks constructive algorithms graphs implementation interactive math probabilities | Statement | G2 | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) {2127} | PROGRAMMING | 2750.0 | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) Editorial | |
| 1787 | Interactive RBS (Hard Version) | binary search bitmasks constructive algorithms dp interactive | Statement | C3 | Codeforces Round 1040 (Div. 1) {2129} | PROGRAMMING | 750.0 | Codeforces Round 1040 (Div. 1, Div. 2) Editorial | |
| 4214 | Interactive RBS (Easy Version) | binary search bitmasks constructive algorithms interactive | Statement | C1 | Codeforces Round 1040 (Div. 1) {2129} | PROGRAMMING | 750.0 | Codeforces Round 1040 (Div. 1, Div. 2) Editorial | |
| 2857 | Interactive RBS (Medium Version) | binary search bitmasks constructive algorithms interactive | Statement | C2 | Codeforces Round 1040 (Div. 1) {2129} | PROGRAMMING | 750.0 | Codeforces Round 1040 (Div. 1, Div. 2) Editorial | |
| 4812 | Unjust Binary Life | binary search binary search data structures greedy greedy math two pointers | Statement | F | Codeforces Round 1042 (Div. 3) {2131} | PROGRAMMING | Codeforces Round 1042 (Div. 3) Editorial | ||
| 9122 | From 1 to Infinity | binary search dp implementation math | Statement | D | Codeforces Round 1043 (Div. 3) {2132} | PROGRAMMING | Codeforces Round 1043 (Div. 3) Editorial | ||
| 13720 | The Cunning Seller (hard version) | binary search greedy math | Statement | C2 | Codeforces Round 1043 (Div. 3) {2132} | PROGRAMMING | Codeforces Round 1043 (Div. 3) Editorial | ||
| 7786 | Chicken Jockey | binary search brute force dp greedy math | Statement | D | Codeforces Round 1044 (Div. 2) {2133} | PROGRAMMING | 2250.0 | Codeforces Round 1044 (Div. 2) Editorial | |
| 1146 | From the Unknown (Hard Version) | binary search brute force constructive algorithms interactive math | Statement | D2 | Codeforces Round 1046 (Div. 1) {2135} | PROGRAMMING | 1250.0 | Codeforces Round 1046 (Div. 1, Div. 2) Editorial | |
| 678 | Antiamuny and Slider Movement | binary search brute force combinatorics implementation math | Statement | D | Codeforces Round 1048 (Div. 1) {2138} | PROGRAMMING | 2500.0 | Codeforces Round 1048 (Div. 1, Div. 2) Editorial | |
| 3239 | Predicting Popularity | binary search data structures math sortings | Statement | E | Educational Codeforces Round 183 (Rated for Div. 2) {2145} | PROGRAMMING | Educational Codeforces Round 183 Editorial | ||
| 13919 | Wrong Binary Search | binary search constructive algorithms | Statement | C | Codeforces Round 1052 (Div. 2) {2146} | PROGRAMMING | 1250.0 | Codeforces Round 1052 (Div. 2) Editorial | |
| 4985 | Nezuko in the Clearing | binary search math ternary search | Statement | F | Codeforces Round 1054 (Div. 3) {2149} | PROGRAMMING | __rose | ||
| 1245 | No Mind To Think | binary search greedy sortings ternary search two pointers | Statement | E | Codeforces Round 1060 (Div. 2) {2154} | PROGRAMMING | 2500.0 | Codeforces Round 1060 (Div. 2) Editorial | |
| 21471 | Strange Machine | binary search brute force greedy implementation | Statement | B | Codeforces Round 1061 (Div. 2) {2156} | PROGRAMMING | 750.0 | Codeforces Round 1061 (Div. 2) Editorial | |
| 1445 | Inverse Minimum Partition (Easy Version) | binary search data structures dp greedy math two pointers | Statement | D1 | Codeforces Round 1058 (Div. 1) {2159} | PROGRAMMING | 1500.0 | Codeforces Round 1058 Editorial | |
| 5698 | Copy String | binary search greedy implementation strings | Statement | D | Codeforces Global Round 30 (Div. 1 + Div. 2) {2164} | PROGRAMMING | 1750.0 | Codeforces Global Round 30 Editorial | |
| 9490 | khba Loves to Sleep! | binary search data structures geometry implementation math | Statement | E | Codeforces Round 1062 (Div. 4) {2167} | PROGRAMMING | Arpa Video Tutorial | ||
| 8941 | Removal of a Sequence (Easy Version) | binary search bitmasks geometry implementation math number theory | Statement | D1 | Educational Codeforces Round 184 (Rated for Div. 2) {2169} | PROGRAMMING | Educational Codeforces Round 184 Editorial | ||
| 2366 | Removal of a Sequence (Hard Version) | binary search constructive algorithms divide and conquer greedy implementation math number theory probabilities | Statement | D2 | Educational Codeforces Round 184 (Rated for Div. 2) {2169} | PROGRAMMING | Educational Codeforces Round 184 Editorial | ||
| 619 | Isla's Memory Thresholds | binary search data structures divide and conquer math | Statement | F | Codeforces Round 1068 (Div. 2) {2173} | PROGRAMMING | 3000.0 | ||
| 674 | Greta's Game | binary search dp math | Statement | G | 2025-2026 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2181} | PROGRAMMING | Tutorial | ||
| 166 | Cacti Classification | binary search interactive math | Statement | C | 2025-2026 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2181} | PROGRAMMING | Tutorial | ||
| 3953 | Alphabet City | binary search math strings | Statement | A | 2025-2026 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2181} | PROGRAMMING | Tutorial | ||
| 11148 | War Strategy | binary search greedy math two pointers | Statement | C | Hello 2026 {2183} | PROGRAMMING | 1500.0 | ||
| 22896 | Huge Pile | binary search math | Statement | C | Codeforces Round 1072 (Div. 3) {2184} | PROGRAMMING | Codeforces Round 1072 (Div. 3) Editorial | ||
| 2052 | Little String (Hard Version) | binary search combinatorics dp greedy math number theory | Statement | D2 | Codeforces Round 1075 (Div. 2) {2189} | PROGRAMMING | 750.0 | Codeforces Round 1075 (Div. 2) Editorial | |
| 12028 | 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 | |
| 310 | 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 | |
| 237 | 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 | |
| 7893 | Test Generator | binary search bitmasks greedy math | Statement | C | Educational Codeforces Round 187 (Rated for Div. 2) {2203} | PROGRAMMING | Educational Codeforces Round 187 Editorial | ||
| 1510 | 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 | ||
| 453 | 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 | ||
| 1337 | 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 | ||
| 257 | 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 | |
| 1266 | 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 | |
| 3721 | 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 | |
| 2359 | 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 | |
| 907 | 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 | |
| 3590 | 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 | |
| 7942 | 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 | |
| 2152 | Drowning | binary search data structures math | Statement | G | Codeforces Round 1096 (Div. 3) {2227} | PROGRAMMING | Codeforces Round 1096 (Div. 3) — Editorial | ||
| 1431 | 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 | ||
| 20085 | Cake Leveling | binary search greedy math | Statement | B | Codeforces Round 1101 (Div. 2) {2232} | PROGRAMMING | 1000.0 | Codeforces Round 1101 (Div. 2) — Editorial | |
| 12109 | Brand New Tatar TV Show | binary search constructive algorithms dp games math | Statement | D | Codeforces Round 1103 (Div. 3) {2236} | PROGRAMMING | |||
| 1151 | Revival | binary search constructive algorithms data structures math two pointers | Statement | C | Codeforces Round 1105 (Div. 1) {2239} | PROGRAMMING | 1500.0 | ||
| 769 | Summmon | binary search data structures greedy math number theory | Statement | G | Codeforces Round 1107 (Div. 3) {2241} | PROGRAMMING |