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 |
|---|---|---|---|---|---|---|---|---|---|
| 2770 | Triangle Formation | brute force greedy math sortings | Statement | F | Pinely Round 4 (Div. 1 + Div. 2) {1991} | PROGRAMMING | 2500.0 | Video Tutorial | |
| 49058 | Only Pluses | brute force constructive algorithms greedy math sortings | Statement | A | Codeforces Round 957 (Div. 3) {1992} | PROGRAMMING | Shayan's Video Tutorial | ||
| 37864 | Angry Monk | greedy math sortings | Statement | B | Codeforces Round 957 (Div. 3) {1992} | PROGRAMMING | Shayan's 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 | |
| 27477 | Turtle and Piggy Are Playing a Game 2 | games greedy sortings | Statement | B | Codeforces Round 968 (Div. 2) {2003} | PROGRAMMING | 750.0 | sol-zh.pdf | |
| 26937 | Splitting Items | games greedy sortings | Statement | C | Educational Codeforces Round 169 (Rated for Div. 2) {2004} | PROGRAMMING | Educational Codeforces Round 169 Editorial | ||
| 21564 | 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) | |
| 24670 | The Strict Teacher (Easy Version) | greedy math sortings | Statement | B1 | Codeforces Round 972 (Div. 2) {2005} | PROGRAMMING | 500.0 | Discussion stream (With Hints) | |
| 15919 | Robert Hood and Mrs Hood | data structures greedy sortings | Statement | D | Codeforces Round 974 (Div. 3) {2014} | PROGRAMMING | Discussion stream (With Hints) | ||
| 237 | 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) | |
| 203 | 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) | |
| 9526 | Tree Pruning | brute force data structures dfs and similar greedy sortings trees | Statement | C | Codeforces Round 975 (Div. 1) {2018} | PROGRAMMING | 750.0 | Editorial of Codeforces Round 975 (Div. 1, Div. 2) | |
| 21483 | Meaning Mean | data structures greedy math sortings | Statement | A | Codeforces Round 977 (Div. 2, based on COMPFEST 16 - Final Round) {2021} | PROGRAMMING | 500.0 | Codeforces Round #977 (Div. 2, based on COMPFEST 16 — Final Round) Editorial | |
| 16527 | Concatenation of Arrays | constructive algorithms greedy math sortings | Statement | A | Codeforces Round 980 (Div. 1) {2023} | PROGRAMMING | 500.0 | 135341 | |
| 17006 | Buying Lemonade | binary search constructive algorithms sortings | Statement | B | Codeforces Round 980 (Div. 2) {2024} | PROGRAMMING | 1000.0 | 135341 | |
| 13608 | Add Zeros | data structures dfs and similar graphs sortings | Statement | C | Codeforces Round 982 (Div. 2) {2027} | PROGRAMMING | 1250.0 | Codeforces Round #982 (Div. 2) Editorial | |
| 8574 | QED's Favorite Permutation | bitmasks data structures implementation sortings | Statement | D | Codeforces Round 979 (Div. 2) {2030} | PROGRAMMING | 1500.0 | Codeforces Round 979 Editorial | |
| 27546 | A Gift From Orangutan | brute force dfs and similar greedy sortings | Statement | A | Codeforces Round 979 (Div. 2) {2030} | PROGRAMMING | 250.0 | Codeforces Round 979 Editorial | |
| 2677 | Penchick and Chloe's Trees | data structures dfs and similar dp greedy sortings trees | Statement | E | Codeforces Round 987 (Div. 2) {2031} | PROGRAMMING | 2500.0 | Codeforces Round 987 (Div. 2) Editorial | |
| 20742 | Penchick and Satay Sticks | greedy sortings | Statement | B | Codeforces Round 987 (Div. 2) {2031} | PROGRAMMING | 1000.0 | Codeforces Round 987 (Div. 2) Editorial | |
| 16097 | Trinity | binary search math sortings two pointers | Statement | C | Codeforces Round 983 (Div. 2) {2032} | PROGRAMMING | 1250.0 | Codeforces Round 983 (Div. 2) Editorial | |
| 6579 | Darius' Wisdom | constructive algorithms greedy implementation sortings | Statement | D | Rayan Programming Contest 2024 - Selection (Codeforces Round 989, Div. 1 + Div. 2) {2034} | PROGRAMMING | 1500.0 | Rayan 2024 Selection Round Editorial | |
| 29708 | Startup | greedy sortings | Statement | B | Codeforces Round 984 (Div. 3) {2036} | PROGRAMMING | Codeforces Round 984 (Div. 3) Editorial | ||
| 2960 | Ardent Flames | binary search data structures sortings two pointers | Statement | F | Codeforces Round 988 (Div. 3) {2037} | PROGRAMMING | Video Tutorial | ||
| 480 | Alternative Platforms | combinatorics data structures fft math sortings | Statement | F | 2024-2025 ICPC, NERC, Southern and Volga Russian Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2038} | PROGRAMMING | 2500 | ||
| 102 | Cool Swap Walk (Easy Version) | constructive algorithms implementation implementation sortings sortings | Statement | H1 | CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!) {2039} | PROGRAMMING | 2250.0 | Editorial of CodeTON Round 9 (Div. 1 + Div. 2) | |
| 90 | Cool Swap Walk (Hard Version) | constructive algorithms constructive algorithms constructive algorithms implementation sortings | Statement | H2 | CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!) {2039} | PROGRAMMING | 2500.0 | Editorial of CodeTON Round 9 (Div. 1 + Div. 2) | 3500 |
| 671 | Auto Complete | data structures implementation sortings strings trees | Statement | I | 2024 ICPC Asia Taichung Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2041} | PROGRAMMING | Problem Analysis and Hints (PDF) | ||
| 5198 | Recommendations | binary search data structures implementation sortings | Statement | D | Educational Codeforces Round 172 (Rated for Div. 2) {2042} | PROGRAMMING | 136886 | ||
| 20826 | Greedy Monocarp | greedy sortings | Statement | A | Educational Codeforces Round 172 (Rated for Div. 2) {2042} | PROGRAMMING | 136886 | ||
| 8605 | Competitive Fishing | greedy sortings | Statement | C | Educational Codeforces Round 172 (Rated for Div. 2) {2042} | PROGRAMMING | 136886 | ||
| 794 | Missing Separators | dp sortings string suffix structures strings | Statement | H | 2024-2025 ICPC Asia Jakarta Regional Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2045} | PROGRAMMING | raRzKDJLPHcUnqTcwvGznwEdKiDWjEkd.pdf | 2200 | |
| 10812 | 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) | |
| 2339 | Adventurers | binary search data structures sortings | Statement | C | Codeforces Round 990 (Div. 1) {2046} | PROGRAMMING | 1500.0 | Разбор Codeforces Round 990 (Div. 2 + Div. 1) | |
| 16746 | Swap Columns and Find a Path | greedy sortings | Statement | A | Codeforces Round 990 (Div. 1) {2046} | PROGRAMMING | 500.0 | Разбор Codeforces Round 990 (Div. 2 + Div. 1) | |
| 8265 | Kevin and Competition Memories | binary search data structures greedy sortings two pointers | Statement | D | Codeforces Global Round 28 {2048} | PROGRAMMING | 1250.0 | Tutorial | |
| 23807 | Counting Pairs | binary search sortings two pointers | Statement | D | Codeforces Round 995 (Div. 3) {2051} | PROGRAMMING | 137623 | ||
| 11898 | Best Price | brute force data structures greedy sortings | Statement | E | Codeforces Round 995 (Div. 3) {2051} | PROGRAMMING | 137623 | ||
| 7662 | 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 | |
| 27188 | Crafting | greedy sortings | Statement | B | Codeforces Round 996 (Div. 2) {2055} | PROGRAMMING | 1000.0 | Codeforces Round 996 (Div. 2) Editorial | |
| 17777 | Find the Permutation | dfs and similar graphs implementation sortings | Statement | B | Codeforces Round 997 (Div. 2) {2056} | PROGRAMMING | 1250.0 | Codeforces Round #997 (Div. 2) Editorial | |
| 1905 | Another Exercise on Graphs (hard version) | binary search brute force dsu graphs shortest paths sortings trees | Statement | E2 | Hello 2025 {2057} | PROGRAMMING | 2000.0 | ||
| 246 | Formation | dp sortings | Statement | F | Hello 2025 {2057} | PROGRAMMING | 3500.0 | ||
| 23158 | Gorilla and the Exam | greedy sortings | Statement | B | Hello 2025 {2057} | PROGRAMMING | 1000.0 | ||
| 12478 | Customer Service | brute force constructive algorithms graph matchings greedy math sortings | Statement | C | Codeforces Round 1002 (Div. 2) {2059} | PROGRAMMING | 1500.0 | 139094 | |
| 29089 | Milya and Two Arrays | constructive algorithms greedy sortings | Statement | A | Codeforces Round 1002 (Div. 2) {2059} | PROGRAMMING | 500.0 | 139094 | |
| 1280 | Bugged Sort | dp greedy sortings | Statement | G | Codeforces Round 998 (Div. 3) {2060} | PROGRAMMING | Codeforces Round 998 (Div. 3) Editorial | ||
| 31980 | Game of Mathletes | games greedy sortings two pointers | Statement | C | Codeforces Round 998 (Div. 3) {2060} | PROGRAMMING | Codeforces Round 998 (Div. 3) Editorial | ||
| 28507 | Farmer John's Card Game | greedy sortings | Statement | B | Codeforces Round 998 (Div. 3) {2060} | PROGRAMMING | Codeforces Round 998 (Div. 3) Editorial | ||
| 610 | Traveling Salescat | dp geometry greedy math sortings | Statement | F | Ethflow Round 1 (Codeforces Round 1001, Div. 1 + Div. 2) {2062} | PROGRAMMING | 3500.0 | Ethflow Round 1 (Codeforces Round 1001, Div. 1 + Div. 2) Editorial | |
| 14529 | Remove Exactly Two | brute force data structures dp graphs greedy sortings trees | Statement | C | Codeforces Round 1000 (Div. 2) {2063} | PROGRAMMING | 1500.0 | Codeforces Round 1000 (Div. 2) — Editorial | |
| 23072 | Subsequence Update | greedy sortings | Statement | B | Codeforces Round 1000 (Div. 2) {2063} | PROGRAMMING | 1000.0 | Codeforces Round 1000 (Div. 2) — Editorial | |
| 20551 | Skibidus and Sigma | sortings | Statement | D | Codeforces Round 1003 (Div. 4) {2065} | PROGRAMMING | Video Tutorial | ||
| 18891 | Two Large Bags | dp greedy sortings | Statement | B | Codeforces Round 1004 (Div. 2) {2067} | PROGRAMMING | 1000.0 | ||
| 265 | Morse Code | dp greedy sortings trees | Statement | D | European Championship 2025 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {2068} | PROGRAMMING | 140239 | ||
| 1893 | A, B, AB and BA | constructive algorithms greedy sortings strings | Statement | E | Educational Codeforces Round 174 (Rated for Div. 2) {2069} | PROGRAMMING | 139774 | ||
| 9624 | Trapmigiano Reggiano | constructive algorithms dfs and similar sortings trees | Statement | C | Codeforces Round 1007 (Div. 2) {2071} | PROGRAMMING | 1500.0 | Codeforces Round 1007 (Div. 2) Editorial | |
| 597 | Another Folding Strip | combinatorics data structures divide and conquer dp math sortings | Statement | E | Codeforces Round 1008 (Div. 1) {2077} | PROGRAMMING | 2250.0 | Codeforces Round 1008 (Div. 1, Div. 2) Editorial | |
| 14426 | Breach of Faith | constructive algorithms greedy math sortings | Statement | A | Codeforces Round 1008 (Div. 1) {2077} | PROGRAMMING | 500.0 | Codeforces Round 1008 (Div. 1, Div. 2) Editorial | |
| 678 | Cute Subsequences | *special sortings | Statement | D | XIX Open Olympiad in Informatics - Final Stage, Day 1 (Unrated, Online Mirror, IOI rules) {2079} | PROGRAMMING | |||
| 1170 | MST in Modulo Graph | constructive algorithms dsu graphs greedy math number theory sortings | Statement | D | Codeforces Round 1010 (Div. 1, Unrated) {2081} | PROGRAMMING | 1750.0 | Codeforces Round 1010 (Div. 1, Div. 2, based on Zhili Cup 2025) Editorial | |
| 6248 | Dining Hall | greedy implementation sortings sortings | Statement | C | Codeforces Round 1012 (Div. 2) {2090} | PROGRAMMING | 1750.0 | Codeforces Round 1012 (Div.1, Div. 2, based on THUPC 2025 — Finals) Editorial | |
| 32474 | Team Training | dp greedy sortings | Statement | B | Codeforces Round 1013 (Div. 3) {2091} | PROGRAMMING | Codeforces Round 1013 (Div. 3) Editorial | ||
| 28254 | Kamilka and the Sheep | greedy implementation math sortings | Statement | A | Codeforces Round 1014 (Div. 2) {2092} | PROGRAMMING | 500.0 | Codeforces Round #1014 (Div. 2) Editorial | |
| 2028 | Wonderful Teddy Bears | greedy implementation sortings | Statement | E | Neowise Labs Contest 1 (Codeforces Round 1018, Div. 1 + Div. 2) {2096} | PROGRAMMING | 2000.0 | Neowise Labs Contest 1 (Codeforces Round 1018, Div. 1 + Div. 2) Editorial | |
| 16491 | Wonderful Gloves | greedy math sortings | Statement | B | Neowise Labs Contest 1 (Codeforces Round 1018, Div. 1 + Div. 2) {2096} | PROGRAMMING | 750.0 | Neowise Labs Contest 1 (Codeforces Round 1018, Div. 1 + Div. 2) Editorial | |
| 8490 | Sports Betting | math sortings | Statement | A | Codeforces Round 1021 (Div. 1) {2097} | PROGRAMMING | 500.0 | 142316 | |
| 7800 | Sasha and the Apartment Purchase | math sortings | Statement | B | Codeforces Round 1021 (Div. 2) {2098} | PROGRAMMING | 1250.0 | 142316 | |
| 6740 | Quartet Swapping | data structures greedy sortings | Statement | B | Codeforces Round 1024 (Div. 1) {2101} | PROGRAMMING | 1250.0 | 142788 | |
| 19717 | The Picky Cat | sortings | Statement | B | Codeforces Round 1024 (Div. 2) {2102} | PROGRAMMING | 500.0 | 142788 | |
| 25501 | Cherry Bomb | greedy math sortings | Statement | C | Codeforces Round 1020 (Div. 3) {2106} | PROGRAMMING | Codeforces Round 1020 (Div. 3) Editorial | ||
| 29699 | Fashionable Array | implementation sortings | Statement | A | Codeforces Round 1026 (Div. 2) {2110} | PROGRAMMING | 500.0 | Codeforces Round 1026 (Div. 2) Editorial | |
| 5391 | 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 | ||
| 11909 | Creating a Schedule | constructive algorithms data structures greedy sortings | Statement | D | Educational Codeforces Round 179 (Rated for Div. 2) {2111} | PROGRAMMING | Educational Codeforces Round 179 Editorial | ||
| 5476 | 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 | ||
| 5115 | Omg Graph | brute force dsu graphs greedy shortest paths sortings | Statement | G | Codeforces Round 1029 (Div. 3) {2117} | PROGRAMMING | Codeforces Round 1029 (Div. 3) Editorial | ||
| 1412 | Grid Coloring | constructive algorithms greedy sortings | Statement | E | Codeforces Round 1030 (Div. 2) {2118} | PROGRAMMING | 2500.0 | Codeforces Round 1030 (Div. 2) Editorial | |
| 12482 | Divine Tree | constructive algorithms greedy math sortings trees | Statement | C | Codeforces Round 1033 (Div. 2) and CodeNite 2025 {2120} | PROGRAMMING | 1250.0 | Codeforces Round 1033 (Div. 2) and CodeNite 2025 Editorial | |
| 2215 | 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 | ||
| 5331 | Gangsta | data structures divide and conquer math sortings | Statement | G | Codeforces Round 1032 (Div. 3) {2121} | PROGRAMMING | Codeforces Round 1032 (Div. 3) Editorial | ||
| 18137 | 1709 | implementation sortings | Statement | D | Codeforces Round 1032 (Div. 3) {2121} | PROGRAMMING | Codeforces Round 1032 (Div. 3) Editorial | ||
| 8325 | Manhattan Pairs | constructive algorithms greedy math sortings | Statement | C | Order Capital Round 1 (Codeforces Round 1038, Div. 1 + Div. 2) {2122} | PROGRAMMING | 1500.0 | Order Capital Round 1 (Codeforces Round 1038, Div. 1 + Div. 2) Editorial | |
| 14806 | 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 | ||
| 19133 | Deranged Deletions | constructive algorithms sortings | Statement | A | EPIC Institute of Technology Round Summer 2025 (Codeforces Round 1036, Div. 1 + Div. 2) {2124} | PROGRAMMING | 500.0 | EPIC Institute of Technology Round Summer 2025 (Codeforces Round 1036, Div. 1 + Div. 2) Editorial | |
| 8046 | Make a Palindrome | greedy sortings | Statement | D | EPIC Institute of Technology Round Summer 2025 (Codeforces Round 1036, Div. 1 + Div. 2) {2124} | PROGRAMMING | 1750.0 | EPIC Institute of Technology Round Summer 2025 (Codeforces Round 1036, Div. 1 + Div. 2) Editorial | |
| 27869 | Difficult Contest | constructive algorithms implementation sortings strings | Statement | A | Educational Codeforces Round 181 (Rated for Div. 2) {2125} | PROGRAMMING | Educational Codeforces Round 181 Editorial | ||
| 26162 | I Will Definitely Make It | greedy sortings | Statement | C | Codeforces Round 1037 (Div. 3) {2126} | PROGRAMMING | 144845 | ||
| 23864 | This Is the Last Time | greedy sortings | Statement | D | Codeforces Round 1037 (Div. 3) {2126} | PROGRAMMING | 144845 | ||
| 12309 | Trip Shopping | games greedy sortings | Statement | C | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) {2127} | PROGRAMMING | 1500.0 | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) Editorial | |
| 21312 | Deque Process | constructive algorithms greedy sortings two pointers | Statement | B | Codeforces Round 1039 (Div. 2) {2128} | PROGRAMMING | 1000.0 | Codeforces Round #1039 — Editorial | |
| 28409 | Recycling Center | greedy sortings | Statement | A | Codeforces Round 1039 (Div. 2) {2128} | PROGRAMMING | 500.0 | Codeforces Round #1039 — Editorial | |
| 473 | Induced Subgraph Queries | data structures graphs sortings | Statement | E | Codeforces Round 1040 (Div. 1) {2129} | PROGRAMMING | 3000.0 | Codeforces Round 1040 (Div. 1, Div. 2) Editorial | |
| 4025 | Prefix Maximum Invariance | binary search data structures sortings | Statement | F | Codeforces Round 1047 (Div. 3) {2137} | PROGRAMMING | Codeforces Round 1047 (Div. 3) Editorial | ||
| 4861 | A Cruel Segment's Thesis | greedy math sortings | Statement | D | Codeforces Round 1049 (Div. 2) {2140} | PROGRAMMING | 1750.0 | Codeforces Round 1049 (Div. 2) Editorial | |
| 22167 | Shift Sort | greedy sortings strings | Statement | A | Codeforces Round 1049 (Div. 2) {2140} | PROGRAMMING | 500.0 | Codeforces Round 1049 (Div. 2) Editorial | |
| 61 | Good Robot Paths | *special data structures geometry sortings | Statement | G | Kotlin Heroes: Episode 13 {2141} | PROGRAMMING | Kotlin Heroes 13 Editorial | ||
| 20730 | Discounts | greedy sortings two pointers | Statement | B | Codeforces Round 1051 (Div. 2) {2143} | PROGRAMMING | 1000.0 | Codeforces Round 1051 (Div. 2) Editorial | |
| 3046 | 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 | ||
| 6539 | Gravity Falls | greedy implementation sortings | Statement | F | Codeforces Round 1050 (Div. 4) {2148} | PROGRAMMING | Codeforces Round 1050 (Div. 4) Editorial | ||
| 26531 | Destruction of the Dandelion Fields | greedy sortings | Statement | D | Codeforces Round 1050 (Div. 4) {2148} | PROGRAMMING | Codeforces Round 1050 (Div. 4) Editorial | ||
| 32879 | Unconventional Pairs | greedy sortings | Statement | B | Codeforces Round 1054 (Div. 3) {2149} | PROGRAMMING | __rose | ||
| 1012 | Hidden Single (Version 1) | divide and conquer interactive math probabilities sortings | Statement | E1 | Codeforces Round 1053 (Div. 1) {2150} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round 1053 (Div. 1, Div. 2) | |
| 11701 | Symmetrical Polygons | geometry greedy sortings | Statement | C | Codeforces Round 1057 (Div. 2) {2153} | PROGRAMMING | 1250.0 | Codeforces Round 1057 (Div. 2) Editorial | |
| 1195 | 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 | |
| 3538 | 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 | |
| 16364 | Dungeon Equilibrium | greedy implementation sortings | Statement | A | Codeforces Round 1066 (Div. 1 + Div. 2) {2157} | PROGRAMMING | 500.0 | Codeforces Round 1066 (Div. 1 + Div. 2) Editorial | |
| 5935 | Billion Players Game | greedy math sortings ternary search two pointers | Statement | D | Codeforces Round 1066 (Div. 1 + Div. 2) {2157} | PROGRAMMING | 1500.0 | Codeforces Round 1066 (Div. 1 + Div. 2) Editorial | |
| 12409 | Loyalty | constructive algorithms greedy sortings two pointers | Statement | C | Pinely Round 5 (Div. 1 + Div. 2) {2161} | PROGRAMMING | 1750.0 | ||
| 19482 | Souvlaki VS. Kalamaki | math sortings | Statement | A | Codeforces Round 1063 (Div. 2) {2163} | PROGRAMMING | 500.0 | Codeforces Round 1063 Editorial | |
| 10571 | 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 | |
| 35775 | Isamatdin and His Magic Wand! | constructive algorithms greedy implementation sortings | Statement | C | Codeforces Round 1062 (Div. 4) {2167} | PROGRAMMING | Arpa Video Tutorial | ||
| 51213 | Your Name | sortings strings | Statement | B | Codeforces Round 1062 (Div. 4) {2167} | PROGRAMMING | Arpa Video Tutorial | ||
| 5686 | Fibonacci Paths | data structures dp geometry graphs sortings | Statement | D | Codeforces Round 1070 (Div. 2) {2176} | PROGRAMMING | 2000.0 | Codeforces Round 1070 (Div.2) Editorial | |
| 15581 | Odd Process | greedy math sortings | Statement | C | Codeforces Round 1070 (Div. 2) {2176} | PROGRAMMING | 1500.0 | Codeforces Round 1070 (Div.2) Editorial | |
| 22103 | Blackslex and Number Theory | math number theory sortings sortings | Statement | C | Codeforces Round 1071 (Div. 3) {2179} | PROGRAMMING | Codeforces Round 1071 (Div. 3) Editorial | ||
| 1336 | 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 | ||
| 137 | Elevator Against Humanity | brute force constructive algorithms greedy sortings | Statement | E | 2025-2026 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2181} | PROGRAMMING | Tutorial | ||
| 5504 | New Year's Gifts | data structures greedy implementation sortings two pointers | Statement | E | Educational Codeforces Round 186 (Rated for Div. 2) {2182} | PROGRAMMING | Educational Codeforces Round 186 Editorial | ||
| 28575 | Shifted MEX | implementation sortings | Statement | C | Codeforces Round 1074 (Div. 4) {2185} | PROGRAMMING | Codeforces Round 1074 (Div. 4) Editorial | ||
| 15677 | 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 | |
| 216 | Zhora the Vacuum Cleaner | dp implementation sortings trees | Statement | F | Codeforces Round 1075 (Div. 2) {2189} | PROGRAMMING | 3250.0 | Codeforces Round 1075 (Div. 2) Editorial | |
| 1280 | 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 | |
| 19690 | MEX Reordering | constructive algorithms sortings | Statement | B | Codeforces Round 1073 (Div. 2) {2191} | PROGRAMMING | 1000.0 | Codeforces Round 1073 (Div. 1, Div. 2) Editorial | |
| 21313 | Monster Game | binary search sortings two pointers | Statement | D | Codeforces Round 1076 (Div. 3) {2193} | PROGRAMMING | Разбор Codeforces Round 1076 (Div. 3) | ||
| 2204 | Paths in a Tree | dfs and similar interactive sortings trees | Statement | G | Codeforces Round 1076 (Div. 3) {2193} | PROGRAMMING | Разбор Codeforces Round 1076 (Div. 3) | ||
| 976 | Double Bracket Sequence | data structures dp greedy sortings | Statement | D | Codeforces Round 1079 (Div. 1) {2196} | PROGRAMMING | 2250.0 | Tutorial | |
| 15685 | Array and Permutation | implementation sortings two pointers | Statement | B | Codeforces Round 1079 (Div. 2) {2197} | PROGRAMMING | 1000.0 | ||
| 2754 | Mooclear Reactor 2 | data structures greedy implementation sortings | Statement | F | Codeforces Round 1084 (Div. 3) {2200} | PROGRAMMING | Codeforces Round 1084 (Div. 3) Editorial | ||
| 24519 | Deletion Sort | greedy sortings | Statement | B | Codeforces Round 1084 (Div. 3) {2200} | PROGRAMMING | Codeforces Round 1084 (Div. 3) Editorial | ||
| 11267 | Portal | greedy sortings | Statement | D | Codeforces Round 1084 (Div. 3) {2200} | PROGRAMMING | Codeforces Round 1084 (Div. 3) Editorial | ||
| 7436 | Simons and Posting Blogs | greedy sortings | Statement | C | Codeforces Round 1083 (Div. 2) {2205} | PROGRAMMING | 1250.0 | Tutorial | |
| 5550 | One Night At Freddy's | games greedy sortings | Statement | B | Codeforces Round 1085 (Div. 1 + Div. 2) {2207} | PROGRAMMING | 1250.0 | Codeforces Round 1085 (Div. 1 + Div. 2) Editorial | |
| 1745 | Tree Orientation (Hard Version) | data structures dfs and similar dsu graphs greedy matrices sortings trees | Statement | D2 | Codeforces Round 1086 (Div. 2) {2208} | PROGRAMMING | 1250.0 | Tutorial | |
| 13216 | Cyclists | games greedy implementation sortings | Statement | B | Codeforces Round 1086 (Div. 2) {2208} | PROGRAMMING | 1000.0 | Tutorial | |
| 15361 | Blocked | greedy sortings | Statement | A | Codeforces Round 1093 (Div. 2) {2220} | PROGRAMMING | 500.0 |