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 4 5Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 11186 | Ruler (hard version) | binary search interactive ternary search | Statement | G2 | Codeforces Round 964 (Div. 4) {1999} | PROGRAMMING | Video Tutorial | ||
| 3155 | Call During the Journey | binary search brute force graphs greedy shortest paths | Statement | G | Codeforces Round 966 (Div. 3) {2000} | PROGRAMMING | 132689 | ||
| 2337 | Ksyusha and the Loaded Set | binary search data structures dp implementation trees | Statement | H | Codeforces Round 966 (Div. 3) {2000} | PROGRAMMING | 132689 | ||
| 12871 | Guess The Tree | binary search brute force greedy interactive trees | Statement | C | Codeforces Round 967 (Div. 2) {2001} | PROGRAMMING | 1500.0 | Video Tutorial | |
| 13343 | Colored Portals | binary search data structures graphs greedy shortest paths | Statement | D | Educational Codeforces Round 169 (Rated for Div. 2) {2004} | PROGRAMMING | Educational Codeforces Round 169 Editorial | ||
| 1264 | Alter the GCD | binary search data structures divide and conquer dp number theory | Statement | D | Codeforces Round 972 (Div. 2) {2005} | PROGRAMMING | 2250.0 | Discussion stream (With Hints) | |
| 21854 | 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) | |
| 2087 | Eri and Expanded Sets | binary search data structures number theory two pointers | Statement | C | Codeforces Round 969 (Div. 1) {2006} | PROGRAMMING | 1500.0 | Tutorial | |
| 6720 | 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 | ||
| 3627 | 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 | ||
| 36674 | Longest Good Array | binary search brute force math | Statement | C | Codeforces Round 970 (Div. 3) {2008} | PROGRAMMING | Codeforces Round 970 (Div. 3) Editorial | ||
| 17798 | 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 | ||
| 5444 | Yunli's Subarray Queries (easy version) | binary search two pointers | Statement | G1 | Codeforces Round 971 (Div. 4) {2009} | PROGRAMMING | Codeforces Round 971 (Div. 4) Editorial | ||
| 666 | Game in Tree (Easy Version) | binary search data structures games implementation trees | Statement | F1 | Codeforces Round 973 (Div. 2) {2013} | PROGRAMMING | 2000.0 | 134298 | |
| 7536 | Minimize the Difference | binary search data structures greedy implementation math | Statement | D | Codeforces Round 973 (Div. 2) {2013} | PROGRAMMING | 2000.0 | 134298 | |
| 167 | Game in Tree (Hard Version) | binary search data structures trees | Statement | F2 | Codeforces Round 973 (Div. 2) {2013} | PROGRAMMING | 2000.0 | 134298 | |
| 27639 | Robin Hood in Town | binary search divide and conquer greedy math | Statement | C | Codeforces Round 974 (Div. 3) {2014} | PROGRAMMING | Discussion stream (With Hints) | ||
| 241 | 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) | |
| 206 | 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) | |
| 5222 | 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) | |
| 21796 | 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 | |
| 769 | Billetes MX (Easy Version) | 2-sat binary search combinatorics dfs and similar dsu graphs | Statement | E1 | Codeforces Round 978 (Div. 2) {2022} | PROGRAMMING | 2250.0 | Codeforces Round 978 (Div 2) Editorial | |
| 718 | Billetes MX (Hard Version) | binary search combinatorics dfs and similar dsu graphs | Statement | E2 | Codeforces Round 978 (Div. 2) {2022} | PROGRAMMING | 1000.0 | Codeforces Round 978 (Div 2) Editorial | |
| 4067 | Asesino (Easy Version) | binary search constructive algorithms implementation interactive | Statement | D1 | Codeforces Round 978 (Div. 2) {2022} | PROGRAMMING | 1750.0 | Codeforces Round 978 (Div 2) Editorial | |
| 17143 | Buying Lemonade | binary search constructive algorithms sortings | Statement | B | Codeforces Round 980 (Div. 2) {2024} | PROGRAMMING | 1000.0 | 135341 | |
| 19178 | New Game | binary search brute force greedy implementation two pointers | Statement | C | Educational Codeforces Round 170 (Rated for Div. 2) {2025} | PROGRAMMING | Educational Codeforces Round 170 Editorial | ||
| 28725 | Two Screens | binary search greedy strings two pointers | Statement | A | Educational Codeforces Round 170 (Rated for Div. 2) {2025} | PROGRAMMING | Educational Codeforces Round 170 Editorial | ||
| 16596 | Black Cells | binary search brute force greedy | Statement | B | Educational Codeforces Round 171 (Rated for Div. 2) {2026} | PROGRAMMING | Educational Codeforces Round 171 Editorial | ||
| 5923 | 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 | ||
| 1913 | The Endspeaker (Hard Version) | binary search combinatorics data structures dp greedy implementation two pointers | Statement | D2 | Codeforces Round 982 (Div. 2) {2027} | PROGRAMMING | 1000.0 | Codeforces Round #982 (Div. 2) Editorial | |
| 7029 | The Endspeaker (Easy Version) | binary search dp graphs greedy implementation two pointers | Statement | D1 | Codeforces Round 982 (Div. 2) {2027} | PROGRAMMING | 1250.0 | Codeforces Round #982 (Div. 2) Editorial | |
| 10066 | Alice's Adventures in Cutting Cake | binary search dp greedy two pointers | Statement | C | Codeforces Round 986 (Div. 2) {2028} | PROGRAMMING | 1500.0 | Codeforces Round 986 (Div. 2) Editorial | |
| 13395 | 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 | |
| 7664 | New Rating | binary search data structures dp greedy | Statement | C | Refact.ai Match 1 (Codeforces Round 985) {2029} | PROGRAMMING | 1750.0 | Refact.ai Match 1 (Codeforces Round 985) Editorial | |
| 14193 | 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 | |
| 1188 | Orangutan Approved Subarrays | binary search brute force data structures greedy two pointers | Statement | F | Codeforces Round 979 (Div. 2) {2030} | PROGRAMMING | 2500.0 | Codeforces Round 979 Editorial | |
| 464 | Penchick and Even Medians | binary search constructive algorithms interactive | Statement | F | Codeforces Round 987 (Div. 2) {2031} | PROGRAMMING | 3000.0 | Codeforces Round 987 (Div. 2) Editorial | |
| 6234 | Genokraken | binary search constructive algorithms data structures graphs interactive trees two pointers | Statement | D | Codeforces Round 983 (Div. 2) {2032} | PROGRAMMING | 1750.0 | Codeforces Round 983 (Div. 2) Editorial | |
| 16298 | Trinity | binary search math sortings two pointers | Statement | C | Codeforces Round 983 (Div. 2) {2032} | PROGRAMMING | 1250.0 | Codeforces Round 983 (Div. 2) Editorial | |
| 17931 | Sakurako's Field Trip | binary search dp greedy | Statement | C | Codeforces Round 981 (Div. 3) {2033} | PROGRAMMING | 135520 | ||
| 5853 | 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 | |
| 1975 | Monster | binary search brute force math | Statement | E | Codeforces Global Round 27 {2035} | PROGRAMMING | 2000.0 | Codeforces Global Round 27 Editorial | |
| 1105 | Tree Operations | binary search dfs and similar dp trees | Statement | F | Codeforces Global Round 27 {2035} | PROGRAMMING | 2250.0 | Codeforces Global Round 27 Editorial | |
| 112 | Go Learn! (Hard Version) | divide and conquer dp | Statement | G2 | Codeforces Global Round 27 {2035} | PROGRAMMING | 2000.0 | Codeforces Global Round 27 Editorial | |
| 172 | Go Learn! (Easy Version) | dp trees | Statement | G1 | Codeforces Global Round 27 {2035} | PROGRAMMING | 2250.0 | Codeforces Global Round 27 Editorial | |
| 1692 | Library of Magic | binary search bitmasks constructive algorithms interactive | Statement | G | Codeforces Round 984 (Div. 3) {2036} | PROGRAMMING | Codeforces Round 984 (Div. 3) Editorial | ||
| 9646 | Reverse the Rivers | binary search greedy | Statement | E | Codeforces Round 984 (Div. 3) {2036} | PROGRAMMING | Codeforces Round 984 (Div. 3) Editorial | ||
| 2981 | Ardent Flames | binary search data structures sortings two pointers | Statement | F | Codeforces Round 988 (Div. 3) {2037} | PROGRAMMING | Video Tutorial | ||
| 1937 | 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 | ||
| 7240 | 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) | ||
| 527 | Vertex Pairs | binary search brute force dfs and similar dp greedy trees | Statement | E | Educational Codeforces Round 172 (Rated for Div. 2) {2042} | PROGRAMMING | 136886 | ||
| 5330 | Recommendations | binary search data structures implementation sortings | Statement | D | Educational Codeforces Round 172 (Rated for Div. 2) {2042} | PROGRAMMING | 136886 | ||
| 329 | 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 | ||
| 11304 | 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 | ||
| 6146 | 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 | ||
| 18251 | Insane Problem | binary search greedy implementation math | Statement | E | Codeforces Round 993 (Div. 4) {2044} | PROGRAMMING | Codeforces Round 993 (Div. 4) Editorial | ||
| 10993 | Move Back at a Cost | binary search data structures greedy sortings | Statement | B | Codeforces Round 990 (Div. 1) {2046} | PROGRAMMING | 750.0 | Разбор Codeforces Round 990 (Div. 2 + Div. 1) | |
| 2368 | Adventurers | binary search data structures sortings | Statement | C | Codeforces Round 990 (Div. 1) {2046} | PROGRAMMING | 1500.0 | Разбор Codeforces Round 990 (Div. 2 + Div. 1) | |
| 8369 | Kevin and Competition Memories | binary search data structures greedy sortings two pointers | Statement | D | Codeforces Global Round 28 {2048} | PROGRAMMING | 1250.0 | Tutorial | |
| 1602 | Broken Queries | binary search bitmasks interactive | Statement | E | Codeforces Round 994 (Div. 2) {2049} | PROGRAMMING | 2250.0 | Codeforces Round #994 (Div. 2) Editorial | |
| 40075 | Journey | binary search math | Statement | B | Codeforces Round 995 (Div. 3) {2051} | PROGRAMMING | 137623 | ||
| 24089 | Counting Pairs | binary search sortings two pointers | Statement | D | Codeforces Round 995 (Div. 3) {2051} | PROGRAMMING | 137623 | ||
| 1556 | Judicious Watching | binary search greedy | Statement | J | 2024-2025 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2052} | PROGRAMMING | |||
| 17057 | Outstanding Impressionist | binary search brute force greedy | Statement | B | Good Bye 2024: 2025 is NEAR {2053} | PROGRAMMING | 1000.0 | Good Bye 2024: 2025 is NEAR Editorial | |
| 7728 | 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 | |
| 4385 | Scarecrow | binary search greedy | Statement | D | Codeforces Round 996 (Div. 2) {2055} | PROGRAMMING | 2250.0 | Codeforces Round 996 (Div. 2) Editorial | |
| 2651 | Another Exercise on Graphs (Easy Version) | binary search brute force dp graphs shortest paths | Statement | E1 | Hello 2025 {2057} | PROGRAMMING | 1000.0 | ||
| 1939 | Another Exercise on Graphs (hard version) | binary search brute force dsu graphs shortest paths sortings trees | Statement | E2 | Hello 2025 {2057} | PROGRAMMING | 2000.0 | ||
| 2282 | 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 | |
| 5083 | 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 | |
| 5920 | Eating | binary search bitmasks data structures greedy two pointers | Statement | D | Codeforces Round 1005 (Div. 2) {2064} | PROGRAMMING | 1750.0 | Codeforces Round 1005 (Div. 2) Editorial | |
| 711 | We Be Summing | binary search data structures two pointers | Statement | F | Codeforces Round 1005 (Div. 2) {2064} | PROGRAMMING | 2750.0 | Codeforces Round 1005 (Div. 2) Editorial | |
| 27965 | Skibidus and Fanum Tax (easy version) | binary search greedy | Statement | C1 | Codeforces Round 1003 (Div. 4) {2065} | PROGRAMMING | Video Tutorial | ||
| 18942 | Skibidus and Fanum Tax (hard version) | binary search greedy | Statement | C2 | Codeforces Round 1003 (Div. 4) {2065} | PROGRAMMING | Video Tutorial | ||
| 1659 | Ads | binary search greedy two pointers | Statement | C | European Championship 2025 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {2068} | PROGRAMMING | 140239 | ||
| 7111 | Palindrome Shuffle | binary search greedy hashing strings two pointers | Statement | D | Educational Codeforces Round 174 (Rated for Div. 2) {2069} | PROGRAMMING | 139774 | ||
| 13965 | Limited Repainting | binary search greedy | Statement | C | Educational Codeforces Round 175 (Rated for Div. 2) {2070} | PROGRAMMING | Video Tutorial | ||
| 351 | Towering Arrays | binary search data structures | Statement | F | Codeforces Round 1007 (Div. 2) {2071} | PROGRAMMING | 3000.0 | Codeforces Round 1007 (Div. 2) Editorial | |
| 12376 | 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 | ||
| 22085 | XOR and Triangle | binary search bitmasks brute force greedy | Statement | C | Codeforces Round 1009 (Div. 3) {2074} | PROGRAMMING | Codeforces Round 1009 (Div. 3) — Editorial | ||
| 14519 | 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 | ||
| 526 | Beautiful Sequence Returns | binary search data structures implementation | Statement | F | Educational Codeforces Round 176 (Rated for Div. 2) {2075} | PROGRAMMING | Educational Codeforces Round 176 Editorial | ||
| 47 | Order Statistics | *special binary search | Statement | D | XIX Open Olympiad in Informatics - Final Stage, Day 2 (Unrated, Online Mirror, IOI rules) {2080} | PROGRAMMING | |||
| 8942 | 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 | |
| 19116 | 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 | ||
| 3253 | Canteen (Easy Version) | binary search data structures flows greedy two pointers | Statement | B1 | Codeforces Round 1012 (Div. 1) {2089} | PROGRAMMING | 1000.0 | Codeforces Round 1012 (Div.1, Div. 2, based on THUPC 2025 — Finals) Editorial | |
| 1291 | 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 | |
| 6199 | Igor and Mountain | binary search brute force dp | Statement | F | Codeforces Round 1013 (Div. 3) {2091} | PROGRAMMING | Codeforces Round 1013 (Div. 3) Editorial | ||
| 23681 | Place of the Olympiad | binary search greedy math | Statement | D | Codeforces Round 1013 (Div. 3) {2091} | PROGRAMMING | Codeforces Round 1013 (Div. 3) Editorial | ||
| 3852 | Shorten the Array | binary search brute force data structures dfs and similar greedy strings trees two pointers | Statement | G | Codeforces Round 1016 (Div. 3) {2093} | PROGRAMMING | Codeforces Round 1016 (Div. 3) Editorial | ||
| 13579 | Min Max MEX | binary search brute force greedy | Statement | E | Codeforces Round 1016 (Div. 3) {2093} | PROGRAMMING | Codeforces Round 1016 (Div. 3) Editorial | ||
| 3820 | 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 | ||
| 2587 | 23 Kingdom | binary search data structures greedy ternary search two pointers | Statement | C | Codeforces Round 1024 (Div. 1) {2101} | PROGRAMMING | 2000.0 | 142788 | |
| 8173 | Unpleasant Strings | binary search data structures dp greedy strings | Statement | E | Educational Codeforces Round 178 (Rated for Div. 2) {2104} | PROGRAMMING | Educational Codeforces Round 178 Editorial | ||
| 13353 | 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 | ||
| 623 | Baudelaire (hard version) | binary search dfs and similar divide and conquer implementation interactive trees | Statement | G2 | Codeforces Round 1020 (Div. 3) {2106} | PROGRAMMING | Codeforces Round 1020 (Div. 3) Editorial | ||
| 12404 | Flower Boy | binary search dp greedy two pointers | Statement | D | Codeforces Round 1020 (Div. 3) {2106} | PROGRAMMING | Codeforces Round 1020 (Div. 3) Editorial | ||
| 5980 | Wolf | binary search greedy math | Statement | E | Codeforces Round 1020 (Div. 3) {2106} | PROGRAMMING | Codeforces Round 1020 (Div. 3) Editorial | ||
| 1627 | Baudelaire (easy version) | binary search interactive trees | Statement | G1 | Codeforces Round 1020 (Div. 3) {2106} | PROGRAMMING | Codeforces Round 1020 (Div. 3) Editorial | ||
| 12220 | 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 | |
| 513 | Cycling (Hard Version) | binary search data structures dp geometry greedy | Statement | F2 | Codeforces Round 1023 (Div. 2) {2107} | PROGRAMMING | 2500.0 | Codeforces Round 1023 (Div 2) Editorial | |
| 2431 | 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 | |
| 551 | Fallen Towers | binary search greedy | Statement | F | Codeforces Round 1022 (Div. 2) {2108} | PROGRAMMING | 3250.0 | Codeforces Round 1022 Editorial | |
| 278 | 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 | |
| 8690 | Fewer Batteries | binary search dfs and similar dp graphs greedy | Statement | D | Codeforces Round 1026 (Div. 2) {2110} | PROGRAMMING | 2000.0 | Codeforces Round 1026 (Div. 2) Editorial | |
| 5434 | Changing the String | binary search data structures greedy implementation sortings strings | Statement | E | Educational Codeforces Round 179 (Rated for Div. 2) {2111} | PROGRAMMING | Educational Codeforces Round 179 Editorial | ||
| 17906 | Coloring Game | binary search brute force greedy two pointers | Statement | C | Educational Codeforces Round 180 (Rated for Div. 2) {2112} | PROGRAMMING | Educational Codeforces Round 180 — Editorial | ||
| 2914 | Cheater | binary search constructive algorithms data structures greedy | Statement | D | Codeforces Round 1031 (Div. 2) {2113} | PROGRAMMING | 1750.0 | Codeforces Round #1031 Editorial | |
| 5538 | 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 | ||
| 43486 | Square Year | binary search brute force math | Statement | A | Codeforces Round 1027 (Div. 3) {2114} | PROGRAMMING | 143268 | ||
| 22304 | Retaliation | binary search math | Statement | D | Codeforces Round 1029 (Div. 3) {2117} | PROGRAMMING | Codeforces Round 1029 (Div. 3) Editorial | ||
| 2519 | 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 | |
| 1881 | Lanes of Cars | binary search dp ternary search | Statement | E | Codeforces Round 1033 (Div. 2) and CodeNite 2025 {2120} | PROGRAMMING | 2500.0 | Codeforces Round 1033 (Div. 2) and CodeNite 2025 Editorial | |
| 2275 | Ice Baby | binary search brute force data structures dp implementation sortings | Statement | H | Codeforces Round 1032 (Div. 3) {2121} | PROGRAMMING | Codeforces Round 1032 (Div. 3) Editorial | ||
| 8199 | Yamakasi | binary search brute force data structures greedy | Statement | F | Codeforces Round 1032 (Div. 3) {2121} | PROGRAMMING | Codeforces Round 1032 (Div. 3) Editorial | ||
| 15065 | 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 | ||
| 335 | Maximise Sum | binary search data structures | Statement | G | EPIC Institute of Technology Round Summer 2025 (Codeforces Round 1036, Div. 1 + Div. 2) {2124} | PROGRAMMING | 4000.0 | EPIC Institute of Technology Round Summer 2025 (Codeforces Round 1036, Div. 1 + Div. 2) Editorial | |
| 406 | Timofey and Docker | binary search dp | Statement | F | Educational Codeforces Round 181 (Rated for Div. 2) {2125} | PROGRAMMING | Educational Codeforces Round 181 Editorial | ||
| 2505 | Big Wins! (easy version) | binary search binary search two pointers | Statement | G1 | Codeforces Round 1037 (Div. 3) {2126} | PROGRAMMING | 144845 | ||
| 1189 | Big Wins! (hard version) | binary search data structures divide and conquer two pointers | Statement | G2 | Codeforces Round 1037 (Div. 3) {2126} | PROGRAMMING | 144845 | ||
| 114 | 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 | |
| 107 | Inter Active (Easy Version) | binary search constructive algorithms interactive interactive | Statement | G1 | 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 | |
| 805 | Submedians (Hard Version) | binary search constructive algorithms data structures two pointers | Statement | E2 | Codeforces Round 1039 (Div. 2) {2128} | PROGRAMMING | 1750.0 | Codeforces Round #1039 — Editorial | |
| 6674 | Submedians (Easy Version) | binary search data structures dp greedy | Statement | E1 | Codeforces Round 1039 (Div. 2) {2128} | PROGRAMMING | 1750.0 | Codeforces Round #1039 — Editorial | |
| 1707 | 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 | |
| 3965 | 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 | |
| 2580 | 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 | |
| 4763 | 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 | ||
| 7714 | Arithmetics Competition | binary search data structures greedy ternary search | Statement | E | Codeforces Round 1043 (Div. 3) {2132} | PROGRAMMING | Codeforces Round 1043 (Div. 3) Editorial | ||
| 8948 | From 1 to Infinity | binary search dp implementation math | Statement | D | Codeforces Round 1043 (Div. 3) {2132} | PROGRAMMING | Codeforces Round 1043 (Div. 3) Editorial | ||
| 13493 | The Cunning Seller (hard version) | binary search greedy math | Statement | C2 | Codeforces Round 1043 (Div. 3) {2132} | PROGRAMMING | Codeforces Round 1043 (Div. 3) Editorial | ||
| 7601 | 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 | |
| 1008 | 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 | |
| 4103 | Prefix Maximum Invariance | binary search data structures sortings | Statement | F | Codeforces Round 1047 (Div. 3) {2137} | PROGRAMMING | Codeforces Round 1047 (Div. 3) Editorial | ||
| 649 | 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 | |
| 6549 | Inversion Graph Coloring (Easy Version) | binary search data structures dp two pointers | Statement | D1 | Codeforces Round 1051 (Div. 2) {2143} | PROGRAMMING | 1750.0 | Codeforces Round 1051 (Div. 2) Editorial | |
| 2852 | Inversion Graph Coloring (Hard Version) | binary search data structures dp two pointers | Statement | D2 | Codeforces Round 1051 (Div. 2) {2143} | PROGRAMMING | 1000.0 | Codeforces Round 1051 (Div. 2) Editorial | |
| 3137 | 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 | ||
| 15673 | Monocarp's String | binary search greedy strings | Statement | C | Educational Codeforces Round 183 (Rated for Div. 2) {2145} | PROGRAMMING | Educational Codeforces Round 183 Editorial | ||
| 13544 | Wrong Binary Search | binary search constructive algorithms | Statement | C | Codeforces Round 1052 (Div. 2) {2146} | PROGRAMMING | 1250.0 | Codeforces Round 1052 (Div. 2) Editorial | |
| 2163 | Maximum OR Popcount | binary search bitmasks brute force data structures greedy | Statement | E | Codeforces Global Round 29 (Div. 1 + Div. 2) {2147} | PROGRAMMING | 2500.0 | ||
| 2701 | Buratsuta 3 | binary search brute force data structures divide and conquer probabilities | Statement | G | Codeforces Round 1054 (Div. 3) {2149} | PROGRAMMING | __rose | ||
| 4880 | Nezuko in the Clearing | binary search math ternary search | Statement | F | Codeforces Round 1054 (Div. 3) {2149} | PROGRAMMING | __rose | ||
| 1225 | 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 | |
| 21048 | 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 | |
| 973 | Best Time to Buy and Sell Stock | binary search data structures games greedy | Statement | E | Codeforces Round 1061 (Div. 2) {2156} | PROGRAMMING | 2750.0 | Codeforces Round 1061 (Div. 2) Editorial | |
| 3782 | Adjusting Drones | binary search data structures dsu greedy implementation sortings | Statement | E | Codeforces Round 1066 (Div. 1 + Div. 2) {2157} | PROGRAMMING | 2000.0 | Codeforces Round 1066 (Div. 1 + Div. 2) Editorial | |
| 1111 | 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 | |
| 416 | Grand Finale: Snakes | binary search interactive | Statement | F | Codeforces Round 1058 (Div. 1) {2159} | PROGRAMMING | 3500.0 | Codeforces Round 1058 Editorial | |
| 2806 | Locked Out | binary search data structures dp graphs greedy implementation two pointers | Statement | D | Pinely Round 5 (Div. 1 + Div. 2) {2161} | PROGRAMMING | 2250.0 | ||
| 12513 | Beautiful Permutation | binary search interactive | Statement | D | Codeforces Round 1059 (Div. 3) {2162} | PROGRAMMING | Codeforces Round 1059 (Div. 3) Editorial | ||
| 2759 | Diadrash (Easy Version) | binary search divide and conquer interactive | Statement | D1 | Codeforces Round 1063 (Div. 2) {2163} | PROGRAMMING | 1500.0 | Codeforces Round 1063 Editorial | |
| 1519 | Diadrash (Hard Version) | binary search interactive | Statement | D2 | Codeforces Round 1063 (Div. 2) {2163} | PROGRAMMING | 1250.0 | Codeforces Round 1063 Editorial | |
| 11135 | Dungeon | binary search brute force data structures greedy sortings | Statement | C | Codeforces Global Round 30 (Div. 1 + Div. 2) {2164} | PROGRAMMING | 1500.0 | Codeforces Global Round 30 Editorial | |
| 5276 | 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 | |
| 9230 | khba Loves to Sleep! | binary search data structures geometry implementation math | Statement | E | Codeforces Round 1062 (Div. 4) {2167} | PROGRAMMING | Arpa Video Tutorial | ||
| 1585 | Locate | binary search constructive algorithms greedy interactive | Statement | B | Testing Round 20 (Unrated, Communication Problems) {2168} | PROGRAMMING | Testing Round 20 Editorial (officially unofficial) | ||
| 8705 | 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 | ||
| 2312 | 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 | ||
| 11464 | Quotient and Remainder | binary search greedy two pointers | Statement | C | Educational Codeforces Round 185 (Rated for Div. 2) {2170} | PROGRAMMING | Educational Codeforces Round 185 Editorial | ||
| 7307 | Rae Taylor and Trees (hard version) | binary search constructive algorithms data structures dp dsu implementation trees | Statement | F | Codeforces Round 1065 (Div. 3) {2171} | PROGRAMMING | Codeforces Round 1065 (Div. 3) Editorial | ||
| 1036 | Shiori Miyagi and Maximum Array Score | binary search data structures dp | Statement | H | Codeforces Round 1065 (Div. 3) {2171} | PROGRAMMING | Codeforces Round 1065 (Div. 3) Editorial | ||
| 11853 | Rae Taylor and Trees (easy version) | binary search data structures dp dsu greedy implementation trees | Statement | D | Codeforces Round 1065 (Div. 3) {2171} | PROGRAMMING | Codeforces Round 1065 (Div. 3) Editorial | ||
| 591 | Isla's Memory Thresholds | binary search data structures divide and conquer math | Statement | F | Codeforces Round 1068 (Div. 2) {2173} | PROGRAMMING | 3000.0 | ||
| 3718 | Flatten or Concatenate | binary search divide and conquer interactive | Statement | E | Good Bye 2025 {2178} | PROGRAMMING | 2250.0 | ||
| 13720 | Blackslex and Penguin Civilization | bitmasks constructive algorithms greedy math | Statement | D | Codeforces Round 1071 (Div. 3) {2179} | PROGRAMMING | Codeforces Round 1071 (Div. 3) Editorial | ||
| 1326 | Blackslex and Plants | bitmasks data structures dp math | Statement | H | Codeforces Round 1071 (Div. 3) {2179} | PROGRAMMING | Codeforces Round 1071 (Div. 3) Editorial | ||
| 1398 | Doorway | binary search data structures sortings | Statement | D | 2025-2026 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2181} | PROGRAMMING | Tutorial | ||
| 658 | 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 | ||
| 155 | 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 | ||
| 3829 | 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 | ||
| 10868 | War Strategy | binary search greedy math two pointers | Statement | C | Hello 2026 {2183} | PROGRAMMING | 1500.0 | ||
| 3026 | Nastiness of Segments | binary search data structures divide and conquer | Statement | G | Codeforces Round 1072 (Div. 3) {2184} | PROGRAMMING | Codeforces Round 1072 (Div. 3) Editorial | ||
| 22233 | Huge Pile | binary search math | Statement | C | Codeforces Round 1072 (Div. 3) {2184} | PROGRAMMING | Codeforces Round 1072 (Div. 3) Editorial | ||
| 713 | BattleCows 2 | binary search brute force data structures greedy | Statement | H | Codeforces Round 1074 (Div. 4) {2185} | PROGRAMMING | Codeforces Round 1074 (Div. 4) Editorial | ||
| 10514 | The Robotic Rush | binary search implementation two pointers | Statement | E | Codeforces Round 1074 (Div. 4) {2185} | PROGRAMMING | Codeforces Round 1074 (Div. 4) Editorial | ||
| 16194 | Restricted Sorting | binary search constructive algorithms greedy sortings | Statement | A | Codeforces Round 1077 (Div. 1) {2187} | PROGRAMMING | 750.0 | Codeforces Round 1077 (Div. 1, Div. 2) Editorial | |
| 230 | Al Fine (Maximizing Version) | binary search data structures divide and conquer greedy trees | Statement | F1 | Codeforces Round 1077 (Div. 1) {2187} | PROGRAMMING | 2000.0 | Codeforces Round 1077 (Div. 1, Div. 2) Editorial | |
| 1981 | 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 | |
| 1321 | 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 | |
| 11469 | 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 | |
| 22008 | Monster Game | binary search sortings two pointers | Statement | D | Codeforces Round 1076 (Div. 3) {2193} | PROGRAMMING | Разбор Codeforces Round 1076 (Div. 3) | ||
| 1096 | 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 | ||
| 8921 | Idiot First Search | dfs and similar dp trees | Statement | E | Codeforces Round 1080 (Div. 3) {2195} | PROGRAMMING | Codeforces Round 1080 (Div. 3) Editorial | ||
| 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 | |
| 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 | |
| 188 | Supersequence | *special binary search greedy | Statement | E | Kotlin Heroes: Episode 14 {2199} | PROGRAMMING | 151783 | ||
| 815 | 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 | |
| 7505 | Test Generator | binary search bitmasks greedy math | Statement | C | Educational Codeforces Round 187 (Rated for Div. 2) {2203} | PROGRAMMING | Educational Codeforces Round 187 Editorial | ||
| 1472 | 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 | ||
| 431 | 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 | ||
| 1291 | 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 | ||
| 1751 | 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) | ||
| 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 | |
| 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 | |
| 9789 | 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 | |
| 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 | |
| 1180 | 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 | |
| 2315 | Definitely Larger | binary search constructive algorithms data structures greedy | Statement | E | Codeforces Round 1091 (Div. 2) and CodeCraft 26 {2217} | PROGRAMMING | 2000.0 | Tutorial | |
| 15665 | 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 | ||
| 3494 | 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 | |
| 3897 | 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 | |
| 2182 | 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 | |
| 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 | |
| 787 | 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 | |
| 3009 | 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 | |
| 672 | 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 | ||
| 6937 | 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 | |
| 11504 | 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 | ||
| 7965 | 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 | ||
| 1830 | Drowning | binary search data structures math | Statement | G | Codeforces Round 1096 (Div. 3) {2227} | PROGRAMMING | Codeforces Round 1096 (Div. 3) — Editorial | ||
| 6925 | 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 | |
| 274 | 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 | |
| 869 | 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 | |
| 4336 | 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 | |
| 1150 | 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 | ||
| 391 | Game on Growing Tree | binary search dfs and similar dp games trees | Statement | F | Educational Codeforces Round 190 (Rated for Div. 2) {2230} | PROGRAMMING | Educational Codeforces Round 190 — Editorial | ||
| 8942 | Seating Arrangement (Easy Version) | binary search dp greedy ternary search two pointers | Statement | C1 | Codeforces Round 1101 (Div. 2) {2232} | PROGRAMMING | 750.0 | Codeforces Round 1101 (Div. 2) — Editorial | |
| 15643 | Cake Leveling | binary search greedy math | Statement | B | Codeforces Round 1101 (Div. 2) {2232} | PROGRAMMING | 1000.0 | Codeforces Round 1101 (Div. 2) — Editorial | |
| 6012 | Seating Arrangement (Hard Version) | binary search greedy ternary search two pointers | Statement | C2 | Codeforces Round 1101 (Div. 2) {2232} | PROGRAMMING | 1000.0 | Codeforces Round 1101 (Div. 2) — Editorial |