Review the problem statement from Codeforces (link will open a new tab). When you've matched your problem, go to the solutions.
Search on plain tags, ratings, names, and problem text. Example: brute force or binary search
< 1 2 3 4 5 6 7 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 2844 | In Search of Truth (Easy Version) | brute force constructive algorithms interactive math probabilities | Statement | G1 | Codeforces Round 878 (Div. 3) {1840} | PROGRAMMING | Codeforces Round #878 (Div.3) Editorial | ||
| 1215 | In Search of Truth (Hard Version) | constructive algorithms interactive math probabilities | Statement | G2 | Codeforces Round 878 (Div. 3) {1840} | PROGRAMMING | Codeforces Round #878 (Div.3) Editorial | ||
| 26091 | Game with Board | constructive algorithms games | Statement | A | Educational Codeforces Round 150 (Rated for Div. 2) {1841} | PROGRAMMING | 117262 | ||
| 4815 | Tenzing and His Animal Friends | brute force constructive algorithms graphs greedy shortest paths | Statement | D | CodeTON Round 5 (Div. 1 + Div. 2, Rated, Prizes!) {1842} | PROGRAMMING | 1500.0 | CodeTON Round 5 Editorial | |
| 1202 | Tree Weights | bitmasks constructive algorithms data structures dfs and similar math matrices number theory trees | Statement | G | Codeforces Round 884 (Div. 1 + Div. 2) {1844} | PROGRAMMING | 3500.0 | Codeforces Round #884 (Div. 1 + Div. 2) Editorial | |
| 2189 | Great Grids | constructive algorithms dfs and similar dsu graphs math | Statement | E | Codeforces Round 884 (Div. 1 + Div. 2) {1844} | PROGRAMMING | 2000.0 | Codeforces Round #884 (Div. 1 + Div. 2) Editorial | |
| 26038 | Subtraction Game | constructive algorithms games math | Statement | A | Codeforces Round 884 (Div. 1 + Div. 2) {1844} | PROGRAMMING | 500.0 | Codeforces Round #884 (Div. 1 + Div. 2) Editorial | |
| 18053 | Particles | constructive algorithms greedy implementation math | Statement | C | Codeforces Round 884 (Div. 1 + Div. 2) {1844} | PROGRAMMING | 1250.0 | Codeforces Round #884 (Div. 1 + Div. 2) Editorial | |
| 20383 | Permutations & Primes | constructive algorithms greedy math | Statement | B | Codeforces Round 884 (Div. 1 + Div. 2) {1844} | PROGRAMMING | 1000.0 | Codeforces Round #884 (Div. 1 + Div. 2) Editorial | |
| 13946 | Row Major | constructive algorithms math number theory strings | Statement | D | Codeforces Round 884 (Div. 1 + Div. 2) {1844} | PROGRAMMING | 1500.0 | Codeforces Round #884 (Div. 1 + Div. 2) Editorial | |
| 22833 | Rudolph and Christmas Tree | constructive algorithms geometry math | Statement | D | Codeforces Round 883 (Div. 3) {1846} | PROGRAMMING | |||
| 3773 | Rudolph and Mimic | constructive algorithms greedy implementation interactive | Statement | F | Codeforces Round 883 (Div. 3) {1846} | PROGRAMMING | |||
| 21783 | Rudolf and the Another Competition | constructive algorithms greedy implementation sortings | Statement | C | Codeforces Round 883 (Div. 3) {1846} | PROGRAMMING | |||
| 18509 | Vika and Her Friends | constructive algorithms games math | Statement | A | Codeforces Round 885 (Div. 2) {1848} | PROGRAMMING | 500.0 | Codeforces Round #885 (Div.2) Editorial | |
| 10480 | Array Painting | brute force constructive algorithms dp greedy | Statement | D | Educational Codeforces Round 152 (Rated for Div. 2) {1849} | PROGRAMMING | 118752 | ||
| 31674 | Escalator Conversations | brute force constructive algorithms implementation math | Statement | A | Codeforces Round 888 (Div. 3) {1851} | PROGRAMMING | 118667 | ||
| 237 | Rivalries | constructive algorithms data structures | Statement | E | Codeforces Round 887 (Div. 1) {1852} | PROGRAMMING | 2250.0 | Codeforces Round 887 (Div 1, Div 2) Tutorial | |
| 630 | Miriany and Matchstick | constructive algorithms dp greedy | Statement | D | Codeforces Round 887 (Div. 1) {1852} | PROGRAMMING | 2000.0 | Codeforces Round 887 (Div 1, Div 2) Tutorial | |
| 5533 | Imbalanced Arrays | constructive algorithms greedy sortings two pointers | Statement | B | Codeforces Round 887 (Div. 1) {1852} | PROGRAMMING | 750.0 | Codeforces Round 887 (Div 1, Div 2) Tutorial | |
| 16147 | Dual (Easy Version) | constructive algorithms math | Statement | A1 | Codeforces Round 889 (Div. 1) {1854} | PROGRAMMING | 750.0 | Editorial of Codeforces Round 889 (Div. 1 + Div. 2) | |
| 8032 | Dual (Hard Version) | constructive algorithms math | Statement | A2 | Codeforces Round 889 (Div. 1) {1854} | PROGRAMMING | 750.0 | Editorial of Codeforces Round 889 (Div. 1 + Div. 2) | |
| 27762 | Good Arrays | constructive algorithms implementation math | Statement | B | Codeforces Round 890 (Div. 2) supported by Constructor Institute {1856} | PROGRAMMING | 750.0 | Codeforces Round #890 (Div. 2) Editorial | |
| 25715 | Yet Another Permutation Problem | constructive algorithms math number theory | Statement | C | Codeforces Round 893 (Div. 2) {1858} | PROGRAMMING | 1500.0 | Codeforces Round #893 (Div. 2) Editorial | 1000 |
| 3235 | Trees and Segments | binary search brute force constructive algorithms data structures dp greedy two pointers | Statement | D | Codeforces Round 893 (Div. 2) {1858} | PROGRAMMING | 2000.0 | Codeforces Round #893 (Div. 2) Editorial | 2200 |
| 58085 | United We Stand | constructive algorithms graphs math | Statement | A | Codeforces Round 892 (Div. 2) {1859} | PROGRAMMING | 500.0 | Video solutions from Geothermal. | |
| 46423 | Olya and Game with Arrays | constructive algorithms greedy math sortings | Statement | B | Codeforces Round 892 (Div. 2) {1859} | PROGRAMMING | 1000.0 | Video solutions from Geothermal. | |
| 3663 | Balanced String | bitmasks constructive algorithms dp | Statement | D | Educational Codeforces Round 153 (Rated for Div. 2) {1860} | PROGRAMMING | Educational Codeforces Round 153 Editorial | ||
| 23747 | Not a Substring | constructive algorithms dp strings | Statement | A | Educational Codeforces Round 153 (Rated for Div. 2) {1860} | PROGRAMMING | Educational Codeforces Round 153 Editorial | ||
| 24246 | Two Binary Strings | constructive algorithms dfs and similar greedy | Statement | B | Educational Codeforces Round 154 (Rated for Div. 2) {1861} | PROGRAMMING | Educational Codeforces Round 154 Editorial | ||
| 26122 | Prime Deletion | constructive algorithms implementation | Statement | A | Educational Codeforces Round 154 (Rated for Div. 2) {1861} | PROGRAMMING | Educational Codeforces Round 154 Editorial | ||
| 20124 | Ice Cream Balls | binary search combinatorics constructive algorithms math | Statement | D | Codeforces Round 894 (Div. 3) {1862} | PROGRAMMING | Tutorial | ||
| 12975 | Kolya and Movie Theatre | constructive algorithms data structures greedy | Statement | E | Codeforces Round 894 (Div. 3) {1862} | PROGRAMMING | Tutorial | ||
| 133 | Redundant Routes | constructive algorithms dp trees | Statement | I | Pinely Round 2 (Div. 1 + Div. 2) {1863} | PROGRAMMING | 4000.0 | ||
| 10888 | Two-Colored Dominoes | constructive algorithms greedy | Statement | D | Pinely Round 2 (Div. 1 + Div. 2) {1863} | PROGRAMMING | 1250.0 | ||
| 3111 | Guess Game | bitmasks combinatorics constructive algorithms data structures games math probabilities strings trees | Statement | E | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) {1864} | PROGRAMMING | 2000.0 | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) Editorial | |
| 15455 | Divisor Chain | bitmasks constructive algorithms math number theory | Statement | C | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) {1864} | PROGRAMMING | 1250.0 | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) Editorial | |
| 7719 | Matrix Cascade | brute force constructive algorithms dp greedy | Statement | D | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) {1864} | PROGRAMMING | 1500.0 | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) Editorial | |
| 21510 | Increasing and Decreasing | constructive algorithms implementation math | Statement | A | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) {1864} | PROGRAMMING | 500.0 | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) Editorial | |
| 18774 | XOR Palindromes | bitmasks constructive algorithms strings | Statement | B | Codeforces Round 897 (Div. 2) {1867} | PROGRAMMING | 1000.0 | ||
| 549 | Most Different Tree | brute force constructive algorithms dfs and similar greedy hashing | Statement | F | Codeforces Round 897 (Div. 2) {1867} | PROGRAMMING | 4000.0 | ||
| 12793 | Salyg1n and the MEX Game | constructive algorithms data structures games greedy interactive | Statement | C | Codeforces Round 897 (Div. 2) {1867} | PROGRAMMING | 1250.0 | ||
| 6943 | Cyclic Operations | constructive algorithms dfs and similar graphs greedy implementation | Statement | D | Codeforces Round 897 (Div. 2) {1867} | PROGRAMMING | 2000.0 | ||
| 4395 | Salyg1n and Array (simple version) | constructive algorithms interactive math | Statement | E1 | Codeforces Round 897 (Div. 2) {1867} | PROGRAMMING | 2000.0 | ||
| 3799 | Salyg1n and Array (hard version) | constructive algorithms interactive math | Statement | E2 | Codeforces Round 897 (Div. 2) {1867} | PROGRAMMING | 1000.0 | ||
| 21208 | green_gold_dog, array and permutation | constructive algorithms sortings | Statement | A | Codeforces Round 897 (Div. 2) {1867} | PROGRAMMING | 500.0 | ||
| 2802 | Candy Party (Hard Version) | bitmasks constructive algorithms dp graphs greedy implementation math | Statement | B2 | Codeforces Round 896 (Div. 1) {1868} | PROGRAMMING | 750.0 | Codeforces Round 896 (Div. 1, Div. 2) Editorial | |
| 8420 | Candy Party (Easy Version) | bitmasks constructive algorithms graphs greedy implementation math | Statement | B1 | Codeforces Round 896 (Div. 1) {1868} | PROGRAMMING | 500.0 | Codeforces Round 896 (Div. 1, Div. 2) Editorial | |
| 411 | Flower-like Pseudotree | constructive algorithms graphs implementation trees | Statement | D | Codeforces Round 896 (Div. 1) {1868} | PROGRAMMING | 1750.0 | Codeforces Round 896 (Div. 1, Div. 2) Editorial | |
| 13724 | Fill in the Matrix | constructive algorithms implementation | Statement | A | Codeforces Round 896 (Div. 1) {1868} | PROGRAMMING | 500.0 | Codeforces Round 896 (Div. 1, Div. 2) Editorial | |
| 20308 | MEXanized Array | constructive algorithms greedy math | Statement | A | CodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!) {1870} | PROGRAMMING | 500.0 | CodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 2788 | Autosynthesis | 2-sat constructive algorithms dfs and similar dp flows graphs trees | Statement | C | Codeforces Round 902 (Div. 1, based on COMPFEST 15 - Final Round) {1876} | PROGRAMMING | 1250.0 | Codeforces Round #902 (Div. 1, Div. 2, based on COMPFEST 15 — Final Round) Editorial | |
| 363 | Ball-Stackable | constructive algorithms data structures dp trees | Statement | E | Codeforces Round 902 (Div. 1, based on COMPFEST 15 - Final Round) {1876} | PROGRAMMING | 2250.0 | Codeforces Round #902 (Div. 1, Div. 2, based on COMPFEST 15 — Final Round) Editorial | |
| 34444 | Aleksa and Stack | constructive algorithms math | Statement | B | Codeforces Round 900 (Div. 3) {1878} | PROGRAMMING | Codeforces round #900 (Div.3) Editorial | ||
| 1603 | Interactive Game with Coloring | brute force constructive algorithms graphs implementation interactive math trees | Statement | E | Educational Codeforces Round 155 (Rated for Div. 2) {1879} | PROGRAMMING | 120773 | 2400 | |
| 25249 | Chips on the Board | constructive algorithms greedy | Statement | B | Educational Codeforces Round 155 (Rated for Div. 2) {1879} | PROGRAMMING | 120773 | 900 | |
| 17557 | Sets and Union | bitmasks brute force constructive algorithms greedy | Statement | B | Codeforces Round 899 (Div. 2) {1882} | PROGRAMMING | 1000.0 | Codeforces Round 899 (Div. 2) Editorial | |
| 1248 | Two Permutations (Easy Version) | brute force constructive algorithms greedy number theory | Statement | E1 | Codeforces Round 899 (Div. 2) {1882} | PROGRAMMING | 2000.0 | Codeforces Round 899 (Div. 2) Editorial | |
| 19243 | Simple Design | brute force constructive algorithms greedy math | Statement | A | Codeforces Round 904 (Div. 2) {1884} | PROGRAMMING | 500.0 | Codeforces Round #904 (Div. 2) Editorial | |
| 27876 | Sum of Three | brute force constructive algorithms math | Statement | A | Educational Codeforces Round 156 (Rated for Div. 2) {1886} | PROGRAMMING | Educational Codeforces Round 156 Editorial | ||
| 17313 | Decreasing String | constructive algorithms strings | Statement | C | Educational Codeforces Round 156 (Rated for Div. 2) {1886} | PROGRAMMING | Educational Codeforces Round 156 Editorial | ||
| 522 | Good Colorings | binary search constructive algorithms graphs interactive | Statement | E | Codeforces Round 905 (Div. 1) {1887} | PROGRAMMING | 2000.0 | Codeforces Round #905 (Div. 1, Div. 2, Div. 3) Editorial | |
| 2337 | Minimum Array | constructive algorithms data structures two pointers | Statement | C | Codeforces Round 905 (Div. 1) {1887} | PROGRAMMING | 1000.0 | Codeforces Round #905 (Div. 1, Div. 2, Div. 3) Editorial | |
| 15493 | Qingshan Loves Strings 2 | constructive algorithms greedy | Statement | A | Codeforces Round 906 (Div. 1) {1889} | PROGRAMMING | 750.0 | Codeforces Round 906 Editorial | |
| 21413 | Smilo and Monsters | constructive algorithms greedy sortings two pointers | Statement | C | Codeforces Round 907 (Div. 2) {1891} | PROGRAMMING | 1000.0 | ||
| 20631 | Sorting with Twos | constructive algorithms sortings | Statement | A | Codeforces Round 907 (Div. 2) {1891} | PROGRAMMING | 500.0 | ||
| 1121 | Colorful Constructive | constructive algorithms greedy math | Statement | D | Codeforces Round 908 (Div. 1) {1893} | PROGRAMMING | 2250.0 | Codeforces Round 908 (Div. 1, Div, 2) Editorial | |
| 11801 | Neutral Tonality | constructive algorithms greedy sortings two pointers | Statement | B | Codeforces Round 908 (Div. 1) {1893} | PROGRAMMING | 1000.0 | Codeforces Round 908 (Div. 1, Div, 2) Editorial | |
| 7224 | XOR Construction | bitmasks constructive algorithms data structures math trees | Statement | D | Educational Codeforces Round 157 (Rated for Div. 2) {1895} | PROGRAMMING | Educational Codeforces Round 157 Editorial | ||
| 11812 | Matching Arrays | binary search constructive algorithms greedy sortings | Statement | C | CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!) {1896} | PROGRAMMING | 1500.0 | CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 1002 | Bracket Xoring | constructive algorithms implementation | Statement | F | CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!) {1896} | PROGRAMMING | 2750.0 | CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 436 | Pepe Racing | constructive algorithms interactive sortings | Statement | G | CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!) {1896} | PROGRAMMING | 3250.0 | CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 6596 | Colorful Grid | constructive algorithms implementation | Statement | C | Codeforces Round 910 (Div. 2) {1898} | PROGRAMMING | 1750.0 | Editorial for Codeforces Round #910 (Div. 2) | |
| 9655 | Alex's whims | constructive algorithms graphs shortest paths trees | Statement | F | Codeforces Round 909 (Div. 3) {1899} | PROGRAMMING | Разбор Codeforces Round 909 (Div. 3) | ||
| 2693 | Transitive Graph | constructive algorithms dfs and similar dp graphs implementation | Statement | E | Codeforces Round 911 (Div. 2) {1900} | PROGRAMMING | 2250.0 | Codeforces Round 911 (Div. 2) Editorial | |
| 69231 | Cover in Water | constructive algorithms implementation | Statement | A | Codeforces Round 911 (Div. 2) {1900} | PROGRAMMING | 500.0 | Codeforces Round 911 (Div. 2) Editorial | |
| 14479 | Add, Divide and Floor | constructive algorithms greedy math | Statement | C | Educational Codeforces Round 158 (Rated for Div. 2) {1901} | PROGRAMMING | Educational Codeforces Round 158 Editorial | ||
| 17446 | Insert and Equalize | brute force constructive algorithms greedy math number theory | Statement | C | Educational Codeforces Round 159 (Rated for Div. 2) {1902} | PROGRAMMING | Educational Codeforces Round 159 Editorial | ||
| 15026 | StORage room | bitmasks brute force constructive algorithms greedy | Statement | B | Codeforces Round 912 (Div. 2) {1903} | PROGRAMMING | 1000.0 | Codeforces Round #912 (Div. 2) Editorial | |
| 2577 | Geo Game | constructive algorithms dp games greedy interactive math | Statement | E | Codeforces Round 912 (Div. 2) {1903} | PROGRAMMING | 2250.0 | Codeforces Round #912 (Div. 2) Editorial | |
| 14729 | Theofanis' Nightmare | constructive algorithms dp greedy | Statement | C | Codeforces Round 912 (Div. 2) {1903} | PROGRAMMING | 1500.0 | Codeforces Round #912 (Div. 2) Editorial | |
| 5828 | Set To Max (Hard Version) | binary search constructive algorithms data structures dsu greedy implementation sortings two pointers | Statement | D2 | Codeforces Round 914 (Div. 2) {1904} | PROGRAMMING | 750.0 | Codeforces Round 914 (Div. 2) Editorial | |
| 8792 | Set To Max (Easy Version) | brute force constructive algorithms greedy | Statement | D1 | Codeforces Round 914 (Div. 2) {1904} | PROGRAMMING | 1250.0 | Codeforces Round 914 (Div. 2) Editorial | |
| 4734 | 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 | |
| 858 | 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 | ||
| 2532 | 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 | ||
| 2401 | Lights | constructive algorithms dfs and similar graphs greedy implementation | Statement | G | Codeforces Round 913 (Div. 3) {1907} | PROGRAMMING | Codeforces Round 913 (Div. 3) Editorial | ||
| 23438 | Removal of Unattractive Pairs | constructive algorithms greedy math strings | Statement | C | Codeforces Round 913 (Div. 3) {1907} | PROGRAMMING | Codeforces Round 913 (Div. 3) Editorial | ||
| 1727 | 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) | |
| 115 | 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) | |
| 13382 | 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) | |
| 1293 | 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 | |
| 33468 | Preparing for the Contest | constructive algorithms math | Statement | B | Codeforces Round 916 (Div. 3) {1914} | PROGRAMMING | Codeforces Round 916 (Div. 3) Editorial | ||
| 9866 | Mathematical Problem | brute force constructive algorithms implementation math strings | Statement | D | Good Bye 2023 {1916} | PROGRAMMING | 1500.0 | ||
| 743 | Group Division | constructive algorithms dfs and similar graphs | Statement | F | Good Bye 2023 {1916} | PROGRAMMING | 2750.0 | ||
| 20092 | Training Before the Olympiad | constructive algorithms games implementation math | Statement | C | Good Bye 2023 {1916} | PROGRAMMING | 1250.0 | ||
| 28477 | 2023 | constructive algorithms implementation math number theory | Statement | A | Good Bye 2023 {1916} | PROGRAMMING | 250.0 | ||
| 32670 | Two Divisors | constructive algorithms math number theory | Statement | B | Good Bye 2023 {1916} | PROGRAMMING | 750.0 | ||
| 1248 | 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) | |
| 27433 | Least Product | constructive algorithms math | Statement | A | Codeforces Round 917 (Div. 2) {1917} | PROGRAMMING | 500.0 | Editorial of Codeforces Round 917 (Div. 2) | |
| 1657 | Construct Matrix | constructive algorithms math | Statement | E | Codeforces Round 917 (Div. 2) {1917} | PROGRAMMING | 2500.0 | Editorial of Codeforces Round 917 (Div. 2) | |
| 27394 | 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 | |
| 32561 | Brick Wall | constructive algorithms greedy implementation math | Statement | A | Codeforces Round 922 (Div. 2) {1918} | PROGRAMMING | 500.0 | Codeforces Round #922 (Div. 2) Editorial | |
| 218 | Tree LGM | constructive algorithms games trees | Statement | G | Hello 2024 {1919} | PROGRAMMING | 4000.0 | 3500 | |
| 9254 | Increasing Subsequences | bitmasks constructive algorithms math | Statement | E | Educational Codeforces Round 161 (Rated for Div. 2) {1922} | PROGRAMMING | Educational Codeforces Round 161 Editorial | ||
| 29007 | Tricky Template | constructive algorithms implementation strings | Statement | A | Educational Codeforces Round 161 (Rated for Div. 2) {1922} | PROGRAMMING | Educational Codeforces Round 161 Editorial | ||
| 18737 | Find B | constructive algorithms data structures greedy | Statement | C | Educational Codeforces Round 162 (Rated for Div. 2) {1923} | PROGRAMMING | Educational Codeforces Round 162 Editorial | ||
| 16997 | 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 | |
| 234 | 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 | |
| 31322 | 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 | |
| 2135 | Vlad and Avoiding X | bitmasks brute force constructive algorithms dfs and similar dp implementation | Statement | F | Codeforces Round 928 (Div. 4) {1926} | PROGRAMMING | 126132 | ||
| 38580 | Following the String | constructive algorithms greedy strings | Statement | B | Codeforces Round 923 (Div. 3) {1927} | PROGRAMMING | 125597 | ||
| 17301 | Klever Permutation | constructive algorithms math | Statement | E | Codeforces Round 923 (Div. 3) {1927} | PROGRAMMING | 125597 | ||
| 2238 | 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 | |
| 24548 | Rectangle Cutting | constructive algorithms geometry greedy math | Statement | A | Codeforces Round 924 (Div. 2) {1928} | PROGRAMMING | 500.0 | Codeforces Round 924 Editorial | |
| 26872 | 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. | |
| 35312 | 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. | |
| 17853 | Permutation Printing | brute force constructive algorithms math | Statement | B | think-cell Round 1 {1930} | PROGRAMMING | 1000.0 | think-cell Round 1 Editorial | |
| 8226 | Lexicographically Largest | constructive algorithms data structures greedy sortings | Statement | C | think-cell Round 1 {1930} | PROGRAMMING | 1500.0 | think-cell Round 1 Editorial | |
| 3782 | One-Dimensional Puzzle | combinatorics constructive algorithms math number theory | Statement | G | Codeforces Round 925 (Div. 3) {1931} | PROGRAMMING | 125878 | ||
| 23871 | 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 | ||
| 4238 | XOR Break --- Solo Version | bitmasks constructive algorithms greedy | Statement | D1 | Codeforces Round 931 (Div. 2) {1934} | PROGRAMMING | 1500.0 | Tutorial | |
| 8229 | Find a Mine | constructive algorithms geometry greedy interactive math | Statement | C | Codeforces Round 931 (Div. 2) {1934} | PROGRAMMING | 1500.0 | Tutorial | |
| 27462 | Too Min Too Max | constructive algorithms greedy math | Statement | A | Codeforces Round 931 (Div. 2) {1934} | PROGRAMMING | 500.0 | Tutorial | |
| 9900 | 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 | |
| 632 | 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 | |
| 30506 | Entertainment in MAC | constructive algorithms strings | Statement | A | Codeforces Round 932 (Div. 2) {1935} | PROGRAMMING | 500.0 | Codeforces Round #932 (Div. 2) Editorial | |
| 8753 | 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 | |
| 308 | 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 | |||
| 177 | 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 | |||
| 106 | 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 | |||
| 275 | 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 | |||
| 18584 | 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 | |
| 15668 | 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 | |
| 2690 | 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 | |
| 941 | Cook and Porridge | binary search constructive algorithms data structures implementation | Statement | G | Codeforces Round 935 (Div. 3) {1945} | PROGRAMMING | 127377 | ||
| 5673 | 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 | |
| 3576 | Clique Partition | constructive algorithms graphs greedy | Statement | E | Educational Codeforces Round 163 (Rated for Div. 2) {1948} | PROGRAMMING | Educational Codeforces Round 163 Editorial | ||
| 480 | Make Triangle | constructive algorithms math | Statement | K | European Championship 2024 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1949} | PROGRAMMING | European Championship 2024 (EUC) Editorial | ||
| 1002 | Inversion Composition | binary search constructive algorithms data structures greedy | Statement | F | Codeforces Global Round 25 {1951} | PROGRAMMING | 2750.0 | Codeforces Global Round 25 Editorial | |
| 4583 | 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 | |
| 118 | Growing Trees | constructive algorithms flows graphs greedy | Statement | I | Codeforces Global Round 25 {1951} | PROGRAMMING | 4000.0 | Codeforces Global Round 25 Editorial | |
| 6373 | Buying Jewels | constructive algorithms greedy math | Statement | D | Codeforces Global Round 25 {1951} | PROGRAMMING | 1750.0 | Codeforces Global Round 25 Editorial | |
| 910 | 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 | ||
| 1554 | The Most Reckless Defense | bitmasks brute force constructive algorithms dp flows graph matchings | Statement | H | Codeforces Round 938 (Div. 3) {1955} | PROGRAMMING | 128243 | ||
| 32732 | Progressive Square | constructive algorithms data structures implementation sortings | Statement | B | Codeforces Round 938 (Div. 3) {1955} | PROGRAMMING | 128243 | ||
| 4855 | 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) | |
| 703 | 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) | |
| 15327 | 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) | |
| 20728 | 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 |
| 25802 | 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 |
| 8266 | 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 |
| 2468 | 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 |
| 475 | 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 |
| 17429 | 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 |
| 19699 | 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 |
| 29609 | Assembly via Remainders | constructive algorithms number theory | Statement | C | Codeforces Round 943 (Div. 3) {1968} | PROGRAMMING | 129096 | 1000 | |
| 22555 | Shifts and Sorting | constructive algorithms greedy | Statement | B | Educational Codeforces Round 165 (Rated for Div. 2) {1969} | PROGRAMMING | Educational Codeforces Round 165 Editorial | 1000 | |
| 22291 | Two Friends | constructive algorithms implementation math | Statement | A | Educational Codeforces Round 165 (Rated for Div. 2) {1969} | PROGRAMMING | Educational Codeforces Round 165 Editorial | 800 | |
| 966 | 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 | |
| 621 | 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 | |
| 685 | 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 | |
| 330 | 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 | |
| 9957 | 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 |
| 18005 | Ingenuity-2 | constructive algorithms greedy implementation | Statement | D | Codeforces Round 946 (Div. 3) {1974} | PROGRAMMING | Codeforces Round #946 (Div. 3) Editorial | 1400 | |
| 20096 | Binary Colouring | bitmasks constructive algorithms greedy math | Statement | B | Codeforces Round 948 (Div. 2) {1977} | PROGRAMMING | 1250.0 | 129858 | 1100 |
| 947 | Tensor | constructive algorithms graphs interactive | Statement | E | Codeforces Round 948 (Div. 2) {1977} | PROGRAMMING | 2500.0 | 129858 | 2600 |
| 18006 | Manhattan Permutations | constructive algorithms greedy implementation math | Statement | C | Codeforces Round 953 (Div. 2) {1978} | PROGRAMMING | 1250.0 | 130527 | |
| 28795 | Alice and Books | constructive algorithms sortings | Statement | A | Codeforces Round 953 (Div. 2) {1978} | PROGRAMMING | 500.0 | 130527 | |
| 22454 | 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 | |
| 1852 | 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 | |
| 7952 | 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 | |
| 13221 | Permutation of Rows and Columns | constructive algorithms data structures hashing math matrices sortings | Statement | E | Codeforces Round 950 (Div. 3) {1980} | PROGRAMMING | 130135 | ||
| 21943 | Sofia and the Lost Operations | constructive algorithms greedy | Statement | C | Codeforces Round 950 (Div. 3) {1980} | PROGRAMMING | 130135 | ||
| 6433 | 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 | |
| 2208 | 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 | |
| 11458 | Swap Dilemma | constructive algorithms divide and conquer greedy math sortings | Statement | D | Codeforces Round 956 (Div. 2) and ByteRace 2024 {1983} | PROGRAMMING | 1750.0 | ||
| 18587 | Corner Twist | constructive algorithms greedy implementation math | Statement | B | Codeforces Round 956 (Div. 2) and ByteRace 2024 {1983} | PROGRAMMING | 1000.0 | ||
| 28246 | Array Divisibility | constructive algorithms math | Statement | A | Codeforces Round 956 (Div. 2) and ByteRace 2024 {1983} | PROGRAMMING | 500.0 | ||
| 1865 | Shuffle | constructive algorithms dp greedy trees | Statement | E | Codeforces Global Round 26 {1984} | PROGRAMMING | 3000.0 | Codeforces Global Round 26 Editorial | |
| 21194 | Large Addition | constructive algorithms implementation math | Statement | B | Codeforces Global Round 26 {1984} | PROGRAMMING | 750.0 | Codeforces Global Round 26 Editorial | |
| 305 | Magic Trick II | constructive algorithms implementation sortings | Statement | G | Codeforces Global Round 26 {1984} | PROGRAMMING | 4000.0 | Codeforces Global Round 26 Editorial | |
| 20540 | 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) | |
| 1215 | 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 | |
| 20076 | Array Craft | constructive algorithms greedy | Statement | B | Codeforces Round 960 (Div. 2) {1990} | PROGRAMMING | 1000.0 | Video Tutorial | |
| 7980 | 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 | |
| 19129 | AND Reconstruction | bitmasks constructive algorithms greedy | Statement | B | Pinely Round 4 (Div. 1 + Div. 2) {1991} | PROGRAMMING | 500.0 | Video Tutorial | |
| 5210 | Coloring Game | constructive algorithms games graphs greedy interactive | Statement | E | Pinely Round 4 (Div. 1 + Div. 2) {1991} | PROGRAMMING | 2000.0 | Video Tutorial | |
| 172 | Grid Game | constructive algorithms games greedy interactive | Statement | I | Pinely Round 4 (Div. 1 + Div. 2) {1991} | PROGRAMMING | 4000.0 | Video Tutorial | |
| 758 | Grid Reset | constructive algorithms greedy | Statement | G | Pinely Round 4 (Div. 1 + Div. 2) {1991} | PROGRAMMING | 3000.0 | Video Tutorial | |
| 17942 | Absolute Zero | constructive algorithms greedy math | Statement | C | Pinely Round 4 (Div. 1 + Div. 2) {1991} | PROGRAMMING | 1000.0 | Video Tutorial | |
| 50018 | Only Pluses | brute force constructive algorithms greedy math sortings | Statement | A | Codeforces Round 957 (Div. 3) {1992} | PROGRAMMING | Shayan's Video Tutorial | ||
| 10963 | Novice's Mistake | brute force constructive algorithms math strings | Statement | E | Codeforces Round 957 (Div. 3) {1992} | PROGRAMMING | Shayan's Video Tutorial | ||
| 33746 | Gorilla and Permutation | constructive algorithms math | Statement | C | Codeforces Round 957 (Div. 3) {1992} | PROGRAMMING | Shayan's Video Tutorial | ||
| 1213 | 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) | |
| 26775 | Parity and Sum | constructive algorithms greedy | Statement | B | Codeforces Round 963 (Div. 2) {1993} | PROGRAMMING | 1000.0 | Editorial of Codeforces Round 963 (Div. 2) | |
| 19822 | 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 | |
| 1610 | 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 | |
| 7692 | 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 | |
| 22475 | Diverse Game | constructive algorithms greedy | Statement | A | Codeforces Round 959 sponsored by NEAR (Div. 1 + Div. 2) {1994} | PROGRAMMING | 500.0 | Video Tutorial | |
| 10420 | 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 | |
| 26255 | Find K Distinct Points with Fixed Center | constructive algorithms implementation math | Statement | A | Codeforces Round 965 (Div. 2) {1998} | PROGRAMMING | 500.0 | Video Tutorial | |
| 28473 | Minimize Equal Sum Subarrays | constructive algorithms math number theory | Statement | B | Codeforces Round 965 (Div. 2) {1998} | PROGRAMMING | 750.0 | Video Tutorial | |
| 6574 | Longest Max Min Subsequence | brute force constructive algorithms greedy two pointers | Statement | D | Codeforces Round 967 (Div. 2) {2001} | PROGRAMMING | 2000.0 | Video Tutorial | |
| 26243 | Generate Permutation | constructive algorithms greedy implementation | Statement | B | Codeforces Round 967 (Div. 2) {2001} | PROGRAMMING | 1000.0 | Video Tutorial | |
| 17959 | 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 | |
| 5171 | 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 | |
| 2924 | 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 | |
| 23359 | 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 | |
| 21434 | 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 | |
| 653 | 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 | |
| 21932 | Turtle and Good Pairs | constructive algorithms greedy strings | Statement | C | Codeforces Round 968 (Div. 2) {2003} | PROGRAMMING | 1000.0 | sol-zh.pdf | |
| 26615 | Simple Palindrome | constructive algorithms greedy | Statement | A | Codeforces Round 972 (Div. 2) {2005} | PROGRAMMING | 750.0 | Discussion stream (With Hints) | |
| 172 | Dora's Paint | brute force combinatorics constructive algorithms graphs | Statement | F | Codeforces Round 969 (Div. 1) {2006} | PROGRAMMING | 3000.0 | Tutorial | |
| 42261 | Sakurako's Exam | brute force constructive algorithms greedy math | Statement | A | Codeforces Round 970 (Div. 3) {2008} | PROGRAMMING | Codeforces Round 970 (Div. 3) Editorial | ||
| 14829 | Password Cracking | brute force constructive algorithms interactive strings | Statement | C | Codeforces Round 973 (Div. 2) {2013} | PROGRAMMING | 1250.0 | 134298 | |
| 28620 | Battle for Survive | constructive algorithms greedy math | Statement | B | Codeforces Round 973 (Div. 2) {2013} | PROGRAMMING | 750.0 | 134298 | |
| 31467 | Zhan's Blender | constructive algorithms math | Statement | A | Codeforces Round 973 (Div. 2) {2013} | PROGRAMMING | 500.0 | 134298 | |
| 4586 | 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 | |
| 14310 | 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 | |
| 4127 | 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 | |
| 1399 | 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 | |
| 16852 | Concatenation of Arrays | constructive algorithms greedy math sortings | Statement | A | Codeforces Round 980 (Div. 1) {2023} | PROGRAMMING | 500.0 | 135341 | |
| 17307 | Buying Lemonade | binary search constructive algorithms sortings | Statement | B | Codeforces Round 980 (Div. 2) {2024} | PROGRAMMING | 1000.0 | 135341 | |
| 3814 | 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 | |
| 1977 | 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 | |
| 3591 | 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 | |
| 4003 | 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 | |
| 865 | 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 | |
| 475 | 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 | |
| 15958 | 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 | |
| 6323 | 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 | |
| 1424 | Balanced | constructive algorithms data structures implementation math | Statement | E | Codeforces Round 983 (Div. 2) {2032} | PROGRAMMING | 2250.0 | Codeforces Round 983 (Div. 2) Editorial | |
| 21029 | Medians | constructive algorithms greedy hashing implementation math | Statement | B | Codeforces Round 983 (Div. 2) {2032} | PROGRAMMING | 750.0 | Codeforces Round 983 (Div. 2) Editorial | |
| 29242 | Sakurako and Water | constructive algorithms greedy | Statement | B | Codeforces Round 981 (Div. 3) {2033} | PROGRAMMING | 135520 | ||
| 41631 | Sakurako and Kosuke | constructive algorithms math | Statement | A | Codeforces Round 981 (Div. 3) {2033} | PROGRAMMING | 135520 | ||
| 2048 | 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 | |
| 9328 | 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 | |
| 6774 | 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 | |
| 11735 | Alya and Permutation | bitmasks constructive algorithms data structures | Statement | C | Codeforces Global Round 27 {2035} | PROGRAMMING | 1000.0 | Codeforces Global Round 27 Editorial | |
| 20875 | Everyone Loves Tres | constructive algorithms greedy math number theory | Statement | B | Codeforces Global Round 27 {2035} | PROGRAMMING | 500.0 | Codeforces Global Round 27 Editorial | |
| 1728 | Library of Magic | binary search bitmasks constructive algorithms interactive | Statement | G | Codeforces Round 984 (Div. 3) {2036} | PROGRAMMING | Codeforces Round 984 (Div. 3) Editorial | ||
| 25942 | Superultra's Favorite Permutation | constructive algorithms greedy math number theory | Statement | C | Codeforces Round 988 (Div. 3) {2037} | PROGRAMMING | Video Tutorial | ||
| 3018 | 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 | ||
| 2412 | 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) | |
| 17571 | 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) | |
| 7140 | 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) | |
| 105 | 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) | |
| 18237 | 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) | |
| 100 | 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 |