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 ... 37 38 39 40 41 ... 44 45 46 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 1026 | Firewood | *special | Statement | C | Kotlin Heroes: Episode 10 {1958} | PROGRAMMING | 129483 | 1500 | |
| 740 | Staircase | *special | Statement | D | Kotlin Heroes: Episode 10 {1958} | PROGRAMMING | 129483 | 1600 | |
| 337 | Yet Another Permutation Constructive | *special constructive algorithms | Statement | E | Kotlin Heroes: Episode 10 {1958} | PROGRAMMING | 129483 | 1900 | |
| 267 | Narrow Paths | *special combinatorics | Statement | F | Kotlin Heroes: Episode 10 {1958} | PROGRAMMING | 129483 | 2000 | |
| 131 | Observation Towers | *special | Statement | G | Kotlin Heroes: Episode 10 {1958} | PROGRAMMING | 129483 | 2400 | |
| 97 | Composite Spells | *special dp | Statement | H | Kotlin Heroes: Episode 10 {1958} | PROGRAMMING | 129483 | 2600 | |
| 53 | Equal Trees | *special graphs meet-in-the-middle | Statement | I | Kotlin Heroes: Episode 10 {1958} | PROGRAMMING | 129483 | 3100 | |
| 48 | Necromancer | *special | Statement | J | Kotlin Heroes: Episode 10 {1958} | PROGRAMMING | 129483 | 3200 | |
| 17322 | Everything Nim | games greedy math sortings | Statement | A | Codeforces Round 941 (Div. 1) {1965} | PROGRAMMING | 500.0 | Codeforces Round #941 (Div. 1, Div. 2) Editorial | 1400 |
| 8331 | 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 |
| 2482 | 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 |
| 600 | 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 |
| 480 | 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 |
| 300 | Conference | data structures flows | Statement | F | Codeforces Round 941 (Div. 1) {1965} | PROGRAMMING | 3500.0 | Codeforces Round #941 (Div. 1, Div. 2) Editorial | 3300 |
| 17528 | 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 |
| 19753 | 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 |
| 16460 | Reverse Card (Easy Version) | brute force math number theory | Statement | B1 | Codeforces Round 942 (Div. 1) {1967} | PROGRAMMING | 500.0 | Tutorial | 1400 |
| 15314 | Permutation Counting | binary search greedy implementation math sortings | Statement | A | Codeforces Round 942 (Div. 1) {1967} | PROGRAMMING | 750.0 | Tutorial | 1400 |
| 4997 | Reverse Card (Hard Version) | brute force math number theory | Statement | B2 | Codeforces Round 942 (Div. 1) {1967} | PROGRAMMING | 750.0 | Tutorial | 2200 |
| 2320 | Fenwick Tree | bitmasks brute force combinatorics data structures dp math trees | Statement | C | Codeforces Round 942 (Div. 1) {1967} | PROGRAMMING | 1250.0 | Tutorial | 2300 |
| 1007 | Long Way to be Non-decreasing | binary search dfs and similar graphs implementation shortest paths two pointers | Statement | D | Codeforces Round 942 (Div. 1) {1967} | PROGRAMMING | 1750.0 | Tutorial | 2800 |
| 479 | Again Counting Arrays (Easy Version) | combinatorics dp fft math | Statement | E1 | Codeforces Round 942 (Div. 1) {1967} | PROGRAMMING | 1750.0 | Tutorial | 3100 |
| 105 | Next and Prev | brute force data structures implementation | Statement | F | Codeforces Round 942 (Div. 1) {1967} | PROGRAMMING | 3500.0 | Tutorial | 3200 |
| 238 | Again Counting Arrays (Hard Version) | combinatorics dp math | Statement | E2 | Codeforces Round 942 (Div. 1) {1967} | PROGRAMMING | 1000.0 | Tutorial | 3500 |
| 29810 | Assembly via Remainders | constructive algorithms number theory | Statement | C | Codeforces Round 943 (Div. 3) {1968} | PROGRAMMING | 129096 | 1000 | |
| 17747 | Permutation Game | brute force dfs and similar games graphs greedy math | Statement | D | Codeforces Round 943 (Div. 3) {1968} | PROGRAMMING | 129096 | 1300 | |
| 12929 | Cells Arrangement | constructive algorithms | Statement | E | Codeforces Round 943 (Div. 3) {1968} | PROGRAMMING | 129096 | 1600 | |
| 7103 | Equal XOR Segments | binary search data structures | Statement | F | Codeforces Round 943 (Div. 3) {1968} | PROGRAMMING | 129096 | 1800 | |
| 5487 | Division + LCP (easy version) | binary search data structures dp hashing string suffix structures strings | Statement | G1 | Codeforces Round 943 (Div. 3) {1968} | PROGRAMMING | 129096 | 1900 | |
| 2676 | Division + LCP (hard version) | binary search brute force data structures dp hashing math string suffix structures strings | Statement | G2 | Codeforces Round 943 (Div. 3) {1968} | PROGRAMMING | 129096 | 2200 | |
| 32036 | Prefiquence | greedy two pointers | Statement | B | Codeforces Round 943 (Div. 3) {1968} | PROGRAMMING | 129096 | 800 | |
| 40102 | Maximize? | brute force math number theory | Statement | A | Codeforces Round 943 (Div. 3) {1968} | PROGRAMMING | 129096 | 800 | |
| 22687 | Shifts and Sorting | constructive algorithms greedy | Statement | B | Educational Codeforces Round 165 (Rated for Div. 2) {1969} | PROGRAMMING | Educational Codeforces Round 165 Editorial | 1000 | |
| 12011 | Minimizing the Sum | dp implementation | Statement | C | Educational Codeforces Round 165 (Rated for Div. 2) {1969} | PROGRAMMING | Educational Codeforces Round 165 Editorial | 1700 | |
| 5845 | Shop Game | data structures greedy math sortings | Statement | D | Educational Codeforces Round 165 (Rated for Div. 2) {1969} | PROGRAMMING | Educational Codeforces Round 165 Editorial | 1900 | |
| 1940 | Unique Array | binary search data structures divide and conquer dp greedy | Statement | E | Educational Codeforces Round 165 (Rated for Div. 2) {1969} | PROGRAMMING | Educational Codeforces Round 165 Editorial | 2400 | |
| 415 | Card Pairing | dp greedy hashing implementation | Statement | F | Educational Codeforces Round 165 (Rated for Div. 2) {1969} | PROGRAMMING | Educational Codeforces Round 165 Editorial | 3000 | |
| 22369 | Two Friends | constructive algorithms implementation math | Statement | A | Educational Codeforces Round 165 (Rated for Div. 2) {1969} | PROGRAMMING | Educational Codeforces Round 165 Editorial | 800 | |
| 7549 | Balanced Shuffle (Easy) | implementation sortings | Statement | A1 | Helvetic Coding Contest 2024 online mirror (teams allowed, unrated) {1970} | PROGRAMMING | Helvetic Coding Contest 2024 Editorial | 1000 | |
| 5258 | Game on Tree (Easy) | games | Statement | C1 | Helvetic Coding Contest 2024 online mirror (teams allowed, unrated) {1970} | PROGRAMMING | Helvetic Coding Contest 2024 Editorial | 1400 | |
| 4590 | Game on Tree (Medium) | dfs and similar dp games trees | Statement | C2 | Helvetic Coding Contest 2024 online mirror (teams allowed, unrated) {1970} | PROGRAMMING | Helvetic Coding Contest 2024 Editorial | 1700 | |
| 3565 | Trails (Easy) | dp | Statement | E1 | Helvetic Coding Contest 2024 online mirror (teams allowed, unrated) {1970} | PROGRAMMING | Helvetic Coding Contest 2024 Editorial | 1800 | |
| 1979 | Min-Fund Prison (Easy) | dfs and similar trees | Statement | G1 | Helvetic Coding Contest 2024 online mirror (teams allowed, unrated) {1970} | PROGRAMMING | Helvetic Coding Contest 2024 Editorial | 1900 | |
| 2566 | Game on Tree (Hard) | dfs and similar dp games trees | Statement | C3 | Helvetic Coding Contest 2024 online mirror (teams allowed, unrated) {1970} | PROGRAMMING | Helvetic Coding Contest 2024 Editorial | 1900 | |
| 1685 | Exact Neighbours (Easy) | constructive algorithms | Statement | B1 | Helvetic Coding Contest 2024 online mirror (teams allowed, unrated) {1970} | PROGRAMMING | Helvetic Coding Contest 2024 Editorial | 1900 | |
| 2197 | Trails (Medium) | dp matrices | Statement | E2 | Helvetic Coding Contest 2024 online mirror (teams allowed, unrated) {1970} | PROGRAMMING | Helvetic Coding Contest 2024 Editorial | 2000 | |
| 1259 | Exact Neighbours (Medium) | constructive algorithms | Statement | B2 | Helvetic Coding Contest 2024 online mirror (teams allowed, unrated) {1970} | PROGRAMMING | Helvetic Coding Contest 2024 Editorial | 2100 | |
| 980 | 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 | |
| 1252 | Trails (Hard) | dp matrices | Statement | E3 | Helvetic Coding Contest 2024 online mirror (teams allowed, unrated) {1970} | PROGRAMMING | Helvetic Coding Contest 2024 Editorial | 2200 | |
| 919 | Min-Fund Prison (Medium) | brute force dfs and similar dp graphs trees | Statement | G2 | Helvetic Coding Contest 2024 online mirror (teams allowed, unrated) {1970} | PROGRAMMING | Helvetic Coding Contest 2024 Editorial | 2200 | |
| 540 | Playing Quidditch (Medium) | implementation | Statement | F2 | Helvetic Coding Contest 2024 online mirror (teams allowed, unrated) {1970} | PROGRAMMING | Helvetic Coding Contest 2024 Editorial | 2300 | |
| 560 | Playing Quidditch (Hard) | implementation | Statement | F3 | Helvetic Coding Contest 2024 online mirror (teams allowed, unrated) {1970} | PROGRAMMING | Helvetic Coding Contest 2024 Editorial | 2300 | |
| 662 | Playing Quidditch (Easy) | implementation | Statement | F1 | Helvetic Coding Contest 2024 online mirror (teams allowed, unrated) {1970} | PROGRAMMING | Helvetic Coding Contest 2024 Editorial | 2300 | |
| 741 | Exact Neighbours (Hard) | constructive algorithms | Statement | B3 | Helvetic Coding Contest 2024 online mirror (teams allowed, unrated) {1970} | PROGRAMMING | Helvetic Coding Contest 2024 Editorial | 2300 | |
| 579 | Min-Fund Prison (Hard) | bitmasks dfs and similar dp graphs trees | Statement | G3 | Helvetic Coding Contest 2024 online mirror (teams allowed, unrated) {1970} | PROGRAMMING | Helvetic Coding Contest 2024 Editorial | 2400 | |
| 622 | 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 | |
| 691 | 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 | |
| 345 | 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 | |
| 170 | Arithmancy (Hard) | interactive | Statement | D3 | Helvetic Coding Contest 2024 online mirror (teams allowed, unrated) {1970} | PROGRAMMING | Helvetic Coding Contest 2024 Editorial | 3100 | |
| 31180 | Binary Cut | dp greedy implementation sortings strings | Statement | D | Codeforces Round 944 (Div. 4) {1971} | PROGRAMMING | Codeforces Round 944 (Div. 4) Editorial | 1100 | |
| 11873 | XOUR | data structures dsu sortings | Statement | G | Codeforces Round 944 (Div. 4) {1971} | PROGRAMMING | Codeforces Round 944 (Div. 4) Editorial | 1400 | |
| 18811 | Find the Car | binary search math sortings | Statement | E | Codeforces Round 944 (Div. 4) {1971} | PROGRAMMING | Codeforces Round 944 (Div. 4) Editorial | 1500 | |
| 12860 | Circle Perimeter | binary search brute force dfs and similar geometry implementation math | Statement | F | Codeforces Round 944 (Div. 4) {1971} | PROGRAMMING | Codeforces Round 944 (Div. 4) Editorial | 1600 | |
| 2987 | ±1 | 2-sat dfs and similar graphs | Statement | H | Codeforces Round 944 (Div. 4) {1971} | PROGRAMMING | Codeforces Round 944 (Div. 4) Editorial | 2100 | |
| 61275 | My First Sorting Problem | implementation sortings | Statement | A | Codeforces Round 944 (Div. 4) {1971} | PROGRAMMING | Codeforces Round 944 (Div. 4) Editorial | 800 | |
| 45757 | Different String | implementation strings | Statement | B | Codeforces Round 944 (Div. 4) {1971} | PROGRAMMING | Codeforces Round 944 (Div. 4) Editorial | 800 | |
| 42654 | Clock and Strings | implementation | Statement | C | Codeforces Round 944 (Div. 4) {1971} | PROGRAMMING | Codeforces Round 944 (Div. 4) Editorial | 900 | |
| 26272 | Contest Proposal | brute force greedy two pointers | Statement | A | Codeforces Round 942 (Div. 2) {1972} | PROGRAMMING | 500.0 | Tutorial | 800 |
| 25863 | Coin Games | games | Statement | B | Codeforces Round 942 (Div. 2) {1972} | PROGRAMMING | 750.0 | Tutorial | 900 |
| 17182 | Cat, Fox and the Lonely Array | binary search bitmasks data structures greedy math two pointers | Statement | B | Codeforces Round 945 (Div. 2) {1973} | PROGRAMMING | 1000.0 | Editorial for Codeforces Round #945 (Div. 2) | 1300 |
| 10028 | 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 |
| 2349 | Cat, Fox and Maximum Array Split | brute force interactive math | Statement | D | Codeforces Round 945 (Div. 2) {1973} | PROGRAMMING | 2000.0 | Editorial for Codeforces Round #945 (Div. 2) | 2400 |
| 1044 | Cat, Fox and Swaps | graphs math sortings | Statement | E | Codeforces Round 945 (Div. 2) {1973} | PROGRAMMING | 2250.0 | Editorial for Codeforces Round #945 (Div. 2) | 2500 |
| 358 | Maximum GCD Sum Queries | bitmasks brute force dp implementation number theory | Statement | F | Codeforces Round 945 (Div. 2) {1973} | PROGRAMMING | 3000.0 | Editorial for Codeforces Round #945 (Div. 2) | 3100 |
| 29052 | Chess For Three | brute force dp implementation math | Statement | A | Codeforces Round 945 (Div. 2) {1973} | PROGRAMMING | 500.0 | Editorial for Codeforces Round #945 (Div. 2) | 900 |
| 18120 | Ingenuity-2 | constructive algorithms greedy implementation | Statement | D | Codeforces Round 946 (Div. 3) {1974} | PROGRAMMING | Codeforces Round #946 (Div. 3) Editorial | 1400 | |
| 19462 | Beautiful Triple Pairs | combinatorics data structures | Statement | C | Codeforces Round 946 (Div. 3) {1974} | PROGRAMMING | Codeforces Round #946 (Div. 3) Editorial | 1400 | |
| 11991 | Money Buys Happiness | dp | Statement | E | Codeforces Round 946 (Div. 3) {1974} | PROGRAMMING | Codeforces Round #946 (Div. 3) Editorial | 1800 | |
| 4490 | Cutting Game | binary search brute force data structures implementation sortings two pointers | Statement | F | Codeforces Round 946 (Div. 3) {1974} | PROGRAMMING | Codeforces Round #946 (Div. 3) Editorial | 1900 | |
| 6275 | Money Buys Less Happiness Now | data structures greedy sortings | Statement | G | Codeforces Round 946 (Div. 3) {1974} | PROGRAMMING | Codeforces Round #946 (Div. 3) Editorial | 2000 | |
| 34922 | Symmetric Encoding | implementation sortings strings | Statement | B | Codeforces Round 946 (Div. 3) {1974} | PROGRAMMING | Codeforces Round #946 (Div. 3) Editorial | 800 | |
| 38418 | Phone Desktop | greedy math | Statement | A | Codeforces Round 946 (Div. 3) {1974} | PROGRAMMING | Codeforces Round #946 (Div. 3) Editorial | 800 | |
| 21361 | 378QAQ and Mocha's Array | brute force greedy math sortings | Statement | B | Codeforces Round 947 (Div. 1 + Div. 2) {1975} | PROGRAMMING | 500.0 | editorial_zh.pdf | 1000 |
| 17474 | Chamo and Mocha's Array | binary search brute force greedy | Statement | C | Codeforces Round 947 (Div. 1 + Div. 2) {1975} | PROGRAMMING | 1000.0 | editorial_zh.pdf | 1200 |
| 7702 | Paint the Tree | brute force dfs and similar dp greedy shortest paths trees | Statement | D | Codeforces Round 947 (Div. 1 + Div. 2) {1975} | PROGRAMMING | 1500.0 | editorial_zh.pdf | 1700 |
| 2993 | Chain Queries | binary search data structures dfs and similar implementation trees | Statement | E | Codeforces Round 947 (Div. 1 + Div. 2) {1975} | PROGRAMMING | 2000.0 | editorial_zh.pdf | 2100 |
| 1089 | Set | bitmasks brute force combinatorics dfs and similar divide and conquer dp math | Statement | F | Codeforces Round 947 (Div. 1 + Div. 2) {1975} | PROGRAMMING | 2500.0 | editorial_zh.pdf | 2600 |
| 361 | Zimpha Fan Club | fft greedy math strings | Statement | G | Codeforces Round 947 (Div. 1 + Div. 2) {1975} | PROGRAMMING | 3000.0 | editorial_zh.pdf | 3000 |
| 195 | Mind Bloom | dp | Statement | I | Codeforces Round 947 (Div. 1 + Div. 2) {1975} | PROGRAMMING | 6000.0 | editorial_zh.pdf | 3500 |
| 221 | 378QAQ and Core | greedy strings | Statement | H | Codeforces Round 947 (Div. 1 + Div. 2) {1975} | PROGRAMMING | 4500.0 | editorial_zh.pdf | 3500 |
| 20962 | Bazoka and Mocha's Array | brute force greedy implementation sortings | Statement | A | Codeforces Round 947 (Div. 1 + Div. 2) {1975} | PROGRAMMING | 250.0 | editorial_zh.pdf | 800 |
| 32977 | Verify Password | implementation sortings | Statement | A | Educational Codeforces Round 166 (Rated for Div. 2) {1976} | PROGRAMMING | Educational Codeforces Round 166 Editorial | ||
| 1357 | Splittable Permutations | combinatorics data structures dfs and similar greedy math trees | Statement | E | Educational Codeforces Round 166 (Rated for Div. 2) {1976} | PROGRAMMING | Educational Codeforces Round 166 Editorial | ||
| 1033 | Remove Bridges | data structures dfs and similar dp greedy sortings trees | Statement | F | Educational Codeforces Round 166 (Rated for Div. 2) {1976} | PROGRAMMING | Educational Codeforces Round 166 Editorial | ||
| 12718 | Job Interview | binary search dp greedy implementation two pointers | Statement | C | Educational Codeforces Round 166 (Rated for Div. 2) {1976} | PROGRAMMING | Educational Codeforces Round 166 Editorial | ||
| 5963 | Invertible Bracket Sequences | binary search combinatorics data structures divide and conquer implementation two pointers | Statement | D | Educational Codeforces Round 166 (Rated for Div. 2) {1976} | PROGRAMMING | Educational Codeforces Round 166 Editorial | ||
| 25413 | Increase/Decrease/Copy | greedy implementation | Statement | B | Educational Codeforces Round 166 (Rated for Div. 2) {1976} | PROGRAMMING | Educational Codeforces Round 166 Editorial | ||
| 20171 | Binary Colouring | bitmasks constructive algorithms greedy math | Statement | B | Codeforces Round 948 (Div. 2) {1977} | PROGRAMMING | 1250.0 | 129858 | 1100 |
| 8224 | Nikita and LCM | brute force data structures dp greedy math number theory sortings | Statement | C | Codeforces Round 948 (Div. 2) {1977} | PROGRAMMING | 1750.0 | 129858 | 1900 |
| 2453 | XORificator | bitmasks brute force greedy hashing | Statement | D | Codeforces Round 948 (Div. 2) {1977} | PROGRAMMING | 2000.0 | 129858 | 2300 |
| 957 | Tensor | constructive algorithms graphs interactive | Statement | E | Codeforces Round 948 (Div. 2) {1977} | PROGRAMMING | 2500.0 | 129858 | 2600 |
| 39876 | Little Nikita | math | Statement | A | Codeforces Round 948 (Div. 2) {1977} | PROGRAMMING | 500.0 | 129858 | 800 |
| 25723 | New Bakery | binary search greedy math ternary search | Statement | B | Codeforces Round 953 (Div. 2) {1978} | PROGRAMMING | 750.0 | 130527 | |
| 18132 | Manhattan Permutations | constructive algorithms greedy implementation math | Statement | C | Codeforces Round 953 (Div. 2) {1978} | PROGRAMMING | 1250.0 | 130527 | |
| 1642 | Large Graph | data structures dsu graphs number theory | Statement | F | Codeforces Round 953 (Div. 2) {1978} | PROGRAMMING | 2500.0 | 130527 | |
| 13957 | Elections | data structures greedy implementation math | Statement | D | Codeforces Round 953 (Div. 2) {1978} | PROGRAMMING | 1500.0 | 130527 | |
| 4715 | Computing Machine | data structures dp greedy implementation | Statement | E | Codeforces Round 953 (Div. 2) {1978} | PROGRAMMING | 2000.0 | 130527 | |
| 28898 | Alice and Books | constructive algorithms sortings | Statement | A | Codeforces Round 953 (Div. 2) {1978} | PROGRAMMING | 500.0 | 130527 | |
| 26857 | XOR Sequences | bitmasks greedy | Statement | B | Codeforces Round 951 (Div. 2) {1979} | PROGRAMMING | 1000.0 | Codeforces Round 951 (Div. 2) Editorial | |
| 1870 | 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 | |
| 452 | Kostyanych's Theorem | brute force graphs interactive | Statement | F | Codeforces Round 951 (Div. 2) {1979} | PROGRAMMING | 3000.0 | Codeforces Round 951 (Div. 2) Editorial | |
| 32107 | Guess the Maximum | brute force greedy implementation | Statement | A | Codeforces Round 951 (Div. 2) {1979} | PROGRAMMING | 500.0 | Codeforces Round 951 (Div. 2) Editorial | |
| 8001 | 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 | |
| 22594 | 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 | |
| 1796 | Yasya and the Mysterious Tree | bitmasks data structures dfs and similar graphs strings trees | Statement | G | Codeforces Round 950 (Div. 3) {1980} | PROGRAMMING | 130135 | ||
| 22072 | Sofia and the Lost Operations | constructive algorithms greedy | Statement | C | Codeforces Round 950 (Div. 3) {1980} | PROGRAMMING | 130135 | ||
| 48336 | Problem Generator | Statement | A | Codeforces Round 950 (Div. 3) {1980} | PROGRAMMING | 130135 | |||
| 13384 | Permutation of Rows and Columns | constructive algorithms data structures hashing math matrices sortings | Statement | E | Codeforces Round 950 (Div. 3) {1980} | PROGRAMMING | 130135 | ||
| 17803 | GCD-sequence | greedy implementation math math number theory number theory | Statement | D | Codeforces Round 950 (Div. 3) {1980} | PROGRAMMING | 130135 | ||
| 1279 | Field Division (hard version) | math sortings | Statement | F2 | Codeforces Round 950 (Div. 3) {1980} | PROGRAMMING | 130135 | ||
| 4467 | Field Division (easy version) | data structures geometry math sortings | Statement | F1 | Codeforces Round 950 (Div. 3) {1980} | PROGRAMMING | 130135 | ||
| 38884 | Choosing Cubes | sortings sortings | Statement | B | Codeforces Round 950 (Div. 3) {1980} | PROGRAMMING | 130135 | ||
| 24418 | Turtle and Piggy Are Playing a Game | brute force greedy math | Statement | A | Codeforces Round 949 (Div. 2) {1981} | PROGRAMMING | 500.0 | Simplified Chinese Tutorial | |
| 362 | Turtle and Paths on a Tree | data structures dp trees | Statement | F | Codeforces Round 949 (Div. 2) {1981} | PROGRAMMING | 3500.0 | Simplified Chinese Tutorial | |
| 2239 | 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 | |
| 1355 | Turtle and Intersected Segments | data structures dsu graphs greedy | Statement | E | Codeforces Round 949 (Div. 2) {1981} | PROGRAMMING | 2500.0 | Simplified Chinese Tutorial | |
| 16843 | Turtle and an Infinite Sequence | bitmasks math | Statement | B | Codeforces Round 949 (Div. 2) {1981} | PROGRAMMING | 1000.0 | Simplified Chinese Tutorial | |
| 6470 | 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 | |
| 1352 | Sorting Problem Again | binary search data structures | Statement | F | Codeforces Round 955 (Div. 2, with prizes from NEAR!) {1982} | PROGRAMMING | 3000.0 | 130839 | |
| 27703 | Soccer | greedy implementation math sortings | Statement | A | Codeforces Round 955 (Div. 2, with prizes from NEAR!) {1982} | PROGRAMMING | 500.0 | 130839 | |
| 1955 | Number of k-good subarrays | bitmasks combinatorics divide and conquer dp math meet-in-the-middle | Statement | E | Codeforces Round 955 (Div. 2, with prizes from NEAR!) {1982} | PROGRAMMING | 2500.0 | 130839 | |
| 20116 | Collatz Conjecture | brute force implementation math number theory | Statement | B | Codeforces Round 955 (Div. 2, with prizes from NEAR!) {1982} | PROGRAMMING | 1000.0 | 130839 | |
| 22406 | Boring Day | binary search data structures dp greedy two pointers | Statement | C | Codeforces Round 955 (Div. 2, with prizes from NEAR!) {1982} | PROGRAMMING | 1000.0 | 130839 | |
| 10301 | Beauty of the mountains | brute force data structures implementation math number theory | Statement | D | Codeforces Round 955 (Div. 2, with prizes from NEAR!) {1982} | PROGRAMMING | 1750.0 | 130839 | |
| 362 | Your Loss | bitmasks brute force trees | Statement | G | Codeforces Round 956 (Div. 2) and ByteRace 2024 {1983} | PROGRAMMING | 3000.0 | ||
| 11640 | Swap Dilemma | constructive algorithms divide and conquer greedy math sortings | Statement | D | Codeforces Round 956 (Div. 2) and ByteRace 2024 {1983} | PROGRAMMING | 1750.0 | ||
| 2580 | I Love Balls | combinatorics math probabilities | Statement | E | Codeforces Round 956 (Div. 2) and ByteRace 2024 {1983} | PROGRAMMING | 2000.0 | ||
| 15001 | Have Your Cake and Eat It Too | binary search brute force dp greedy implementation | Statement | C | Codeforces Round 956 (Div. 2) and ByteRace 2024 {1983} | PROGRAMMING | 1250.0 | ||
| 18674 | Corner Twist | constructive algorithms greedy implementation math | Statement | B | Codeforces Round 956 (Div. 2) and ByteRace 2024 {1983} | PROGRAMMING | 1000.0 | ||
| 1614 | array-value | binary search bitmasks data structures two pointers | Statement | F | Codeforces Round 956 (Div. 2) and ByteRace 2024 {1983} | PROGRAMMING | 2500.0 | ||
| 28301 | Array Divisibility | constructive algorithms math | Statement | A | Codeforces Round 956 (Div. 2) and ByteRace 2024 {1983} | PROGRAMMING | 500.0 | ||
| 309 | Tower Capturing | dp geometry | Statement | H | Codeforces Global Round 26 {1984} | PROGRAMMING | 5000.0 | Codeforces Global Round 26 Editorial | |
| 23011 | Strange Splitting | constructive algorithms | Statement | A | Codeforces Global Round 26 {1984} | PROGRAMMING | 500.0 | Codeforces Global Round 26 Editorial | |
| 1907 | Shuffle | constructive algorithms dp greedy trees | Statement | E | Codeforces Global Round 26 {1984} | PROGRAMMING | 3000.0 | Codeforces Global Round 26 Editorial | |
| 1193 | Reconstruction | brute force dp | Statement | F | Codeforces Global Round 26 {1984} | PROGRAMMING | 3000.0 | Codeforces Global Round 26 Editorial | |
| 8903 | Magnitude (Hard Version) | combinatorics dp greedy | Statement | C2 | Codeforces Global Round 26 {1984} | PROGRAMMING | 1250.0 | Codeforces Global Round 26 Editorial | |
| 20702 | Magnitude (Easy Version) | dp greedy | Statement | C1 | Codeforces Global Round 26 {1984} | PROGRAMMING | 750.0 | Codeforces Global Round 26 Editorial | |
| 307 | Magic Trick II | constructive algorithms implementation sortings | Statement | G | Codeforces Global Round 26 {1984} | PROGRAMMING | 4000.0 | Codeforces Global Round 26 Editorial | |
| 21294 | Large Addition | constructive algorithms implementation math | Statement | B | Codeforces Global Round 26 {1984} | PROGRAMMING | 750.0 | Codeforces Global Round 26 Editorial | |
| 3991 | ''a'' String Problem | hashing implementation math string suffix structures strings | Statement | D | Codeforces Global Round 26 {1984} | PROGRAMMING | 2500.0 | Codeforces Global Round 26 Editorial | |
| 23981 | Secret Box | brute force combinatorics math | Statement | E | Codeforces Round 952 (Div. 4) {1985} | PROGRAMMING | Codeforces Round 952 (Div. 4) Editorial | ||
| 58122 | Maximum Multiple Sum | brute force math | Statement | B | Codeforces Round 952 (Div. 4) {1985} | PROGRAMMING | Codeforces Round 952 (Div. 4) Editorial | ||
| 1994 | Maximize the Largest Component (Hard Version) | data structures dfs and similar dsu implementation | Statement | H2 | Codeforces Round 952 (Div. 4) {1985} | PROGRAMMING | Codeforces Round 952 (Div. 4) Editorial | ||
| 7490 | Maximize the Largest Component (Easy Version) | brute force data structures dfs and similar dsu graphs implementation | Statement | H1 | Codeforces Round 952 (Div. 4) {1985} | PROGRAMMING | Codeforces Round 952 (Div. 4) Editorial | ||
| 42228 | Manhattan Circle | implementation math | Statement | D | Codeforces Round 952 (Div. 4) {1985} | PROGRAMMING | Codeforces Round 952 (Div. 4) Editorial | ||
| 41296 | Good Prefixes | greedy implementation | Statement | C | Codeforces Round 952 (Div. 4) {1985} | PROGRAMMING | Codeforces Round 952 (Div. 4) Editorial | ||
| 20682 | Final Boss | binary search brute force data structures | Statement | F | Codeforces Round 952 (Div. 4) {1985} | PROGRAMMING | Codeforces Round 952 (Div. 4) Editorial | ||
| 12646 | D-Function | bitmasks combinatorics math number theory | Statement | G | Codeforces Round 952 (Div. 4) {1985} | PROGRAMMING | Codeforces Round 952 (Div. 4) Editorial | ||
| 74885 | Creating Words | implementation strings | Statement | A | Codeforces Round 952 (Div. 4) {1985} | PROGRAMMING | Codeforces Round 952 (Div. 4) Editorial | ||
| 48766 | X Axis | brute force math sortings | Statement | A | Codeforces Round 954 (Div. 3) {1986} | PROGRAMMING | 130762 | ||
| 26413 | Update Queries | data structures greedy sortings | Statement | C | Codeforces Round 954 (Div. 3) {1986} | PROGRAMMING | 130762 | ||
| 1974 | Permutation Problem (Simple Version) | brute force combinatorics math number theory | Statement | G1 | Codeforces Round 954 (Div. 3) {1986} | PROGRAMMING | 130762 | ||
| 1518 | Permutation Problem (Hard Version) | brute force data structures hashing math number theory | Statement | G2 | Codeforces Round 954 (Div. 3) {1986} | PROGRAMMING | 130762 | ||
| 6923 | Non-academic Problem | combinatorics dfs and similar dsu graphs | Statement | F | Codeforces Round 954 (Div. 3) {1986} | PROGRAMMING | 130762 | ||
| 30529 | Matrix Stabilization | brute force greedy sortings | Statement | B | Codeforces Round 954 (Div. 3) {1986} | PROGRAMMING | 130762 | ||
| 18336 | Mathematical Problem | brute force dp two pointers | Statement | D | Codeforces Round 954 (Div. 3) {1986} | PROGRAMMING | 130762 | ||
| 11158 | Beautiful Array | dp math sortings | Statement | E | Codeforces Round 954 (Div. 3) {1986} | PROGRAMMING | 130762 | ||
| 8989 | World is Mine | dp games greedy | Statement | D | EPIC Institute of Technology Round Summer 2024 (Div. 1 + Div. 2) {1987} | PROGRAMMING | 1500.0 | EPIC Institute of Technology Round Summer 2024 (Div. 1 + Div. 2) Editorial | |
| 4183 | Wonderful Tree! | brute force dfs and similar dp flows greedy trees | Statement | E | EPIC Institute of Technology Round Summer 2024 (Div. 1 + Div. 2) {1987} | PROGRAMMING | 1750.0 | EPIC Institute of Technology Round Summer 2024 (Div. 1 + Div. 2) Editorial | |
| 29368 | Upload More RAM | greedy math | Statement | A | EPIC Institute of Technology Round Summer 2024 (Div. 1 + Div. 2) {1987} | PROGRAMMING | 250.0 | EPIC Institute of Technology Round Summer 2024 (Div. 1 + Div. 2) Editorial | |
| 255 | Spinning Round (Hard Version) | dp | Statement | G2 | EPIC Institute of Technology Round Summer 2024 (Div. 1 + Div. 2) {1987} | PROGRAMMING | 2000.0 | EPIC Institute of Technology Round Summer 2024 (Div. 1 + Div. 2) Editorial | |
| 362 | Spinning Round (Easy Version) | dp trees | Statement | G1 | EPIC Institute of Technology Round Summer 2024 (Div. 1 + Div. 2) {1987} | PROGRAMMING | 3000.0 | EPIC Institute of Technology Round Summer 2024 (Div. 1 + Div. 2) Editorial | |
| 24338 | K-Sort | greedy | Statement | B | EPIC Institute of Technology Round Summer 2024 (Div. 1 + Div. 2) {1987} | PROGRAMMING | 750.0 | EPIC Institute of Technology Round Summer 2024 (Div. 1 + Div. 2) Editorial | |
| 1405 | Interesting Problem (Hard Version) | dp | Statement | F2 | EPIC Institute of Technology Round Summer 2024 (Div. 1 + Div. 2) {1987} | PROGRAMMING | 500.0 | EPIC Institute of Technology Round Summer 2024 (Div. 1 + Div. 2) Editorial | |
| 1427 | Interesting Problem (Easy Version) | dp | Statement | F1 | EPIC Institute of Technology Round Summer 2024 (Div. 1 + Div. 2) {1987} | PROGRAMMING | 2000.0 | EPIC Institute of Technology Round Summer 2024 (Div. 1 + Div. 2) Editorial | |
| 171 | Fumo Temple | interactive | Statement | H | EPIC Institute of Technology Round Summer 2024 (Div. 1 + Div. 2) {1987} | PROGRAMMING | 5000.0 | EPIC Institute of Technology Round Summer 2024 (Div. 1 + Div. 2) Editorial | |
| 21243 | Basil's Garden | dp greedy | Statement | C | EPIC Institute of Technology Round Summer 2024 (Div. 1 + Div. 2) {1987} | PROGRAMMING | 1000.0 | EPIC Institute of Technology Round Summer 2024 (Div. 1 + Div. 2) Editorial | |
| 6197 | The Omnipotent Monster Killer | brute force dp trees | Statement | D | Codeforces Round 958 (Div. 2) {1988} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round 958 (Div. 2) | |
| 27404 | Split the Multiset | brute force dp greedy math | Statement | A | Codeforces Round 958 (Div. 2) {1988} | PROGRAMMING | 500.0 | Editorial of Codeforces Round 958 (Div. 2) | |
| 1860 | Range Minimum Sum | binary search brute force data structures implementation | Statement | E | Codeforces Round 958 (Div. 2) {1988} | PROGRAMMING | 2500.0 | Editorial of Codeforces Round 958 (Div. 2) | |
| 26922 | Make Majority | greedy | Statement | B | Codeforces Round 958 (Div. 2) {1988} | PROGRAMMING | 1000.0 | Editorial of Codeforces Round 958 (Div. 2) | |
| 20701 | 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) | |
| 486 | Heartbeat | combinatorics dp fft math | Statement | F | Codeforces Round 958 (Div. 2) {1988} | PROGRAMMING | 3500.0 | Editorial of Codeforces Round 958 (Div. 2) | |
| 23063 | Two Movies | greedy | Statement | C | Educational Codeforces Round 167 (Rated for Div. 2) {1989} | PROGRAMMING | Educational Codeforces Round 167 Editorial | ||
| 23698 | Substring and Subsequence | bitmasks brute force dp graphs greedy hashing strings trees | Statement | B | Educational Codeforces Round 167 (Rated for Div. 2) {1989} | PROGRAMMING | Educational Codeforces Round 167 Editorial | ||
| 7278 | Smithing Skill | brute force dp greedy math sortings two pointers | Statement | D | Educational Codeforces Round 167 (Rated for Div. 2) {1989} | PROGRAMMING | Educational Codeforces Round 167 Editorial | ||
| 628 | Simultaneous Coloring | dfs and similar divide and conquer graphs | Statement | F | Educational Codeforces Round 167 (Rated for Div. 2) {1989} | PROGRAMMING | Educational Codeforces Round 167 Editorial | ||
| 2610 | Distance to Different | combinatorics dp | Statement | E | Educational Codeforces Round 167 (Rated for Div. 2) {1989} | PROGRAMMING | Educational Codeforces Round 167 Editorial | ||
| 29760 | Catch the Coin | implementation | Statement | A | Educational Codeforces Round 167 (Rated for Div. 2) {1989} | PROGRAMMING | Educational Codeforces Round 167 Editorial | ||
| 27373 | Submission Bait | brute force games greedy sortings | Statement | A | Codeforces Round 960 (Div. 2) {1990} | PROGRAMMING | 500.0 | Video Tutorial | |
| 475 | Polygonal Segments | data structures geometry two pointers | Statement | F | Codeforces Round 960 (Div. 2) {1990} | PROGRAMMING | 3000.0 | Video Tutorial | |
| 14964 | Mad MAD Sum | brute force greedy math | Statement | C | Codeforces Round 960 (Div. 2) {1990} | PROGRAMMING | 1500.0 | Video Tutorial | |
| 7965 | Grid Puzzle | bitmasks dp greedy | Statement | D | Codeforces Round 960 (Div. 2) {1990} | PROGRAMMING | 1750.0 | Video Tutorial | |
| 1227 | Catch the Mole(Hard Version) | binary search data structures dfs and similar interactive trees | Statement | E2 | Codeforces Round 960 (Div. 2) {1990} | PROGRAMMING | 750.0 | Video Tutorial | |
| 1248 | 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 | |
| 20222 | Array Craft | constructive algorithms greedy | Statement | B | Codeforces Round 960 (Div. 2) {1990} | PROGRAMMING | 1000.0 | Video Tutorial | |
| 2843 | Triangle Formation | brute force greedy math sortings | Statement | F | Pinely Round 4 (Div. 1 + Div. 2) {1991} | PROGRAMMING | 2500.0 | Video Tutorial | |
| 8079 | 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 | |
| 587 | Prime Split Game | fft games math number theory | Statement | H | Pinely Round 4 (Div. 1 + Div. 2) {1991} | PROGRAMMING | 3500.0 | Video Tutorial | |
| 24610 | Maximize the Last Element | greedy implementation | Statement | A | Pinely Round 4 (Div. 1 + Div. 2) {1991} | PROGRAMMING | 250.0 | Video Tutorial | |
| 762 | Grid Reset | constructive algorithms greedy | Statement | G | Pinely Round 4 (Div. 1 + Div. 2) {1991} | PROGRAMMING | 3000.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 | |
| 5268 | Coloring Game | constructive algorithms games graphs greedy interactive | Statement | E | Pinely Round 4 (Div. 1 + Div. 2) {1991} | PROGRAMMING | 2000.0 | Video Tutorial | |
| 19265 | AND Reconstruction | bitmasks constructive algorithms greedy | Statement | B | Pinely Round 4 (Div. 1 + Div. 2) {1991} | PROGRAMMING | 500.0 | Video Tutorial | |
| 18073 | Absolute Zero | constructive algorithms greedy math | Statement | C | Pinely Round 4 (Div. 1 + Div. 2) {1991} | PROGRAMMING | 1000.0 | Video Tutorial | |
| 7830 | Valuable Cards | dp greedy number theory two pointers | Statement | F | Codeforces Round 957 (Div. 3) {1992} | PROGRAMMING | Shayan's Video Tutorial | ||
| 4357 | Ultra-Meow | combinatorics math number theory | Statement | G | Codeforces Round 957 (Div. 3) {1992} | PROGRAMMING | Shayan's Video Tutorial | ||
| 24660 | Test of Love | dp greedy implementation | Statement | D | Codeforces Round 957 (Div. 3) {1992} | PROGRAMMING | Shayan's Video Tutorial | ||
| 50287 | Only Pluses | brute force constructive algorithms greedy math sortings | Statement | A | Codeforces Round 957 (Div. 3) {1992} | PROGRAMMING | Shayan's Video Tutorial | ||
| 11027 | Novice's Mistake | brute force constructive algorithms math strings | Statement | E | Codeforces Round 957 (Div. 3) {1992} | PROGRAMMING | Shayan's Video Tutorial | ||
| 33895 | Gorilla and Permutation | constructive algorithms math | Statement | C | Codeforces Round 957 (Div. 3) {1992} | PROGRAMMING | Shayan's Video Tutorial | ||
| 38579 | Angry Monk | greedy math sortings | Statement | B | Codeforces Round 957 (Div. 3) {1992} | PROGRAMMING | Shayan's Video Tutorial | ||
| 745 | Xor-Grid Problem | bitmasks dp | Statement | E | Codeforces Round 963 (Div. 2) {1993} | PROGRAMMING | 2750.0 | Editorial of Codeforces Round 963 (Div. 2) | |
| 33488 | Question Marks | greedy implementation | Statement | A | Codeforces Round 963 (Div. 2) {1993} | PROGRAMMING | 500.0 | Editorial of Codeforces Round 963 (Div. 2) | |
| 26984 | Parity and Sum | constructive algorithms greedy | Statement | B | Codeforces Round 963 (Div. 2) {1993} | PROGRAMMING | 1000.0 | Editorial of Codeforces Round 963 (Div. 2) | |
| 4575 | Med-imize | binary search data structures dp greedy | Statement | D | Codeforces Round 963 (Div. 2) {1993} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round 963 (Div. 2) | |
| 16523 | Light Switches | implementation math | Statement | C | Codeforces Round 963 (Div. 2) {1993} | PROGRAMMING | 1500.0 | Editorial of Codeforces Round 963 (Div. 2) | |
| 586 | Dyn-scripted Robot (Hard Version) | chinese remainder theorem math number theory | Statement | F2 | Codeforces Round 963 (Div. 2) {1993} | PROGRAMMING | 1000.0 | Editorial of Codeforces Round 963 (Div. 2) | |
| 1226 | 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) | |
| 5717 | Wooden Game | bitmasks greedy math trees | Statement | E | Codeforces Round 959 sponsored by NEAR (Div. 1 + Div. 2) {1994} | PROGRAMMING | 2000.0 | Video Tutorial | |
| 1660 | 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 | |
| 1705 | Minecraft | bitmasks brute force dp math | Statement | G | Codeforces Round 959 sponsored by NEAR (Div. 1 + Div. 2) {1994} | PROGRAMMING | 2750.0 | Video Tutorial | |
| 14047 | Hungry Games | binary search data structures dp two pointers | Statement | C | Codeforces Round 959 sponsored by NEAR (Div. 1 + Div. 2) {1994} | PROGRAMMING | 1250.0 | Video Tutorial | |
| 7837 | 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 | |
| 19916 | 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 | |
| 782 | Fortnite | interactive math | Statement | H | Codeforces Round 959 sponsored by NEAR (Div. 1 + Div. 2) {1994} | PROGRAMMING | 3750.0 | Video Tutorial | |
| 22521 | Diverse Game | constructive algorithms greedy | Statement | A | Codeforces Round 959 sponsored by NEAR (Div. 1 + Div. 2) {1994} | PROGRAMMING | 500.0 | Video Tutorial | |
| 10504 | 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 | |
| 421 | Let Me Teach You a Lesson (Hard Version) | 2-sat bitmasks data structures dp graphs matrices two pointers | Statement | E2 | Codeforces Round 961 (Div. 2) {1995} | PROGRAMMING | 1500.0 | Video Tutorial | |
| 539 | Let Me Teach You a Lesson (Easy Version) | 2-sat data structures dp two pointers | Statement | E1 | Codeforces Round 961 (Div. 2) {1995} | PROGRAMMING | 2500.0 | Video Tutorial | |
| 26609 | Diagonals | brute force greedy implementation math | Statement | A | Codeforces Round 961 (Div. 2) {1995} | PROGRAMMING | 500.0 | Video Tutorial | |
| 3070 | Cases | bitmasks brute force combinatorics dfs and similar dp graphs greedy strings | Statement | D | Codeforces Round 961 (Div. 2) {1995} | PROGRAMMING | 2250.0 | Video Tutorial | |
| 10345 | Bouquet (Hard Version) | binary search data structures greedy math sortings two pointers | Statement | B2 | Codeforces Round 961 (Div. 2) {1995} | PROGRAMMING | 500.0 | Video Tutorial | |
| 21391 | Bouquet (Easy Version) | binary search brute force greedy sortings sortings two pointers | Statement | B1 | Codeforces Round 961 (Div. 2) {1995} | PROGRAMMING | 1000.0 | Video Tutorial | |
| 28638 | Sort | strings | Statement | C | Codeforces Round 962 (Div. 3) {1996} | PROGRAMMING | Codeforces Round 962 (Div. 3) Editorial | ||
| 37323 | Scale | implementation | Statement | B | Codeforces Round 962 (Div. 3) {1996} | PROGRAMMING | Codeforces Round 962 (Div. 3) Editorial | ||
| 2406 | Penacony | brute force data structures dp hashing | Statement | G | Codeforces Round 962 (Div. 3) {1996} | PROGRAMMING | Codeforces Round 962 (Div. 3) Editorial | ||
| 59245 | Legs | math | Statement | A | Codeforces Round 962 (Div. 3) {1996} | PROGRAMMING | Codeforces Round 962 (Div. 3) Editorial | ||
| 20092 | Fun | binary search brute force number theory | Statement | D | Codeforces Round 962 (Div. 3) {1996} | PROGRAMMING | Codeforces Round 962 (Div. 3) Editorial | ||
| 12954 | Decode | brute force combinatorics implementation | Statement | E | Codeforces Round 962 (Div. 3) {1996} | PROGRAMMING | Codeforces Round 962 (Div. 3) Editorial | ||
| 6577 | Bomb | binary search greedy math | Statement | F | Codeforces Round 962 (Div. 3) {1996} | PROGRAMMING | Codeforces Round 962 (Div. 3) Editorial | ||
| 33781 | Strong Password | implementation | Statement | A | Educational Codeforces Round 168 (Rated for Div. 2) {1997} | PROGRAMMING | Video Tutorial | ||
| 16461 | Maximize the Root | binary search dfs and similar dp greedy trees | Statement | D | Educational Codeforces Round 168 (Rated for Div. 2) {1997} | PROGRAMMING | Video Tutorial | ||
| 23715 | Make Three Regions | constructive algorithms | Statement | B | Educational Codeforces Round 168 (Rated for Div. 2) {1997} | PROGRAMMING | Video Tutorial | ||
| 3903 | Level Up | binary search brute force data structures implementation | Statement | E | Educational Codeforces Round 168 (Rated for Div. 2) {1997} | PROGRAMMING | Video Tutorial | ||
| 25860 | Even Positions | greedy | Statement | C | Educational Codeforces Round 168 (Rated for Div. 2) {1997} | PROGRAMMING | Video Tutorial | ||
| 1326 | Chips on a Line | dp math | Statement | F | Educational Codeforces Round 168 (Rated for Div. 2) {1997} | PROGRAMMING | Video Tutorial | ||
| 7254 | Perform Operations to Maximize Score | binary search brute force greedy | Statement | C | Codeforces Round 965 (Div. 2) {1998} | PROGRAMMING | 1250.0 | Video Tutorial | |
| 28624 | Minimize Equal Sum Subarrays | constructive algorithms math number theory | Statement | B | Codeforces Round 965 (Div. 2) {1998} | PROGRAMMING | 750.0 | Video Tutorial | |
| 26318 | Find K Distinct Points with Fixed Center | constructive algorithms implementation math | Statement | A | Codeforces Round 965 (Div. 2) {1998} | PROGRAMMING | 500.0 | Video Tutorial |