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 ... 41 42 43 44 45 46 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 4583 | Gellyfish and Camellia Japonica | constructive algorithms dfs and similar dp graphs greedy | Statement | B | Codeforces Round 1028 (Div. 1) {2115} | PROGRAMMING | 1250.0 | Codeforces Round 1028 (Div.1, Div.2) Editorial | |
| 27195 | Gellyfish and Tricolor Pansy | greedy | Statement | A | Codeforces Round 1028 (Div. 2) {2116} | PROGRAMMING | 500.0 | Codeforces Round 1028 (Div.1, Div.2) Editorial | |
| 17921 | Gellyfish and Baby's Breath | greedy | Statement | B | Codeforces Round 1028 (Div. 2) {2116} | PROGRAMMING | 750.0 | Codeforces Round 1028 (Div.1, Div.2) Editorial | |
| 6069 | Wildflower | combinatorics dfs and similar trees | Statement | F | Codeforces Round 1029 (Div. 3) {2117} | PROGRAMMING | Codeforces Round 1029 (Div. 3) Editorial | ||
| 32582 | Shrink | constructive algorithms | Statement | B | Codeforces Round 1029 (Div. 3) {2117} | PROGRAMMING | Codeforces Round 1029 (Div. 3) Editorial | ||
| 22633 | Retaliation | binary search math | Statement | D | Codeforces Round 1029 (Div. 3) {2117} | PROGRAMMING | Codeforces Round 1029 (Div. 3) Editorial | ||
| 5300 | 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 | ||
| 12217 | Lost Soul | greedy | Statement | E | Codeforces Round 1029 (Div. 3) {2117} | PROGRAMMING | Codeforces Round 1029 (Div. 3) Editorial | ||
| 1009 | Incessant Rain | data structures divide and conquer | Statement | H | Codeforces Round 1029 (Div. 3) {2117} | PROGRAMMING | Codeforces Round 1029 (Div. 3) Editorial | ||
| 38646 | False Alarm | greedy implementation | Statement | A | Codeforces Round 1029 (Div. 3) {2117} | PROGRAMMING | Codeforces Round 1029 (Div. 3) Editorial | ||
| 21505 | Cool Partition | data structures greedy | Statement | C | Codeforces Round 1029 (Div. 3) {2117} | PROGRAMMING | Codeforces Round 1029 (Div. 3) Editorial | ||
| 297 | Shifts and Swaps | graphs hashing strings | Statement | F | Codeforces Round 1030 (Div. 2) {2118} | PROGRAMMING | 3500.0 | Codeforces Round 1030 (Div. 2) Editorial | |
| 2562 | Red Light, Green Light (Hard version) | binary search dfs and similar dp dsu graphs implementation number theory | Statement | D2 | Codeforces Round 1030 (Div. 2) {2118} | PROGRAMMING | 1000.0 | Codeforces Round 1030 (Div. 2) Editorial | |
| 8617 | Red Light, Green Light (Easy version) | brute force dfs and similar dp graphs implementation | Statement | D1 | Codeforces Round 1030 (Div. 2) {2118} | PROGRAMMING | 1250.0 | Codeforces Round 1030 (Div. 2) Editorial | |
| 20403 | Make It Permutation | constructive algorithms | Statement | B | Codeforces Round 1030 (Div. 2) {2118} | PROGRAMMING | 1000.0 | Codeforces Round 1030 (Div. 2) Editorial | |
| 18910 | Make It Beautiful | bitmasks greedy math | Statement | C | Codeforces Round 1030 (Div. 2) {2118} | PROGRAMMING | 1000.0 | Codeforces Round 1030 (Div. 2) Editorial | |
| 1447 | Grid Coloring | constructive algorithms greedy sortings | Statement | E | Codeforces Round 1030 (Div. 2) {2118} | PROGRAMMING | 2500.0 | Codeforces Round 1030 (Div. 2) Editorial | |
| 29403 | Equal Subsequences | constructive algorithms greedy | Statement | A | Codeforces Round 1030 (Div. 2) {2118} | PROGRAMMING | 500.0 | Codeforces Round 1030 (Div. 2) Editorial | |
| 190 | Volcanic Eruptions | dfs and similar dp | Statement | F | Codeforces Round 1035 (Div. 2) {2119} | PROGRAMMING | 3000.0 | Codeforces Round 1035 (Div. 2) Editorial | |
| 3551 | Token Removing | combinatorics dp math | Statement | D | Codeforces Round 1035 (Div. 2) {2119} | PROGRAMMING | 2250.0 | Codeforces Round 1035 (Div. 2) Editorial | |
| 18758 | Line Segments | geometry greedy math | Statement | B | Codeforces Round 1035 (Div. 2) {2119} | PROGRAMMING | 1000.0 | Codeforces Round 1035 (Div. 2) Editorial | |
| 728 | And Constraint | bitmasks dp greedy implementation | Statement | E | Codeforces Round 1035 (Div. 2) {2119} | PROGRAMMING | 2500.0 | Codeforces Round 1035 (Div. 2) Editorial | |
| 16745 | A Good Problem | bitmasks constructive algorithms math | Statement | C | Codeforces Round 1035 (Div. 2) {2119} | PROGRAMMING | 1500.0 | Codeforces Round 1035 (Div. 2) Editorial | |
| 27635 | Add or XOR | greedy math | Statement | A | Codeforces Round 1035 (Div. 2) {2119} | PROGRAMMING | 500.0 | Codeforces Round 1035 (Div. 2) Editorial | |
| 503 | Superb Graphs | 2-sat graphs | Statement | F | Codeforces Round 1033 (Div. 2) and CodeNite 2025 {2120} | PROGRAMMING | 3000.0 | Codeforces Round 1033 (Div. 2) and CodeNite 2025 Editorial | |
| 18035 | Square Pool | chinese remainder theorem geometry | Statement | B | Codeforces Round 1033 (Div. 2) and CodeNite 2025 {2120} | PROGRAMMING | 750.0 | Codeforces Round 1033 (Div. 2) and CodeNite 2025 Editorial | |
| 20567 | Square of Rectangles | geometry math | Statement | A | Codeforces Round 1033 (Div. 2) and CodeNite 2025 {2120} | PROGRAMMING | 500.0 | Codeforces Round 1033 (Div. 2) and CodeNite 2025 Editorial | |
| 5906 | Matrix game | combinatorics math | Statement | D | Codeforces Round 1033 (Div. 2) and CodeNite 2025 {2120} | PROGRAMMING | 1750.0 | Codeforces Round 1033 (Div. 2) and CodeNite 2025 Editorial | |
| 1900 | Lanes of Cars | binary search dp ternary search | Statement | E | Codeforces Round 1033 (Div. 2) and CodeNite 2025 {2120} | PROGRAMMING | 2500.0 | Codeforces Round 1033 (Div. 2) and CodeNite 2025 Editorial | |
| 113 | Eulerian Line Graph | graphs greedy math | Statement | G | Codeforces Round 1033 (Div. 2) and CodeNite 2025 {2120} | PROGRAMMING | 4000.0 | Codeforces Round 1033 (Div. 2) and CodeNite 2025 Editorial | |
| 12950 | 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 | |
| 8321 | Yamakasi | binary search brute force data structures greedy | Statement | F | Codeforces Round 1032 (Div. 3) {2121} | PROGRAMMING | Codeforces Round 1032 (Div. 3) Editorial | ||
| 22259 | Those Who Are With Us | greedy greedy implementation | Statement | C | Codeforces Round 1032 (Div. 3) {2121} | PROGRAMMING | Codeforces Round 1032 (Div. 3) Editorial | ||
| 15097 | Sponsor of Your Problems | greedy strings | Statement | E | Codeforces Round 1032 (Div. 3) {2121} | PROGRAMMING | Codeforces Round 1032 (Div. 3) Editorial | ||
| 39780 | Letter Home | brute force math | Statement | A | Codeforces Round 1032 (Div. 3) {2121} | PROGRAMMING | Codeforces Round 1032 (Div. 3) Editorial | ||
| 2310 | 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 | ||
| 5486 | Gangsta | data structures divide and conquer math sortings | Statement | G | Codeforces Round 1032 (Div. 3) {2121} | PROGRAMMING | Codeforces Round 1032 (Div. 3) Editorial | ||
| 32811 | Above the Clouds | constructive algorithms greedy strings | Statement | B | Codeforces Round 1032 (Div. 3) {2121} | PROGRAMMING | Codeforces Round 1032 (Div. 3) Editorial | ||
| 18638 | 1709 | implementation sortings | Statement | D | Codeforces Round 1032 (Div. 3) {2121} | PROGRAMMING | Codeforces Round 1032 (Div. 3) Editorial | ||
| 914 | Tree Parking | combinatorics math trees | Statement | G | Order Capital Round 1 (Codeforces Round 1038, Div. 1 + Div. 2) {2122} | PROGRAMMING | 4000.0 | Order Capital Round 1 (Codeforces Round 1038, Div. 1 + Div. 2) Editorial | |
| 2671 | Traffic Lights | brute force dp graphs shortest paths | Statement | D | Order Capital Round 1 (Codeforces Round 1038, Div. 1 + Div. 2) {2122} | PROGRAMMING | 2000.0 | Order Capital Round 1 (Codeforces Round 1038, Div. 1 + Div. 2) Editorial | |
| 16243 | Pile Shuffling | greedy math | Statement | B | Order Capital Round 1 (Codeforces Round 1038, Div. 1 + Div. 2) {2122} | PROGRAMMING | 1000.0 | Order Capital Round 1 (Codeforces Round 1038, Div. 1 + Div. 2) Editorial | |
| 9242 | 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 | |
| 1676 | Greedy Grid Counting | dp greedy math | Statement | E | Order Capital Round 1 (Codeforces Round 1038, Div. 1 + Div. 2) {2122} | PROGRAMMING | 2500.0 | Order Capital Round 1 (Codeforces Round 1038, Div. 1 + Div. 2) Editorial | |
| 20248 | Greedy Grid | constructive algorithms greedy | Statement | A | Order Capital Round 1 (Codeforces Round 1038, Div. 1 + Div. 2) {2122} | PROGRAMMING | 500.0 | Order Capital Round 1 (Codeforces Round 1038, Div. 1 + Div. 2) Editorial | |
| 149 | Colorful Polygon | constructive algorithms divide and conquer geometry | Statement | F | Order Capital Round 1 (Codeforces Round 1038, Div. 1 + Div. 2) {2122} | PROGRAMMING | 3250.0 | Order Capital Round 1 (Codeforces Round 1038, Div. 1 + Div. 2) Editorial | |
| 35367 | Tournament | greedy | Statement | B | Codeforces Round 1034 (Div. 3) {2123} | PROGRAMMING | Codeforces Round 1034 (Div. 3) Editorial | ||
| 31568 | Prefix Min and Suffix Max | brute force data structures | Statement | C | Codeforces Round 1034 (Div. 3) {2123} | PROGRAMMING | Codeforces Round 1034 (Div. 3) Editorial | ||
| 3336 | Modular Sorting | brute force data structures math number theory | Statement | G | Codeforces Round 1034 (Div. 3) {2123} | PROGRAMMING | Codeforces Round 1034 (Div. 3) Editorial | ||
| 10027 | Minimize Fixed Points | constructive algorithms number theory | Statement | F | Codeforces Round 1034 (Div. 3) {2123} | PROGRAMMING | Codeforces Round 1034 (Div. 3) Editorial | ||
| 15296 | MEX Count | binary search data structures greedy sortings two pointers | Statement | E | Codeforces Round 1034 (Div. 3) {2123} | PROGRAMMING | Codeforces Round 1034 (Div. 3) Editorial | ||
| 42253 | Blackboard Game | math | Statement | A | Codeforces Round 1034 (Div. 3) {2123} | PROGRAMMING | Codeforces Round 1034 (Div. 3) Editorial | ||
| 22451 | Binary String Battle | constructive algorithms games greedy | Statement | D | Codeforces Round 1034 (Div. 3) {2123} | PROGRAMMING | Codeforces Round 1034 (Div. 3) Editorial | ||
| 15738 | Subset Multiplication | number theory | Statement | C | EPIC Institute of Technology Round Summer 2025 (Codeforces Round 1036, Div. 1 + Div. 2) {2124} | PROGRAMMING | 1250.0 | EPIC Institute of Technology Round Summer 2025 (Codeforces Round 1036, Div. 1 + Div. 2) Editorial | |
| 21451 | Minimise Sum | greedy | Statement | B | EPIC Institute of Technology Round Summer 2025 (Codeforces Round 1036, Div. 1 + Div. 2) {2124} | PROGRAMMING | 1000.0 | EPIC Institute of Technology Round Summer 2025 (Codeforces Round 1036, Div. 1 + Div. 2) Editorial | |
| 400 | Maximise Sum | binary search data structures | Statement | G | EPIC Institute of Technology Round Summer 2025 (Codeforces Round 1036, Div. 1 + Div. 2) {2124} | PROGRAMMING | 4000.0 | EPIC Institute of Technology Round Summer 2025 (Codeforces Round 1036, Div. 1 + Div. 2) Editorial | |
| 4448 | Make it Zero | constructive algorithms math | Statement | E | EPIC Institute of Technology Round Summer 2025 (Codeforces Round 1036, Div. 1 + Div. 2) {2124} | PROGRAMMING | 2000.0 | EPIC Institute of Technology Round Summer 2025 (Codeforces Round 1036, Div. 1 + Div. 2) Editorial | |
| 8767 | 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 | |
| 231 | Longest Good Subsequence | dp math | Statement | H | EPIC Institute of Technology Round Summer 2025 (Codeforces Round 1036, Div. 1 + Div. 2) {2124} | PROGRAMMING | 4750.0 | EPIC Institute of Technology Round Summer 2025 (Codeforces Round 1036, Div. 1 + Div. 2) Editorial | |
| 284 | Lexicographic Partition | constructive algorithms math trees | Statement | I | EPIC Institute of Technology Round Summer 2025 (Codeforces Round 1036, Div. 1 + Div. 2) {2124} | PROGRAMMING | 4750.0 | EPIC Institute of Technology Round Summer 2025 (Codeforces Round 1036, Div. 1 + Div. 2) Editorial | |
| 20116 | 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 | |
| 701 | Appending Permutations (Hard Version) | combinatorics dp | Statement | F2 | EPIC Institute of Technology Round Summer 2025 (Codeforces Round 1036, Div. 1 + Div. 2) {2124} | PROGRAMMING | 2000.0 | EPIC Institute of Technology Round Summer 2025 (Codeforces Round 1036, Div. 1 + Div. 2) Editorial | |
| 2171 | Appending Permutations (Easy Version) | combinatorics dp | Statement | F1 | EPIC Institute of Technology Round Summer 2025 (Codeforces Round 1036, Div. 1 + Div. 2) {2124} | PROGRAMMING | 2000.0 | EPIC Institute of Technology Round Summer 2025 (Codeforces Round 1036, Div. 1 + Div. 2) Editorial | |
| 442 | Timofey and Docker | binary search dp | Statement | F | Educational Codeforces Round 181 (Rated for Div. 2) {2125} | PROGRAMMING | Educational Codeforces Round 181 Editorial | ||
| 1442 | Sets of Complementary Sums | combinatorics dp math two pointers | Statement | E | Educational Codeforces Round 181 (Rated for Div. 2) {2125} | PROGRAMMING | Educational Codeforces Round 181 Editorial | ||
| 9554 | Segments Covering | dp probabilities | Statement | D | Educational Codeforces Round 181 (Rated for Div. 2) {2125} | PROGRAMMING | Educational Codeforces Round 181 Editorial | ||
| 28269 | Left and Down | greedy math number theory | Statement | B | Educational Codeforces Round 181 (Rated for Div. 2) {2125} | PROGRAMMING | Educational Codeforces Round 181 Editorial | ||
| 28459 | Difficult Contest | constructive algorithms implementation sortings strings | Statement | A | Educational Codeforces Round 181 (Rated for Div. 2) {2125} | PROGRAMMING | Educational Codeforces Round 181 Editorial | ||
| 23294 | Count Good Numbers | combinatorics math number theory | Statement | C | Educational Codeforces Round 181 (Rated for Div. 2) {2125} | PROGRAMMING | Educational Codeforces Round 181 Editorial | ||
| 24586 | This Is the Last Time | greedy sortings | Statement | D | Codeforces Round 1037 (Div. 3) {2126} | PROGRAMMING | 144845 | ||
| 52934 | Only One Digit | implementation math | Statement | A | Codeforces Round 1037 (Div. 3) {2126} | PROGRAMMING | 144845 | ||
| 38381 | No Casino in the Mountains | dp greedy | Statement | B | Codeforces Round 1037 (Div. 3) {2126} | PROGRAMMING | 144845 | ||
| 26817 | I Will Definitely Make It | greedy sortings | Statement | C | Codeforces Round 1037 (Div. 3) {2126} | PROGRAMMING | 144845 | ||
| 17477 | G-C-D, Unlucky! | math number theory | Statement | E | Codeforces Round 1037 (Div. 3) {2126} | PROGRAMMING | 144845 | ||
| 1214 | Big Wins! (hard version) | binary search data structures divide and conquer two pointers | Statement | G2 | Codeforces Round 1037 (Div. 3) {2126} | PROGRAMMING | 144845 | ||
| 2534 | Big Wins! (easy version) | binary search binary search two pointers | Statement | G1 | Codeforces Round 1037 (Div. 3) {2126} | PROGRAMMING | 144845 | ||
| 4414 | 1-1-1, Free Tree! | data structures dfs and similar graphs trees | Statement | F | Codeforces Round 1037 (Div. 3) {2126} | PROGRAMMING | 144845 | ||
| 13550 | 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 | |
| 7033 | Root was Built by Love, Broken by Destiny | combinatorics dfs and similar graphs trees | Statement | D | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) {2127} | PROGRAMMING | 2000.0 | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) Editorial | |
| 20623 | Mix Mex Max | constructive algorithms greedy math | Statement | A | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) {2127} | PROGRAMMING | 500.0 | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) Editorial | |
| 124 | Inter Active (Hard Version) | binary search bitmasks constructive algorithms graphs implementation interactive math probabilities | Statement | G2 | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) {2127} | PROGRAMMING | 2750.0 | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) Editorial | |
| 116 | Inter Active (Easy Version) | binary search constructive algorithms interactive interactive | Statement | G1 | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) {2127} | PROGRAMMING | 2750.0 | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) Editorial | |
| 14180 | Hamiiid, Haaamid... Hamid? | games greedy | Statement | B | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) {2127} | PROGRAMMING | 1000.0 | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) Editorial | |
| 1681 | Hamed and AghaBalaSar | combinatorics math | Statement | F | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) {2127} | PROGRAMMING | 3000.0 | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) Editorial | |
| 3989 | Ancient Tree | constructive algorithms data structures dfs and similar dsu greedy trees | Statement | E | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) {2127} | PROGRAMMING | 2500.0 | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) Editorial | |
| 1603 | 23 Rises Again | brute force data structures dfs and similar dp flows graphs implementation probabilities trees | Statement | H | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) {2127} | PROGRAMMING | 4000.0 | Atto Round 1 (Codeforces Round 1041, Div. 1 + Div. 2) Editorial | |
| 12886 | Sum of LDS | combinatorics dp math | Statement | D | Codeforces Round 1039 (Div. 2) {2128} | PROGRAMMING | 1750.0 | Codeforces Round #1039 — Editorial | |
| 816 | Submedians (Hard Version) | binary search constructive algorithms data structures two pointers | Statement | E2 | Codeforces Round 1039 (Div. 2) {2128} | PROGRAMMING | 1750.0 | Codeforces Round #1039 — Editorial | |
| 6832 | Submedians (Easy Version) | binary search data structures dp greedy | Statement | E1 | Codeforces Round 1039 (Div. 2) {2128} | PROGRAMMING | 1750.0 | Codeforces Round #1039 — Editorial | |
| 401 | Strict Triangle | graphs shortest paths | Statement | F | Codeforces Round 1039 (Div. 2) {2128} | PROGRAMMING | 4000.0 | Codeforces Round #1039 — Editorial | |
| 29086 | Recycling Center | greedy sortings | Statement | A | Codeforces Round 1039 (Div. 2) {2128} | PROGRAMMING | 500.0 | Codeforces Round #1039 — Editorial | |
| 21381 | Leftmost Below | greedy | Statement | C | Codeforces Round 1039 (Div. 2) {2128} | PROGRAMMING | 1250.0 | Codeforces Round #1039 — Editorial | |
| 22041 | Deque Process | constructive algorithms greedy sortings two pointers | Statement | B | Codeforces Round 1039 (Div. 2) {2128} | PROGRAMMING | 1000.0 | Codeforces Round #1039 — Editorial | |
| 106 | Top-K Tracker (Hard Version) | interactive interactive | Statement | F2 | Codeforces Round 1040 (Div. 1) {2129} | PROGRAMMING | 2500.0 | Codeforces Round 1040 (Div. 1, Div. 2) Editorial | |
| 354 | Top-K Tracker (Easy Version) | interactive | Statement | F1 | Codeforces Round 1040 (Div. 1) {2129} | PROGRAMMING | 2500.0 | Codeforces Round 1040 (Div. 1, Div. 2) Editorial | |
| 14516 | Stay or Mirror | constructive algorithms data structures dp greedy | Statement | B | Codeforces Round 1040 (Div. 1) {2129} | PROGRAMMING | 1000.0 | Codeforces Round 1040 (Div. 1, Div. 2) Editorial | |
| 2167 | Permutation Blackhole | combinatorics dp | Statement | D | Codeforces Round 1040 (Div. 1) {2129} | PROGRAMMING | 2000.0 | Codeforces Round 1040 (Div. 1, Div. 2) Editorial | |
| 2857 | Interactive RBS (Medium Version) | binary search bitmasks constructive algorithms interactive | Statement | C2 | Codeforces Round 1040 (Div. 1) {2129} | PROGRAMMING | 750.0 | Codeforces Round 1040 (Div. 1, Div. 2) Editorial | |
| 1787 | Interactive RBS (Hard Version) | binary search bitmasks constructive algorithms dp interactive | Statement | C3 | Codeforces Round 1040 (Div. 1) {2129} | PROGRAMMING | 750.0 | Codeforces Round 1040 (Div. 1, Div. 2) Editorial | |
| 4214 | Interactive RBS (Easy Version) | binary search bitmasks constructive algorithms interactive | Statement | C1 | Codeforces Round 1040 (Div. 1) {2129} | PROGRAMMING | 750.0 | Codeforces Round 1040 (Div. 1, Div. 2) Editorial | |
| 545 | 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 | |
| 17804 | Double Perspective | constructive algorithms dp dsu greedy | Statement | A | Codeforces Round 1040 (Div. 1) {2129} | PROGRAMMING | 500.0 | Codeforces Round 1040 (Div. 1, Div. 2) Editorial | |
| 29098 | Submission is All You Need | greedy math | Statement | A | Codeforces Round 1040 (Div. 2) {2130} | PROGRAMMING | 500.0 | Codeforces Round 1040 (Div. 1, Div. 2) Editorial | |
| 22036 | Pathless | constructive algorithms | Statement | B | Codeforces Round 1040 (Div. 2) {2130} | PROGRAMMING | 1000.0 | Codeforces Round 1040 (Div. 1, Div. 2) Editorial | |
| 3879 | Wafu! | bitmasks brute force dp math | Statement | G | Codeforces Round 1042 (Div. 3) {2131} | PROGRAMMING | Codeforces Round 1042 (Div. 3) Editorial | ||
| 4812 | Unjust Binary Life | binary search binary search data structures greedy greedy math two pointers | Statement | F | Codeforces Round 1042 (Div. 3) {2131} | PROGRAMMING | Codeforces Round 1042 (Div. 3) Editorial | ||
| 906 | Sea, You & copriMe | brute force combinatorics constructive algorithms graphs greedy math number theory | Statement | H | Codeforces Round 1042 (Div. 3) {2131} | PROGRAMMING | Codeforces Round 1042 (Div. 3) Editorial | ||
| 22243 | Make it Equal | math number theory | Statement | C | Codeforces Round 1042 (Div. 3) {2131} | PROGRAMMING | Codeforces Round 1042 (Div. 3) Editorial | ||
| 39573 | Lever | math | Statement | A | Codeforces Round 1042 (Div. 3) {2131} | PROGRAMMING | Codeforces Round 1042 (Div. 3) Editorial | ||
| 14803 | Arboris Contractio | graphs greedy trees | Statement | D | Codeforces Round 1042 (Div. 3) {2131} | PROGRAMMING | Codeforces Round 1042 (Div. 3) Editorial | ||
| 31455 | Alternating Series | constructive algorithms greedy math | Statement | B | Codeforces Round 1042 (Div. 3) {2131} | PROGRAMMING | Codeforces Round 1042 (Div. 3) Editorial | ||
| 17694 | Adjacent XOR | greedy | Statement | E | Codeforces Round 1042 (Div. 3) {2131} | PROGRAMMING | Codeforces Round 1042 (Div. 3) Editorial | ||
| 34375 | The Secret Number | math | Statement | B | Codeforces Round 1043 (Div. 3) {2132} | PROGRAMMING | Codeforces Round 1043 (Div. 3) Editorial | ||
| 13720 | The Cunning Seller (hard version) | binary search greedy math | Statement | C2 | Codeforces Round 1043 (Div. 3) {2132} | PROGRAMMING | Codeforces Round 1043 (Div. 3) Editorial | ||
| 28475 | The Cunning Seller (easy version) | greedy math | Statement | C1 | Codeforces Round 1043 (Div. 3) {2132} | PROGRAMMING | Codeforces Round 1043 (Div. 3) Editorial | ||
| 2860 | Rada and the Chamomile Valley | dfs and similar graphs shortest paths | Statement | F | Codeforces Round 1043 (Div. 3) {2132} | PROGRAMMING | Codeforces Round 1043 (Div. 3) Editorial | ||
| 44837 | Homework | brute force implementation strings | Statement | A | Codeforces Round 1043 (Div. 3) {2132} | PROGRAMMING | Codeforces Round 1043 (Div. 3) Editorial | ||
| 9122 | From 1 to Infinity | binary search dp implementation math | Statement | D | Codeforces Round 1043 (Div. 3) {2132} | PROGRAMMING | Codeforces Round 1043 (Div. 3) Editorial | ||
| 526 | Famous Choreographer | hashing strings | Statement | G | Codeforces Round 1043 (Div. 3) {2132} | PROGRAMMING | Codeforces Round 1043 (Div. 3) Editorial | ||
| 7891 | Arithmetics Competition | binary search data structures greedy ternary search | Statement | E | Codeforces Round 1043 (Div. 3) {2132} | PROGRAMMING | Codeforces Round 1043 (Div. 3) Editorial | ||
| 26206 | Villagers | greedy | Statement | B | Codeforces Round 1044 (Div. 2) {2133} | PROGRAMMING | 1000.0 | Codeforces Round 1044 (Div. 2) Editorial | |
| 13318 | The Nether | graphs interactive | Statement | C | Codeforces Round 1044 (Div. 2) {2133} | PROGRAMMING | 1750.0 | Codeforces Round 1044 (Div. 2) Editorial | |
| 31810 | Redstone? | brute force implementation math | Statement | A | Codeforces Round 1044 (Div. 2) {2133} | PROGRAMMING | 500.0 | Codeforces Round 1044 (Div. 2) Editorial | |
| 1785 | I Yearned For The Mines | constructive algorithms dfs and similar trees | Statement | E | Codeforces Round 1044 (Div. 2) {2133} | PROGRAMMING | 2750.0 | Codeforces Round 1044 (Div. 2) Editorial | |
| 488 | Flint and Steel | data structures dp | Statement | F | Codeforces Round 1044 (Div. 2) {2133} | PROGRAMMING | 3250.0 | Codeforces Round 1044 (Div. 2) Editorial | |
| 7786 | Chicken Jockey | binary search brute force dp greedy math | Statement | D | Codeforces Round 1044 (Div. 2) {2133} | PROGRAMMING | 2250.0 | Codeforces Round 1044 (Div. 2) Editorial | |
| 3758 | Sliding Tree | constructive algorithms dfs and similar trees | Statement | D | Codeforces Round 1045 (Div. 2) {2134} | PROGRAMMING | 2000.0 | 145832 | |
| 2494 | Power Boxes | constructive algorithms dp interactive | Statement | E | Codeforces Round 1045 (Div. 2) {2134} | PROGRAMMING | 2250.0 | 145832 | |
| 708 | Permutation Oddness | combinatorics dp | Statement | F | Codeforces Round 1045 (Div. 2) {2134} | PROGRAMMING | 2750.0 | 145832 | |
| 27343 | Painting With Two Colors | constructive algorithms implementation math | Statement | A | Codeforces Round 1045 (Div. 2) {2134} | PROGRAMMING | 500.0 | 145832 | |
| 19449 | Even Larger | greedy greedy | Statement | C | Codeforces Round 1045 (Div. 2) {2134} | PROGRAMMING | 1250.0 | 145832 | |
| 21820 | Add 0 or K | constructive algorithms math number theory | Statement | B | Codeforces Round 1045 (Div. 2) {2134} | PROGRAMMING | 1250.0 | 145832 | |
| 310 | To the Infinity | data structures hashing math trees | Statement | F | Codeforces Round 1046 (Div. 1) {2135} | PROGRAMMING | 4000.0 | Codeforces Round 1046 (Div. 1, Div. 2) Editorial | |
| 1146 | From the Unknown (Hard Version) | binary search brute force constructive algorithms interactive math | Statement | D2 | Codeforces Round 1046 (Div. 1) {2135} | PROGRAMMING | 1250.0 | Codeforces Round 1046 (Div. 1, Div. 2) Editorial | |
| 3032 | From the Unknown (Easy Version) | constructive algorithms interactive math | Statement | D1 | Codeforces Round 1046 (Div. 1) {2135} | PROGRAMMING | 1250.0 | Codeforces Round 1046 (Div. 1, Div. 2) Editorial | |
| 8172 | For the Champion | constructive algorithms interactive math | Statement | B | Codeforces Round 1046 (Div. 1) {2135} | PROGRAMMING | 1000.0 | Codeforces Round 1046 (Div. 1, Div. 2) Editorial | |
| 4887 | By the Assignment | bitmasks dfs and similar dsu graphs | Statement | C | Codeforces Round 1046 (Div. 1) {2135} | PROGRAMMING | 1750.0 | Codeforces Round 1046 (Div. 1, Div. 2) Editorial | |
| 180 | Beyond the Palindrome (Hard Version) | combinatorics dp math number theory | Statement | E2 | Codeforces Round 1046 (Div. 1) {2135} | PROGRAMMING | 2000.0 | Codeforces Round 1046 (Div. 1, Div. 2) Editorial | |
| 539 | Beyond the Palindrome (Easy Version) | combinatorics dp math | Statement | E1 | Codeforces Round 1046 (Div. 1) {2135} | PROGRAMMING | 3000.0 | Codeforces Round 1046 (Div. 1, Div. 2) Editorial | |
| 19698 | Against the Difference | data structures dp | Statement | A | Codeforces Round 1046 (Div. 1) {2135} | PROGRAMMING | 500.0 | Codeforces Round 1046 (Div. 1, Div. 2) Editorial | |
| 21640 | Like the Bitset | constructive algorithms greedy two pointers | Statement | B | Codeforces Round 1046 (Div. 2) {2136} | PROGRAMMING | 1000.0 | Codeforces Round 1046 (Div. 1, Div. 2) Editorial | |
| 26879 | In the Dream | greedy math | Statement | A | Codeforces Round 1046 (Div. 2) {2136} | PROGRAMMING | 500.0 | Codeforces Round 1046 (Div. 1, Div. 2) Editorial | |
| 20284 | Replace with Occurrences | constructive algorithms | Statement | D | Codeforces Round 1047 (Div. 3) {2137} | PROGRAMMING | Codeforces Round 1047 (Div. 3) Editorial | ||
| 4165 | Prefix Maximum Invariance | binary search data structures sortings | Statement | F | Codeforces Round 1047 (Div. 3) {2137} | PROGRAMMING | Codeforces Round 1047 (Div. 3) Editorial | ||
| 10604 | Mexification | implementation math | Statement | E | Codeforces Round 1047 (Div. 3) {2137} | PROGRAMMING | Codeforces Round 1047 (Div. 3) Editorial | ||
| 23663 | Maximum Even Sum | brute force greedy implementation math | Statement | C | Codeforces Round 1047 (Div. 3) {2137} | PROGRAMMING | Codeforces Round 1047 (Div. 3) Editorial | ||
| 27262 | Fun Permutation | constructive algorithms math number theory | Statement | B | Codeforces Round 1047 (Div. 3) {2137} | PROGRAMMING | Codeforces Round 1047 (Div. 3) Editorial | ||
| 2000 | Cry Me a River | dfs and similar dp games graphs | Statement | G | Codeforces Round 1047 (Div. 3) {2137} | PROGRAMMING | Codeforces Round 1047 (Div. 3) Editorial | ||
| 36189 | Collatz Conjecture | constructive algorithms math | Statement | A | Codeforces Round 1047 (Div. 3) {2137} | PROGRAMMING | Codeforces Round 1047 (Div. 3) Editorial | ||
| 93 | Ode to the Bridge Builder | constructive algorithms | Statement | F | Codeforces Round 1048 (Div. 1) {2138} | PROGRAMMING | 4250.0 | Codeforces Round 1048 (Div. 1, Div. 2) Editorial | |
| 3535 | Maple and Tree Beauty (Hard Version) | bitmasks brute force dfs and similar divide and conquer dp fft trees | Statement | C2 | Codeforces Round 1048 (Div. 1) {2138} | PROGRAMMING | 750.0 | Codeforces Round 1048 (Div. 1, Div. 2) Editorial | |
| 5673 | Maple and Tree Beauty (Easy Version) | dfs and similar dp graphs trees | Statement | C1 | Codeforces Round 1048 (Div. 1) {2138} | PROGRAMMING | 1250.0 | Codeforces Round 1048 (Div. 1, Div. 2) Editorial | |
| 196 | Determinant Construction (Hard Version) | constructive algorithms matrices | Statement | E2 | Codeforces Round 1048 (Div. 1) {2138} | PROGRAMMING | 1500.0 | Codeforces Round 1048 (Div. 1, Div. 2) Editorial | |
| 268 | Determinant Construction (Easy Version) | constructive algorithms matrices | Statement | E1 | Codeforces Round 1048 (Div. 1) {2138} | PROGRAMMING | 2750.0 | Codeforces Round 1048 (Div. 1, Div. 2) Editorial | |
| 17696 | Cake Assignment | bitmasks constructive algorithms | Statement | A | Codeforces Round 1048 (Div. 1) {2138} | PROGRAMMING | 500.0 | Codeforces Round 1048 (Div. 1, Div. 2) Editorial | |
| 5630 | Antiamuny Wants to Learn Swap | data structures greedy | Statement | B | Codeforces Round 1048 (Div. 1) {2138} | PROGRAMMING | 1250.0 | Codeforces Round 1048 (Div. 1, Div. 2) Editorial | |
| 678 | Antiamuny and Slider Movement | binary search brute force combinatorics implementation math | Statement | D | Codeforces Round 1048 (Div. 1) {2138} | PROGRAMMING | 2500.0 | Codeforces Round 1048 (Div. 1, Div. 2) Editorial | |
| 26604 | Maple and Multiplication | greedy math | Statement | A | Codeforces Round 1048 (Div. 2) {2139} | PROGRAMMING | 500.0 | Codeforces Round 1048 (Div. 1, Div. 2) Editorial | |
| 21459 | Cake Collection | greedy | Statement | B | Codeforces Round 1048 (Div. 2) {2139} | PROGRAMMING | 1000.0 | Codeforces Round 1048 (Div. 1, Div. 2) Editorial | |
| 13051 | Ultimate Value | data structures games greedy | Statement | C | Codeforces Round 1049 (Div. 2) {2140} | PROGRAMMING | 1250.0 | Codeforces Round 1049 (Div. 2) Editorial | |
| 337 | Sum Minimisation | number theory | Statement | F | Codeforces Round 1049 (Div. 2) {2140} | PROGRAMMING | 2750.0 | Codeforces Round 1049 (Div. 2) Editorial | |
| 22978 | Shift Sort | greedy sortings strings | Statement | A | Codeforces Round 1049 (Div. 2) {2140} | PROGRAMMING | 500.0 | Codeforces Round 1049 (Div. 2) Editorial | |
| 1288 | Prime Gaming (Hard Version) | bitmasks combinatorics dp probabilities | Statement | E2 | Codeforces Round 1049 (Div. 2) {2140} | PROGRAMMING | 1000.0 | Codeforces Round 1049 (Div. 2) Editorial | |
| 2212 | Prime Gaming (Easy Version) | bitmasks combinatorics dp | Statement | E1 | Codeforces Round 1049 (Div. 2) {2140} | PROGRAMMING | 1750.0 | Codeforces Round 1049 (Div. 2) Editorial | |
| 23102 | Another Divisibility Problem | constructive algorithms math number theory | Statement | B | Codeforces Round 1049 (Div. 2) {2140} | PROGRAMMING | 1000.0 | Codeforces Round 1049 (Div. 2) Editorial | |
| 5187 | 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 | |
| 261 | Perfect Cut | *special dp greedy | Statement | E | Kotlin Heroes: Episode 13 {2141} | PROGRAMMING | Kotlin Heroes 13 Editorial | ||
| 352 | Minimum on Subarrays | *special brute force | Statement | C | Kotlin Heroes: Episode 13 {2141} | PROGRAMMING | Kotlin Heroes 13 Editorial | ||
| 85 | Merging Vertices in a Graph | *special dfs and similar dsu graphs | Statement | H | Kotlin Heroes: Episode 13 {2141} | PROGRAMMING | Kotlin Heroes 13 Editorial | ||
| 64 | Good Robot Paths | *special data structures geometry sortings | Statement | G | Kotlin Heroes: Episode 13 {2141} | PROGRAMMING | Kotlin Heroes 13 Editorial | ||
| 1532 | Games | *special greedy | Statement | B | Kotlin Heroes: Episode 13 {2141} | PROGRAMMING | Kotlin Heroes 13 Editorial | ||
| 1682 | Furniture Store | *special implementation | Statement | A | Kotlin Heroes: Episode 13 {2141} | PROGRAMMING | Kotlin Heroes 13 Editorial | ||
| 63 | Color the Tree | *special | Statement | I | Kotlin Heroes: Episode 13 {2141} | PROGRAMMING | Kotlin Heroes 13 Editorial | ||
| 484 | Avoid Minimums | *special greedy math | Statement | D | Kotlin Heroes: Episode 13 {2141} | PROGRAMMING | Kotlin Heroes 13 Editorial | ||
| 145 | Array Reduction | *special greedy | Statement | F | Kotlin Heroes: Episode 13 {2141} | PROGRAMMING | Kotlin Heroes 13 Editorial | ||
| 14826 | Max Tree | dfs and similar graphs greedy | Statement | C | Codeforces Round 1051 (Div. 2) {2143} | PROGRAMMING | 1500.0 | Codeforces Round 1051 (Div. 2) Editorial | |
| 2107 | Make Good | constructive algorithms math strings | Statement | E | Codeforces Round 1051 (Div. 2) {2143} | PROGRAMMING | 2500.0 | Codeforces Round 1051 (Div. 2) Editorial | |
| 2976 | Inversion Graph Coloring (Hard Version) | binary search data structures dp two pointers | Statement | D2 | Codeforces Round 1051 (Div. 2) {2143} | PROGRAMMING | 1000.0 | Codeforces Round 1051 (Div. 2) Editorial | |
| 6754 | Inversion Graph Coloring (Easy Version) | binary search data structures dp two pointers | Statement | D1 | Codeforces Round 1051 (Div. 2) {2143} | PROGRAMMING | 1750.0 | Codeforces Round 1051 (Div. 2) Editorial | |
| 451 | Increasing Xor | data structures math | Statement | F | Codeforces Round 1051 (Div. 2) {2143} | PROGRAMMING | 3000.0 | Codeforces Round 1051 (Div. 2) Editorial | |
| 21938 | Discounts | greedy sortings two pointers | Statement | B | Codeforces Round 1051 (Div. 2) {2143} | PROGRAMMING | 1000.0 | Codeforces Round 1051 (Div. 2) Editorial | |
| 21414 | All Lengths Subtraction | two pointers | Statement | A | Codeforces Round 1051 (Div. 2) {2143} | PROGRAMMING | 500.0 | Codeforces Round 1051 (Div. 2) Editorial | |
| 7341 | Price Tags | dp math | Statement | D | Educational Codeforces Round 182 (Rated for Div. 2) {2144} | PROGRAMMING | Educational Codeforces Round 182 Editorial | ||
| 15635 | Non-Descending Arrays | combinatorics dp | Statement | C | Educational Codeforces Round 182 (Rated for Div. 2) {2144} | PROGRAMMING | Educational Codeforces Round 182 Editorial | ||
| 19218 | Maximum Cost Permutation | constructive algorithms greedy | Statement | B | Educational Codeforces Round 182 (Rated for Div. 2) {2144} | PROGRAMMING | Educational Codeforces Round 182 Editorial | ||
| 2733 | Looking at Towers (easy version) | combinatorics dp implementation | Statement | E1 | Educational Codeforces Round 182 (Rated for Div. 2) {2144} | PROGRAMMING | Educational Codeforces Round 182 Editorial | ||
| 1529 | Looking at Towers (difficult version) | combinatorics data structures dp implementation | Statement | E2 | Educational Codeforces Round 182 (Rated for Div. 2) {2144} | PROGRAMMING | Educational Codeforces Round 182 Editorial | ||
| 22256 | Cut the Array | brute force math number theory | Statement | A | Educational Codeforces Round 182 (Rated for Div. 2) {2144} | PROGRAMMING | Educational Codeforces Round 182 Editorial | ||
| 1082 | Bracket Groups | constructive algorithms dp strings | Statement | F | Educational Codeforces Round 182 (Rated for Div. 2) {2144} | PROGRAMMING | Educational Codeforces Round 182 Editorial | ||
| 3239 | Predicting Popularity | binary search data structures math sortings | Statement | E | Educational Codeforces Round 183 (Rated for Div. 2) {2145} | PROGRAMMING | Educational Codeforces Round 183 Editorial | ||
| 16099 | Monocarp's String | binary search greedy strings | Statement | C | Educational Codeforces Round 183 (Rated for Div. 2) {2145} | PROGRAMMING | Educational Codeforces Round 183 Editorial | ||
| 1059 | Long Journey | dfs and similar dp graphs matrices number theory shortest paths | Statement | F | Educational Codeforces Round 183 (Rated for Div. 2) {2145} | PROGRAMMING | Educational Codeforces Round 183 Editorial | ||
| 7010 | Inversion Value of a Permutation | constructive algorithms dfs and similar dp math | Statement | D | Educational Codeforces Round 183 (Rated for Div. 2) {2145} | PROGRAMMING | Educational Codeforces Round 183 Editorial | ||
| 22345 | Deck of Cards | greedy implementation | Statement | B | Educational Codeforces Round 183 (Rated for Div. 2) {2145} | PROGRAMMING | Educational Codeforces Round 183 Editorial | ||
| 640 | Cost of Coloring | combinatorics fft math | Statement | G | Educational Codeforces Round 183 (Rated for Div. 2) {2145} | PROGRAMMING | Educational Codeforces Round 183 Editorial | ||
| 31870 | Candies for Nephews | brute force math | Statement | A | Educational Codeforces Round 183 (Rated for Div. 2) {2145} | PROGRAMMING | Educational Codeforces Round 183 Editorial | ||
| 2181 | Yet Another MEX Problem | brute force constructive algorithms data structures greedy | Statement | E | Codeforces Round 1052 (Div. 2) {2146} | PROGRAMMING | 2500.0 | Codeforces Round 1052 (Div. 2) Editorial | |
| 13919 | Wrong Binary Search | binary search constructive algorithms | Statement | C | Codeforces Round 1052 (Div. 2) {2146} | PROGRAMMING | 1250.0 | Codeforces Round 1052 (Div. 2) Editorial | |
| 16573 | Merging the Sets | greedy implementation | Statement | B | Codeforces Round 1052 (Div. 2) {2146} | PROGRAMMING | 1000.0 | Codeforces Round 1052 (Div. 2) Editorial | |
| 4252 | Max Sum OR (Hard Version) | bitmasks constructive algorithms divide and conquer greedy | Statement | D2 | Codeforces Round 1052 (Div. 2) {2146} | PROGRAMMING | 1000.0 | Codeforces Round 1052 (Div. 2) Editorial | |
| 11096 | Max Sum OR (Easy Version) | bitmasks constructive algorithms divide and conquer greedy trees | Statement | D1 | Codeforces Round 1052 (Div. 2) {2146} | PROGRAMMING | 1500.0 | Codeforces Round 1052 (Div. 2) Editorial | |
| 22413 | Equal Occurrences | brute force greedy implementation | Statement | A | Codeforces Round 1052 (Div. 2) {2146} | PROGRAMMING | 500.0 | Codeforces Round 1052 (Div. 2) Editorial | |
| 332 | Bubble Sort | brute force combinatorics dp | Statement | F | Codeforces Round 1052 (Div. 2) {2146} | PROGRAMMING | 3500.0 | Codeforces Round 1052 (Div. 2) Editorial | |
| 19696 | Shortest Increasing Path | constructive algorithms | Statement | A | Codeforces Global Round 29 (Div. 1 + Div. 2) {2147} | PROGRAMMING | 500.0 | ||
| 10855 | Rabbits | 2-sat dp graphs greedy implementation | Statement | C | Codeforces Global Round 29 (Div. 1 + Div. 2) {2147} | PROGRAMMING | 1500.0 | ||
| 18214 | Multiple Construction | constructive algorithms | Statement | B | Codeforces Global Round 29 (Div. 1 + Div. 2) {2147} | PROGRAMMING | 1000.0 | ||
| 646 | Modular Tetration | combinatorics math number theory | Statement | G | Codeforces Global Round 29 (Div. 1 + Div. 2) {2147} | PROGRAMMING | 4500.0 | ||
| 2217 | Maximum OR Popcount | binary search bitmasks brute force data structures greedy | Statement | E | Codeforces Global Round 29 (Div. 1 + Div. 2) {2147} | PROGRAMMING | 2500.0 | ||
| 266 | Maxflow GCD Coloring | flows graphs | Statement | H | Codeforces Global Round 29 (Div. 1 + Div. 2) {2147} | PROGRAMMING | 5500.0 | ||
| 112 | Longest Increasing Path (Hard Version) | constructive algorithms | Statement | I2 | Codeforces Global Round 29 (Div. 1 + Div. 2) {2147} | PROGRAMMING | 3500.0 | ||
| 142 | Longest Increasing Path (Easy Version) | constructive algorithms | Statement | I1 | Codeforces Global Round 29 (Div. 1 + Div. 2) {2147} | PROGRAMMING | 4000.0 | ||
| 8121 | Game on Array | games greedy | Statement | D | Codeforces Global Round 29 (Div. 1 + Div. 2) {2147} | PROGRAMMING | 2000.0 | ||
| 943 | Exchange Queries | data structures greedy | Statement | F | Codeforces Global Round 29 (Div. 1 + Div. 2) {2147} | PROGRAMMING | 3000.0 | ||
| 49200 | Sublime Sequence | brute force math | Statement | A | Codeforces Round 1050 (Div. 4) {2148} | PROGRAMMING | Codeforces Round 1050 (Div. 4) Editorial | ||
| 14635 | Split | two pointers | Statement | E | Codeforces Round 1050 (Div. 4) {2148} | PROGRAMMING | Codeforces Round 1050 (Div. 4) Editorial | ||
| 26104 | Pacer | greedy math | Statement | C | Codeforces Round 1050 (Div. 4) {2148} | PROGRAMMING | Codeforces Round 1050 (Div. 4) Editorial | ||
| 34023 | Lasers | geometry | Statement | B | Codeforces Round 1050 (Div. 4) {2148} | PROGRAMMING | Codeforces Round 1050 (Div. 4) Editorial | ||
| 6858 | Gravity Falls | greedy implementation sortings | Statement | F | Codeforces Round 1050 (Div. 4) {2148} | PROGRAMMING | Codeforces Round 1050 (Div. 4) Editorial | ||
| 4324 | Farmer John's Last Wish | data structures math number theory | Statement | G | Codeforces Round 1050 (Div. 4) {2148} | PROGRAMMING | Codeforces Round 1050 (Div. 4) Editorial | ||
| 27672 | Destruction of the Dandelion Fields | greedy sortings | Statement | D | Codeforces Round 1050 (Div. 4) {2148} | PROGRAMMING | Codeforces Round 1050 (Div. 4) Editorial | ||
| 33769 | Unconventional Pairs | greedy sortings | Statement | B | Codeforces Round 1054 (Div. 3) {2149} | PROGRAMMING | __rose | ||
| 4985 | Nezuko in the Clearing | binary search math ternary search | Statement | F | Codeforces Round 1054 (Div. 3) {2149} | PROGRAMMING | __rose | ||
| 29022 | MEX rose | greedy | Statement | C | Codeforces Round 1054 (Div. 3) {2149} | PROGRAMMING | __rose | ||
| 9686 | Hidden Knowledge of the Ancients | data structures two pointers | Statement | E | Codeforces Round 1054 (Div. 3) {2149} | PROGRAMMING | __rose | ||
| 2773 | Buratsuta 3 | binary search brute force data structures divide and conquer probabilities | Statement | G | Codeforces Round 1054 (Div. 3) {2149} | PROGRAMMING | __rose | ||
| 42166 | Be Positive | math | Statement | A | Codeforces Round 1054 (Div. 3) {2149} | PROGRAMMING | __rose | ||
| 20155 | A and B | strings | Statement | D | Codeforces Round 1054 (Div. 3) {2149} | PROGRAMMING | __rose | ||
| 3340 | Limited Edition Shop | data structures dp | Statement | C | Codeforces Round 1053 (Div. 1) {2150} | PROGRAMMING | 1750.0 | Editorial of Codeforces Round 1053 (Div. 1, Div. 2) | |
| 12834 | Incremental Path | data structures implementation | Statement | A | Codeforces Round 1053 (Div. 1) {2150} | PROGRAMMING | 500.0 | Editorial of Codeforces Round 1053 (Div. 1, Div. 2) | |
| 659 | Hidden Single (Version 2) | divide and conquer interactive math probabilities | Statement | E2 | Codeforces Round 1053 (Div. 1) {2150} | PROGRAMMING | 1750.0 | Editorial of Codeforces Round 1053 (Div. 1, Div. 2) | |
| 1887 | 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) | |
| 7020 | Grid Counting | combinatorics math | Statement | B | Codeforces Round 1053 (Div. 1) {2150} | PROGRAMMING | 1000.0 | Editorial of Codeforces Round 1053 (Div. 1, Div. 2) | |
| 223 | Cycle Closing | constructive algorithms graphs trees | Statement | F | Codeforces Round 1053 (Div. 1) {2150} | PROGRAMMING | 3250.0 | Editorial of Codeforces Round 1053 (Div. 1, Div. 2) | |
| 223 | Counting Is Fun: The Finale | Statement | G | Codeforces Round 1053 (Div. 1) {2150} | PROGRAMMING | 4250.0 | Editorial of Codeforces Round 1053 (Div. 1, Div. 2) | ||
| 939 | Attraction Theory | combinatorics dp implementation math | Statement | D | Codeforces Round 1053 (Div. 1) {2150} | PROGRAMMING | 2500.0 | Editorial of Codeforces Round 1053 (Div. 1, Div. 2) | |
| 18451 | Incremental Subarray | strings | Statement | A | Codeforces Round 1053 (Div. 2) {2151} | PROGRAMMING | 500.0 | Editorial of Codeforces Round 1053 (Div. 1, Div. 2) | |
| 10918 | Incremental Stay | greedy implementation | Statement | C | Codeforces Round 1053 (Div. 2) {2151} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round 1053 (Div. 1, Div. 2) | |
| 212 | Victorious Coloring (Hard Version) | data structures data structures data structures data structures | Statement | H2 | Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) {2152} | PROGRAMMING | 2500.0 | Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) Editorial | |
| 1346 | Victorious Coloring (Easy Version) | dp graphs | Statement | H1 | Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) {2152} | PROGRAMMING | 4000.0 | Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) Editorial | |
| 13392 | Triple Removal | data structures greedy math | Statement | C | Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) {2152} | PROGRAMMING | 1500.0 | Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) Editorial | |
| 2469 | Triple Attack | brute force data structures greedy trees two pointers | Statement | F | Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) {2152} | PROGRAMMING | 4000.0 | Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) Editorial | |
| 2217 | Query Jungle | data structures data structures implementation math math trees | Statement | G | Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) {2152} | PROGRAMMING | 4000.0 | Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) Editorial | |
| 3497 | Monotone Subsequence | brute force constructive algorithms dp graphs interactive math | Statement | E | Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) {2152} | PROGRAMMING | 3000.0 | Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) Editorial | |
| 23456 | Increase or Smash | implementation | Statement | A | Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) {2152} | PROGRAMMING | 500.0 | Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) Editorial | |
| 7638 | Division Versus Addition | bitmasks data structures games | Statement | D | Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) {2152} | PROGRAMMING | 2500.0 | Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) Editorial | |
| 13709 | Catching the Krug | games math | Statement | B | Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) {2152} | PROGRAMMING | 1500.0 | Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) Editorial | |
| 1031 | Zero Trailing Factorial | brute force math number theory | Statement | E | Codeforces Round 1057 (Div. 2) {2153} | PROGRAMMING | 2250.0 | Codeforces Round 1057 (Div. 2) Editorial | |
| 12221 | Symmetrical Polygons | geometry greedy sortings | Statement | C | Codeforces Round 1057 (Div. 2) {2153} | PROGRAMMING | 1250.0 | Codeforces Round 1057 (Div. 2) Editorial | |
| 335 | Odd Queries on Odd Array | data structures trees | Statement | F | Codeforces Round 1057 (Div. 2) {2153} | PROGRAMMING | 3250.0 | Codeforces Round 1057 (Div. 2) Editorial | |
| 6523 | Not Alone | dp implementation | Statement | D | Codeforces Round 1057 (Div. 2) {2153} | PROGRAMMING | 1750.0 | Codeforces Round 1057 (Div. 2) Editorial |