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 5 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 805 | Teleporters | binary search greedy math | Statement | F | Educational Codeforces Round 126 (Rated for Div. 2) {1661} | PROGRAMMING | Educational Codeforces Round 126 Editorial | ||
| 1793 | MinimizOR | binary search bitmasks data structures dp greedy implementation | Statement | E | Codeforces Round 781 (Div. 2) {1665} | PROGRAMMING | 2250.0 | Codeforces Round #781 (Div. 2) Editorial | |
| 9835 | Tree Infection | binary search dfs and similar greedy trees | Statement | C | Codeforces Round 781 (Div. 2) {1665} | PROGRAMMING | 1250.0 | Codeforces Round #781 (Div. 2) Editorial | |
| 881 | Even Split | binary search constructive algorithms greedy | Statement | E | 2021-2022 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1666} | PROGRAMMING | Tutorial (PDF) | ||
| 39261 | Eating Candies | binary search data structures greedy two pointers | Statement | F | Codeforces Round 784 (Div. 4) {1669} | PROGRAMMING | 102101 | 1100 | |
| 5599 | Very Suspicious | binary search brute force geometry implementation math | Statement | D | Codeforces Round 788 (Div. 2) {1670} | PROGRAMMING | 2250.0 | Tutorial | 1700 |
| 25213 | Dolce Vita | binary search brute force greedy math | Statement | C | Educational Codeforces Round 127 (Rated for Div. 2) {1671} | PROGRAMMING | 102181 | ||
| 2514 | notepad.exe | binary search constructive algorithms greedy interactive | Statement | E | Codeforces Global Round 20 {1672} | PROGRAMMING | 1500.0 | Global Round 20 Editorial | 2200 |
| 7281 | Breaking the Wall | binary search brute force constructive algorithms greedy math | Statement | E | Codeforces Round 786 (Div. 3) {1674} | PROGRAMMING | 102482 | ||
| 32825 | Eating Queries | binary search greedy sortings | Statement | E | Codeforces Round 790 (Div. 4) {1676} | PROGRAMMING | Codeforces Round #790 (Div. 4) Editorial | ||
| 5806 | Toss a Coin to Your Graph... | binary search dfs and similar dp graphs | Statement | D | Codeforces Round 791 (Div. 2) {1679} | PROGRAMMING | 1750.0 | Codeforces Round #791 (Div. 2) Editorial | |
| 4314 | Moving Chips | binary search bitmasks dp greedy | Statement | E | Educational Codeforces Round 128 (Rated for Div. 2) {1680} | PROGRAMMING | 102852 | ||
| 11087 | Binary String | binary search greedy two pointers | Statement | C | Educational Codeforces Round 128 (Rated for Div. 2) {1680} | PROGRAMMING | 102852 | ||
| 731 | Cute number | binary search brute force implementation math | Statement | D | Codeforces Round 796 (Div. 1) {1687} | PROGRAMMING | 1500.0 | Editorial of Codeforces Round 796 | |
| 16948 | Price Maximization | binary search greedy math two pointers | Statement | E | Codeforces Round 797 (Div. 3) {1690} | PROGRAMMING | Codeforces Round #797 (Div. 3) Editorial | 1500 | |
| 4107 | Count the Trains | binary search data structures sortings | Statement | G | Codeforces Round 797 (Div. 3) {1690} | PROGRAMMING | Codeforces Round #797 (Div. 3) Editorial | 2000 | |
| 7447 | Max GEQ Sum | binary search constructive algorithms data structures divide and conquer implementation sortings two pointers | Statement | D | CodeCraft-22 and Codeforces Round 795 (Div. 2) {1691} | PROGRAMMING | 1750.0 | Editorial for CodeCraft-22 and Codeforces Round #795 (Div. 2) | |
| 33013 | Binary Deque | binary search implementation two pointers | Statement | E | Codeforces Round 799 (Div. 4) {1692} | PROGRAMMING | Codeforces Round #799 (Div. 4) Editorial | ||
| 6004 | Permutation Graph | binary search constructive algorithms data structures greedy shortest paths trees | Statement | D | Codeforces Global Round 21 {1696} | PROGRAMMING | 2000.0 | Editorial of Codeforces Global Round 21 | |
| 4982 | Guess The String | binary search brute force constructive algorithms dsu interactive | Statement | D | Educational Codeforces Round 130 (Rated for Div. 2) {1697} | PROGRAMMING | 103835 | ||
| 1782 | PermutationForces II | binary search brute force combinatorics constructive algorithms greedy sortings | Statement | E | Codeforces Round 803 (Div. 2) {1698} | PROGRAMMING | 2000.0 | Codeforces Round #803 (Div. 2) Editorial | |
| 12020 | Fixed Point Guessing | binary search constructive algorithms interactive | Statement | D | Codeforces Round 803 (Div. 2) {1698} | PROGRAMMING | 1500.0 | Codeforces Round #803 (Div. 2) Editorial | |
| 6976 | River Locks | binary search dp greedy math | Statement | D | Codeforces Round 802 (Div. 2) {1700} | PROGRAMMING | 1750.0 | 103978 | 1900 |
| 6260 | Permutation Restoration | binary search data structures greedy math sortings | Statement | D | Educational Codeforces Round 131 (Rated for Div. 2) {1701} | PROGRAMMING | Educational Codeforces Round 131 Editorial | ||
| 23669 | Schedule Management | binary search greedy | Statement | C | Educational Codeforces Round 131 (Rated for Div. 2) {1701} | PROGRAMMING | Educational Codeforces Round 131 Editorial | ||
| 29784 | Yet Another Problem About Pairs Satisfying an Inequality | binary search data structures dp greedy sortings | Statement | F | Codeforces Round 806 (Div. 4) {1703} | PROGRAMMING | 104786 | ||
| 2446 | Mark and Professor Koro | binary search bitmasks combinatorics data structures greedy | Statement | E | Codeforces Round 807 (Div. 2) {1705} | PROGRAMMING | 2500.0 | Codeforces Round #807 (Div 2.) Editorial | |
| 7706 | Chopping Carrots (Easy Version) | binary search brute force constructive algorithms dp greedy number theory | Statement | D1 | Codeforces Round 809 (Div. 2) {1706} | PROGRAMMING | 1000.0 | Codeforces Round #809 Editorial | |
| 3687 | Qpwoeirut and Vertices | binary search data structures dsu trees | Statement | E | Codeforces Round 809 (Div. 2) {1706} | PROGRAMMING | 2250.0 | Codeforces Round #809 Editorial | |
| 15414 | Doremy's IQ | binary search greedy implementation | Statement | A | Codeforces Round 808 (Div. 1) {1707} | PROGRAMMING | 500.0 | 104930 | |
| 2457 | LCM Sum (easy version) | binary search brute force combinatorics math number theory two pointers | Statement | E1 | Codeforces Round 813 (Div. 2) {1712} | PROGRAMMING | 2000.0 | Codeforces Round #813 (Div. 2) Editorial | |
| 5081 | Empty Graph | binary search data structures greedy | Statement | D | Codeforces Round 813 (Div. 2) {1712} | PROGRAMMING | 2000.0 | Codeforces Round #813 (Div. 2) Editorial | |
| 9674 | Path Prefixes | binary search data structures dfs and similar implementation trees | Statement | G | Codeforces Round 811 (Div. 3) {1714} | PROGRAMMING | Codeforces Round #811 (Div. 3) Editorial | ||
| 14351 | Fighting Tournament | binary search data structures implementation two pointers | Statement | C | Codeforces Round 814 (Div. 2) {1719} | PROGRAMMING | 1250.0 | Codeforces Round #814 (Div. 1, Div. 2) Editorial | |
| 14544 | Min-Max Array Transformation | binary search greedy two pointers | Statement | C | Educational Codeforces Round 134 (Rated for Div. 2) {1721} | PROGRAMMING | 106416 | ||
| 232 | Deducing Sortability | binary search bitmasks math | Statement | D | COMPFEST 14 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1725} | PROGRAMMING | Tutorial | ||
| 1920 | Circular Mirror | binary search combinatorics math two pointers | Statement | C | COMPFEST 14 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1725} | PROGRAMMING | Tutorial | ||
| 27882 | Basketball Together | binary search greedy sortings | Statement | B | COMPFEST 14 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1725} | PROGRAMMING | Tutorial | ||
| 6681 | Garage | binary search math | Statement | G | COMPFEST 14 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1725} | PROGRAMMING | Tutorial | ||
| 2025 | Red-Black Pepper | binary search brute force greedy math number theory sortings ternary search | Statement | E | Educational Codeforces Round 135 (Rated for Div. 2) {1728} | PROGRAMMING | 106805 | ||
| 17163 | Meeting on the Line | binary search greedy implementation math ternary search | Statement | B | Codeforces Round 823 (Div. 2) {1730} | PROGRAMMING | 1000.0 | Codeforces Round #823 — editorial | 1600 |
| 8461 | Valiant's New Map | binary search brute force data structures dp two pointers | Statement | D | Codeforces Round 841 (Div. 2) and Divide by Zero 2022 {1731} | PROGRAMMING | 1500.0 | Codeforces Round #841 (Div. 2) and Divide By Zero 2022 Editorial | |
| 7519 | Sheikh (Easy version) | binary search bitmasks greedy two pointers | Statement | C1 | Codeforces Round 830 (Div. 2) {1732} | PROGRAMMING | 1000.0 | 108327 | 1800 |
| 3058 | Sheikh (Hard Version) | binary search bitmasks brute force greedy implementation two pointers | Statement | C2 | Codeforces Round 830 (Div. 2) {1732} | PROGRAMMING | 1000.0 | 108327 | 2100 |
| 16483 | Good Subarrays (Easy Version) | binary search data structures two pointers | Statement | C1 | Codeforces Round 825 (Div. 2) {1736} | PROGRAMMING | 1250.0 | Codeforces Round #825 (Div. 2) Editorial | |
| 1465 | Good Subarrays (Hard Version) | binary search data structures two pointers | Statement | C2 | Codeforces Round 825 (Div. 2) {1736} | PROGRAMMING | 2000.0 | Codeforces Round #825 (Div. 2) Editorial | |
| 150 | Ela Takes Dancing Class | binary search binary search data structures | Statement | G | Dytechlab Cup 2022 {1737} | PROGRAMMING | 3750.0 | Editorial of Dytechlab Cup 2022 | |
| 10163 | Ela's Fitness and the Luxury Number | binary search implementation math | Statement | B | Dytechlab Cup 2022 {1737} | PROGRAMMING | 1000.0 | Editorial of Dytechlab Cup 2022 | |
| 6216 | Reset K Edges | binary search data structures dfs and similar graphs greedy trees | Statement | D | Educational Codeforces Round 136 (Rated for Div. 2) {1739} | PROGRAMMING | Educational Codeforces Round 136 Editorial | ||
| 2888 | Multi-Colored Segments | binary search data structures math sortings | Statement | F | Codeforces Round 826 (Div. 3) {1741} | PROGRAMMING | 107908 | ||
| 38271 | Scuza | binary search greedy math | Statement | E | Codeforces Round 827 (Div. 4) {1742} | PROGRAMMING | 107962 | ||
| 1858 | FTL | binary search dp greedy | Statement | E | Educational Codeforces Round 137 (Rated for Div. 2) {1743} | PROGRAMMING | Educational Codeforces Round 137 Editorial | 2400 | |
| 43669 | Traffic Light | binary search implementation two pointers | Statement | C | Codeforces Round 828 (Div. 3) {1744} | PROGRAMMING | Codeforces Round #828 (Div. 3) Editorial | ||
| 1688 | Joking (Easy Version) | binary search bitmasks constructive algorithms interactive ternary search | Statement | E1 | Codeforces Global Round 23 {1746} | PROGRAMMING | 2000.0 | Codeforces Global Round 23 Editorial | |
| 112 | Olympiad Training | binary search geometry sortings | Statement | G | Codeforces Global Round 23 {1746} | PROGRAMMING | 3500.0 | Codeforces Global Round 23 Editorial | |
| 5541 | Yet Another Problem | binary search bitmasks constructive algorithms data structures | Statement | D | Codeforces Round 832 (Div. 2) {1747} | PROGRAMMING | 1750.0 | Codeforces Round #832 (Div. 2) Editorial | |
| 1655 | Bracket Cost | binary search data structures divide and conquer dp greedy strings | Statement | E | CodeTON Round 3 (Div. 1 + Div. 2, Rated, Prizes!) {1750} | PROGRAMMING | 2250.0 | CodeTON Round 3 (Div. 1 + Div. 2) Editorial | |
| 423 | N Machines | binary search brute force greedy | Statement | E | Codeforces Round 829 (Div. 1) {1753} | PROGRAMMING | 2500.0 | Tutorial | 3300 |
| 8457 | Range = √Sum | binary search brute force constructive algorithms math two pointers | Statement | D | Codeforces Round 836 (Div. 2) {1758} | PROGRAMMING | 1750.0 | Codeforces Round #836 (Div. 2) Editorial | |
| 5478 | Restore the Permutation | binary search data structures greedy math | Statement | G | Codeforces Round 834 (Div. 3) {1759} | PROGRAMMING | 109254 | ||
| 4493 | All Possible Digits | binary search data structures greedy math number theory | Statement | F | Codeforces Round 834 (Div. 3) {1759} | PROGRAMMING | 109254 | ||
| 14731 | Quests | binary search greedy sortings | Statement | F | Codeforces Round 835 (Div. 4) {1760} | PROGRAMMING | 109348 | ||
| 863 | Good Pairs | binary search data structures dp | Statement | F | Codeforces Round 838 (Div. 2) {1762} | PROGRAMMING | 2750.0 | Codeforces Round #838 (Div. 2) Editorial | |
| 16379 | Incinerate | binary search brute force data structures sortings | Statement | B | Codeforces Round 840 (Div. 2) and Enigma 2022 - Cybros LNMIIT {1763} | PROGRAMMING | 1000.0 | Codeforces Round #840 (Div. 2) and Enigma 2022 — Cybros LNMIIT Editorial | |
| 1424 | Doremy's Number Line | binary search dp greedy sortings | Statement | E | Codeforces Global Round 24 {1764} | PROGRAMMING | 2250.0 | Codeforces Global Round 24 Editorial | |
| 697 | Doremy's Perfect DS Class (Easy Version) | binary search interactive | Statement | G1 | Codeforces Global Round 24 {1764} | PROGRAMMING | 2000.0 | Codeforces Global Round 24 Editorial | |
| 636 | Doremy's Perfect DS Class (Medium Version) | binary search interactive | Statement | G2 | Codeforces Global Round 24 {1764} | PROGRAMMING | 500.0 | Codeforces Global Round 24 Editorial | |
| 558 | Doremy's Perfect DS Class (Hard Version) | binary search interactive | Statement | G3 | Codeforces Global Round 24 {1764} | PROGRAMMING | 500.0 | Codeforces Global Round 24 Editorial | |
| 4859 | Watch the Videos | binary search constructive algorithms two pointers | Statement | D | 2022-2023 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Preferably Teams) {1765} | PROGRAMMING | 109642 | 1700 | |
| 1532 | Hospital Queue | binary search graphs greedy | Statement | H | 2022-2023 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Preferably Teams) {1765} | PROGRAMMING | 109642 | 2200 | |
| 1519 | Hossam and Range Minimum Query | binary search bitmasks data structures hashing probabilities strings trees | Statement | F | Codeforces Round 837 (Div. 2) {1771} | PROGRAMMING | 3500.0 | Codeforces Round #837 (Div. 2) Editorial | |
| 21207 | Hossam and Friends | binary search constructive algorithms dp two pointers | Statement | B | Codeforces Round 837 (Div. 2) {1771} | PROGRAMMING | 1000.0 | Codeforces Round #837 (Div. 2) Editorial | |
| 1599 | Gaining Rating | binary search greedy math sortings | Statement | G | Codeforces Round 839 (Div. 3) {1772} | PROGRAMMING | 110313 | ||
| 486 | Hot and Cold | binary search interactive | Statement | H | 2022-2023 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1773} | PROGRAMMING | 2600 | ||
| 14097 | Interesting Sequence | binary search bitmasks math | Statement | C | Codeforces Round 843 (Div. 2) {1775} | PROGRAMMING | 1500.0 | Codeforces Round #843 (Div. 2) Editorial | |
| 8406 | Friendly Spiders | dfs and similar graphs math number theory shortest paths | Statement | D | Codeforces Round 843 (Div. 2) {1775} | PROGRAMMING | 2000.0 | Codeforces Round #843 (Div. 2) Editorial | |
| 11440 | Controllers | binary search math | Statement | L | SWERC 2022-2023 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1776} | PROGRAMMING | |||
| 1334 | Comfortably Numb | binary search bitmasks data structures divide and conquer dsu strings trees two pointers | Statement | F | Codeforces Round 845 (Div. 2) and ByteRace 2023 {1777} | PROGRAMMING | 2750.0 | Codeforces Round #845 (Div. 2) and ByteRace 2023 Editorial | |
| 2324 | Edge Reverse | binary search dfs and similar dsu graphs | Statement | E | Codeforces Round 845 (Div. 2) and ByteRace 2023 {1777} | PROGRAMMING | 2250.0 | Codeforces Round #845 (Div. 2) and ByteRace 2023 Editorial | |
| 5814 | Bit Guessing Game | binary search bitmasks interactive | Statement | D | Codeforces Round 846 (Div. 2) {1780} | PROGRAMMING | 1500.0 | 111841 | |
| 1719 | Josuke and Complete Graph | binary search brute force data structures number theory | Statement | E | Codeforces Round 846 (Div. 2) {1780} | PROGRAMMING | 1750.0 | 111841 | |
| 1429 | Rectangle Shrinking | binary search data structures greedy implementation two pointers | Statement | E | VK Cup 2022 - Отборочный раунд (Engine) {1781} | PROGRAMMING | 2750.0 | Tutorial | |
| 14732 | Going to the Cinema | binary search math sortings two pointers | Statement | B | VK Cup 2022 - Отборочный раунд (Engine) {1781} | PROGRAMMING | 1000.0 | Tutorial | |
| 10841 | Yet Another Tournament | binary search greedy sortings | Statement | C | Educational Codeforces Round 141 (Rated for Div. 2) {1783} | PROGRAMMING | Educational Codeforces Round 141 Editorial | ||
| 4635 | Moving Dots | binary search brute force combinatorics dp math two pointers | Statement | D | Codeforces Round 851 (Div. 2) {1788} | PROGRAMMING | 2250.0 | Codeforces Round #851 (Div. 2) Editorial | |
| 15463 | Range Update Point Query | binary search brute force data structures | Statement | F | Codeforces Round 849 (Div. 4) {1791} | PROGRAMMING | 112282 | ||
| 5859 | Teleporters (Hard Version) | binary search greedy sortings | Statement | G2 | Codeforces Round 849 (Div. 4) {1791} | PROGRAMMING | 112282 | ||
| 16705 | Min Max Sort | binary search brute force greedy math | Statement | C | Educational Codeforces Round 142 (Rated for Div. 2) {1792} | PROGRAMMING | 111835 | ||
| 8009 | Fixed Prefix Permutations | binary search data structures math sortings strings | Statement | D | Educational Codeforces Round 142 (Rated for Div. 2) {1792} | PROGRAMMING | 111835 | ||
| 21919 | Scoring Subsequences | binary search greedy math two pointers | Statement | C | Codeforces Round 856 (Div. 2) {1794} | PROGRAMMING | 1250.0 | Codeforces Round 856 (Div. 2) Editorial | |
| 2375 | Explosions? | binary search data structures dp math | Statement | E | Educational Codeforces Round 143 (Rated for Div. 2) {1795} | PROGRAMMING | 112963 | ||
| 17904 | Tea Tasting | binary search data structures implementation | Statement | C | Educational Codeforces Round 143 (Rated for Div. 2) {1795} | PROGRAMMING | 112963 | ||
| 1371 | Blocking Chips | binary search dfs and similar dp greedy | Statement | F | Educational Codeforces Round 143 (Rated for Div. 2) {1795} | PROGRAMMING | 112963 | ||
| 12143 | Maximum Set | binary search brute force combinatorics dp math | Statement | C | Educational Codeforces Round 144 (Rated for Div. 2) {1796} | PROGRAMMING | Educational Codeforces Round 144 Editorial | ||
| 4086 | Music Festival | binary search data structures dp greedy sortings | Statement | C | Codeforces Round 857 (Div. 1) {1801} | PROGRAMMING | 1250.0 | Codeforces Round #857 Editorial | |
| 1171 | Approximate Diameter | binary search divide and conquer graphs shortest paths | Statement | F | Nebius Welcome Round (Div. 1 + Div. 2) {1804} | PROGRAMMING | 2750.0 | Nebius Welcome Round Editorial | |
| 14148 | Place for a Selfie | binary search geometry math sortings | Statement | C | Codeforces Round 862 (Div. 2) {1805} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round #862 (Div. 2) | |
| 16582 | Interview | binary search implementation interactive | Statement | E | Codeforces Round 859 (Div. 4) {1807} | PROGRAMMING | 114143 | ||
| 2699 | Petya, Petya, Petr, and Palindromes | binary search data structures two pointers | Statement | D | Codeforces Round 861 (Div. 2) {1808} | PROGRAMMING | 1750.0 | Codeforces Round #861 (Div. 2) editorial | 2100 |
| 930 | Traveling in Berland | binary search data structures graphs greedy implementation | Statement | F | Educational Codeforces Round 145 (Rated for Div. 2) {1809} | PROGRAMMING | 114300 | ||
| 7258 | Binary String Sorting | binary search dp greedy | Statement | D | Educational Codeforces Round 145 (Rated for Div. 2) {1809} | PROGRAMMING | 114300 | ||
| 1066 | Two Tanks | binary search dp implementation math | Statement | E | Educational Codeforces Round 145 (Rated for Div. 2) {1809} | PROGRAMMING | 114300 | ||
| 22309 | Points on Plane | binary search greedy math | Statement | B | Educational Codeforces Round 145 (Rated for Div. 2) {1809} | PROGRAMMING | 114300 | ||
| 8516 | Climbing the Tree | binary search math | Statement | D | CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) {1810} | PROGRAMMING | 1250.0 | Editorial of CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) | |
| 2117 | Vlad and the Nice Paths (hard version) | binary search combinatorics data structures dp math two pointers | Statement | G2 | Codeforces Round 863 (Div. 3) {1811} | PROGRAMMING | 114788 | ||
| 14374 | Living Sequence | binary search dp math number theory | Statement | E | Codeforces Round 863 (Div. 3) {1811} | PROGRAMMING | 114788 | ||
| 1021 | Balancing Weapons | binary search brute force two pointers | Statement | D | Educational Codeforces Round 146 (Rated for Div. 2) {1814} | PROGRAMMING | Educational Codeforces Round 146 Editorial | ||
| 5525 | Black Cells | binary search brute force greedy math | Statement | D | Educational Codeforces Round 147 (Rated for Div. 2) {1821} | PROGRAMMING | 115296 | ||
| 4300 | Unique Palindromes | binary search constructive algorithms greedy math strings | Statement | D | Codeforces Round 868 (Div. 2) {1823} | PROGRAMMING | 2000.0 | 115465 | |
| 4522 | Range Sorting (Easy Version) | binary search dp dsu greedy trees two pointers | Statement | B1 | Codeforces Round 873 (Div. 1) {1827} | PROGRAMMING | 750.0 | Codeforces Round #873 (Div. 1 & 2) Editorial | 2000 |
| 2304 | Range Sorting (Hard Version) | binary search data structures dp greedy | Statement | B2 | Codeforces Round 873 (Div. 1) {1827} | PROGRAMMING | 750.0 | Codeforces Round #873 (Div. 1 & 2) Editorial | 2400 |
| 1645 | Palindrome Partition | binary search brute force data structures dp hashing strings | Statement | C | Codeforces Round 873 (Div. 1) {1827} | PROGRAMMING | 1500.0 | Codeforces Round #873 (Div. 1 & 2) Editorial | 2600 |
| 556 | Bus Routes | binary search constructive algorithms dfs and similar greedy trees | Statement | E | Codeforces Round 873 (Div. 1) {1827} | PROGRAMMING | 2500.0 | Codeforces Round #873 (Div. 1 & 2) Editorial | 3400 |
| 3372 | Red-Blue Operations (Easy Version) | binary search greedy implementation math | Statement | D1 | Educational Codeforces Round 148 (Rated for Div. 2) {1832} | PROGRAMMING | 116454 | 2100 | |
| 2332 | Red-Blue Operations (Hard Version) | binary search constructive algorithms greedy implementation math | Statement | D2 | Educational Codeforces Round 148 (Rated for Div. 2) {1832} | PROGRAMMING | 116454 | 2400 | |
| 356 | Zombies | binary search dp | Statement | F | Educational Codeforces Round 148 (Rated for Div. 2) {1832} | PROGRAMMING | 116454 | 3200 | |
| 2761 | MEX of LCM | binary search brute force data structures implementation math number theory two pointers | Statement | E | Codeforces Round 879 (Div. 2) {1834} | PROGRAMMING | 2500.0 | Codeforces Round #879 Editorial | |
| 1071 | Lottery | binary search brute force greedy math sortings two pointers | Statement | B | Codeforces Round 880 (Div. 1) {1835} | PROGRAMMING | 1250.0 | Codeforces Round 880 Editorial | |
| 2653 | Editorial for Two | binary search data structures greedy implementation | Statement | F | Educational Codeforces Round 149 (Rated for Div. 2) {1837} | PROGRAMMING | 116752 | ||
| 379 | Stuck Conveyor | binary search interactive | Statement | F | Codeforces Round 877 (Div. 2) {1838} | PROGRAMMING | 3000.0 | Codeforces Round #877 (Div. 2) Editorial | |
| 16243 | Wooden Toy Festival | binary search greedy sortings | Statement | D | Codeforces Round 878 (Div. 3) {1840} | PROGRAMMING | Codeforces Round #878 (Div.3) Editorial | ||
| 17688 | Tracking Segments | binary search | Statement | E | Codeforces Round 881 (Div. 3) {1843} | PROGRAMMING | Codeforces Round #881 (Div. 3) Editorial | ||
| 475 | Min Cost Permutation (Hard Version) | binary search data structures graphs greedy sortings | Statement | F2 | Codeforces Round 884 (Div. 1 + Div. 2) {1844} | PROGRAMMING | 1000.0 | Codeforces Round #884 (Div. 1 + Div. 2) Editorial | |
| 16741 | Strong Password | binary search dp greedy strings | Statement | C | Educational Codeforces Round 151 (Rated for Div. 2) {1845} | PROGRAMMING | 117791 | ||
| 25022 | Rudolf and Snowflakes (simple version) | binary search brute force implementation math | Statement | E1 | Codeforces Round 883 (Div. 3) {1846} | PROGRAMMING | |||
| 8480 | Rudolf and Snowflakes (hard version) | binary search brute force implementation math | Statement | E2 | Codeforces Round 883 (Div. 3) {1846} | PROGRAMMING | |||
| 1026 | The Boss's Identity | binary search bitmasks data structures dfs and similar greedy math sortings | Statement | F | Codeforces Round 882 (Div. 2) {1847} | PROGRAMMING | 3000.0 | Tutorial | |
| 2028 | Vika and Wiki | binary search bitmasks combinatorics math | Statement | F | Codeforces Round 885 (Div. 2) {1848} | PROGRAMMING | 2750.0 | Codeforces Round #885 (Div.2) Editorial | |
| 2973 | Vika and Bonuses | binary search brute force math ternary search | Statement | D | Codeforces Round 885 (Div. 2) {1848} | PROGRAMMING | 2000.0 | Codeforces Round #885 (Div.2) Editorial | |
| 24201 | Vika and the Bridge | binary search data structures greedy implementation math sortings | Statement | B | Codeforces Round 885 (Div. 2) {1848} | PROGRAMMING | 1000.0 | Codeforces Round #885 (Div.2) Editorial | |
| 877 | XOR Partition | binary search bitmasks data structures divide and conquer greedy trees | Statement | F | Educational Codeforces Round 152 (Rated for Div. 2) {1849} | PROGRAMMING | 118752 | ||
| 12494 | Binary String Copying | binary search brute force data structures hashing strings | Statement | C | Educational Codeforces Round 152 (Rated for Div. 2) {1849} | PROGRAMMING | 118752 | ||
| 2174 | Max to the Right of Min | binary search data structures divide and conquer dsu two pointers | Statement | E | Educational Codeforces Round 152 (Rated for Div. 2) {1849} | PROGRAMMING | 118752 | ||
| 34755 | Cardboard for Pictures | binary search geometry implementation math | Statement | E | Codeforces Round 886 (Div. 4) {1850} | PROGRAMMING | Codeforces Round #886 (Div. 4) Editorial | ||
| 9207 | Ntarsis' Set | binary search implementation math two pointers | Statement | A | Codeforces Round 887 (Div. 1) {1852} | PROGRAMMING | 500.0 | Codeforces Round 887 (Div 1, Div 2) Tutorial | |
| 19686 | Fibonaccharsis | binary search brute force math | Statement | B | Codeforces Round 887 (Div. 2) {1853} | PROGRAMMING | 1000.0 | Codeforces Round 887 (Div 1, Div 2) Tutorial | |
| 18175 | To Become Max | binary search brute force data structures dp | Statement | C | Codeforces Round 890 (Div. 2) supported by Constructor Institute {1856} | PROGRAMMING | 1250.0 | Codeforces Round #890 (Div. 2) Editorial | |
| 28105 | Tales of a Sort | binary search implementation | Statement | A | Codeforces Round 890 (Div. 2) supported by Constructor Institute {1856} | PROGRAMMING | 500.0 | Codeforces Round #890 (Div. 2) Editorial | |
| 3185 | Trees and Segments | binary search brute force constructive algorithms data structures dp greedy two pointers | Statement | D | Codeforces Round 893 (Div. 2) {1858} | PROGRAMMING | 2000.0 | Codeforces Round #893 (Div. 2) Editorial | 2200 |
| 7977 | Andrey and Escape from Capygrad | binary search data structures dp dsu greedy sortings two pointers | Statement | D | Codeforces Round 892 (Div. 2) {1859} | PROGRAMMING | 1750.0 | Video solutions from Geothermal. | |
| 18834 | Fancy Coins | binary search brute force greedy math | Statement | B | Educational Codeforces Round 153 (Rated for Div. 2) {1860} | PROGRAMMING | Educational Codeforces Round 153 Editorial | ||
| 7572 | Magic Will Save the World | binary search bitmasks brute force dp | Statement | F | Codeforces Round 894 (Div. 3) {1862} | PROGRAMMING | Tutorial | ||
| 19775 | Ice Cream Balls | binary search combinatorics constructive algorithms math | Statement | D | Codeforces Round 894 (Div. 3) {1862} | PROGRAMMING | Tutorial | ||
| 2164 | Grouped Carriages | binary search data structures greedy | Statement | G | COMPFEST 15 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1866} | PROGRAMMING | COMPFEST 15 Preliminary — Editorial | ||
| 155 | Freak Joker Process | binary search data structures sortings | Statement | F | COMPFEST 15 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1866} | PROGRAMMING | COMPFEST 15 Preliminary — Editorial | ||
| 558 | Keen Tree Calculation | binary search dp geometry trees | Statement | K | COMPFEST 15 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1866} | PROGRAMMING | COMPFEST 15 Preliminary — Editorial | ||
| 13084 | Colorful Table | binary search data structures dp implementation math sortings two pointers | Statement | C | CodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!) {1870} | PROGRAMMING | 1500.0 | CodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 8010 | 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 | |
| 552 | 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 | |
| 42969 | Building an Aquarium | binary search sortings | Statement | E | Codeforces Round 898 (Div. 4) {1873} | PROGRAMMING | 120634 | ||
| 276 | Clubstep | binary search brute force data structures greedy trees | Statement | G | Codeforces Round 902 (Div. 1, based on COMPFEST 15 - Final Round) {1876} | PROGRAMMING | 3250.0 | Codeforces Round #902 (Div. 1, Div. 2, based on COMPFEST 15 — Final Round) Editorial | |
| 185 | Indefinite Clownfish | binary search graphs | Statement | F | Codeforces Round 902 (Div. 1, based on COMPFEST 15 - Final Round) {1876} | PROGRAMMING | 2750.0 | Codeforces Round #902 (Div. 1, Div. 2, based on COMPFEST 15 — Final Round) Editorial | |
| 1458 | 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 | ||
| 20662 | Iva & Pav | binary search bitmasks data structures greedy | Statement | E | Codeforces Round 900 (Div. 3) {1878} | PROGRAMMING | Codeforces round #900 (Div.3) Editorial | ||
| 2877 | Anya and the Mysterious String | binary search data structures implementation | Statement | G | Codeforces Round 903 (Div. 3) {1881} | PROGRAMMING | 121327 | ||
| 19375 | Dances (Easy version) | binary search | Statement | G1 | Codeforces Round 905 (Div. 3) {1883} | PROGRAMMING | 1750.0 | Codeforces Round #905 (Div. 1, Div. 2, Div. 3) Editorial | |
| 6713 | Dances (Hard Version) | binary search | Statement | G2 | Codeforces Round 905 (Div. 3) {1883} | PROGRAMMING | 2000.0 | Codeforces Round #905 (Div. 1, Div. 2, Div. 3) Editorial | |
| 17985 | 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 | ||
| 492 | Good Colorings | binary search constructive algorithms graphs interactive | Statement | E | Codeforces Round 905 (Div. 1) {1887} | PROGRAMMING | 2000.0 | Codeforces Round #905 (Div. 1, Div. 2, Div. 3) Editorial | |
| 1253 | 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 | |
| 3888 | Time Travel | binary search graphs implementation shortest paths | Statement | B | Codeforces Round 905 (Div. 1) {1887} | PROGRAMMING | 750.0 | Codeforces Round #905 (Div. 1, Div. 2, Div. 3) Editorial | |
| 4546 | Suspicious logarithms | binary search brute force implementation math number theory | Statement | D | Codeforces Round 907 (Div. 2) {1891} | PROGRAMMING | 1500.0 | ||
| 320 | Two Characters, Two Colors | binary search data structures dp flows geometry | Statement | G | Educational Codeforces Round 157 (Rated for Div. 2) {1895} | PROGRAMMING | Educational Codeforces Round 157 Editorial | ||
| 11571 | Matching Arrays | binary search constructive algorithms greedy sortings | Statement | C | CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!) {1896} | PROGRAMMING | 1500.0 | CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 188 | Landscaping | binary search geometry | Statement | F | Educational Codeforces Round 158 (Rated for Div. 2) {1901} | PROGRAMMING | Educational Codeforces Round 158 Editorial | ||
| 8561 | 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 | ||
| 5567 | Collapsing Strings | binary search data structures dfs and similar hashing strings trees | Statement | E | Educational Codeforces Round 159 (Rated for Div. 2) {1902} | PROGRAMMING | Educational Codeforces Round 159 Editorial | ||
| 5239 | Robot Queries | binary search data structures geometry sortings | Statement | D | Educational Codeforces Round 159 (Rated for Div. 2) {1902} | PROGRAMMING | Educational Codeforces Round 159 Editorial | ||
| 16383 | Getting Points | binary search math | Statement | B | Educational Codeforces Round 159 (Rated for Div. 2) {1902} | PROGRAMMING | Educational Codeforces Round 159 Editorial | ||
| 895 | Babysitting | 2-sat binary search data structures graphs | Statement | F | Codeforces Round 912 (Div. 2) {1903} | PROGRAMMING | 3500.0 | Codeforces Round #912 (Div. 2) Editorial | |
| 7083 | Maximum And Queries (easy version) | binary search bitmasks brute force greedy | Statement | D1 | Codeforces Round 912 (Div. 2) {1903} | PROGRAMMING | 1500.0 | Codeforces Round #912 (Div. 2) Editorial | |
| 23375 | Array Game | binary search brute force data structures sortings | Statement | C | Codeforces Round 914 (Div. 2) {1904} | PROGRAMMING | 1000.0 | Codeforces Round 914 (Div. 2) Editorial | |
| 5666 | Set To Max (Hard Version) | binary search constructive algorithms data structures dsu greedy implementation sortings two pointers | Statement | D2 | Codeforces Round 914 (Div. 2) {1904} | PROGRAMMING | 750.0 | Codeforces Round 914 (Div. 2) Editorial | |
| 1272 | Tree Queries | binary search data structures dfs and similar implementation trees | Statement | E | Codeforces Round 914 (Div. 2) {1904} | PROGRAMMING | 2750.0 | Codeforces Round 914 (Div. 2) Editorial | |
| 27636 | Collecting Game | binary search dp greedy two pointers | Statement | B | Codeforces Round 914 (Div. 2) {1904} | PROGRAMMING | 750.0 | Codeforces Round 914 (Div. 2) Editorial | |
| 4598 | 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 | |
| 169 | Spaceship Exploration | binary search geometry | Statement | D | 2023-2024 ICPC, Asia Jakarta Regional Contest (Online Mirror, Unrated, ICPC Rules, Teams Preferred) {1906} | PROGRAMMING | problem_analysis.pdf | ||
| 23401 | Jumping Through Segments | binary search constructive algorithms | Statement | D | Codeforces Round 913 (Div. 3) {1907} | PROGRAMMING | Codeforces Round 913 (Div. 3) Editorial | ||
| 107 | Sum of Digits of Sums | *special binary search data structures | Statement | H | Kotlin Heroes: Episode 9 (Unrated, T-Shirts + Prizes!) {1910} | PROGRAMMING | 123261 | ||
| 17451 | Game with Multiset | binary search bitmasks greedy | Statement | C | Educational Codeforces Round 160 (Rated for Div. 2) {1913} | PROGRAMMING | 123493 | ||
| 536 | Palindromic Problem | binary search data structures hashing strings | Statement | F | Educational Codeforces Round 160 (Rated for Div. 2) {1913} | PROGRAMMING | 123493 | ||
| 6142 | Blocking Elements | binary search data structures dp greedy implementation two pointers | Statement | D | Codeforces Round 922 (Div. 2) {1918} | PROGRAMMING | 2000.0 | Codeforces Round #922 (Div. 2) Editorial | |
| 1095 | Caterpillar on a Tree | binary search dfs and similar graphs greedy implementation trees | Statement | F | Codeforces Round 922 (Div. 2) {1918} | PROGRAMMING | 3000.0 | Codeforces Round #922 (Div. 2) Editorial | |
| 2053 | ace5 and Task Order | binary search divide and conquer implementation interactive probabilities sortings | Statement | E | Codeforces Round 922 (Div. 2) {1918} | PROGRAMMING | 2500.0 | Codeforces Round #922 (Div. 2) Editorial | |
| 1190 | Smooth Sailing (Easy Version) | binary search data structures dfs and similar dsu graphs | Statement | F1 | Codeforces Round 919 (Div. 2) {1920} | PROGRAMMING | 2500.0 | Editorial for Codeforces Round #919 (Div. 2) | |
| 6472 | 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) | |
| 641 | Smooth Sailing (Hard Version) | binary search data structures dsu graphs trees | Statement | F2 | Codeforces Round 919 (Div. 2) {1920} | PROGRAMMING | 2500.0 | Editorial for Codeforces Round #919 (Div. 2) | |
| 8327 | Slimes | binary search data structures greedy | Statement | D | Educational Codeforces Round 162 (Rated for Div. 2) {1923} | PROGRAMMING | Educational Codeforces Round 162 Editorial | ||
| 533 | Shrink-Reverse | binary search greedy string suffix structures strings | Statement | F | Educational Codeforces Round 162 (Rated for Div. 2) {1923} | PROGRAMMING | Educational Codeforces Round 162 Editorial | ||
| 14797 | 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 | ||
| 32887 | Find the Different Ones! | binary search brute force data structures dp greedy two pointers | Statement | D | Codeforces Round 923 (Div. 3) {1927} | PROGRAMMING | 125597 | ||
| 5153 | 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 | |
| 20703 | Equalize | binary search greedy sortings two pointers | Statement | B | Codeforces Round 924 (Div. 2) {1928} | PROGRAMMING | 1000.0 | Codeforces Round 924 Editorial | |
| 17241 | 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. | |
| 2258 | Sasha and the Wedding Binary Search Tree | combinatorics dfs and similar math sortings trees | Statement | F | Codeforces Round 926 (Div. 2) {1929} | PROGRAMMING | 3000.0 | Codeforces Round #926 (Div. 2) Editorial. | |
| 13462 | 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 | ||
| 1645 | 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 | |
| 9747 | Messenger in MAC | binary search brute force constructive algorithms data structures dp sortings | Statement | C | Codeforces Round 932 (Div. 2) {1935} | PROGRAMMING | 1500.0 | Codeforces Round #932 (Div. 2) Editorial | |
| 10598 | Exam in MAC | binary search combinatorics math | Statement | D | Codeforces Round 932 (Div. 2) {1935} | PROGRAMMING | 1750.0 | Codeforces Round #932 (Div. 2) Editorial | |
| 600 | Andrey's Tree | binary search constructive algorithms dsu greedy implementation trees | Statement | F | Codeforces Round 932 (Div. 2) {1935} | PROGRAMMING | 3000.0 | Codeforces Round #932 (Div. 2) Editorial | |
| 3550 | Pinball | binary search implementation math | Statement | B | Codeforces Round 930 (Div. 1) {1936} | PROGRAMMING | 1000.0 | Codeforces Round 930 (Div. 1, Div. 2) Editorial | |
| 7372 | Rudolf and Imbalance | binary search greedy two pointers | Statement | F | Codeforces Round 933 (Div. 3) {1941} | PROGRAMMING | 127018 | ||
| 529 | MEX Game 2 (Easy Version) | binary search brute force greedy | Statement | E1 | Codeforces Round 934 (Div. 1) {1943} | PROGRAMMING | 2000.0 | Codeforces Round #934 (Div1, Div2) Editorial | |
| 370 | MEX Game 2 (Hard Version) | binary search greedy two pointers | Statement | E2 | Codeforces Round 934 (Div. 1) {1943} | PROGRAMMING | 1500.0 | Codeforces Round #934 (Div1, Div2) Editorial | |
| 9697 | Binary Search | binary search constructive algorithms | Statement | E | Codeforces Round 935 (Div. 3) {1945} | PROGRAMMING | 127377 | ||
| 904 | Cook and Porridge | binary search constructive algorithms data structures implementation | Statement | G | Codeforces Round 935 (Div. 3) {1945} | PROGRAMMING | 127377 | ||
| 13674 | Tree Cutting | binary search dp greedy implementation trees | Statement | C | Codeforces Round 936 (Div. 2) {1946} | PROGRAMMING | 1500.0 | Codeforces Round #936 (Div. 2) Editorial | |
| 4871 | Charming Meals | binary search brute force greedy sortings | Statement | B | European Championship 2024 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1949} | PROGRAMMING | European Championship 2024 (EUC) Editorial | ||
| 961 | Inversion Composition | binary search constructive algorithms data structures greedy | Statement | F | Codeforces Global Round 25 {1951} | PROGRAMMING | 2750.0 | Codeforces Global Round 25 Editorial | |
| 16808 | Battle Cows | binary search greedy | Statement | B | Codeforces Global Round 25 {1951} | PROGRAMMING | 1000.0 | Codeforces Global Round 25 Editorial | |
| 5351 | Are You a Procrastinator? | binary search schedules | Statement | D | April Fools Day Contest 2024 {1952} | PROGRAMMING | April Fools Day Contest 2024 Editorial | ||
| 660 | Frequency Mismatch (Easy Version) | binary search data structures divide and conquer hashing probabilities trees | Statement | F1 | Codeforces Round 940 (Div. 2) and CodeCraft-23 {1957} | PROGRAMMING | 2250.0 | Codeforces Round #940 and CodeCraft-23 (Div. 2) Editorial | 2600 |
| 605 | Frequency Mismatch (Hard Version) | binary search data structures dfs and similar hashing probabilities trees | Statement | F2 | Codeforces Round 940 (Div. 2) and CodeCraft-23 {1957} | PROGRAMMING | 1250.0 | Codeforces Round #940 and CodeCraft-23 (Div. 2) Editorial | 2700 |
| 14908 | Permutation Counting | binary search greedy implementation math sortings | Statement | A | Codeforces Round 942 (Div. 1) {1967} | PROGRAMMING | 750.0 | Tutorial | 1400 |
| 971 | Long Way to be Non-decreasing | binary search dfs and similar graphs implementation shortest paths two pointers | Statement | D | Codeforces Round 942 (Div. 1) {1967} | PROGRAMMING | 1750.0 | Tutorial | 2800 |
| 6899 | Equal XOR Segments | binary search data structures | Statement | F | Codeforces Round 943 (Div. 3) {1968} | PROGRAMMING | 129096 | 1800 | |
| 5268 | Division + LCP (easy version) | binary search data structures dp hashing string suffix structures strings | Statement | G1 | Codeforces Round 943 (Div. 3) {1968} | PROGRAMMING | 129096 | 1900 | |
| 2494 | 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 | |
| 1845 | Unique Array | binary search data structures divide and conquer dp greedy | Statement | E | Educational Codeforces Round 165 (Rated for Div. 2) {1969} | PROGRAMMING | Educational Codeforces Round 165 Editorial | 2400 | |
| 18152 | Find the Car | binary search math sortings | Statement | E | Codeforces Round 944 (Div. 4) {1971} | PROGRAMMING | Codeforces Round 944 (Div. 4) Editorial | 1500 | |
| 12422 | 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 | |
| 16778 | 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 |
| 4388 | Cutting Game | binary search brute force data structures implementation sortings two pointers | Statement | F | Codeforces Round 946 (Div. 3) {1974} | PROGRAMMING | Codeforces Round #946 (Div. 3) Editorial | 1900 | |
| 17125 | Chamo and Mocha's Array | binary search brute force greedy | Statement | C | Codeforces Round 947 (Div. 1 + Div. 2) {1975} | PROGRAMMING | 1000.0 | editorial_zh.pdf | 1200 |
| 2861 | 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 |
| 5773 | Invertible Bracket Sequences | binary search combinatorics data structures divide and conquer implementation two pointers | Statement | D | Educational Codeforces Round 166 (Rated for Div. 2) {1976} | PROGRAMMING | Educational Codeforces Round 166 Editorial | ||
| 12385 | Job Interview | binary search dp greedy implementation two pointers | Statement | C | Educational Codeforces Round 166 (Rated for Div. 2) {1976} | PROGRAMMING | Educational Codeforces Round 166 Editorial | ||
| 25285 | New Bakery | binary search greedy math ternary search | Statement | B | Codeforces Round 953 (Div. 2) {1978} | PROGRAMMING | 750.0 | 130527 | |
| 22139 | Earning on Bets | binary search combinatorics constructive algorithms number theory | Statement | C | Codeforces Round 951 (Div. 2) {1979} | PROGRAMMING | 1500.0 | Codeforces Round 951 (Div. 2) Editorial | |
| 1801 | Manhattan Triangle | binary search constructive algorithms data structures geometry graphs two pointers | Statement | E | Codeforces Round 951 (Div. 2) {1979} | PROGRAMMING | 2500.0 | Codeforces Round 951 (Div. 2) Editorial | |
| 1288 | Sorting Problem Again | binary search data structures | Statement | F | Codeforces Round 955 (Div. 2, with prizes from NEAR!) {1982} | PROGRAMMING | 3000.0 | 130839 | |
| 21832 | Boring Day | binary search data structures dp greedy two pointers | Statement | C | Codeforces Round 955 (Div. 2, with prizes from NEAR!) {1982} | PROGRAMMING | 1000.0 | 130839 | |
| 1514 | array-value | binary search bitmasks data structures two pointers | Statement | F | Codeforces Round 956 (Div. 2) and ByteRace 2024 {1983} | PROGRAMMING | 2500.0 | ||
| 14682 | Have Your Cake and Eat It Too | binary search brute force dp greedy implementation | Statement | C | Codeforces Round 956 (Div. 2) and ByteRace 2024 {1983} | PROGRAMMING | 1250.0 | ||
| 19928 | Final Boss | binary search brute force data structures | Statement | F | Codeforces Round 952 (Div. 4) {1985} | PROGRAMMING | Codeforces Round 952 (Div. 4) Editorial | ||
| 1783 | Range Minimum Sum | binary search brute force data structures implementation | Statement | E | Codeforces Round 958 (Div. 2) {1988} | PROGRAMMING | 2500.0 | Editorial of Codeforces Round 958 (Div. 2) | |
| 1135 | Catch the Mole(Easy Version) | binary search constructive algorithms data structures interactive trees | Statement | E1 | Codeforces Round 960 (Div. 2) {1990} | PROGRAMMING | 2000.0 | Video Tutorial | |
| 1098 | Catch the Mole(Hard Version) | binary search data structures dfs and similar interactive trees | Statement | E2 | Codeforces Round 960 (Div. 2) {1990} | PROGRAMMING | 750.0 | Video Tutorial | |
| 4461 | Med-imize | binary search data structures dp greedy | Statement | D | Codeforces Round 963 (Div. 2) {1993} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round 963 (Div. 2) | |
| 13479 | Hungry Games | binary search data structures dp two pointers | Statement | C | Codeforces Round 959 sponsored by NEAR (Div. 1 + Div. 2) {1994} | PROGRAMMING | 1250.0 | Video Tutorial | |
| 20914 | Bouquet (Easy Version) | binary search brute force greedy sortings sortings two pointers | Statement | B1 | Codeforces Round 961 (Div. 2) {1995} | PROGRAMMING | 1000.0 | Video Tutorial | |
| 10131 | 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 | |
| 19550 | Fun | binary search brute force number theory | Statement | D | Codeforces Round 962 (Div. 3) {1996} | PROGRAMMING | Codeforces Round 962 (Div. 3) Editorial | ||
| 6292 | Bomb | binary search greedy math | Statement | F | Codeforces Round 962 (Div. 3) {1996} | PROGRAMMING | Codeforces Round 962 (Div. 3) Editorial | ||
| 3770 | Level Up | binary search brute force data structures implementation | Statement | E | Educational Codeforces Round 168 (Rated for Div. 2) {1997} | PROGRAMMING | Video Tutorial | ||
| 15828 | Maximize the Root | binary search dfs and similar dp greedy trees | Statement | D | Educational Codeforces Round 168 (Rated for Div. 2) {1997} | PROGRAMMING | Video Tutorial | ||
| 2277 | 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 | |
| 895 | Eliminating Balls With Merging (Hard Version) | binary search brute force data structures divide and conquer implementation | Statement | E2 | Codeforces Round 965 (Div. 2) {1998} | PROGRAMMING | 1750.0 | Video Tutorial | |
| 7077 | Perform Operations to Maximize Score | binary search brute force greedy | Statement | C | Codeforces Round 965 (Div. 2) {1998} | PROGRAMMING | 1250.0 | Video Tutorial | |
| 14443 | Ruler (easy version) | binary search interactive ternary search | Statement | G1 | Codeforces Round 964 (Div. 4) {1999} | PROGRAMMING | Video Tutorial |