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 ... 5 6 7 8 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 4598 | Cyclic MEX | binary search constructive algorithms data structures implementation math two pointers | Statement | D | Codeforces Round 915 (Div. 2) {1905} | PROGRAMMING | 2000.0 | Codeforces Round 915 (Div. 2) Editorial | |
| 823 | Button Pressing | bitmasks constructive algorithms hashing | Statement | B | 2023-2024 ICPC, Asia Jakarta Regional Contest (Online Mirror, Unrated, ICPC Rules, Teams Preferred) {1906} | PROGRAMMING | problem_analysis.pdf | ||
| 762 | Palindromic Parentheses | constructive algorithms | Statement | L | 2023-2024 ICPC, Asia Jakarta Regional Contest (Online Mirror, Unrated, ICPC Rules, Teams Preferred) {1906} | PROGRAMMING | problem_analysis.pdf | ||
| 2397 | Merge Not Sort | constructive algorithms dp | Statement | E | 2023-2024 ICPC, Asia Jakarta Regional Contest (Online Mirror, Unrated, ICPC Rules, Teams Preferred) {1906} | PROGRAMMING | problem_analysis.pdf | ||
| 23401 | Jumping Through Segments | binary search constructive algorithms | Statement | D | Codeforces Round 913 (Div. 3) {1907} | PROGRAMMING | Codeforces Round 913 (Div. 3) Editorial | ||
| 2323 | Lights | constructive algorithms dfs and similar graphs greedy implementation | Statement | G | Codeforces Round 913 (Div. 3) {1907} | PROGRAMMING | Codeforces Round 913 (Div. 3) Editorial | ||
| 23083 | Removal of Unattractive Pairs | constructive algorithms greedy math strings | Statement | C | Codeforces Round 913 (Div. 3) {1907} | PROGRAMMING | Codeforces Round 913 (Div. 3) Editorial | ||
| 1675 | Multiple Lamps | brute force constructive algorithms number theory | Statement | E | Pinely Round 3 (Div. 1 + Div. 2) {1909} | PROGRAMMING | 2500.0 | Editorial of Pinely Round 3 (Div. 1 + Div. 2) | |
| 109 | Parallel Swaps Sort | constructive algorithms data structures | Statement | H | Pinely Round 3 (Div. 1 + Div. 2) {1909} | PROGRAMMING | 6000.0 | Editorial of Pinely Round 3 (Div. 1 + Div. 2) | |
| 13137 | Heavy Intervals | constructive algorithms data structures dsu greedy math sortings | Statement | C | Pinely Round 3 (Div. 1 + Div. 2) {1909} | PROGRAMMING | 1500.0 | Editorial of Pinely Round 3 (Div. 1 + Div. 2) | |
| 1271 | Evaluate It and Back Again | constructive algorithms implementation math | Statement | E | 2023-2024 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1912} | PROGRAMMING | Tutorials (PDF) | 2200 | |
| 70 | Cactus Transformation | constructive algorithms | Statement | C | 2023-2024 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1912} | PROGRAMMING | 3300 | ||
| 33171 | Preparing for the Contest | constructive algorithms math | Statement | B | Codeforces Round 916 (Div. 3) {1914} | PROGRAMMING | Codeforces Round 916 (Div. 3) Editorial | ||
| 9745 | Mathematical Problem | brute force constructive algorithms implementation math strings | Statement | D | Good Bye 2023 {1916} | PROGRAMMING | 1500.0 | ||
| 707 | Group Division | constructive algorithms dfs and similar graphs | Statement | F | Good Bye 2023 {1916} | PROGRAMMING | 2750.0 | ||
| 19841 | Training Before the Olympiad | constructive algorithms games implementation math | Statement | C | Good Bye 2023 {1916} | PROGRAMMING | 1250.0 | ||
| 28259 | 2023 | constructive algorithms implementation math number theory | Statement | A | Good Bye 2023 {1916} | PROGRAMMING | 250.0 | ||
| 31758 | Two Divisors | constructive algorithms math number theory | Statement | B | Good Bye 2023 {1916} | PROGRAMMING | 750.0 | ||
| 1188 | Construct Tree | bitmasks constructive algorithms dp trees | Statement | F | Codeforces Round 917 (Div. 2) {1917} | PROGRAMMING | 3000.0 | Editorial of Codeforces Round 917 (Div. 2) | |
| 27218 | Least Product | constructive algorithms math | Statement | A | Codeforces Round 917 (Div. 2) {1917} | PROGRAMMING | 500.0 | Editorial of Codeforces Round 917 (Div. 2) | |
| 1623 | Construct Matrix | constructive algorithms math | Statement | E | Codeforces Round 917 (Div. 2) {1917} | PROGRAMMING | 2500.0 | Editorial of Codeforces Round 917 (Div. 2) | |
| 654 | Permutation of Given | brute force constructive algorithms | Statement | G | Codeforces Round 922 (Div. 2) {1918} | PROGRAMMING | 3250.0 | Codeforces Round #922 (Div. 2) Editorial | |
| 26939 | Minimize Inversions | constructive algorithms data structures greedy implementation sortings | Statement | B | Codeforces Round 922 (Div. 2) {1918} | PROGRAMMING | 1000.0 | Codeforces Round #922 (Div. 2) Editorial | |
| 32303 | Brick Wall | constructive algorithms greedy implementation math | Statement | A | Codeforces Round 922 (Div. 2) {1918} | PROGRAMMING | 500.0 | Codeforces Round #922 (Div. 2) Editorial | |
| 208 | Tree LGM | constructive algorithms games trees | Statement | G | Hello 2024 {1919} | PROGRAMMING | 4000.0 | 3500 | |
| 9067 | Increasing Subsequences | bitmasks constructive algorithms math | Statement | E | Educational Codeforces Round 161 (Rated for Div. 2) {1922} | PROGRAMMING | Educational Codeforces Round 161 Editorial | ||
| 28784 | Tricky Template | constructive algorithms implementation strings | Statement | A | Educational Codeforces Round 161 (Rated for Div. 2) {1922} | PROGRAMMING | Educational Codeforces Round 161 Editorial | ||
| 18401 | Find B | constructive algorithms data structures greedy | Statement | C | Educational Codeforces Round 162 (Rated for Div. 2) {1923} | PROGRAMMING | Educational Codeforces Round 162 Editorial | ||
| 16681 | Did We Get Everything Covered? | constructive algorithms dp greedy strings | Statement | A | Codeforces Round 921 (Div. 1) {1924} | PROGRAMMING | 500.0 | Codeforces Round 921 (Div. 1, Div. 2) Editorial | |
| 225 | Anti-Proxy Attendance | constructive algorithms interactive ternary search | Statement | F | Codeforces Round 921 (Div. 1) {1924} | PROGRAMMING | 3000.0 | Codeforces Round 921 (Div. 1, Div. 2) Editorial | |
| 31114 | We Got Everything Covered! | constructive algorithms greedy strings | Statement | A | Codeforces Round 921 (Div. 2) {1925} | PROGRAMMING | 500.0 | Codeforces Round 921 (Div. 1, Div. 2) Editorial | |
| 2087 | Vlad and Avoiding X | bitmasks brute force constructive algorithms dfs and similar dp implementation | Statement | F | Codeforces Round 928 (Div. 4) {1926} | PROGRAMMING | 126132 | ||
| 37987 | Following the String | constructive algorithms greedy strings | Statement | B | Codeforces Round 923 (Div. 3) {1927} | PROGRAMMING | 125597 | ||
| 17003 | Klever Permutation | constructive algorithms math | Statement | E | Codeforces Round 923 (Div. 3) {1927} | PROGRAMMING | 125597 | ||
| 2088 | Modular Sequence | constructive algorithms dp greedy implementation math number theory | Statement | E | Codeforces Round 924 (Div. 2) {1928} | PROGRAMMING | 2250.0 | Codeforces Round 924 Editorial | |
| 24396 | Rectangle Cutting | constructive algorithms geometry greedy math | Statement | A | Codeforces Round 924 (Div. 2) {1928} | PROGRAMMING | 500.0 | Codeforces Round 924 Editorial | |
| 26697 | Sasha and the Drawing | constructive algorithms greedy math | Statement | B | Codeforces Round 926 (Div. 2) {1929} | PROGRAMMING | 1000.0 | Codeforces Round #926 (Div. 2) Editorial. | |
| 34870 | Sasha and the Beautiful Array | constructive algorithms greedy sortings | Statement | A | Codeforces Round 926 (Div. 2) {1929} | PROGRAMMING | 500.0 | Codeforces Round #926 (Div. 2) Editorial. | |
| 17621 | Permutation Printing | brute force constructive algorithms math | Statement | B | think-cell Round 1 {1930} | PROGRAMMING | 1000.0 | think-cell Round 1 Editorial | |
| 8134 | Lexicographically Largest | constructive algorithms data structures greedy sortings | Statement | C | think-cell Round 1 {1930} | PROGRAMMING | 1500.0 | think-cell Round 1 Editorial | |
| 3624 | One-Dimensional Puzzle | combinatorics constructive algorithms math number theory | Statement | G | Codeforces Round 925 (Div. 3) {1931} | PROGRAMMING | 125878 | ||
| 23455 | Turtle Tenacity: Continual Mods | constructive algorithms greedy number theory sortings | Statement | D | Codeforces Round 929 (Div. 3) {1933} | PROGRAMMING | Codeforces Round 929 (Div. 3) Editorial | ||
| 4127 | XOR Break --- Solo Version | bitmasks constructive algorithms greedy | Statement | D1 | Codeforces Round 931 (Div. 2) {1934} | PROGRAMMING | 1500.0 | Tutorial | |
| 340 | Weird LCM Operations | brute force constructive algorithms | Statement | E | Codeforces Round 931 (Div. 2) {1934} | PROGRAMMING | 3250.0 | Tutorial | |
| 8057 | Find a Mine | constructive algorithms geometry greedy interactive math | Statement | C | Codeforces Round 931 (Div. 2) {1934} | PROGRAMMING | 1500.0 | Tutorial | |
| 27220 | Too Min Too Max | constructive algorithms greedy math | Statement | A | Codeforces Round 931 (Div. 2) {1934} | PROGRAMMING | 500.0 | Tutorial | |
| 9747 | Messenger in MAC | binary search brute force constructive algorithms data structures dp sortings | Statement | C | Codeforces Round 932 (Div. 2) {1935} | PROGRAMMING | 1500.0 | Codeforces Round #932 (Div. 2) Editorial | |
| 600 | Andrey's Tree | binary search constructive algorithms dsu greedy implementation trees | Statement | F | Codeforces Round 932 (Div. 2) {1935} | PROGRAMMING | 3000.0 | Codeforces Round #932 (Div. 2) Editorial | |
| 20850 | Informatics in MAC | constructive algorithms | Statement | B | Codeforces Round 932 (Div. 2) {1935} | PROGRAMMING | 1000.0 | Codeforces Round #932 (Div. 2) Editorial | |
| 30293 | Entertainment in MAC | constructive algorithms strings | Statement | A | Codeforces Round 932 (Div. 2) {1935} | PROGRAMMING | 500.0 | Codeforces Round #932 (Div. 2) Editorial | |
| 8637 | Bitwise Operation Wizard | bitmasks constructive algorithms greedy interactive math | Statement | A | Codeforces Round 930 (Div. 1) {1936} | PROGRAMMING | 500.0 | Codeforces Round 930 (Div. 1, Div. 2) Editorial | |
| 304 | Evidence Board | *special constructive algorithms dfs and similar graphs trees | Statement | B | XVIII Open Olympiad in Informatics - Final Stage, Day 1 (Unrated, Online Mirror, IOI rules) {1939} | PROGRAMMING | |||
| 30 | Draw Polygon Lines | *special constructive algorithms dp geometry interactive | Statement | A | XVIII Open Olympiad in Informatics - Final Stage, Day 1 (Unrated, Online Mirror, IOI rules) {1939} | PROGRAMMING | |||
| 175 | Almost Certainly | *special constructive algorithms data structures sortings | Statement | D | XVIII Open Olympiad in Informatics - Final Stage, Day 2 (Unrated, Online Mirror, IOI rules) {1940} | PROGRAMMING | |||
| 105 | Parallel Universes | *special constructive algorithms dfs and similar dsu graphs | Statement | A | XVIII Open Olympiad in Informatics - Final Stage, Day 2 (Unrated, Online Mirror, IOI rules) {1940} | PROGRAMMING | |||
| 270 | Three Arrays | *special constructive algorithms implementation sortings | Statement | B | XVIII Open Olympiad in Informatics - Final Stage, Day 2 (Unrated, Online Mirror, IOI rules) {1940} | PROGRAMMING | |||
| 18496 | Farmer John's Challenge | constructive algorithms math | Statement | A | CodeTON Round 8 (Div. 1 + Div. 2, Rated, Prizes!) {1942} | PROGRAMMING | 500.0 | CodeTON Round 8 Editorial | |
| 15474 | Bessie and MEX | constructive algorithms math | Statement | B | CodeTON Round 8 (Div. 1 + Div. 2, Rated, Prizes!) {1942} | PROGRAMMING | 1000.0 | CodeTON Round 8 Editorial | |
| 2590 | Tree Compass | constructive algorithms dfs and similar greedy trees | Statement | C | Codeforces Round 934 (Div. 1) {1943} | PROGRAMMING | 1250.0 | Codeforces Round #934 (Div1, Div2) Editorial | |
| 18132 | Equal XOR | bitmasks constructive algorithms | Statement | B | Codeforces Round 934 (Div. 2) {1944} | PROGRAMMING | 1000.0 | Codeforces Round #934 (Div1, Div2) Editorial | |
| 9697 | Binary Search | binary search constructive algorithms | Statement | E | Codeforces Round 935 (Div. 3) {1945} | PROGRAMMING | 127377 | ||
| 904 | Cook and Porridge | binary search constructive algorithms data structures implementation | Statement | G | Codeforces Round 935 (Div. 3) {1945} | PROGRAMMING | 127377 | ||
| 5591 | Birthday Gift | bitmasks brute force constructive algorithms greedy implementation | Statement | D | Codeforces Round 936 (Div. 2) {1946} | PROGRAMMING | 1750.0 | Codeforces Round #936 (Div. 2) Editorial | |
| 30908 | Special Characters | brute force constructive algorithms | Statement | A | Educational Codeforces Round 163 (Rated for Div. 2) {1948} | PROGRAMMING | Educational Codeforces Round 163 Editorial | ||
| 3508 | Clique Partition | constructive algorithms graphs greedy | Statement | E | Educational Codeforces Round 163 (Rated for Div. 2) {1948} | PROGRAMMING | Educational Codeforces Round 163 Editorial | ||
| 545 | Funny or Scary? | constructive algorithms | Statement | D | European Championship 2024 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1949} | PROGRAMMING | European Championship 2024 (EUC) Editorial | ||
| 449 | Make Triangle | constructive algorithms math | Statement | K | European Championship 2024 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1949} | PROGRAMMING | European Championship 2024 (EUC) Editorial | ||
| 961 | Inversion Composition | binary search constructive algorithms data structures greedy | Statement | F | Codeforces Global Round 25 {1951} | PROGRAMMING | 2750.0 | Codeforces Global Round 25 Editorial | |
| 4466 | No Palindromes | brute force constructive algorithms greedy hashing implementation strings | Statement | E | Codeforces Global Round 25 {1951} | PROGRAMMING | 2250.0 | Codeforces Global Round 25 Editorial | |
| 103 | Growing Trees | constructive algorithms flows graphs greedy | Statement | I | Codeforces Global Round 25 {1951} | PROGRAMMING | 4000.0 | Codeforces Global Round 25 Editorial | |
| 6288 | Buying Jewels | constructive algorithms greedy math | Statement | D | Codeforces Global Round 25 {1951} | PROGRAMMING | 1750.0 | Codeforces Global Round 25 Editorial | |
| 899 | Help, what does it mean to be "Based" | brute force combinatorics constructive algorithms games implementation sortings | Statement | J | April Fools Day Contest 2024 {1952} | PROGRAMMING | April Fools Day Contest 2024 Editorial | ||
| 1514 | The Most Reckless Defense | bitmasks brute force constructive algorithms dp flows graph matchings | Statement | H | Codeforces Round 938 (Div. 3) {1955} | PROGRAMMING | 128243 | ||
| 32211 | Progressive Square | constructive algorithms data structures implementation sortings | Statement | B | Codeforces Round 938 (Div. 3) {1955} | PROGRAMMING | 128243 | ||
| 4753 | Nene and the Mex Operator | bitmasks brute force constructive algorithms divide and conquer dp greedy implementation | Statement | D | Codeforces Round 939 (Div. 2) {1956} | PROGRAMMING | 1750.0 | [Editorial] Codeforces Round 939 (Div. 2) | |
| 481 | Nene and the Passing Game | constructive algorithms data structures dsu graphs sortings | Statement | F | Codeforces Round 939 (Div. 2) {1956} | PROGRAMMING | 2500.0 | [Editorial] Codeforces Round 939 (Div. 2) | |
| 15097 | Nene's Magical Matrix | constructive algorithms greedy math | Statement | C | Codeforces Round 939 (Div. 2) {1956} | PROGRAMMING | 1500.0 | [Editorial] Codeforces Round 939 (Div. 2) | |
| 20360 | A BIT of a Construction | bitmasks constructive algorithms greedy implementation | Statement | B | Codeforces Round 940 (Div. 2) and CodeCraft-23 {1957} | PROGRAMMING | 1000.0 | Codeforces Round #940 and CodeCraft-23 (Div. 2) Editorial | 1100 |
| 25647 | Stickogon | constructive algorithms greedy | Statement | A | Codeforces Round 940 (Div. 2) and CodeCraft-23 {1957} | PROGRAMMING | 500.0 | Codeforces Round #940 and CodeCraft-23 (Div. 2) Editorial | 800 |
| 329 | Yet Another Permutation Constructive | *special constructive algorithms | Statement | E | Kotlin Heroes: Episode 10 {1958} | PROGRAMMING | 129483 | 1900 | |
| 8085 | Missing Subsequence Sum | bitmasks constructive algorithms greedy number theory | Statement | B | Codeforces Round 941 (Div. 1) {1965} | PROGRAMMING | 1250.0 | Codeforces Round #941 (Div. 1, Div. 2) Editorial | 1800 |
| 2344 | Folding Strip | constructive algorithms greedy strings | Statement | C | Codeforces Round 941 (Div. 1) {1965} | PROGRAMMING | 1500.0 | Codeforces Round #941 (Div. 1, Div. 2) Editorial | 2300 |
| 536 | Missing Subarray Sum | constructive algorithms | Statement | D | Codeforces Round 941 (Div. 1) {1965} | PROGRAMMING | 2000.0 | Codeforces Round #941 (Div. 1, Div. 2) Editorial | 2900 |
| 461 | Connected Cubes | constructive algorithms games | Statement | E | Codeforces Round 941 (Div. 1) {1965} | PROGRAMMING | 2500.0 | Codeforces Round #941 (Div. 1, Div. 2) Editorial | 3100 |
| 17174 | Rectangle Filling | constructive algorithms implementation | Statement | B | Codeforces Round 941 (Div. 2) {1966} | PROGRAMMING | 1000.0 | Codeforces Round #941 (Div. 1, Div. 2) Editorial | 1100 |
| 19544 | Card Exchange | constructive algorithms games greedy | Statement | A | Codeforces Round 941 (Div. 2) {1966} | PROGRAMMING | 500.0 | Codeforces Round #941 (Div. 1, Div. 2) Editorial | 800 |
| 29176 | Assembly via Remainders | constructive algorithms number theory | Statement | C | Codeforces Round 943 (Div. 3) {1968} | PROGRAMMING | 129096 | 1000 | |
| 12601 | Cells Arrangement | constructive algorithms | Statement | E | Codeforces Round 943 (Div. 3) {1968} | PROGRAMMING | 129096 | 1600 | |
| 22285 | Shifts and Sorting | constructive algorithms greedy | Statement | B | Educational Codeforces Round 165 (Rated for Div. 2) {1969} | PROGRAMMING | Educational Codeforces Round 165 Editorial | 1000 | |
| 22006 | Two Friends | constructive algorithms implementation math | Statement | A | Educational Codeforces Round 165 (Rated for Div. 2) {1969} | PROGRAMMING | Educational Codeforces Round 165 Editorial | 800 | |
| 1635 | Exact Neighbours (Easy) | constructive algorithms | Statement | B1 | Helvetic Coding Contest 2024 online mirror (teams allowed, unrated) {1970} | PROGRAMMING | Helvetic Coding Contest 2024 Editorial | 1900 | |
| 937 | Arithmancy (Easy) | brute force constructive algorithms interactive strings | Statement | D1 | Helvetic Coding Contest 2024 online mirror (teams allowed, unrated) {1970} | PROGRAMMING | Helvetic Coding Contest 2024 Editorial | 2100 | |
| 1206 | Exact Neighbours (Medium) | constructive algorithms | Statement | B2 | Helvetic Coding Contest 2024 online mirror (teams allowed, unrated) {1970} | PROGRAMMING | Helvetic Coding Contest 2024 Editorial | 2100 | |
| 711 | Exact Neighbours (Hard) | constructive algorithms | Statement | B3 | Helvetic Coding Contest 2024 online mirror (teams allowed, unrated) {1970} | PROGRAMMING | Helvetic Coding Contest 2024 Editorial | 2300 | |
| 598 | Balanced Unshuffle (Medium) | brute force constructive algorithms trees | Statement | A2 | Helvetic Coding Contest 2024 online mirror (teams allowed, unrated) {1970} | PROGRAMMING | Helvetic Coding Contest 2024 Editorial | 2400 | |
| 662 | Balanced Unshuffle (Hard) | constructive algorithms trees | Statement | A3 | Helvetic Coding Contest 2024 online mirror (teams allowed, unrated) {1970} | PROGRAMMING | Helvetic Coding Contest 2024 Editorial | 2400 | |
| 308 | Arithmancy (Medium) | constructive algorithms interactive probabilities strings | Statement | D2 | Helvetic Coding Contest 2024 online mirror (teams allowed, unrated) {1970} | PROGRAMMING | Helvetic Coding Contest 2024 Editorial | 2600 | |
| 9828 | Cat, Fox and Double Maximum | constructive algorithms greedy implementation math sortings | Statement | C | Codeforces Round 945 (Div. 2) {1973} | PROGRAMMING | 1500.0 | Editorial for Codeforces Round #945 (Div. 2) | 1700 |
| 17746 | Ingenuity-2 | constructive algorithms greedy implementation | Statement | D | Codeforces Round 946 (Div. 3) {1974} | PROGRAMMING | Codeforces Round #946 (Div. 3) Editorial | 1400 | |
| 19862 | Binary Colouring | bitmasks constructive algorithms greedy math | Statement | B | Codeforces Round 948 (Div. 2) {1977} | PROGRAMMING | 1250.0 | 129858 | 1100 |
| 933 | Tensor | constructive algorithms graphs interactive | Statement | E | Codeforces Round 948 (Div. 2) {1977} | PROGRAMMING | 2500.0 | 129858 | 2600 |
| 17750 | Manhattan Permutations | constructive algorithms greedy implementation math | Statement | C | Codeforces Round 953 (Div. 2) {1978} | PROGRAMMING | 1250.0 | 130527 | |
| 28576 | Alice and Books | constructive algorithms sortings | Statement | A | Codeforces Round 953 (Div. 2) {1978} | PROGRAMMING | 500.0 | 130527 | |
| 22139 | Earning on Bets | binary search combinatorics constructive algorithms number theory | Statement | C | Codeforces Round 951 (Div. 2) {1979} | PROGRAMMING | 1500.0 | Codeforces Round 951 (Div. 2) Editorial | |
| 1801 | Manhattan Triangle | binary search constructive algorithms data structures geometry graphs two pointers | Statement | E | Codeforces Round 951 (Div. 2) {1979} | PROGRAMMING | 2500.0 | Codeforces Round 951 (Div. 2) Editorial | |
| 7833 | Fixing a Binary String | bitmasks brute force constructive algorithms greedy hashing strings | Statement | D | Codeforces Round 951 (Div. 2) {1979} | PROGRAMMING | 2000.0 | Codeforces Round 951 (Div. 2) Editorial | |
| 12961 | Permutation of Rows and Columns | constructive algorithms data structures hashing math matrices sortings | Statement | E | Codeforces Round 950 (Div. 3) {1980} | PROGRAMMING | 130135 | ||
| 21659 | Sofia and the Lost Operations | constructive algorithms greedy | Statement | C | Codeforces Round 950 (Div. 3) {1980} | PROGRAMMING | 130135 | ||
| 6329 | Turtle and an Incomplete Sequence | bitmasks constructive algorithms greedy implementation math | Statement | C | Codeforces Round 949 (Div. 2) {1981} | PROGRAMMING | 1500.0 | Simplified Chinese Tutorial | |
| 2115 | Turtle and Multiplication | constructive algorithms dfs and similar graphs number theory | Statement | D | Codeforces Round 949 (Div. 2) {1981} | PROGRAMMING | 2000.0 | Simplified Chinese Tutorial | |
| 11001 | Swap Dilemma | constructive algorithms divide and conquer greedy math sortings | Statement | D | Codeforces Round 956 (Div. 2) and ByteRace 2024 {1983} | PROGRAMMING | 1750.0 | ||
| 18365 | Corner Twist | constructive algorithms greedy implementation math | Statement | B | Codeforces Round 956 (Div. 2) and ByteRace 2024 {1983} | PROGRAMMING | 1000.0 | ||
| 28076 | Array Divisibility | constructive algorithms math | Statement | A | Codeforces Round 956 (Div. 2) and ByteRace 2024 {1983} | PROGRAMMING | 500.0 | ||
| 22844 | Strange Splitting | constructive algorithms | Statement | A | Codeforces Global Round 26 {1984} | PROGRAMMING | 500.0 | Codeforces Global Round 26 Editorial | |
| 1810 | Shuffle | constructive algorithms dp greedy trees | Statement | E | Codeforces Global Round 26 {1984} | PROGRAMMING | 3000.0 | Codeforces Global Round 26 Editorial | |
| 20911 | Large Addition | constructive algorithms implementation math | Statement | B | Codeforces Global Round 26 {1984} | PROGRAMMING | 750.0 | Codeforces Global Round 26 Editorial | |
| 299 | Magic Trick II | constructive algorithms implementation sortings | Statement | G | Codeforces Global Round 26 {1984} | PROGRAMMING | 4000.0 | Codeforces Global Round 26 Editorial | |
| 20243 | Increasing Sequence with Fixed OR | bitmasks constructive algorithms greedy | Statement | C | Codeforces Round 958 (Div. 2) {1988} | PROGRAMMING | 1000.0 | Editorial of Codeforces Round 958 (Div. 2) | |
| 1135 | Catch the Mole(Easy Version) | binary search constructive algorithms data structures interactive trees | Statement | E1 | Codeforces Round 960 (Div. 2) {1990} | PROGRAMMING | 2000.0 | Video Tutorial | |
| 19816 | Array Craft | constructive algorithms greedy | Statement | B | Codeforces Round 960 (Div. 2) {1990} | PROGRAMMING | 1000.0 | Video Tutorial | |
| 7869 | Prime XOR Coloring | bitmasks constructive algorithms graphs greedy math number theory | Statement | D | Pinely Round 4 (Div. 1 + Div. 2) {1991} | PROGRAMMING | 1500.0 | Video Tutorial | |
| 18870 | AND Reconstruction | bitmasks constructive algorithms greedy | Statement | B | Pinely Round 4 (Div. 1 + Div. 2) {1991} | PROGRAMMING | 500.0 | Video Tutorial | |
| 5101 | Coloring Game | constructive algorithms games graphs greedy interactive | Statement | E | Pinely Round 4 (Div. 1 + Div. 2) {1991} | PROGRAMMING | 2000.0 | Video Tutorial | |
| 171 | Grid Game | constructive algorithms games greedy interactive | Statement | I | Pinely Round 4 (Div. 1 + Div. 2) {1991} | PROGRAMMING | 4000.0 | Video Tutorial | |
| 743 | Grid Reset | constructive algorithms greedy | Statement | G | Pinely Round 4 (Div. 1 + Div. 2) {1991} | PROGRAMMING | 3000.0 | Video Tutorial | |
| 17668 | Absolute Zero | constructive algorithms greedy math | Statement | C | Pinely Round 4 (Div. 1 + Div. 2) {1991} | PROGRAMMING | 1000.0 | Video Tutorial | |
| 49058 | Only Pluses | brute force constructive algorithms greedy math sortings | Statement | A | Codeforces Round 957 (Div. 3) {1992} | PROGRAMMING | Shayan's Video Tutorial | ||
| 10727 | Novice's Mistake | brute force constructive algorithms math strings | Statement | E | Codeforces Round 957 (Div. 3) {1992} | PROGRAMMING | Shayan's Video Tutorial | ||
| 33181 | Gorilla and Permutation | constructive algorithms math | Statement | C | Codeforces Round 957 (Div. 3) {1992} | PROGRAMMING | Shayan's Video Tutorial | ||
| 1182 | Dyn-scripted Robot (Easy Version) | brute force chinese remainder theorem constructive algorithms math number theory | Statement | F1 | Codeforces Round 963 (Div. 2) {1993} | PROGRAMMING | 2500.0 | Editorial of Codeforces Round 963 (Div. 2) | |
| 26368 | Parity and Sum | constructive algorithms greedy | Statement | B | Codeforces Round 963 (Div. 2) {1993} | PROGRAMMING | 1000.0 | Editorial of Codeforces Round 963 (Div. 2) | |
| 19429 | Fun Game | bitmasks constructive algorithms greedy math | Statement | B | Codeforces Round 959 sponsored by NEAR (Div. 1 + Div. 2) {1994} | PROGRAMMING | 1000.0 | Video Tutorial | |
| 1523 | Stardew Valley | constructive algorithms dfs and similar graphs | Statement | F | Codeforces Round 959 sponsored by NEAR (Div. 1 + Div. 2) {1994} | PROGRAMMING | 2500.0 | Video Tutorial | |
| 7349 | Funny Game | constructive algorithms dsu graphs greedy math number theory | Statement | D | Codeforces Round 959 sponsored by NEAR (Div. 1 + Div. 2) {1994} | PROGRAMMING | 2000.0 | Video Tutorial | |
| 22257 | Diverse Game | constructive algorithms greedy | Statement | A | Codeforces Round 959 sponsored by NEAR (Div. 1 + Div. 2) {1994} | PROGRAMMING | 500.0 | Video Tutorial | |
| 10254 | Squaring | brute force constructive algorithms data structures greedy implementation math number theory | Statement | C | Codeforces Round 961 (Div. 2) {1995} | PROGRAMMING | 1750.0 | Video Tutorial | |
| 23429 | Make Three Regions | constructive algorithms | Statement | B | Educational Codeforces Round 168 (Rated for Div. 2) {1997} | PROGRAMMING | Video Tutorial | ||
| 26098 | Find K Distinct Points with Fixed Center | constructive algorithms implementation math | Statement | A | Codeforces Round 965 (Div. 2) {1998} | PROGRAMMING | 500.0 | Video Tutorial | |
| 28069 | Minimize Equal Sum Subarrays | constructive algorithms math number theory | Statement | B | Codeforces Round 965 (Div. 2) {1998} | PROGRAMMING | 750.0 | Video Tutorial | |
| 6354 | Longest Max Min Subsequence | brute force constructive algorithms greedy two pointers | Statement | D | Codeforces Round 967 (Div. 2) {2001} | PROGRAMMING | 2000.0 | Video Tutorial | |
| 26053 | Generate Permutation | constructive algorithms greedy implementation | Statement | B | Codeforces Round 967 (Div. 2) {2001} | PROGRAMMING | 1000.0 | Video Tutorial | |
| 17655 | Black Circles | brute force constructive algorithms geometry greedy math | Statement | C | EPIC Institute of Technology Round August 2024 (Div. 1 + Div. 2) {2002} | PROGRAMMING | 1000.0 | EPIC Institute of Technology Round August 2024 (Div. 1 + Div. 2) Editorial | |
| 5069 | DFS Checker (Easy Version) | constructive algorithms data structures dfs and similar hashing implementation | Statement | D1 | EPIC Institute of Technology Round August 2024 (Div. 1 + Div. 2) {2002} | PROGRAMMING | 1250.0 | EPIC Institute of Technology Round August 2024 (Div. 1 + Div. 2) Editorial | |
| 2857 | DFS Checker (Hard Version) | constructive algorithms data structures dfs and similar hashing implementation trees | Statement | D2 | EPIC Institute of Technology Round August 2024 (Div. 1 + Div. 2) {2002} | PROGRAMMING | 1250.0 | EPIC Institute of Technology Round August 2024 (Div. 1 + Div. 2) Editorial | |
| 22945 | Removals Game | constructive algorithms games | Statement | B | EPIC Institute of Technology Round August 2024 (Div. 1 + Div. 2) {2002} | PROGRAMMING | 750.0 | EPIC Institute of Technology Round August 2024 (Div. 1 + Div. 2) Editorial | |
| 21297 | Distanced Coloring | constructive algorithms implementation math | Statement | A | EPIC Institute of Technology Round August 2024 (Div. 1 + Div. 2) {2002} | PROGRAMMING | 500.0 | EPIC Institute of Technology Round August 2024 (Div. 1 + Div. 2) Editorial | |
| 637 | Turtle and Inversions (Hard Version) | brute force constructive algorithms data structures dp greedy two pointers | Statement | E2 | Codeforces Round 968 (Div. 2) {2003} | PROGRAMMING | 1000.0 | sol-zh.pdf | |
| 21589 | Turtle and Good Pairs | constructive algorithms greedy strings | Statement | C | Codeforces Round 968 (Div. 2) {2003} | PROGRAMMING | 1000.0 | sol-zh.pdf | |
| 26171 | Simple Palindrome | constructive algorithms greedy | Statement | A | Codeforces Round 972 (Div. 2) {2005} | PROGRAMMING | 750.0 | Discussion stream (With Hints) | |
| 164 | Dora's Paint | brute force combinatorics constructive algorithms graphs | Statement | F | Codeforces Round 969 (Div. 1) {2006} | PROGRAMMING | 3000.0 | Tutorial | |
| 41681 | Sakurako's Exam | brute force constructive algorithms greedy math | Statement | A | Codeforces Round 970 (Div. 3) {2008} | PROGRAMMING | Codeforces Round 970 (Div. 3) Editorial | ||
| 14481 | Password Cracking | brute force constructive algorithms interactive strings | Statement | C | Codeforces Round 973 (Div. 2) {2013} | PROGRAMMING | 1250.0 | 134298 | |
| 28142 | Battle for Survive | constructive algorithms greedy math | Statement | B | Codeforces Round 973 (Div. 2) {2013} | PROGRAMMING | 750.0 | 134298 | |
| 31156 | Zhan's Blender | constructive algorithms math | Statement | A | Codeforces Round 973 (Div. 2) {2013} | PROGRAMMING | 500.0 | 134298 | |
| 4494 | Adjust The Presentation (Hard Version) | constructive algorithms data structures greedy implementation | Statement | C2 | Codeforces Round 977 (Div. 2, based on COMPFEST 16 - Final Round) {2021} | PROGRAMMING | 1000.0 | Codeforces Round #977 (Div. 2, based on COMPFEST 16 — Final Round) Editorial | |
| 14084 | Adjust The Presentation (Easy Version) | constructive algorithms greedy | Statement | C1 | Codeforces Round 977 (Div. 2, based on COMPFEST 16 - Final Round) {2021} | PROGRAMMING | 750.0 | Codeforces Round #977 (Div. 2, based on COMPFEST 16 — Final Round) Editorial | |
| 3984 | Asesino (Easy Version) | binary search constructive algorithms implementation interactive | Statement | D1 | Codeforces Round 978 (Div. 2) {2022} | PROGRAMMING | 1750.0 | Codeforces Round 978 (Div 2) Editorial | |
| 1369 | C+K+S | brute force constructive algorithms dfs and similar graphs greedy hashing math strings | Statement | C | Codeforces Round 980 (Div. 1) {2023} | PROGRAMMING | 1500.0 | 135341 | |
| 16527 | Concatenation of Arrays | constructive algorithms greedy math sortings | Statement | A | Codeforces Round 980 (Div. 1) {2023} | PROGRAMMING | 500.0 | 135341 | |
| 17006 | Buying Lemonade | binary search constructive algorithms sortings | Statement | B | Codeforces Round 980 (Div. 2) {2024} | PROGRAMMING | 1000.0 | 135341 | |
| 3724 | Alice's Adventures in Cards | constructive algorithms data structures dfs and similar dp graphs greedy implementation shortest paths | Statement | D | Codeforces Round 986 (Div. 2) {2028} | PROGRAMMING | 1750.0 | Codeforces Round 986 (Div. 2) Editorial | |
| 1892 | Alice's Adventures in the Rabbit Hole | constructive algorithms dfs and similar dp greedy math probabilities trees | Statement | E | Codeforces Round 986 (Div. 2) {2028} | PROGRAMMING | 2000.0 | Codeforces Round 986 (Div. 2) Editorial | |
| 3520 | Common Generator | brute force constructive algorithms greedy math number theory | Statement | E | Refact.ai Match 1 (Codeforces Round 985) {2029} | PROGRAMMING | 2500.0 | Refact.ai Match 1 (Codeforces Round 985) Editorial | |
| 3906 | Cool Graph | constructive algorithms data structures dfs and similar dsu graphs trees | Statement | D | Refact.ai Match 1 (Codeforces Round 985) {2029} | PROGRAMMING | 2250.0 | Refact.ai Match 1 (Codeforces Round 985) Editorial | |
| 848 | Palindrome Everywhere | constructive algorithms greedy | Statement | F | Refact.ai Match 1 (Codeforces Round 985) {2029} | PROGRAMMING | 3000.0 | Refact.ai Match 1 (Codeforces Round 985) Editorial | |
| 23626 | Minimise Oneness | brute force combinatorics constructive algorithms | Statement | B | Codeforces Round 979 (Div. 2) {2030} | PROGRAMMING | 500.0 | Codeforces Round 979 Editorial | |
| 449 | Penchick and Even Medians | binary search constructive algorithms interactive | Statement | F | Codeforces Round 987 (Div. 2) {2031} | PROGRAMMING | 3000.0 | Codeforces Round 987 (Div. 2) Editorial | |
| 15665 | Penchick and BBQ Buns | brute force constructive algorithms math number theory | Statement | C | Codeforces Round 987 (Div. 2) {2031} | PROGRAMMING | 1500.0 | Codeforces Round 987 (Div. 2) Editorial | |
| 6175 | Genokraken | binary search constructive algorithms data structures graphs interactive trees two pointers | Statement | D | Codeforces Round 983 (Div. 2) {2032} | PROGRAMMING | 1750.0 | Codeforces Round 983 (Div. 2) Editorial | |
| 1389 | Balanced | constructive algorithms data structures implementation math | Statement | E | Codeforces Round 983 (Div. 2) {2032} | PROGRAMMING | 2250.0 | Codeforces Round 983 (Div. 2) Editorial | |
| 20539 | Medians | constructive algorithms greedy hashing implementation math | Statement | B | Codeforces Round 983 (Div. 2) {2032} | PROGRAMMING | 750.0 | Codeforces Round 983 (Div. 2) Editorial | |
| 28797 | Sakurako and Water | constructive algorithms greedy | Statement | B | Codeforces Round 981 (Div. 3) {2033} | PROGRAMMING | 135520 | ||
| 41063 | Sakurako and Kosuke | constructive algorithms math | Statement | A | Codeforces Round 981 (Div. 3) {2033} | PROGRAMMING | 135520 | ||
| 2015 | Permutations Harmony | brute force combinatorics constructive algorithms greedy hashing implementation math | Statement | E | Rayan Programming Contest 2024 - Selection (Codeforces Round 989, Div. 1 + Div. 2) {2034} | PROGRAMMING | 2000.0 | Rayan 2024 Selection Round Editorial | |
| 9098 | Trapped in the Witch's Labyrinth | constructive algorithms dfs and similar graphs implementation | Statement | C | Rayan Programming Contest 2024 - Selection (Codeforces Round 989, Div. 1 + Div. 2) {2034} | PROGRAMMING | 1500.0 | Rayan 2024 Selection Round Editorial | |
| 6579 | Darius' Wisdom | constructive algorithms greedy implementation sortings | Statement | D | Rayan Programming Contest 2024 - Selection (Codeforces Round 989, Div. 1 + Div. 2) {2034} | PROGRAMMING | 1500.0 | Rayan 2024 Selection Round Editorial | |
| 11480 | Alya and Permutation | bitmasks constructive algorithms data structures | Statement | C | Codeforces Global Round 27 {2035} | PROGRAMMING | 1000.0 | Codeforces Global Round 27 Editorial | |
| 96 | Peak Productivity Forces | constructive algorithms | Statement | H | Codeforces Global Round 27 {2035} | PROGRAMMING | 4500.0 | Codeforces Global Round 27 Editorial | |
| 20513 | Everyone Loves Tres | constructive algorithms greedy math number theory | Statement | B | Codeforces Global Round 27 {2035} | PROGRAMMING | 500.0 | Codeforces Global Round 27 Editorial | |
| 1660 | Library of Magic | binary search bitmasks constructive algorithms interactive | Statement | G | Codeforces Round 984 (Div. 3) {2036} | PROGRAMMING | Codeforces Round 984 (Div. 3) Editorial | ||
| 25464 | Superultra's Favorite Permutation | constructive algorithms greedy math number theory | Statement | C | Codeforces Round 988 (Div. 3) {2037} | PROGRAMMING | Video Tutorial | ||
| 2944 | Guess One Character | constructive algorithms interactive | Statement | G | 2024-2025 ICPC, NERC, Southern and Volga Russian Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2038} | PROGRAMMING | 1900 | ||
| 2368 | Shohag Loves Inversions | combinatorics constructive algorithms dp math | Statement | E | CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!) {2039} | PROGRAMMING | 2750.0 | Editorial of CodeTON Round 9 (Div. 1 + Div. 2) | |
| 17241 | Shohag Loves Strings | constructive algorithms greedy implementation strings | Statement | B | CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!) {2039} | PROGRAMMING | 1000.0 | Editorial of CodeTON Round 9 (Div. 1 + Div. 2) | |
| 6941 | Shohag Loves GCD | constructive algorithms greedy math number theory | Statement | D | CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!) {2039} | PROGRAMMING | 2000.0 | Editorial of CodeTON Round 9 (Div. 1 + Div. 2) | |
| 102 | Cool Swap Walk (Easy Version) | constructive algorithms implementation implementation sortings sortings | Statement | H1 | CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!) {2039} | PROGRAMMING | 2250.0 | Editorial of CodeTON Round 9 (Div. 1 + Div. 2) | |
| 18077 | Shohag Loves Mod | constructive algorithms number theory | Statement | A | CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!) {2039} | PROGRAMMING | 500.0 | Editorial of CodeTON Round 9 (Div. 1 + Div. 2) | |
| 90 | Cool Swap Walk (Hard Version) | constructive algorithms constructive algorithms constructive algorithms implementation sortings | Statement | H2 | CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!) {2039} | PROGRAMMING | 2500.0 | Editorial of CodeTON Round 9 (Div. 1 + Div. 2) | 3500 |
| 5833 | Non Prime Tree | brute force constructive algorithms dfs and similar greedy number theory trees two pointers | Statement | D | Codeforces Round 992 (Div. 2) {2040} | PROGRAMMING | 2000.0 | Codeforces Round #992 (Div.2) Editorial | |
| 24032 | Paint a Strip | constructive algorithms greedy math | Statement | B | Codeforces Round 992 (Div. 2) {2040} | PROGRAMMING | 1000.0 | Codeforces Round #992 (Div.2) Editorial | |
| 10732 | Ordered Permutations | constructive algorithms greedy math | Statement | C | Codeforces Round 992 (Div. 2) {2040} | PROGRAMMING | 1500.0 | Codeforces Round #992 (Div.2) Editorial | |
| 9826 | Beautiful Array | constructive algorithms | Statement | E | 2024 ICPC Asia Taichung Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2041} | PROGRAMMING | Problem Analysis and Hints (PDF) | ||
| 23997 | Harder Problem | constructive algorithms greedy math | Statement | D | Codeforces Round 993 (Div. 4) {2044} | PROGRAMMING | Codeforces Round 993 (Div. 4) Editorial | ||
| 157 | Buggy DFS | constructive algorithms | Statement | L | 2024-2025 ICPC Asia Jakarta Regional Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2045} | PROGRAMMING | raRzKDJLPHcUnqTcwvGznwEdKiDWjEkd.pdf | 3000 | |
| 132 | Yandex Cuneiform (Easy Version) | constructive algorithms data structures greedy | Statement | F1 | Codeforces Round 990 (Div. 1) {2046} | PROGRAMMING | 2000.0 | Разбор Codeforces Round 990 (Div. 2 + Div. 1) | |
| 95 | Yandex Cuneiform (Hard Version) | constructive algorithms data structures greedy | Statement | F2 | Codeforces Round 990 (Div. 1) {2046} | PROGRAMMING | 2500.0 | Разбор Codeforces Round 990 (Div. 2 + Div. 1) | |
| 228 | Cheops and a Contest (Easy Version) | constructive algorithms greedy | Statement | E1 | Codeforces Round 990 (Div. 1) {2046} | PROGRAMMING | 2000.0 | Разбор Codeforces Round 990 (Div. 2 + Div. 1) | |
| 102 | Kevin and Puzzle (Easy Version) | constructive algorithms | Statement | I1 | Codeforces Global Round 28 {2048} | PROGRAMMING | 3000.0 | Tutorial | |
| 3478 | Kevin and Bipartite Graph | constructive algorithms graphs greedy | Statement | E | Codeforces Global Round 28 {2048} | PROGRAMMING | 1750.0 | Tutorial | |
| 20600 | Kevin and Permutation | constructive algorithms greedy | Statement | B | Codeforces Global Round 28 {2048} | PROGRAMMING | 500.0 | Tutorial | |
| 18867 | pspspsps | brute force constructive algorithms implementation | Statement | B | Codeforces Round 994 (Div. 2) {2049} | PROGRAMMING | 750.0 | Codeforces Round #994 (Div. 2) Editorial | |
| 13565 | MEX Cycle | constructive algorithms greedy implementation | Statement | C | Codeforces Round 994 (Div. 2) {2049} | PROGRAMMING | 1000.0 | Codeforces Round #994 (Div. 2) Editorial | |
| 27913 | Preparing for the Exam | constructive algorithms implementation | Statement | C | Codeforces Round 995 (Div. 3) {2051} | PROGRAMMING | 137623 | ||
| 3721 | Fix Flooded Floor | constructive algorithms dp | Statement | F | 2024-2025 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2052} | PROGRAMMING | |||
| 55 | Cactus without Bridges | constructive algorithms math | Statement | C | 2024-2025 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2052} | PROGRAMMING | |||
| 75 | Delicate Anti-monotonous Operations | constructive algorithms implementation | Statement | H | Good Bye 2024: 2025 is NEAR {2053} | PROGRAMMING | 4500.0 | Good Bye 2024: 2025 is NEAR Editorial | |
| 470 | Haystacks | constructive algorithms data structures greedy | Statement | E | Codeforces Round 996 (Div. 2) {2055} | PROGRAMMING | 3000.0 | Codeforces Round 996 (Div. 2) Editorial | |
| 33516 | Two Frogs | constructive algorithms games greedy | Statement | A | Codeforces Round 996 (Div. 2) {2055} | PROGRAMMING | 500.0 | Codeforces Round 996 (Div. 2) Editorial | |
| 17180 | The Trail | constructive algorithms greedy math | Statement | C | Codeforces Round 996 (Div. 2) {2055} | PROGRAMMING | 1500.0 | Codeforces Round 996 (Div. 2) Editorial | |
| 19323 | Palindromic Subsequences | constructive algorithms math | Statement | C | Codeforces Round 997 (Div. 2) {2056} | PROGRAMMING | 1500.0 | Codeforces Round #997 (Div. 2) Editorial | |
| 13696 | Trip to the Olympiad | bitmasks constructive algorithms greedy math | Statement | C | Hello 2025 {2057} | PROGRAMMING | 1500.0 | ||
| 27441 | MEX Table | constructive algorithms greedy | Statement | A | Hello 2025 {2057} | PROGRAMMING | 500.0 | ||
| 717 | Secret Message | constructive algorithms math | Statement | G | Hello 2025 {2057} | PROGRAMMING | 3750.0 | ||
| 348 | Stop Gaming (Hard Version) | brute force constructive algorithms data structures | Statement | E2 | Codeforces Round 1002 (Div. 2) {2059} | PROGRAMMING | 1500.0 | 139094 | |
| 12478 | Customer Service | brute force constructive algorithms graph matchings greedy math sortings | Statement | C | Codeforces Round 1002 (Div. 2) {2059} | PROGRAMMING | 1500.0 | 139094 | |
| 882 | Stop Gaming (Easy Version) | brute force constructive algorithms greedy hashing | Statement | E1 | Codeforces Round 1002 (Div. 2) {2059} | PROGRAMMING | 1500.0 | 139094 | |
| 18705 | Cost of the Array | brute force constructive algorithms greedy math | Statement | B | Codeforces Round 1002 (Div. 2) {2059} | PROGRAMMING | 1000.0 | 139094 | |
| 29089 | Milya and Two Arrays | constructive algorithms greedy sortings | Statement | A | Codeforces Round 1002 (Div. 2) {2059} | PROGRAMMING | 500.0 | 139094 | |
| 14621 | Kevin and Geometry | brute force constructive algorithms data structures geometry greedy implementation math two pointers | Statement | B | IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2) {2061} | PROGRAMMING | 1000.0 | IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2) Editorial | |
| 489 | Kevin and Teams | constructive algorithms graphs interactive | Statement | G | IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2) {2061} | PROGRAMMING | 3000.0 | IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2) Editorial | |
| 22245 | Kevin and Arithmetic | constructive algorithms greedy math | Statement | A | IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2) {2061} | PROGRAMMING | 500.0 | IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2) Editorial | |
| 18288 | Cirno and Operations | brute force constructive algorithms | Statement | C | Ethflow Round 1 (Codeforces Round 1001, Div. 1 + Div. 2) {2062} | PROGRAMMING | 1000.0 | Ethflow Round 1 (Codeforces Round 1001, Div. 1 + Div. 2) Editorial | |
| 17669 | Remove the Ends | brute force constructive algorithms dp greedy | Statement | C | Codeforces Round 1005 (Div. 2) {2064} | PROGRAMMING | 1250.0 | Codeforces Round 1005 (Div. 2) Editorial | |
| 20017 | Variety is Discouraged | constructive algorithms constructive algorithms greedy greedy | Statement | B | Codeforces Round 1005 (Div. 2) {2064} | PROGRAMMING | 1000.0 | Codeforces Round 1005 (Div. 2) Editorial | |
| 55215 | Skibidus and Amog'u | brute force constructive algorithms implementation strings | Statement | A | Codeforces Round 1003 (Div. 4) {2065} | PROGRAMMING | Video Tutorial | ||
| 11900 | Skibidus and Rizz | constructive algorithms greedy | Statement | E | Codeforces Round 1003 (Div. 4) {2065} | PROGRAMMING | Video Tutorial | ||
| 71 | Curse | constructive algorithms dp math | Statement | F | Codeforces Round 1004 (Div. 1) {2066} | PROGRAMMING | 3000.0 | 139415 | |
| 5423 | White Magic | constructive algorithms greedy implementation | Statement | B | Codeforces Round 1004 (Div. 1) {2066} | PROGRAMMING | 750.0 | 139415 | |
| 25607 | Adjacent Digit Sums | constructive algorithms math | Statement | A | Codeforces Round 1004 (Div. 2) {2067} | PROGRAMMING | 500.0 | ||
| 142 | Urban Planning | constructive algorithms | Statement | B | European Championship 2025 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {2068} | PROGRAMMING | 140239 | ||
| 993 | Condorcet Elections | constructive algorithms graphs probabilities | Statement | A | European Championship 2025 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {2068} | PROGRAMMING | 140239 | ||
| 403 | Statues | constructive algorithms greedy | Statement | H | European Championship 2025 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {2068} | PROGRAMMING | 140239 | ||
| 1893 | A, B, AB and BA | constructive algorithms greedy sortings strings | Statement | E | Educational Codeforces Round 174 (Rated for Div. 2) {2069} | PROGRAMMING | 139774 | ||
| 1073 | Infinite Sequence (Hard Version) | bitmasks constructive algorithms data structures dp implementation math | Statement | D2 | Codeforces Round 1007 (Div. 2) {2071} | PROGRAMMING | 1250.0 | Codeforces Round 1007 (Div. 2) Editorial | |
| 20785 | Perfecto | brute force constructive algorithms greedy math probabilities | Statement | B | Codeforces Round 1007 (Div. 2) {2071} | PROGRAMMING | 1000.0 | Codeforces Round 1007 (Div. 2) Editorial | |
| 9624 | Trapmigiano Reggiano | constructive algorithms dfs and similar sortings trees | Statement | C | Codeforces Round 1007 (Div. 2) {2071} | PROGRAMMING | 1500.0 | Codeforces Round 1007 (Div. 2) Editorial | |
| 12206 | Do You Love Your Hero and His Two-Hit Multi-Target Attacks? | binary search constructive algorithms geometry greedy math | Statement | E | Codeforces Round 1006 (Div. 3) {2072} | PROGRAMMING | Codeforces Round 1006 (Div. 3) Editorial | ||
| 8401 | Goodbye, Banker Life | bitmasks combinatorics constructive algorithms math number theory | Statement | F | Codeforces Round 1006 (Div. 3) {2072} | PROGRAMMING | Codeforces Round 1006 (Div. 3) Editorial | ||
| 19460 | Creating Keys for StORages Has Become My Main Skill | bitmasks constructive algorithms greedy | Statement | C | Codeforces Round 1006 (Div. 3) {2072} | PROGRAMMING | Codeforces Round 1006 (Div. 3) Editorial | ||
| 30865 | Having Been a Treasurer in the Past, I Help Goblins Deceive | combinatorics constructive algorithms strings | Statement | B | Codeforces Round 1006 (Div. 3) {2072} | PROGRAMMING | Codeforces Round 1006 (Div. 3) Editorial | ||
| 258 | AND x OR | bitmasks constructive algorithms dp | Statement | F | Codeforces Round 1008 (Div. 1) {2077} | PROGRAMMING | 2500.0 | Codeforces Round 1008 (Div. 1, Div. 2) Editorial | |
| 3642 | Finding OR Sum | bitmasks constructive algorithms implementation interactive math | Statement | B | Codeforces Round 1008 (Div. 1) {2077} | PROGRAMMING | 1000.0 | Codeforces Round 1008 (Div. 1, Div. 2) Editorial | |
| 14426 | Breach of Faith | constructive algorithms greedy math sortings | Statement | A | Codeforces Round 1008 (Div. 1) {2077} | PROGRAMMING | 500.0 | Codeforces Round 1008 (Div. 1, Div. 2) Editorial | |
| 18221 | Vicious Labyrinth | constructive algorithms graphs greedy implementation math | Statement | B | Codeforces Round 1008 (Div. 2) {2078} | PROGRAMMING | 750.0 | Codeforces Round 1008 (Div. 1, Div. 2) Editorial | |
| 44 | Strong Connectivity Strikes Back | *special constructive algorithms graphs | Statement | A | XIX Open Olympiad in Informatics - Final Stage, Day 2 (Unrated, Online Mirror, IOI rules) {2080} | PROGRAMMING | |||
| 1170 | MST in Modulo Graph | constructive algorithms dsu graphs greedy math number theory sortings | Statement | D | Codeforces Round 1010 (Div. 1, Unrated) {2081} | PROGRAMMING | 1750.0 | Codeforces Round 1010 (Div. 1, Div. 2, based on Zhili Cup 2025) Editorial | |
| 139 | Hot Matrix | constructive algorithms math | Statement | F | Codeforces Round 1010 (Div. 1, Unrated) {2081} | PROGRAMMING | 2500.0 | Codeforces Round 1010 (Div. 1, Div. 2, based on Zhili Cup 2025) Editorial | |
| 8765 | Arcology On Permafrost | binary search brute force constructive algorithms greedy math | Statement | D | Teza Round 1 (Codeforces Round 1015, Div. 1 + Div. 2) {2084} | PROGRAMMING | 1750.0 | 141155 | |
| 505 | Skyscape | constructive algorithms data structures greedy | Statement | F | Teza Round 1 (Codeforces Round 1015, Div. 1 + Div. 2) {2084} | PROGRAMMING | 3000.0 | 141155 | |
| 11628 | You Soared Afar With Grace | constructive algorithms greedy implementation | Statement | C | Teza Round 1 (Codeforces Round 1015, Div. 1 + Div. 2) {2084} | PROGRAMMING | 1500.0 | 141155 |