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 ... 42 43 44 45 46 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 26550 | Circle of Apple Trees | greedy | Statement | A | Codeforces Round 1057 (Div. 2) {2153} | PROGRAMMING | 500.0 | Codeforces Round 1057 (Div. 2) Editorial | |
| 22748 | Bitwise Reversion | bitmasks | Statement | B | Codeforces Round 1057 (Div. 2) {2153} | PROGRAMMING | 750.0 | Codeforces Round 1057 (Div. 2) Editorial | |
| 23353 | Notelock | greedy two pointers | Statement | A | Codeforces Round 1060 (Div. 2) {2154} | PROGRAMMING | 500.0 | Codeforces Round 1060 (Div. 2) Editorial | |
| 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 | |
| 5590 | No Cost Too Great (Hard Version) | greedy math number theory | Statement | C2 | Codeforces Round 1060 (Div. 2) {2154} | PROGRAMMING | 1000.0 | Codeforces Round 1060 (Div. 2) Editorial | |
| 13744 | No Cost Too Great (Easy Version) | greedy implementation math number theory | Statement | C1 | Codeforces Round 1060 (Div. 2) {2154} | PROGRAMMING | 1250.0 | Codeforces Round 1060 (Div. 2) Editorial | |
| 20071 | Make it Zigzag | constructive algorithms greedy | Statement | B | Codeforces Round 1060 (Div. 2) {2154} | PROGRAMMING | 1000.0 | Codeforces Round 1060 (Div. 2) Editorial | |
| 4841 | Catshock | constructive algorithms dfs and similar graphs trees | Statement | D | Codeforces Round 1060 (Div. 2) {2154} | PROGRAMMING | 1750.0 | Codeforces Round 1060 (Div. 2) Editorial | |
| 179 | Bombing (Hard Version) | combinatorics dp | Statement | F2 | Codeforces Round 1060 (Div. 2) {2154} | PROGRAMMING | 1750.0 | Codeforces Round 1060 (Div. 2) Editorial | |
| 574 | Bombing (Easy Version) | combinatorics dp | Statement | F1 | Codeforces Round 1060 (Div. 2) {2154} | PROGRAMMING | 2250.0 | Codeforces Round 1060 (Div. 2) Editorial | |
| 10473 | The Ancient Wizards' Capes | brute force dp implementation | Statement | C | Codeforces Round 1056 (Div. 2) {2155} | PROGRAMMING | 1750.0 | Codeforces Round 1056 (Div. 2) Editorial | |
| 2926 | Mimo & Yuyu | games greedy math | Statement | E | Codeforces Round 1056 (Div. 2) {2155} | PROGRAMMING | 2250.0 | Codeforces Round 1056 (Div. 2) Editorial | |
| 671 | Juan's Colorful Tree | data structures data structures dfs and similar dfs and similar dsu graphs graphs trees | Statement | F | Codeforces Round 1056 (Div. 2) {2155} | PROGRAMMING | 3000.0 | Codeforces Round 1056 (Div. 2) Editorial | |
| 25429 | El fucho | implementation math | Statement | A | Codeforces Round 1056 (Div. 2) {2155} | PROGRAMMING | 500.0 | Codeforces Round 1056 (Div. 2) Editorial | |
| 5984 | Batteries | interactive math | Statement | D | Codeforces Round 1056 (Div. 2) {2155} | PROGRAMMING | 2000.0 | Codeforces Round 1056 (Div. 2) Editorial | |
| 17257 | Abraham's Great Escape | constructive algorithms graphs | Statement | B | Codeforces Round 1056 (Div. 2) {2155} | PROGRAMMING | 1000.0 | Codeforces Round 1056 (Div. 2) Editorial | |
| 249 | Strange Operation (Hard Version) | data structures greedy | Statement | F2 | Codeforces Round 1061 (Div. 2) {2156} | PROGRAMMING | 3250.0 | Codeforces Round 1061 (Div. 2) Editorial | |
| 1631 | Strange Operation (Easy Version) | brute force data structures greedy implementation | Statement | F1 | Codeforces Round 1061 (Div. 2) {2156} | PROGRAMMING | 3250.0 | Codeforces Round 1061 (Div. 2) Editorial | |
| 21032 | 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 | |
| 27097 | Pizza Time | brute force constructive algorithms greedy | Statement | A | Codeforces Round 1061 (Div. 2) {2156} | PROGRAMMING | 500.0 | Codeforces Round 1061 (Div. 2) Editorial | |
| 12460 | Maximum GCD on Whiteboard | greedy math number theory | Statement | C | Codeforces Round 1061 (Div. 2) {2156} | PROGRAMMING | 1500.0 | Codeforces Round 1061 (Div. 2) Editorial | |
| 5430 | Find the Last Number | bitmasks constructive algorithms interactive math | Statement | D | Codeforces Round 1061 (Div. 2) {2156} | PROGRAMMING | 2000.0 | Codeforces Round 1061 (Div. 2) Editorial | |
| 972 | 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 | |
| 9723 | Meximum Array 2 | constructive algorithms greedy math | Statement | C | Codeforces Round 1066 (Div. 1 + Div. 2) {2157} | PROGRAMMING | 1500.0 | Codeforces Round 1066 (Div. 1 + Div. 2) Editorial | |
| 133 | Keygen 3 | brute force combinatorics constructive algorithms | Statement | H | Codeforces Round 1066 (Div. 1 + Div. 2) {2157} | PROGRAMMING | 3750.0 | Codeforces Round 1066 (Div. 1 + Div. 2) Editorial | |
| 460 | Isaac's Queries | brute force constructive algorithms dfs and similar divide and conquer greedy interactive math probabilities | Statement | G | Codeforces Round 1066 (Div. 1 + Div. 2) {2157} | PROGRAMMING | 3000.0 | Codeforces Round 1066 (Div. 1 + Div. 2) Editorial | |
| 173 | Hyper Smawk Bros | dp dp games | Statement | I | Codeforces Round 1066 (Div. 1 + Div. 2) {2157} | PROGRAMMING | 4000.0 | Codeforces Round 1066 (Div. 1 + Div. 2) Editorial | |
| 1370 | Git Gud | constructive algorithms data structures divide and conquer | Statement | F | Codeforces Round 1066 (Div. 1 + Div. 2) {2157} | PROGRAMMING | 2500.0 | Codeforces Round 1066 (Div. 1 + Div. 2) Editorial | |
| 13373 | Expansion Plan 2 | implementation math | Statement | B | Codeforces Round 1066 (Div. 1 + Div. 2) {2157} | PROGRAMMING | 1000.0 | Codeforces Round 1066 (Div. 1 + Div. 2) Editorial | |
| 16970 | 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 | |
| 6370 | 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 | |
| 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 | |
| 23653 | Suspension | greedy math | Statement | A | Codeforces Round 1067 (Div. 2) {2158} | PROGRAMMING | 500.0 | Codeforces Round 1067 (Div. 2) Editorial | |
| 14212 | Split | constructive algorithms greedy math | Statement | B | Codeforces Round 1067 (Div. 2) {2158} | PROGRAMMING | 1250.0 | Codeforces Round 1067 (Div. 2) Editorial | |
| 642 | Sink | data structures dsu dsu graphs graphs | Statement | E | Codeforces Round 1067 (Div. 2) {2158} | PROGRAMMING | 2750.0 | Codeforces Round 1067 (Div. 2) Editorial | |
| 3342 | Palindrome Flipping | brute force constructive algorithms implementation strings | Statement | D | Codeforces Round 1067 (Div. 2) {2158} | PROGRAMMING | 2000.0 | Codeforces Round 1067 (Div. 2) Editorial | |
| 263 | Distinct GCDs (Hard Version) | combinatorics constructive algorithms graphs graphs graphs math number theory number theory | Statement | F2 | Codeforces Round 1067 (Div. 2) {2158} | PROGRAMMING | 1000.0 | Codeforces Round 1067 (Div. 2) Editorial | |
| 421 | Distinct GCDs (Easy Version) | constructive algorithms constructive algorithms graphs graphs number theory number theory | Statement | F1 | Codeforces Round 1067 (Div. 2) {2158} | PROGRAMMING | 2500.0 | Codeforces Round 1067 (Div. 2) Editorial | |
| 11333 | Annoying Game | dp games greedy | Statement | C | Codeforces Round 1067 (Div. 2) {2158} | PROGRAMMING | 1500.0 | Codeforces Round 1067 (Div. 2) Editorial | |
| 1905 | Twin Polynomials | combinatorics graph matchings graphs math | Statement | C | Codeforces Round 1058 (Div. 1) {2159} | PROGRAMMING | 1500.0 | Codeforces Round 1058 Editorial | |
| 363 | Super-Short-Polynomial-San | math math meet-in-the-middle meet-in-the-middle | Statement | E | Codeforces Round 1058 (Div. 1) {2159} | PROGRAMMING | 3000.0 | Codeforces Round 1058 Editorial | |
| 2561 | Rectangles | data structures dsu implementation two pointers | Statement | B | Codeforces Round 1058 (Div. 1) {2159} | PROGRAMMING | 1500.0 | Codeforces Round 1058 Editorial | |
| 8386 | MAD Interactive Problem | constructive algorithms implementation interactive | Statement | A | Codeforces Round 1058 (Div. 1) {2159} | PROGRAMMING | 750.0 | Codeforces Round 1058 Editorial | |
| 400 | Inverse Minimum Partition (Hard Version) | dp greedy | Statement | D2 | Codeforces Round 1058 (Div. 1) {2159} | PROGRAMMING | 1750.0 | Codeforces Round 1058 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 | |
| 15351 | Reverse XOR | bitmasks | Statement | C | Codeforces Round 1058 (Div. 2) {2160} | PROGRAMMING | 1250.0 | Codeforces Round 1058 Editorial | |
| 22617 | MEX Partition | math | Statement | A | Codeforces Round 1058 (Div. 2) {2160} | PROGRAMMING | 500.0 | Codeforces Round 1058 Editorial | |
| 17963 | Distinct Elements | greedy math | Statement | B | Codeforces Round 1058 (Div. 2) {2160} | PROGRAMMING | 1000.0 | Codeforces Round 1058 Editorial | |
| 353 | SubMST | combinatorics graphs trees | Statement | F | Pinely Round 5 (Div. 1 + Div. 2) {2161} | PROGRAMMING | 3250.0 | ||
| 15820 | Round Trip | games greedy implementation math | Statement | A | Pinely Round 5 (Div. 1 + Div. 2) {2161} | PROGRAMMING | 500.0 | ||
| 5435 | Make Connected | brute force dsu implementation | Statement | B | Pinely Round 5 (Div. 1 + Div. 2) {2161} | PROGRAMMING | 1000.0 | ||
| 12808 | Loyalty | constructive algorithms greedy sortings two pointers | Statement | C | Pinely Round 5 (Div. 1 + Div. 2) {2161} | PROGRAMMING | 1750.0 | ||
| 2802 | 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 | ||
| 793 | Left is Always Right | combinatorics math | Statement | E | Pinely Round 5 (Div. 1 + Div. 2) {2161} | PROGRAMMING | 3000.0 | ||
| 67 | Cycle Sort | Statement | H | Pinely Round 5 (Div. 1 + Div. 2) {2161} | PROGRAMMING | 5000.0 | |||
| 92 | Bitwise And Equals | bitmasks | Statement | G | Pinely Round 5 (Div. 1 + Div. 2) {2161} | PROGRAMMING | 3750.0 | ||
| 21600 | Beautiful XOR | bitmasks constructive algorithms | Statement | C | Codeforces Round 1059 (Div. 3) {2162} | PROGRAMMING | Codeforces Round 1059 (Div. 3) Editorial | ||
| 2833 | Beautiful Tree | constructive algorithms math trees | Statement | G | Codeforces Round 1059 (Div. 3) {2162} | PROGRAMMING | Codeforces Round 1059 (Div. 3) Editorial | ||
| 28191 | Beautiful String | constructive algorithms | Statement | B | Codeforces Round 1059 (Div. 3) {2162} | PROGRAMMING | Codeforces Round 1059 (Div. 3) Editorial | ||
| 320 | Beautiful Problem | dp | Statement | H | Codeforces Round 1059 (Div. 3) {2162} | PROGRAMMING | Codeforces Round 1059 (Div. 3) Editorial | ||
| 12510 | Beautiful Permutation | binary search interactive | Statement | D | Codeforces Round 1059 (Div. 3) {2162} | PROGRAMMING | Codeforces Round 1059 (Div. 3) Editorial | ||
| 9482 | Beautiful Palindromes | constructive algorithms greedy schedules | Statement | E | Codeforces Round 1059 (Div. 3) {2162} | PROGRAMMING | Codeforces Round 1059 (Div. 3) Editorial | ||
| 2952 | Beautiful Intervals | constructive algorithms greedy | Statement | F | Codeforces Round 1059 (Div. 3) {2162} | PROGRAMMING | Codeforces Round 1059 (Div. 3) Editorial | ||
| 41964 | Beautiful Average | brute force greedy | Statement | A | Codeforces Round 1059 (Div. 3) {2162} | PROGRAMMING | Codeforces Round 1059 (Div. 3) Editorial | ||
| 19757 | Souvlaki VS. Kalamaki | math sortings | Statement | A | Codeforces Round 1063 (Div. 2) {2163} | PROGRAMMING | 500.0 | Codeforces Round 1063 Editorial | |
| 9260 | Siga ta Kymata | constructive algorithms math | Statement | B | Codeforces Round 1063 (Div. 2) {2163} | PROGRAMMING | 1000.0 | Codeforces Round 1063 Editorial | |
| 645 | Plegma | interactive | Statement | E | Codeforces Round 1063 (Div. 2) {2163} | PROGRAMMING | 2750.0 | Codeforces Round 1063 Editorial | |
| 9205 | Monopati | dp math two pointers | Statement | C | Codeforces Round 1063 (Div. 2) {2163} | PROGRAMMING | 1250.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 | |
| 2758 | Diadrash (Easy Version) | binary search divide and conquer interactive | Statement | D1 | Codeforces Round 1063 (Div. 2) {2163} | PROGRAMMING | 1500.0 | Codeforces Round 1063 Editorial | |
| 21251 | Sequence Game | brute force greedy | Statement | A | Codeforces Global Round 30 (Div. 1 + Div. 2) {2164} | PROGRAMMING | 500.0 | Codeforces Global Round 30 Editorial | |
| 228 | Pointless Machine | interactive | Statement | G | Codeforces Global Round 30 (Div. 1 + Div. 2) {2164} | PROGRAMMING | 3500.0 | Codeforces Global Round 30 Editorial | |
| 46 | PalindromePalindrome | data structures strings | Statement | H | Codeforces Global Round 30 (Div. 1 + Div. 2) {2164} | PROGRAMMING | 5500.0 | Codeforces Global Round 30 Editorial | |
| 1903 | Journey | dfs and similar dsu graphs greedy | Statement | E | Codeforces Global Round 30 (Div. 1 + Div. 2) {2164} | PROGRAMMING | 2250.0 | Codeforces Global Round 30 Editorial | |
| 18738 | Even Modulo Pair | brute force probabilities | Statement | B | Codeforces Global Round 30 (Div. 1 + Div. 2) {2164} | PROGRAMMING | 750.0 | Codeforces Global Round 30 Editorial | |
| 11126 | 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 | |
| 491 | Chain Prefix Rank (Hard Version) | combinatorics data structures dp math | Statement | F2 | Codeforces Global Round 30 (Div. 1 + Div. 2) {2164} | PROGRAMMING | 1500.0 | Codeforces Global Round 30 Editorial | |
| 747 | Chain Prefix Rank (Easy Version) | combinatorics dfs and similar dp math | Statement | F1 | Codeforces Global Round 30 (Div. 1 + Div. 2) {2164} | PROGRAMMING | 2500.0 | Codeforces Global Round 30 Editorial | |
| 307 | Rainbow Branch | dp trees | Statement | E | Codeforces Round 1064 (Div. 1) {2165} | PROGRAMMING | 3000.0 | 148452 | |
| 908 | Path Split | dp graph matchings greedy | Statement | D | Codeforces Round 1064 (Div. 1) {2165} | PROGRAMMING | 2500.0 | 148452 | |
| 4838 | Marble Council | dp math | Statement | B | Codeforces Round 1064 (Div. 1) {2165} | PROGRAMMING | 1000.0 | 148452 | |
| 14547 | Cyclic Merging | brute force constructive algorithms graphs greedy trees | Statement | A | Codeforces Round 1064 (Div. 1) {2165} | PROGRAMMING | 500.0 | 148452 | |
| 3861 | Binary Wine | bitmasks greedy | Statement | C | Codeforces Round 1064 (Div. 1) {2165} | PROGRAMMING | 1500.0 | 148452 | |
| 197 | Arctic Acquisition | data structures | Statement | F | Codeforces Round 1064 (Div. 1) {2165} | PROGRAMMING | 4000.0 | 148452 | |
| 18390 | Tab Closing | math | Statement | B | Codeforces Round 1064 (Div. 2) {2166} | PROGRAMMING | 750.0 | Codeforces Round 1064 (Div. 1, Div. 2) Editorial | |
| 23140 | Same Difference | brute force dp strings | Statement | A | Codeforces Round 1064 (Div. 2) {2166} | PROGRAMMING | 500.0 | Codeforces Round 1064 (Div. 1, Div. 2) Editorial | |
| 52628 | Your Name | sortings strings | Statement | B | Codeforces Round 1062 (Div. 4) {2167} | PROGRAMMING | Arpa Video Tutorial | ||
| 30655 | Yet Another Array Problem | brute force math number theory | Statement | D | Codeforces Round 1062 (Div. 4) {2167} | PROGRAMMING | Arpa Video Tutorial | ||
| 7259 | Tree, TREE!!! | data structures dp trees | Statement | F | Codeforces Round 1062 (Div. 4) {2167} | PROGRAMMING | Arpa Video Tutorial | ||
| 59496 | Square? | math | Statement | A | Codeforces Round 1062 (Div. 4) {2167} | PROGRAMMING | Arpa Video Tutorial | ||
| 11191 | Mukhammadali and the Smooth Array | data structures dp | Statement | G | Codeforces Round 1062 (Div. 4) {2167} | PROGRAMMING | Arpa Video Tutorial | ||
| 9225 | khba Loves to Sleep! | binary search data structures geometry implementation math | Statement | E | Codeforces Round 1062 (Div. 4) {2167} | PROGRAMMING | Arpa Video Tutorial | ||
| 36404 | Isamatdin and His Magic Wand! | constructive algorithms greedy implementation sortings | Statement | C | 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) | ||
| 881 | Intercepting Butterflies | bitmasks constructive algorithms graphs interactive | Statement | C | Testing Round 20 (Unrated, Communication Problems) {2168} | PROGRAMMING | Testing Round 20 Editorial (officially unofficial) | ||
| 3398 | Encode and Decode (Hard Version) | bitmasks interactive math | Statement | A2 | Testing Round 20 (Unrated, Communication Problems) {2168} | PROGRAMMING | Testing Round 20 Editorial (officially unofficial) | ||
| 5087 | Encode and Decode (Easy Version) | constructive algorithms interactive | Statement | A1 | Testing Round 20 (Unrated, Communication Problems) {2168} | PROGRAMMING | Testing Round 20 Editorial (officially unofficial) | ||
| 343 | Subsequence Problem | combinatorics dp fft math | Statement | F | Educational Codeforces Round 184 (Rated for Div. 2) {2169} | PROGRAMMING | Educational Codeforces Round 184 Editorial | ||
| 2310 | 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 | ||
| 8698 | 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 | ||
| 12896 | Range Operation | math two pointers | Statement | C | Educational Codeforces Round 184 (Rated for Div. 2) {2169} | PROGRAMMING | Educational Codeforces Round 184 Editorial | ||
| 1096 | Points Selection | dp geometry greedy | Statement | E | Educational Codeforces Round 184 (Rated for Div. 2) {2169} | PROGRAMMING | Educational Codeforces Round 184 Editorial | ||
| 16348 | Drifting Away | implementation implementation implementation implementation implementation | Statement | B | Educational Codeforces Round 184 (Rated for Div. 2) {2169} | PROGRAMMING | Educational Codeforces Round 184 Editorial | ||
| 19396 | Alice and Bob | greedy | Statement | A | Educational Codeforces Round 184 (Rated for Div. 2) {2169} | PROGRAMMING | Educational Codeforces Round 184 Editorial | ||
| 11460 | 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 | ||
| 20192 | Maximum Neighborhood | greedy math | Statement | A | Educational Codeforces Round 185 (Rated for Div. 2) {2170} | PROGRAMMING | Educational Codeforces Round 185 Editorial | ||
| 799 | Build XOR on a Segment | bitmasks dp | Statement | F | Educational Codeforces Round 185 (Rated for Div. 2) {2170} | PROGRAMMING | Educational Codeforces Round 185 Editorial | ||
| 2366 | Binary Strings and Blocks | combinatorics dp | Statement | E | Educational Codeforces Round 185 (Rated for Div. 2) {2170} | PROGRAMMING | Educational Codeforces Round 185 Editorial | ||
| 1708 | Almost Roman | constructive algorithms greedy implementation | Statement | D | Educational Codeforces Round 185 (Rated for Div. 2) {2170} | PROGRAMMING | Educational Codeforces Round 185 Editorial | ||
| 14589 | Addition on a Segment | greedy math | Statement | B | Educational Codeforces Round 185 (Rated for Div. 2) {2170} | PROGRAMMING | Educational Codeforces Round 185 Editorial | ||
| 27452 | Yuu Koito and Minimum Absolute Sum | Statement | B | Codeforces Round 1065 (Div. 3) {2171} | PROGRAMMING | Codeforces Round 1065 (Div. 3) Editorial | |||
| 37576 | Shizuku Hoshikawa and Farm Legs | math | Statement | A | 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 | ||
| 2373 | Sakura Adachi and Optimal Sequences | bitmasks combinatorics greedy math | Statement | G | Codeforces Round 1065 (Div. 3) {2171} | PROGRAMMING | Codeforces Round 1065 (Div. 3) Editorial | ||
| 12056 | Renako Amaori and XOR Game (hard version) | bitmasks games greedy | Statement | C2 | Codeforces Round 1065 (Div. 3) {2171} | PROGRAMMING | Codeforces Round 1065 (Div. 3) Editorial | ||
| 19502 | Renako Amaori and XOR Game (easy version) | games greedy | Statement | C1 | Codeforces Round 1065 (Div. 3) {2171} | PROGRAMMING | Codeforces Round 1065 (Div. 3) Editorial | ||
| 7300 | 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 | ||
| 11843 | 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 | ||
| 3706 | Anisphia Wynn Palettia and Good Permutations | constructive algorithms greedy number theory | Statement | E | Codeforces Round 1065 (Div. 3) {2171} | PROGRAMMING | Codeforces Round 1065 (Div. 3) Editorial | ||
| 573 | Sliding Tiles | Statement | J | 2025 ICPC Asia Taichung Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2172} | PROGRAMMING | ||||
| 303 | Shuffling Cards with Problem Solver 68! | string suffix structures | Statement | H | 2025 ICPC Asia Taichung Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2172} | PROGRAMMING | |||
| 6067 | Number Maze | constructive algorithms implementation | Statement | E | 2025 ICPC Asia Taichung Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2172} | PROGRAMMING | |||
| 166 | New Kingdom | Statement | N | 2025 ICPC Asia Taichung Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2172} | PROGRAMMING | ||||
| 5997 | Maximum Distance To Port | Statement | M | 2025 ICPC Asia Taichung Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2172} | PROGRAMMING | ||||
| 811 | Maximum Color Segment | dp | Statement | L | 2025 ICPC Asia Taichung Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2172} | PROGRAMMING | |||
| 856 | Kindergarten Homework | Statement | K | 2025 ICPC Asia Taichung Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2172} | PROGRAMMING | ||||
| 67 | Gene Editor | Statement | G | 2025 ICPC Asia Taichung Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2172} | PROGRAMMING | ||||
| 104 | Divisor Card Game | Statement | D | 2025 ICPC Asia Taichung Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2172} | PROGRAMMING | ||||
| 4017 | Cluster Computing System | Statement | F | 2025 ICPC Asia Taichung Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2172} | PROGRAMMING | ||||
| 96 | Circles Are Far from Each Other | Statement | C | 2025 ICPC Asia Taichung Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2172} | PROGRAMMING | ||||
| 2174 | Buses | Statement | B | 2025 ICPC Asia Taichung Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2172} | PROGRAMMING | ||||
| 1105 | Birthday | geometry | Statement | I | 2025 ICPC Asia Taichung Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2172} | PROGRAMMING | |||
| 14780 | ASCII Art Contest | implementation | Statement | A | 2025 ICPC Asia Taichung Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2172} | PROGRAMMING | |||
| 3712 | Taiga's Carry Chains | bitmasks brute force dp greedy | Statement | D | Codeforces Round 1068 (Div. 2) {2173} | PROGRAMMING | 1750.0 | ||
| 24014 | Sleeping Through Classes | implementation | Statement | A | Codeforces Round 1068 (Div. 2) {2173} | PROGRAMMING | 500.0 | ||
| 1568 | Shiro's Mirror Duel | interactive probabilities | Statement | E | Codeforces Round 1068 (Div. 2) {2173} | PROGRAMMING | 2250.0 | ||
| 18390 | Niko's Tactical Cards | dp greedy | Statement | B | Codeforces Round 1068 (Div. 2) {2173} | PROGRAMMING | 1000.0 | ||
| 12675 | Kanade's Perfect Multiples | greedy number theory | Statement | C | Codeforces Round 1068 (Div. 2) {2173} | PROGRAMMING | 1250.0 | ||
| 588 | Isla's Memory Thresholds | binary search data structures divide and conquer math | Statement | F | Codeforces Round 1068 (Div. 2) {2173} | PROGRAMMING | 3000.0 | ||
| 4059 | Wishing Cards | dp | Statement | B | Codeforces Round 1069 (Div. 1) {2174} | PROGRAMMING | 1250.0 | Codeforces Round 1069 Editorial | |
| 300 | Secret Message | data structures greedy trees | Statement | D | Codeforces Round 1069 (Div. 1) {2174} | PROGRAMMING | 2750.0 | Codeforces Round 1069 Editorial | |
| 14610 | Needle in a Haystack | greedy strings two pointers | Statement | A | Codeforces Round 1069 (Div. 1) {2174} | PROGRAMMING | 500.0 | Codeforces Round 1069 Editorial | |
| 479 | Mosaic Tree | combinatorics dp fft math trees | Statement | F | Codeforces Round 1069 (Div. 1) {2174} | PROGRAMMING | 3500.0 | Codeforces Round 1069 Editorial | |
| 98 | Game of Scientists (Version 2) | brute force chinese remainder theorem interactive math | Statement | E2 | Codeforces Round 1069 (Div. 1) {2174} | PROGRAMMING | 1750.0 | Codeforces Round 1069 Editorial | |
| 137 | Game of Scientists (Version 1) | chinese remainder theorem interactive math | Statement | E1 | Codeforces Round 1069 (Div. 1) {2174} | PROGRAMMING | 1750.0 | Codeforces Round 1069 Editorial | |
| 1051 | Beautiful Patterns (Hard Version) | math probabilities | Statement | C2 | Codeforces Round 1069 (Div. 1) {2174} | PROGRAMMING | 500.0 | Codeforces Round 1069 Editorial | |
| 1198 | Beautiful Patterns (Easy Version) | math probabilities | Statement | C1 | Codeforces Round 1069 (Div. 1) {2174} | PROGRAMMING | 1500.0 | Codeforces Round 1069 Editorial | |
| 12463 | XOR Array | math | Statement | B | Codeforces Round 1069 (Div. 2) {2175} | PROGRAMMING | 750.0 | Codeforces Round 1069 Editorial | |
| 18974 | Little Fairy's Painting | implementation | Statement | A | Codeforces Round 1069 (Div. 2) {2175} | PROGRAMMING | 500.0 | Codeforces Round 1069 Editorial | |
| 1302 | Remove at the lowest cost | data structures dfs and similar greedy implementation trees | Statement | E | Codeforces Round 1070 (Div. 2) {2176} | PROGRAMMING | 2500.0 | Codeforces Round 1070 (Div.2) Editorial | |
| 23225 | Optimal Shifts | bitmasks greedy strings | Statement | B | Codeforces Round 1070 (Div. 2) {2176} | PROGRAMMING | 1000.0 | Codeforces Round 1070 (Div.2) Editorial | |
| 29389 | Operations with Inversions | data structures greedy implementation | Statement | A | Codeforces Round 1070 (Div. 2) {2176} | PROGRAMMING | 500.0 | Codeforces Round 1070 (Div.2) Editorial | |
| 1519 | Omega Numbers | bitmasks dp math number theory | Statement | F | Codeforces Round 1070 (Div. 2) {2176} | PROGRAMMING | 2750.0 | Codeforces Round 1070 (Div.2) Editorial | |
| 15960 | Odd Process | greedy math sortings | Statement | C | Codeforces Round 1070 (Div. 2) {2176} | PROGRAMMING | 1500.0 | Codeforces Round 1070 (Div.2) Editorial | |
| 5872 | 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 | |
| 26049 | Yes or Yes | brute force greedy strings | Statement | A | Good Bye 2025 {2178} | PROGRAMMING | 500.0 | ||
| 6794 | Xmas or Hysteria | constructive algorithms graphs greedy implementation | Statement | D | Good Bye 2025 {2178} | PROGRAMMING | 1750.0 | ||
| 221 | Numbers or Fireworks | combinatorics dp | Statement | I | Good Bye 2025 {2178} | PROGRAMMING | 4000.0 | ||
| 21867 | Impost or Sus | greedy implementation strings | Statement | B | Good Bye 2025 {2178} | PROGRAMMING | 750.0 | ||
| 3717 | Flatten or Concatenate | binary search divide and conquer interactive | Statement | E | Good Bye 2025 {2178} | PROGRAMMING | 2250.0 | ||
| 15975 | First or Second | dp greedy implementation | Statement | C | Good Bye 2025 {2178} | PROGRAMMING | 1250.0 | ||
| 598 | deCH OR Dations | data structures hashing | Statement | G | Good Bye 2025 {2178} | PROGRAMMING | 3500.0 | ||
| 320 | Create or Duplicate | number theory shortest paths | Statement | H | Good Bye 2025 {2178} | PROGRAMMING | 3750.0 | ||
| 1850 | Conquer or of Forest | combinatorics dfs and similar dsu trees | Statement | F | Good Bye 2025 {2178} | PROGRAMMING | 2750.0 | ||
| 28666 | Blackslex and Showering | greedy implementation | Statement | B | Codeforces Round 1071 (Div. 3) {2179} | PROGRAMMING | Codeforces Round 1071 (Div. 3) Editorial | ||
| 1323 | Blackslex and Plants | bitmasks data structures dp math | Statement | H | Codeforces Round 1071 (Div. 3) {2179} | PROGRAMMING | Codeforces Round 1071 (Div. 3) Editorial | ||
| 1230 | Blackslex and Penguin Migration | brute force interactive math | Statement | G | Codeforces Round 1071 (Div. 3) {2179} | PROGRAMMING | Codeforces Round 1071 (Div. 3) Editorial | ||
| 13713 | Blackslex and Penguin Civilization | bitmasks constructive algorithms greedy math | Statement | D | Codeforces Round 1071 (Div. 3) {2179} | PROGRAMMING | Codeforces Round 1071 (Div. 3) Editorial | ||
| 34754 | Blackslex and Password | math strings | Statement | A | Codeforces Round 1071 (Div. 3) {2179} | PROGRAMMING | Codeforces Round 1071 (Div. 3) Editorial | ||
| 22560 | Blackslex and Number Theory | math number theory sortings sortings | Statement | C | Codeforces Round 1071 (Div. 3) {2179} | PROGRAMMING | Codeforces Round 1071 (Div. 3) Editorial | ||
| 5874 | Blackslex and Girls | constructive algorithms geometry math | Statement | E | Codeforces Round 1071 (Div. 3) {2179} | PROGRAMMING | Codeforces Round 1071 (Div. 3) Editorial | ||
| 2812 | Blackslex and Another RGB Walking | graphs interactive number theory | Statement | F | Codeforces Round 1071 (Div. 3) {2179} | PROGRAMMING | Codeforces Round 1071 (Div. 3) Editorial | ||
| 6530 | XOR-factorization | bitmasks constructive algorithms dp greedy number theory | Statement | C | Codeforces Global Round 31 (Div. 1 + Div. 2) {2180} | PROGRAMMING | 1500.0 | Codeforces Global Round 31 | |
| 1762 | No Effect XOR | bitmasks math | Statement | E | Codeforces Global Round 31 (Div. 1 + Div. 2) {2180} | PROGRAMMING | 2000.0 | Codeforces Global Round 31 | |
| 4302 | Insolvable Disks | greedy math | Statement | D | Codeforces Global Round 31 (Div. 1 + Div. 2) {2180} | PROGRAMMING | 1750.0 | Codeforces Global Round 31 | |
| 229 | Control Car (Hard Version) | combinatorics dp probabilities | Statement | F2 | Codeforces Global Round 31 (Div. 1 + Div. 2) {2180} | PROGRAMMING | 750.0 | Codeforces Global Round 31 | |
| 410 | Control Car (Easy Version) | combinatorics dp probabilities | Statement | F1 | Codeforces Global Round 31 (Div. 1 + Div. 2) {2180} | PROGRAMMING | 2500.0 | Codeforces Global Round 31 | |
| 26053 | Carnival Wheel | brute force number theory | Statement | A | Codeforces Global Round 31 (Div. 1 + Div. 2) {2180} | PROGRAMMING | 500.0 | Codeforces Global Round 31 | |
| 124 | Bug Is Feature (Unconditional Version) | games | Statement | H1 | Codeforces Global Round 31 (Div. 1 + Div. 2) {2180} | PROGRAMMING | 3000.0 | Codeforces Global Round 31 | |
| 109 | Bug Is Feature (Conditional Version) | games | Statement | H2 | Codeforces Global Round 31 (Div. 1 + Div. 2) {2180} | PROGRAMMING | 3000.0 | Codeforces Global Round 31 | |
| 143 | Balance | combinatorics math | Statement | G | Codeforces Global Round 31 (Div. 1 + Div. 2) {2180} | PROGRAMMING | 2750.0 | Codeforces Global Round 31 | |
| 24797 | Ashmal | greedy strings | Statement | B | Codeforces Global Round 31 (Div. 1 + Div. 2) {2180} | PROGRAMMING | 750.0 | Codeforces Global Round 31 | |
| 3586 | Medical Parity | dp | Statement | M | 2025-2026 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2181} | PROGRAMMING | Tutorial | ||
| 142 | LLM Training | math | Statement | L | 2025-2026 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2181} | PROGRAMMING | Tutorial | ||
| 70 | Knit the Grid | Statement | K | 2025-2026 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2181} | PROGRAMMING | Tutorial | |||
| 721 | Jinx or Jackpot | brute force dp math probabilities | Statement | J | 2025-2026 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2181} | PROGRAMMING | Tutorial | ||
| 53 | Irrigation Interlock | geometry | Statement | I | 2025-2026 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2181} | PROGRAMMING | Tutorial | ||
| 6838 | Honey Cake | math number theory | Statement | H | 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 | ||
| 3679 | Fragmented Nim | games | Statement | F | 2025-2026 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2181} | PROGRAMMING | Tutorial | ||
| 149 | 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 | ||
| 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 | ||
| 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 | ||
| 5950 | Battle of Arrays | brute force data structures games greedy | Statement | B | 2025-2026 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2181} | PROGRAMMING | Tutorial | ||
| 3826 | 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 | ||
| 357 | Short Garland | data structures dp trees | Statement | G | Educational Codeforces Round 186 (Rated for Div. 2) {2182} | PROGRAMMING | Educational Codeforces Round 186 Editorial | ||
| 15818 | Production of Snowmen | combinatorics dp | Statement | C | Educational Codeforces Round 186 (Rated for Div. 2) {2182} | PROGRAMMING | Educational Codeforces Round 186 Editorial | ||
| 25642 | New Year String | greedy implementation strings | Statement | A | Educational Codeforces Round 186 (Rated for Div. 2) {2182} | PROGRAMMING | Educational Codeforces Round 186 Editorial | ||
| 5663 | 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 | ||
| 23736 | New Year Cake | brute force implementation | Statement | B | Educational Codeforces Round 186 (Rated for Div. 2) {2182} | PROGRAMMING | Educational Codeforces Round 186 Editorial | ||
| 9128 | Christmas Tree Decoration | combinatorics dp greedy math | Statement | D | Educational Codeforces Round 186 (Rated for Div. 2) {2182} | PROGRAMMING | Educational Codeforces Round 186 Editorial | ||
| 1104 | Christmas Reindeer (hard version) | bitmasks combinatorics dp | Statement | F2 | Educational Codeforces Round 186 (Rated for Div. 2) {2182} | PROGRAMMING | Educational Codeforces Round 186 Editorial | ||
| 1284 | Christmas Reindeer (easy version) | bitmasks combinatorics dp | Statement | F1 | Educational Codeforces Round 186 (Rated for Div. 2) {2182} | PROGRAMMING | Educational Codeforces Round 186 Editorial | ||
| 16335 | Yet Another MEX Problem | constructive algorithms greedy | Statement | B | Hello 2026 {2183} | PROGRAMMING | 1000.0 | ||
| 10863 | War Strategy | binary search greedy math two pointers | Statement | C | Hello 2026 {2183} | PROGRAMMING | 1500.0 | ||
| 2525 | Tree Coloring (Hard Version) | constructive algorithms data structures dfs and similar greedy implementation trees | Statement | D2 | Hello 2026 {2183} | PROGRAMMING | 2000.0 | ||
| 9039 | Tree Coloring (Easy Version) | constructive algorithms dfs and similar greedy trees | Statement | D1 | Hello 2026 {2183} | PROGRAMMING | 1000.0 | ||
| 223 | Snake Instructions | interactive | Statement | G | Hello 2026 {2183} | PROGRAMMING | 4000.0 | ||
| 74 | Pairs Flipping (Hard Version) | constructive algorithms | Statement | I2 | Hello 2026 {2183} | PROGRAMMING | 1000.0 | ||
| 86 | Pairs Flipping (Easy Version) | constructive algorithms | Statement | I1 | Hello 2026 {2183} | PROGRAMMING | 4500.0 | ||
| 162 | Minimise Cost | dp | Statement | H | Hello 2026 {2183} | PROGRAMMING | 4000.0 | ||
| 2895 | LCM is Legendary Counting Master | dp math number theory | Statement | E | Hello 2026 {2183} | PROGRAMMING | 2250.0 | ||
| 1142 | Jumping Man | combinatorics data structures dp trees | Statement | F | Hello 2026 {2183} | PROGRAMMING | 2750.0 | ||
| 23846 | Binary Array Game | games | Statement | A | Hello 2026 {2183} | PROGRAMMING | 500.0 | ||
| 9713 | Unfair Game | combinatorics dp math | Statement | D | Codeforces Round 1072 (Div. 3) {2184} | PROGRAMMING | Codeforces Round 1072 (Div. 3) Editorial | ||
| 38675 | Social Experiment | math | Statement | A | Codeforces Round 1072 (Div. 3) {2184} | PROGRAMMING | Codeforces Round 1072 (Div. 3) Editorial | ||
| 3024 | 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 | ||
| 22221 | Huge Pile | binary search math | Statement | C | Codeforces Round 1072 (Div. 3) {2184} | PROGRAMMING | Codeforces Round 1072 (Div. 3) Editorial | ||
| 24494 | Hourglass | math | Statement | B | Codeforces Round 1072 (Div. 3) {2184} | PROGRAMMING | Codeforces Round 1072 (Div. 3) Editorial | ||
| 5903 | Exquisite Array | combinatorics data structures dsu | Statement | E | Codeforces Round 1072 (Div. 3) {2184} | PROGRAMMING | Codeforces Round 1072 (Div. 3) Editorial | ||
| 4019 | Cherry Tree | dfs and similar dp graphs trees | Statement | F | Codeforces Round 1072 (Div. 3) {2184} | PROGRAMMING | Codeforces Round 1072 (Div. 3) Editorial | ||
| 10505 | The Robotic Rush | binary search implementation two pointers | Statement | E | Codeforces Round 1074 (Div. 4) {2185} | PROGRAMMING | Codeforces Round 1074 (Div. 4) Editorial | ||
| 29605 | Shifted MEX | implementation sortings | Statement | C | Codeforces Round 1074 (Div. 4) {2185} | PROGRAMMING | Codeforces Round 1074 (Div. 4) Editorial | ||
| 41537 | Prefix Max | greedy | Statement | B | Codeforces Round 1074 (Div. 4) {2185} | PROGRAMMING | Codeforces Round 1074 (Div. 4) Editorial | ||
| 44014 | Perfect Root | constructive algorithms math | Statement | A | Codeforces Round 1074 (Div. 4) {2185} | PROGRAMMING | Codeforces Round 1074 (Div. 4) Editorial | ||
| 21083 | OutOfMemoryError | data structures implementation math two pointers | Statement | D | Codeforces Round 1074 (Div. 4) {2185} | PROGRAMMING | Codeforces Round 1074 (Div. 4) Editorial | ||
| 3431 | Mixing MEXes | data structures implementation math | Statement | G | Codeforces Round 1074 (Div. 4) {2185} | PROGRAMMING | Codeforces Round 1074 (Div. 4) 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 | ||
| 5152 | BattleCows | data structures divide and conquer implementation | Statement | F | Codeforces Round 1074 (Div. 4) {2185} | PROGRAMMING | Codeforces Round 1074 (Div. 4) Editorial | ||
| 5421 | Shortest Statement Ever | bitmasks constructive algorithms dp greedy | Statement | B | Codeforces Round 1077 (Div. 1) {2187} | PROGRAMMING | 1250.0 | Codeforces Round 1077 (Div. 1, Div. 2) Editorial | |
| 16182 | 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 | |
| 104 | Many Cartesian Trees | greedy | Statement | G | Codeforces Round 1077 (Div. 1) {2187} | PROGRAMMING | 3000.0 | Codeforces Round 1077 (Div. 1, Div. 2) Editorial | |
| 1410 | Jerry and Tom | data structures dfs and similar games graphs greedy trees | Statement | C | Codeforces Round 1077 (Div. 1) {2187} | PROGRAMMING | 1750.0 | Codeforces Round 1077 (Div. 1, Div. 2) Editorial | |
| 342 | Doors and Keys | data structures dp | Statement | E | Codeforces Round 1077 (Div. 1) {2187} | PROGRAMMING | 2250.0 | Codeforces Round 1077 (Div. 1, Div. 2) Editorial | |
| 658 | Cool Problem | bitmasks brute force divide and conquer dp math | Statement | D | Codeforces Round 1077 (Div. 1) {2187} | PROGRAMMING | 2000.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 | |
| 77 | Al Fine (Counting Version) | dp trees | Statement | F2 | Codeforces Round 1077 (Div. 1) {2187} | PROGRAMMING | 3500.0 | Codeforces Round 1077 (Div. 1, Div. 2) Editorial | |
| 21471 | Seats | greedy | Statement | B | Codeforces Round 1077 (Div. 2) {2188} | PROGRAMMING | 1000.0 | Codeforces Round 1077 (Div. 1, Div. 2) Editorial | |
| 26204 | Divisible Permutation | constructive algorithms | Statement | A | Codeforces Round 1077 (Div. 2) {2188} | PROGRAMMING | 500.0 | Codeforces Round 1077 (Div. 1, Div. 2) Editorial | |
| 230 | 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 | |
| 6305 | XOR-convenience (Hard Version) | bitmasks brute force constructive algorithms math | Statement | C2 | Codeforces Round 1075 (Div. 2) {2189} | PROGRAMMING | 750.0 | Codeforces Round 1075 (Div. 2) Editorial | |
| 14181 | XOR Convenience (Easy Version) | bitmasks brute force constructive algorithms math | Statement | C1 | Codeforces Round 1075 (Div. 2) {2189} | PROGRAMMING | 1250.0 | Codeforces Round 1075 (Div. 2) Editorial | |
| 15666 | The Curse of the Frog | greedy math | Statement | B | Codeforces Round 1075 (Div. 2) {2189} | PROGRAMMING | 1000.0 | Codeforces Round 1075 (Div. 2) Editorial | |
| 24641 | Table with Numbers | greedy implementation | Statement | A | Codeforces Round 1075 (Div. 2) {2189} | PROGRAMMING | 500.0 | Codeforces Round 1075 (Div. 2) Editorial | |
| 848 | Majority Wins? | dp greedy math strings | Statement | E | Codeforces Round 1075 (Div. 2) {2189} | PROGRAMMING | 2500.0 | Codeforces Round 1075 (Div. 2) Editorial | |
| 1978 | 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 | |
| 4039 | Little String (Easy Version) | combinatorics dp math | Statement | D1 | Codeforces Round 1075 (Div. 2) {2189} | PROGRAMMING | 2000.0 | Codeforces Round 1075 (Div. 2) Editorial | |
| 95 | Xor Product | bitmasks dp | Statement | F | Codeforces Round 1073 (Div. 1) {2190} | PROGRAMMING | 3500.0 | Codeforces Round 1073 (Div. 1, Div. 2) Editorial |