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 ... 36 37 38 39 40 ... 44 45 46 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 36508 | Wallet Exchange | games math | Statement | A | Hello 2024 {1919} | PROGRAMMING | 250.0 | 800 | |
| 31832 | Plus-Minus Split | greedy | Statement | B | Hello 2024 {1919} | PROGRAMMING | 500.0 | 800 | |
| 23507 | Summation Game | dp games greedy sortings | Statement | B | Codeforces Round 919 (Div. 2) {1920} | PROGRAMMING | 1000.0 | Editorial for Codeforces Round #919 (Div. 2) | |
| 687 | Smooth Sailing (Hard Version) | binary search data structures dsu graphs trees | Statement | F2 | Codeforces Round 919 (Div. 2) {1920} | PROGRAMMING | 2500.0 | Editorial for Codeforces Round #919 (Div. 2) | |
| 1307 | Smooth Sailing (Easy Version) | binary search data structures dfs and similar dsu graphs | Statement | F1 | Codeforces Round 919 (Div. 2) {1920} | PROGRAMMING | 2500.0 | Editorial for Codeforces Round #919 (Div. 2) | |
| 29900 | Satisfying Constraints | brute force greedy math schedules | Statement | A | Codeforces Round 919 (Div. 2) {1920} | PROGRAMMING | 500.0 | Editorial for Codeforces Round #919 (Div. 2) | |
| 21327 | Partitioning the Array | brute force number theory | Statement | C | Codeforces Round 919 (Div. 2) {1920} | PROGRAMMING | 1500.0 | Editorial for Codeforces Round #919 (Div. 2) | |
| 3527 | Counting Binary Strings | combinatorics dp math strings | Statement | E | Codeforces Round 919 (Div. 2) {1920} | PROGRAMMING | 2250.0 | Editorial for Codeforces Round #919 (Div. 2) | |
| 6764 | Array Repetition | binary search data structures dp implementation math | Statement | D | Codeforces Round 919 (Div. 2) {1920} | PROGRAMMING | 2000.0 | Editorial for Codeforces Round #919 (Div. 2) | |
| 24803 | Very Different Array | greedy sortings two pointers | Statement | D | Codeforces Round 920 (Div. 3) {1921} | PROGRAMMING | Editorial for Codeforces Round 920 (Div. 3) | ||
| 5325 | Sum of Progression | brute force data structures implementation math | Statement | F | Codeforces Round 920 (Div. 3) {1921} | PROGRAMMING | Editorial for Codeforces Round 920 (Div. 3) | ||
| 50476 | Square | greedy math | Statement | A | Codeforces Round 920 (Div. 3) {1921} | PROGRAMMING | Editorial for Codeforces Round 920 (Div. 3) | ||
| 33098 | Sending Messages | greedy math | Statement | C | Codeforces Round 920 (Div. 3) {1921} | PROGRAMMING | Editorial for Codeforces Round 920 (Div. 3) | ||
| 1573 | Mischievous Shooter | data structures divide and conquer dp implementation | Statement | G | Codeforces Round 920 (Div. 3) {1921} | PROGRAMMING | Editorial for Codeforces Round 920 (Div. 3) | ||
| 11673 | Eat the Chip | brute force games greedy | Statement | E | Codeforces Round 920 (Div. 3) {1921} | PROGRAMMING | Editorial for Codeforces Round 920 (Div. 3) | ||
| 36890 | Arranging Cats | greedy implementation | Statement | B | Codeforces Round 920 (Div. 3) {1921} | PROGRAMMING | Editorial for Codeforces Round 920 (Div. 3) | ||
| 29065 | Tricky Template | constructive algorithms implementation strings | Statement | A | Educational Codeforces Round 161 (Rated for Div. 2) {1922} | PROGRAMMING | Educational Codeforces Round 161 Editorial | ||
| 1809 | Replace on Segment | dp | Statement | F | Educational Codeforces Round 161 (Rated for Div. 2) {1922} | PROGRAMMING | Educational Codeforces Round 161 Editorial | ||
| 9337 | Increasing Subsequences | bitmasks constructive algorithms math | Statement | E | Educational Codeforces Round 161 (Rated for Div. 2) {1922} | PROGRAMMING | Educational Codeforces Round 161 Editorial | ||
| 23779 | Forming Triangles | combinatorics implementation math | Statement | B | Educational Codeforces Round 161 (Rated for Div. 2) {1922} | PROGRAMMING | Educational Codeforces Round 161 Editorial | ||
| 22524 | Closest Cities | greedy | Statement | C | Educational Codeforces Round 161 (Rated for Div. 2) {1922} | PROGRAMMING | Educational Codeforces Round 161 Editorial | ||
| 7010 | Berserk Monsters | data structures dfs and similar greedy implementation | Statement | D | Educational Codeforces Round 161 (Rated for Div. 2) {1922} | PROGRAMMING | Educational Codeforces Round 161 Editorial | ||
| 8575 | Slimes | binary search data structures greedy | Statement | D | Educational Codeforces Round 162 (Rated for Div. 2) {1923} | PROGRAMMING | Educational Codeforces Round 162 Editorial | ||
| 547 | Shrink-Reverse | binary search greedy string suffix structures strings | Statement | F | Educational Codeforces Round 162 (Rated for Div. 2) {1923} | PROGRAMMING | Educational Codeforces Round 162 Editorial | ||
| 26528 | Moving Chips | greedy implementation | Statement | A | Educational Codeforces Round 162 (Rated for Div. 2) {1923} | PROGRAMMING | Educational Codeforces Round 162 Editorial | ||
| 20142 | Monsters Attack! | dp greedy implementation | Statement | B | Educational Codeforces Round 162 (Rated for Div. 2) {1923} | PROGRAMMING | Educational Codeforces Round 162 Editorial | ||
| 18970 | Find B | constructive algorithms data structures greedy | Statement | C | Educational Codeforces Round 162 (Rated for Div. 2) {1923} | PROGRAMMING | Educational Codeforces Round 162 Editorial | ||
| 5429 | Count Paths | data structures dfs and similar divide and conquer dp dsu trees | Statement | E | Educational Codeforces Round 162 (Rated for Div. 2) {1923} | PROGRAMMING | Educational Codeforces Round 162 Editorial | ||
| 3400 | Space Harbour | brute force data structures implementation math sortings | Statement | B | Codeforces Round 921 (Div. 1) {1924} | PROGRAMMING | 1000.0 | Codeforces Round 921 (Div. 1, Div. 2) Editorial | |
| 652 | Paper Cutting Again | combinatorics probabilities | Statement | E | Codeforces Round 921 (Div. 1) {1924} | PROGRAMMING | 2500.0 | Codeforces Round 921 (Div. 1, Div. 2) Editorial | |
| 1416 | Fractal Origami | combinatorics geometry math matrices | Statement | C | Codeforces Round 921 (Div. 1) {1924} | PROGRAMMING | 1500.0 | Codeforces Round 921 (Div. 1, Div. 2) Editorial | |
| 17123 | 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 | |
| 1561 | Balanced Subsequences | combinatorics dp math | Statement | D | Codeforces Round 921 (Div. 1) {1924} | PROGRAMMING | 1750.0 | Codeforces Round 921 (Div. 1, Div. 2) Editorial | |
| 241 | 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 | |
| 31414 | 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 | |
| 5031 | Good Trip | combinatorics dp math probabilities | Statement | D | Codeforces Round 921 (Div. 2) {1925} | PROGRAMMING | 1750.0 | Codeforces Round 921 (Div. 1, Div. 2) Editorial | |
| 23820 | A Balanced Problemset? | brute force greedy math number theory | Statement | B | Codeforces Round 921 (Div. 2) {1925} | PROGRAMMING | 1000.0 | Codeforces Round 921 (Div. 1, Div. 2) Editorial | |
| 4699 | Vlad and Trouble at MIT | dfs and similar dp flows graphs greedy implementation trees | Statement | G | Codeforces Round 928 (Div. 4) {1926} | PROGRAMMING | 126132 | ||
| 64098 | Vlad and the Best of Five | implementation | Statement | A | Codeforces Round 928 (Div. 4) {1926} | PROGRAMMING | 126132 | ||
| 36905 | Vlad and Shapes | implementation | Statement | B | Codeforces Round 928 (Div. 4) {1926} | PROGRAMMING | 126132 | ||
| 18771 | Vlad and Division | bitmasks greedy | Statement | D | Codeforces Round 928 (Div. 4) {1926} | PROGRAMMING | 126132 | ||
| 2163 | Vlad and Avoiding X | bitmasks brute force constructive algorithms dfs and similar dp implementation | Statement | F | Codeforces Round 928 (Div. 4) {1926} | PROGRAMMING | 126132 | ||
| 33688 | Vlad and a Sum of Sum of Digits | dp implementation | Statement | C | Codeforces Round 928 (Div. 4) {1926} | PROGRAMMING | 126132 | ||
| 15294 | Vlad and an Odd Ordering | binary search bitmasks data structures dp implementation math number theory | Statement | E | Codeforces Round 928 (Div. 4) {1926} | PROGRAMMING | 126132 | ||
| 2074 | Paint Charges | data structures dp greedy math | Statement | G | Codeforces Round 923 (Div. 3) {1927} | PROGRAMMING | 125597 | ||
| 5672 | Microcycle | data structures dfs and similar dsu graphs greedy trees | Statement | F | Codeforces Round 923 (Div. 3) {1927} | PROGRAMMING | 125597 | ||
| 52490 | Make it White | greedy strings | Statement | A | Codeforces Round 923 (Div. 3) {1927} | PROGRAMMING | 125597 | ||
| 17440 | Klever Permutation | constructive algorithms math | Statement | E | Codeforces Round 923 (Div. 3) {1927} | PROGRAMMING | 125597 | ||
| 38781 | Following the String | constructive algorithms greedy strings | Statement | B | Codeforces Round 923 (Div. 3) {1927} | PROGRAMMING | 125597 | ||
| 36030 | Find the Different Ones! | binary search brute force data structures dp greedy two pointers | Statement | D | Codeforces Round 923 (Div. 3) {1927} | PROGRAMMING | 125597 | ||
| 32067 | Choose the Different Ones! | brute force greedy math | Statement | C | Codeforces Round 923 (Div. 3) {1927} | PROGRAMMING | 125597 | ||
| 24602 | Rectangle Cutting | constructive algorithms geometry greedy math | Statement | A | Codeforces Round 924 (Div. 2) {1928} | PROGRAMMING | 500.0 | Codeforces Round 924 Editorial | |
| 10587 | Physical Education Lesson | brute force math number theory | Statement | C | Codeforces Round 924 (Div. 2) {1928} | PROGRAMMING | 1500.0 | Codeforces Round 924 Editorial | |
| 2269 | 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 | |
| 5287 | Lonely Mountain Dungeons | binary search brute force data structures greedy math ternary search | Statement | D | Codeforces Round 924 (Div. 2) {1928} | PROGRAMMING | 1750.0 | Codeforces Round 924 Editorial | |
| 21308 | Equalize | binary search greedy sortings two pointers | Statement | B | Codeforces Round 924 (Div. 2) {1928} | PROGRAMMING | 1000.0 | Codeforces Round 924 Editorial | |
| 497 | Digital Patterns | combinatorics data structures implementation math | Statement | F | Codeforces Round 924 (Div. 2) {1928} | PROGRAMMING | 2750.0 | Codeforces Round 924 Editorial | |
| 2370 | Sasha and the Wedding Binary Search Tree | combinatorics dfs and similar math sortings trees | Statement | F | Codeforces Round 926 (Div. 2) {1929} | PROGRAMMING | 3000.0 | Codeforces Round #926 (Div. 2) Editorial. | |
| 2164 | Sasha and the Happy Tree Cutting | bitmasks brute force dp fft graphs greedy trees | Statement | E | Codeforces Round 926 (Div. 2) {1929} | PROGRAMMING | 2500.0 | Codeforces Round #926 (Div. 2) Editorial. | |
| 26932 | 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. | |
| 17659 | Sasha and the Casino | binary search brute force dp games greedy math | Statement | C | Codeforces Round 926 (Div. 2) {1929} | PROGRAMMING | 1500.0 | Codeforces Round #926 (Div. 2) Editorial. | |
| 35476 | 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. | |
| 5958 | Sasha and a Walk in the City | combinatorics dfs and similar dp math trees | Statement | D | Codeforces Round 926 (Div. 2) {1929} | PROGRAMMING | 2000.0 | Codeforces Round #926 (Div. 2) Editorial. | |
| 3150 | Sum over all Substrings (Hard Version) | dp greedy strings | Statement | D2 | think-cell Round 1 {1930} | PROGRAMMING | 1000.0 | think-cell Round 1 Editorial | |
| 4941 | Sum over all Substrings (Easy Version) | brute force dp greedy strings | Statement | D1 | think-cell Round 1 {1930} | PROGRAMMING | 1250.0 | think-cell Round 1 Editorial | |
| 542 | Prefix Max Set Counting | data structures trees | Statement | G | think-cell Round 1 {1930} | PROGRAMMING | 3500.0 | think-cell Round 1 Editorial | |
| 17923 | Permutation Printing | brute force constructive algorithms math | Statement | B | think-cell Round 1 {1930} | PROGRAMMING | 1000.0 | think-cell Round 1 Editorial | |
| 984 | Maximize the Difference | bitmasks brute force dfs and similar | Statement | F | think-cell Round 1 {1930} | PROGRAMMING | 2750.0 | think-cell Round 1 Editorial | |
| 20501 | Maximise The Score | greedy sortings | Statement | A | think-cell Round 1 {1930} | PROGRAMMING | 500.0 | think-cell Round 1 Editorial | |
| 8294 | Lexicographically Largest | constructive algorithms data structures greedy sortings | Statement | C | think-cell Round 1 {1930} | PROGRAMMING | 1500.0 | think-cell Round 1 Editorial | |
| 416 | Interactive Mex Tree | interactive | Statement | H | think-cell Round 1 {1930} | PROGRAMMING | 3500.0 | think-cell Round 1 Editorial | |
| 112 | Counting Is Fun | combinatorics | Statement | I | think-cell Round 1 {1930} | PROGRAMMING | 5000.0 | think-cell Round 1 Editorial | |
| 1535 | 2..3...4.... Wonderful! Wonderful! | combinatorics math | Statement | E | think-cell Round 1 {1930} | PROGRAMMING | 2500.0 | think-cell Round 1 Editorial | |
| 40396 | Recovering a Small String | brute force strings | Statement | A | Codeforces Round 925 (Div. 3) {1931} | PROGRAMMING | 125878 | ||
| 3835 | One-Dimensional Puzzle | combinatorics constructive algorithms math number theory | Statement | G | Codeforces Round 925 (Div. 3) {1931} | PROGRAMMING | 125878 | ||
| 34508 | Make Equal Again | brute force greedy math | Statement | C | Codeforces Round 925 (Div. 3) {1931} | PROGRAMMING | 125878 | ||
| 35758 | Make Equal | greedy | Statement | B | Codeforces Round 925 (Div. 3) {1931} | PROGRAMMING | 125878 | ||
| 33502 | Divisible Pairs | combinatorics data structures hashing math | Statement | D | Codeforces Round 925 (Div. 3) {1931} | PROGRAMMING | 125878 | ||
| 12843 | Chat Screenshots | combinatorics dfs and similar graphs implementation | Statement | F | Codeforces Round 925 (Div. 3) {1931} | PROGRAMMING | 125878 | ||
| 28041 | Anna and the Valentine's Day Gift | games greedy math sortings | Statement | E | Codeforces Round 925 (Div. 3) {1931} | PROGRAMMING | 125878 | ||
| 34580 | Thorns and Coins | dp greedy implementation | Statement | A | Codeforces Round 927 (Div. 3) {1932} | PROGRAMMING | 126196 | ||
| 1433 | Moving Platforms | graphs math number theory shortest paths | Statement | G | Codeforces Round 927 (Div. 3) {1932} | PROGRAMMING | 126196 | ||
| 19400 | LR-remainders | brute force data structures implementation math | Statement | C | Codeforces Round 927 (Div. 3) {1932} | PROGRAMMING | 126196 | ||
| 10525 | Final Countdown | implementation math number theory | Statement | E | Codeforces Round 927 (Div. 3) {1932} | PROGRAMMING | 126196 | ||
| 6075 | Feed Cats | data structures dp sortings | Statement | F | Codeforces Round 927 (Div. 3) {1932} | PROGRAMMING | 126196 | ||
| 24119 | Chaya Calendar | number theory | Statement | B | Codeforces Round 927 (Div. 3) {1932} | PROGRAMMING | 126196 | ||
| 13742 | Card Game | greedy implementation | Statement | D | Codeforces Round 927 (Div. 3) {1932} | PROGRAMMING | 126196 | ||
| 13939 | Turtle vs. Rabbit Race: Optimal Trainings | binary search math ternary search | Statement | E | Codeforces Round 929 (Div. 3) {1933} | PROGRAMMING | Codeforces Round 929 (Div. 3) Editorial | ||
| 24074 | 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 | ||
| 42671 | Turtle Puzzle: Rearrange and Negate | greedy math sortings | Statement | A | Codeforces Round 929 (Div. 3) {1933} | PROGRAMMING | Codeforces Round 929 (Div. 3) Editorial | ||
| 3036 | Turtle Mission: Robot and the Earthquake | dfs and similar dp graphs shortest paths | Statement | F | Codeforces Round 929 (Div. 3) {1933} | PROGRAMMING | Codeforces Round 929 (Div. 3) Editorial | ||
| 37220 | Turtle Math: Fast Three Task | implementation number theory | Statement | B | Codeforces Round 929 (Div. 3) {1933} | PROGRAMMING | Codeforces Round 929 (Div. 3) Editorial | ||
| 1223 | Turtle Magic: Royal Turtle Shell Pattern | bitmasks brute force combinatorics math | Statement | G | Codeforces Round 929 (Div. 3) {1933} | PROGRAMMING | Codeforces Round 929 (Div. 3) Editorial | ||
| 25808 | Turtle Fingers: Count the Values of k | brute force number theory | Statement | C | Codeforces Round 929 (Div. 3) {1933} | PROGRAMMING | Codeforces Round 929 (Div. 3) Editorial | ||
| 22479 | Yet Another Coin Problem | brute force dp greedy math | Statement | B | Codeforces Round 931 (Div. 2) {1934} | PROGRAMMING | 1000.0 | Tutorial | |
| 4268 | XOR Break --- Solo Version | bitmasks constructive algorithms greedy | Statement | D1 | Codeforces Round 931 (Div. 2) {1934} | PROGRAMMING | 1500.0 | Tutorial | |
| 1843 | XOR Break --- Game Version | bitmasks games greedy interactive | Statement | D2 | Codeforces Round 931 (Div. 2) {1934} | PROGRAMMING | 1250.0 | Tutorial | |
| 403 | Weird LCM Operations | brute force constructive algorithms | Statement | E | Codeforces Round 931 (Div. 2) {1934} | PROGRAMMING | 3250.0 | Tutorial | |
| 27530 | Too Min Too Max | constructive algorithms greedy math | Statement | A | Codeforces Round 931 (Div. 2) {1934} | PROGRAMMING | 500.0 | Tutorial | |
| 8286 | Find a Mine | constructive algorithms geometry greedy interactive math | Statement | C | Codeforces Round 931 (Div. 2) {1934} | PROGRAMMING | 1500.0 | Tutorial | |
| 9974 | 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 | |
| 21202 | Informatics in MAC | constructive algorithms | Statement | B | Codeforces Round 932 (Div. 2) {1935} | PROGRAMMING | 1000.0 | Codeforces Round #932 (Div. 2) Editorial | |
| 11204 | Exam in MAC | binary search combinatorics math | Statement | D | Codeforces Round 932 (Div. 2) {1935} | PROGRAMMING | 1750.0 | Codeforces Round #932 (Div. 2) Editorial | |
| 30627 | Entertainment in MAC | constructive algorithms strings | Statement | A | Codeforces Round 932 (Div. 2) {1935} | PROGRAMMING | 500.0 | Codeforces Round #932 (Div. 2) Editorial | |
| 1693 | Distance Learning Courses in MAC | binary search bitmasks data structures greedy implementation math | Statement | E | Codeforces Round 932 (Div. 2) {1935} | PROGRAMMING | 2500.0 | Codeforces Round #932 (Div. 2) Editorial | |
| 693 | 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 | |
| 162 | Yet Yet Another Permutation Problem | divide and conquer fft math | Statement | E | Codeforces Round 930 (Div. 1) {1936} | PROGRAMMING | 2500.0 | Codeforces Round 930 (Div. 1, Div. 2) Editorial | |
| 1787 | Pokémon Arena | data structures graphs shortest paths | Statement | C | Codeforces Round 930 (Div. 1) {1936} | PROGRAMMING | 1500.0 | Codeforces Round 930 (Div. 1, Div. 2) Editorial | |
| 3644 | Pinball | binary search implementation math | Statement | B | Codeforces Round 930 (Div. 1) {1936} | PROGRAMMING | 1000.0 | Codeforces Round 930 (Div. 1, Div. 2) Editorial | |
| 185 | Grand Finale: Circles | geometry | Statement | F | Codeforces Round 930 (Div. 1) {1936} | PROGRAMMING | 2750.0 | Codeforces Round 930 (Div. 1, Div. 2) Editorial | |
| 725 | Bitwise Paradox | bitmasks data structures greedy two pointers | Statement | D | Codeforces Round 930 (Div. 1) {1936} | PROGRAMMING | 2000.0 | Codeforces Round 930 (Div. 1, Div. 2) Editorial | |
| 8793 | 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 | |
| 24939 | Shuffle Party | implementation math | Statement | A | Codeforces Round 930 (Div. 2) {1937} | PROGRAMMING | 500.0 | Codeforces Round 930 (Div. 1, Div. 2) Editorial | |
| 17633 | Binary Path | greedy implementation | Statement | B | Codeforces Round 930 (Div. 2) {1937} | PROGRAMMING | 1000.0 | Codeforces Round 930 (Div. 1, Div. 2) Editorial | |
| 101 | Zig-zag | Statement | M | 2024 ICPC Asia Pacific Championship - Online Mirror (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1938} | PROGRAMMING | ||||
| 359 | XOR Operations | Statement | L | 2024 ICPC Asia Pacific Championship - Online Mirror (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1938} | PROGRAMMING | ||||
| 799 | Tree Quiz | Statement | K | 2024 ICPC Asia Pacific Championship - Online Mirror (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1938} | PROGRAMMING | ||||
| 1627 | There and Back Again | Statement | J | 2024 ICPC Asia Pacific Championship - Online Mirror (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1938} | PROGRAMMING | ||||
| 89 | Symmetric Boundary | Statement | I | 2024 ICPC Asia Pacific Championship - Online Mirror (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1938} | PROGRAMMING | ||||
| 2731 | Pho Restaurant | Statement | H | 2024 ICPC Asia Pacific Championship - Online Mirror (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1938} | PROGRAMMING | ||||
| 1324 | Personality Test | Statement | G | 2024 ICPC Asia Pacific Championship - Online Mirror (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1938} | PROGRAMMING | ||||
| 947 | Forming Groups | Statement | F | 2024 ICPC Asia Pacific Championship - Online Mirror (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1938} | PROGRAMMING | ||||
| 1299 | Duplicates | Statement | E | 2024 ICPC Asia Pacific Championship - Online Mirror (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1938} | PROGRAMMING | ||||
| 1869 | Bit Counting Sequence | Statement | C | 2024 ICPC Asia Pacific Championship - Online Mirror (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1938} | PROGRAMMING | ||||
| 113 | Bánh Bò | Statement | D | 2024 ICPC Asia Pacific Championship - Online Mirror (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1938} | PROGRAMMING | ||||
| 234 | Attraction Score | Statement | B | 2024 ICPC Asia Pacific Championship - Online Mirror (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1938} | PROGRAMMING | ||||
| 84 | Antiparticle Antiphysics | Statement | A | 2024 ICPC Asia Pacific Championship - Online Mirror (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1938} | PROGRAMMING | ||||
| 420 | More Gifts | *special dfs and similar two pointers | Statement | C | XVIII Open Olympiad in Informatics - Final Stage, Day 1 (Unrated, Online Mirror, IOI rules) {1939} | PROGRAMMING | |||
| 309 | 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 | |||
| 115 | Big Persimmon | *special dp games | Statement | D | XVIII Open Olympiad in Informatics - Final Stage, Day 1 (Unrated, Online Mirror, IOI rules) {1939} | 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 | |||
| 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 | |||
| 44 | Burenka and Pether | *special data structures dfs and similar divide and conquer dsu graphs sortings trees | Statement | C | XVIII Open Olympiad in Informatics - Final Stage, Day 2 (Unrated, Online Mirror, IOI rules) {1940} | 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 | |||
| 40039 | Rudolf and the Ugly String | dp strings | Statement | C | Codeforces Round 933 (Div. 3) {1941} | PROGRAMMING | 127018 | ||
| 48395 | Rudolf and the Ticket | brute force math sortings two pointers | Statement | A | Codeforces Round 933 (Div. 3) {1941} | PROGRAMMING | 127018 | ||
| 21388 | Rudolf and the Ball Game | dp implementation | Statement | D | Codeforces Round 933 (Div. 3) {1941} | PROGRAMMING | 127018 | ||
| 5047 | Rudolf and Subway | dfs and similar graphs shortest paths | Statement | G | Codeforces Round 933 (Div. 3) {1941} | PROGRAMMING | 127018 | ||
| 12334 | Rudolf and k Bridges | data structures dp | Statement | E | Codeforces Round 933 (Div. 3) {1941} | PROGRAMMING | 127018 | ||
| 7600 | Rudolf and Imbalance | binary search greedy two pointers | Statement | F | Codeforces Round 933 (Div. 3) {1941} | PROGRAMMING | 127018 | ||
| 35551 | Rudolf and 121 | greedy math | Statement | B | Codeforces Round 933 (Div. 3) {1941} | PROGRAMMING | 127018 | ||
| 3423 | Learning to Paint | data structures dp greedy | Statement | D | CodeTON Round 8 (Div. 1 + Div. 2, Rated, Prizes!) {1942} | PROGRAMMING | 2250.0 | CodeTON Round 8 Editorial | |
| 2043 | Farm Game | combinatorics games math | Statement | E | CodeTON Round 8 (Div. 1 + Div. 2, Rated, Prizes!) {1942} | PROGRAMMING | 2500.0 | CodeTON Round 8 Editorial | |
| 269 | Farmer John's Favorite Intern | data structures dp flows trees | Statement | H | CodeTON Round 8 (Div. 1 + Div. 2, Rated, Prizes!) {1942} | PROGRAMMING | 4500.0 | CodeTON Round 8 Editorial | |
| 1013 | Farmer John's Favorite Function | data structures | Statement | F | CodeTON Round 8 (Div. 1 + Div. 2, Rated, Prizes!) {1942} | PROGRAMMING | 3000.0 | CodeTON Round 8 Editorial | |
| 18617 | 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 | |
| 6990 | Bessie's Birthday Cake (Hard Version) | geometry greedy math | Statement | C2 | CodeTON Round 8 (Div. 1 + Div. 2, Rated, Prizes!) {1942} | PROGRAMMING | 750.0 | CodeTON Round 8 Editorial | |
| 12606 | Bessie's Birthday Cake (Easy Version) | geometry math | Statement | C1 | CodeTON Round 8 (Div. 1 + Div. 2, Rated, Prizes!) {1942} | PROGRAMMING | 1250.0 | CodeTON Round 8 Editorial | |
| 15725 | 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 | |
| 876 | Bessie and Cards | combinatorics math | Statement | G | CodeTON Round 8 (Div. 1 + Div. 2, Rated, Prizes!) {1942} | PROGRAMMING | 3000.0 | CodeTON Round 8 Editorial | |
| 2757 | 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 | |
| 4694 | Non-Palindromic Substring | data structures hashing implementation math strings | Statement | B | Codeforces Round 934 (Div. 1) {1943} | PROGRAMMING | 1250.0 | Codeforces Round #934 (Div1, Div2) Editorial | |
| 151 | Minimum Hamming Distance | dp | Statement | F | Codeforces Round 934 (Div. 1) {1943} | PROGRAMMING | 4500.0 | Codeforces Round #934 (Div1, Div2) Editorial | |
| 381 | MEX Game 2 (Hard Version) | binary search greedy two pointers | Statement | E2 | Codeforces Round 934 (Div. 1) {1943} | PROGRAMMING | 1500.0 | Codeforces Round #934 (Div1, Div2) Editorial | |
| 554 | MEX Game 2 (Easy Version) | binary search brute force greedy | Statement | E1 | Codeforces Round 934 (Div. 1) {1943} | PROGRAMMING | 2000.0 | Codeforces Round #934 (Div1, Div2) Editorial | |
| 22107 | MEX Game 1 | brute force games greedy | Statement | A | Codeforces Round 934 (Div. 1) {1943} | PROGRAMMING | 500.0 | Codeforces Round #934 (Div1, Div2) Editorial | |
| 1212 | Counting Is Fun (Hard Version) | combinatorics dp | Statement | D2 | Codeforces Round 934 (Div. 1) {1943} | PROGRAMMING | 2000.0 | Codeforces Round #934 (Div1, Div2) Editorial | |
| 2027 | Counting Is Fun (Easy Version) | combinatorics dp | Statement | D1 | Codeforces Round 934 (Div. 1) {1943} | PROGRAMMING | 1250.0 | Codeforces Round #934 (Div1, Div2) Editorial | |
| 18430 | Equal XOR | bitmasks constructive algorithms | Statement | B | Codeforces Round 934 (Div. 2) {1944} | PROGRAMMING | 1000.0 | Codeforces Round #934 (Div1, Div2) Editorial | |
| 29596 | Destroying Bridges | math | Statement | A | Codeforces Round 934 (Div. 2) {1944} | PROGRAMMING | 500.0 | Codeforces Round #934 (Div1, Div2) Editorial | |
| 30750 | Setting up Camp | greedy math | Statement | A | Codeforces Round 935 (Div. 3) {1945} | PROGRAMMING | 127377 | ||
| 17560 | Seraphim the Owl | greedy | Statement | D | Codeforces Round 935 (Div. 3) {1945} | PROGRAMMING | 127377 | ||
| 17734 | Left and Right Houses | brute force | Statement | C | Codeforces Round 935 (Div. 3) {1945} | PROGRAMMING | 127377 | ||
| 5249 | Kirill and Mushrooms | data structures sortings | Statement | F | Codeforces Round 935 (Div. 3) {1945} | PROGRAMMING | 127377 | ||
| 988 | GCD is Greater | bitmasks brute force number theory | Statement | H | Codeforces Round 935 (Div. 3) {1945} | PROGRAMMING | 127377 | ||
| 26634 | Fireworks | math number theory | Statement | B | Codeforces Round 935 (Div. 3) {1945} | PROGRAMMING | 127377 | ||
| 955 | Cook and Porridge | binary search constructive algorithms data structures implementation | Statement | G | Codeforces Round 935 (Div. 3) {1945} | PROGRAMMING | 127377 | ||
| 9932 | Binary Search | binary search constructive algorithms | Statement | E | Codeforces Round 935 (Div. 3) {1945} | PROGRAMMING | 127377 | ||
| 14237 | Tree Cutting | binary search dp greedy implementation trees | Statement | C | Codeforces Round 936 (Div. 2) {1946} | PROGRAMMING | 1500.0 | Codeforces Round #936 (Div. 2) Editorial | |
| 1298 | Nobody is needed | brute force data structures dp math number theory | Statement | F | Codeforces Round 936 (Div. 2) {1946} | PROGRAMMING | 2750.0 | Codeforces Round #936 (Div. 2) Editorial | |
| 28958 | Median of an Array | greedy implementation | Statement | A | Codeforces Round 936 (Div. 2) {1946} | PROGRAMMING | 500.0 | Codeforces Round #936 (Div. 2) Editorial | |
| 23988 | Maximum Sum | greedy math | Statement | B | Codeforces Round 936 (Div. 2) {1946} | PROGRAMMING | 1000.0 | Codeforces Round #936 (Div. 2) Editorial | |
| 3267 | Girl Permutation | combinatorics dp math number theory | Statement | E | Codeforces Round 936 (Div. 2) {1946} | PROGRAMMING | 2250.0 | Codeforces Round #936 (Div. 2) Editorial | |
| 5720 | 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 | |
| 12948 | Tandem Repeats? | brute force dp strings two pointers | Statement | D | Educational Codeforces Round 163 (Rated for Div. 2) {1948} | PROGRAMMING | Educational Codeforces Round 163 Editorial | ||
| 31430 | Special Characters | brute force constructive algorithms | Statement | A | Educational Codeforces Round 163 (Rated for Div. 2) {1948} | PROGRAMMING | Educational Codeforces Round 163 Editorial | ||
| 1744 | Rare Coins | combinatorics math probabilities | Statement | F | Educational Codeforces Round 163 (Rated for Div. 2) {1948} | PROGRAMMING | Educational Codeforces Round 163 Editorial | ||
| 1017 | MST with Matching | bitmasks brute force trees | Statement | G | Educational Codeforces Round 163 (Rated for Div. 2) {1948} | PROGRAMMING | Educational Codeforces Round 163 Editorial | ||
| 3612 | Clique Partition | constructive algorithms graphs greedy | Statement | E | Educational Codeforces Round 163 (Rated for Div. 2) {1948} | PROGRAMMING | Educational Codeforces Round 163 Editorial | ||
| 21661 | Arrow Path | dfs and similar graphs shortest paths | Statement | C | Educational Codeforces Round 163 (Rated for Div. 2) {1948} | PROGRAMMING | Educational Codeforces Round 163 Editorial | ||
| 26659 | Array Fix | brute force dp greedy implementation | Statement | B | Educational Codeforces Round 163 (Rated for Div. 2) {1948} | PROGRAMMING | Educational Codeforces Round 163 Editorial | ||
| 1074 | Scooter | graphs greedy | Statement | G | European Championship 2024 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1949} | PROGRAMMING | European Championship 2024 (EUC) Editorial | ||
| 513 | Make Triangle | constructive algorithms math | Statement | K | European Championship 2024 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1949} | PROGRAMMING | European Championship 2024 (EUC) Editorial | ||
| 226 | Grove | dp dp dp geometry | Statement | A | European Championship 2024 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1949} | PROGRAMMING | European Championship 2024 (EUC) Editorial | ||
| 578 | Funny or Scary? | constructive algorithms | Statement | D | European Championship 2024 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1949} | PROGRAMMING | European Championship 2024 (EUC) Editorial | ||
| 170 | Division Avoidance | Statement | H | European Championship 2024 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1949} | PROGRAMMING | European Championship 2024 (EUC) Editorial | |||
| 2896 | Disks | dfs and similar geometry graphs | Statement | I | European Championship 2024 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1949} | PROGRAMMING | European Championship 2024 (EUC) Editorial | ||
| 1523 | Dating | greedy sortings trees | Statement | F | European Championship 2024 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1949} | PROGRAMMING | European Championship 2024 (EUC) Editorial | ||
| 155 | Damage per Second | Statement | E | European Championship 2024 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1949} | PROGRAMMING | European Championship 2024 (EUC) Editorial | |||
| 5076 | Charming Meals | binary search brute force greedy sortings | Statement | B | European Championship 2024 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1949} | PROGRAMMING | European Championship 2024 (EUC) Editorial | ||
| 2608 | Annual Ants' Gathering | dfs and similar greedy trees | Statement | C | European Championship 2024 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1949} | PROGRAMMING | European Championship 2024 (EUC) Editorial | ||
| 565 | Amanda the Amoeba | graphs implementation trees two pointers | Statement | J | European Championship 2024 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1949} | PROGRAMMING | European Championship 2024 (EUC) Editorial | ||
| 44984 | Upscaling | implementation | Statement | B | Codeforces Round 937 (Div. 4) {1950} | PROGRAMMING | Codeforces Round 937 (Div. 4) Editorial | ||
| 71748 | Stair, Peak, or Neither? | implementation | Statement | A | Codeforces Round 937 (Div. 4) {1950} | PROGRAMMING | Codeforces Round 937 (Div. 4) Editorial | ||
| 6438 | Shuffling Songs | bitmasks dp graphs implementation strings | Statement | G | Codeforces Round 937 (Div. 4) {1950} | PROGRAMMING | Codeforces Round 937 (Div. 4) Editorial | ||
| 26857 | Product of Binary Decimals | dp implementation number theory | Statement | D | Codeforces Round 937 (Div. 4) {1950} | PROGRAMMING | Codeforces Round 937 (Div. 4) Editorial | ||
| 17836 | Nearly Shortest Repeating Substring | brute force implementation number theory strings | Statement | E | Codeforces Round 937 (Div. 4) {1950} | PROGRAMMING | Codeforces Round 937 (Div. 4) Editorial | ||
| 47715 | Clock Conversion | implementation math | Statement | C | Codeforces Round 937 (Div. 4) {1950} | PROGRAMMING | Codeforces Round 937 (Div. 4) Editorial | ||
| 11537 | 0, 1, 2, Tree! | greedy math trees | Statement | F | Codeforces Round 937 (Div. 4) {1950} | PROGRAMMING | Codeforces Round 937 (Div. 4) Editorial | ||
| 14026 | Ticket Hoarding | greedy math sortings | Statement | C | Codeforces Global Round 25 {1951} | PROGRAMMING | 1500.0 | Codeforces Global Round 25 Editorial | |
| 382 | Thanos Snap | dp games greedy trees | Statement | H | Codeforces Global Round 25 {1951} | PROGRAMMING | 3500.0 | Codeforces Global Round 25 Editorial | |
| 4627 | 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 | |
| 1020 | Inversion Composition | binary search constructive algorithms data structures greedy | Statement | F | Codeforces Global Round 25 {1951} | PROGRAMMING | 2750.0 | Codeforces Global Round 25 Editorial | |
| 119 | Growing Trees | constructive algorithms flows graphs greedy | Statement | I | Codeforces Global Round 25 {1951} | PROGRAMMING | 4000.0 | Codeforces Global Round 25 Editorial | |
| 22917 | Dual Trigger | greedy math | Statement | A | Codeforces Global Round 25 {1951} | PROGRAMMING | 500.0 | Codeforces Global Round 25 Editorial | |
| 562 | Clacking Balls | combinatorics math probabilities | Statement | G | Codeforces Global Round 25 {1951} | PROGRAMMING | 3250.0 | Codeforces Global Round 25 Editorial | |
| 6432 | Buying Jewels | constructive algorithms greedy math | Statement | D | Codeforces Global Round 25 {1951} | PROGRAMMING | 1750.0 | Codeforces Global Round 25 Editorial | |
| 17127 | Battle Cows | binary search greedy | Statement | B | Codeforces Global Round 25 {1951} | PROGRAMMING | 1000.0 | Codeforces Global Round 25 Editorial | |
| 3284 | They Have Fooled | brute force | Statement | C | April Fools Day Contest 2024 {1952} | PROGRAMMING | April Fools Day Contest 2024 Editorial | ||
| 346 | Sweep Line | combinatorics games math | Statement | E | April Fools Day Contest 2024 {1952} | PROGRAMMING | April Fools Day Contest 2024 Editorial | ||
| 814 | Palindrome | fft meet-in-the-middle | Statement | H | April Fools Day Contest 2024 {1952} | PROGRAMMING | April Fools Day Contest 2024 Editorial | ||
| 1237 | Mathematician Takeover | math | Statement | G | April Fools Day Contest 2024 {1952} | PROGRAMMING | April Fools Day Contest 2024 Editorial | ||
| 12384 | Is it stated? | strings | Statement | B | April Fools Day Contest 2024 {1952} | PROGRAMMING | April Fools Day Contest 2024 Editorial | ||
| 913 | 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 | ||
| 1973 | Grid | brute force divide and conquer matrices | Statement | F | April Fools Day Contest 2024 {1952} | PROGRAMMING | April Fools Day Contest 2024 Editorial | ||
| 653 | Dark Matter | Statement | I | April Fools Day Contest 2024 {1952} | PROGRAMMING | April Fools Day Contest 2024 Editorial | |||
| 14200 | Are You a Robot, Again? | expression parsing graphs strings | Statement | A | April Fools Day Contest 2024 {1952} | PROGRAMMING | April Fools Day Contest 2024 Editorial | ||
| 5410 | Are You a Procrastinator? | binary search schedules | Statement | D | April Fools Day Contest 2024 {1952} | PROGRAMMING | April Fools Day Contest 2024 Editorial | ||
| 0 | Accuracy-Preserving Summation Algorithm | *special | Statement | A | 2023 Post World Finals Online ICPC Challenge powered by Huawei {1953} | PROGRAMMING | |||
| 466 | Unique Strings | combinatorics dp math | Statement | F | Educational Codeforces Round 164 (Rated for Div. 2) {1954} | PROGRAMMING | Educational Codeforces Round 164 Editorial | ||
| 28119 | Painting the Ribbon | math | Statement | A | Educational Codeforces Round 164 (Rated for Div. 2) {1954} | PROGRAMMING | Educational Codeforces Round 164 Editorial | ||
| 22057 | Make It Ugly | implementation math | Statement | B | Educational Codeforces Round 164 (Rated for Div. 2) {1954} | PROGRAMMING | Educational Codeforces Round 164 Editorial | ||
| 23276 | Long Multiplication | greedy math | Statement | C | Educational Codeforces Round 164 (Rated for Div. 2) {1954} | PROGRAMMING | Educational Codeforces Round 164 Editorial | ||
| 8470 | Colored Balls | combinatorics dp greedy math sortings | Statement | D | Educational Codeforces Round 164 (Rated for Div. 2) {1954} | PROGRAMMING | Educational Codeforces Round 164 Editorial | ||
| 3124 | Chain Reaction | data structures dsu greedy implementation math number theory | Statement | E | Educational Codeforces Round 164 (Rated for Div. 2) {1954} | PROGRAMMING | Educational Codeforces Round 164 Editorial | ||
| 53967 | Yogurt Sale | math | Statement | A | Codeforces Round 938 (Div. 3) {1955} | PROGRAMMING | 128243 | ||
| 8910 | Unfair Game | dp games greedy math | Statement | F | Codeforces Round 938 (Div. 3) {1955} | PROGRAMMING | 128243 | ||
| 1573 | The Most Reckless Defense | bitmasks brute force constructive algorithms dp flows graph matchings | Statement | H | Codeforces Round 938 (Div. 3) {1955} | PROGRAMMING | 128243 | ||
| 32905 | Progressive Square | constructive algorithms data structures implementation sortings | Statement | B | Codeforces Round 938 (Div. 3) {1955} | PROGRAMMING | 128243 | ||
| 10848 | Long Inversions | brute force greedy implementation sortings | Statement | E | Codeforces Round 938 (Div. 3) {1955} | PROGRAMMING | 128243 | ||
| 25149 | Inhabitant of the Deep Sea | greedy implementation math | Statement | C | Codeforces Round 938 (Div. 3) {1955} | PROGRAMMING | 128243 | ||
| 19166 | Inaccurate Subsequence Search | data structures two pointers | Statement | D | Codeforces Round 938 (Div. 3) {1955} | PROGRAMMING | 128243 | ||
| 6117 | GCD on a grid | brute force dfs and similar dp math number theory | Statement | G | Codeforces Round 938 (Div. 3) {1955} | PROGRAMMING | 128243 | ||
| 1146 | Nene vs. Monsters (Hard Version) | brute force implementation math | Statement | E2 | Codeforces Round 939 (Div. 2) {1956} | PROGRAMMING | 750.0 | [Editorial] Codeforces Round 939 (Div. 2) | |
| 1698 | Nene vs. Monsters (Easy Version) | brute force implementation math | Statement | E1 | Codeforces Round 939 (Div. 2) {1956} | PROGRAMMING | 1500.0 | [Editorial] Codeforces Round 939 (Div. 2) | |
| 15441 | 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) | |
| 24652 | Nene's Game | brute force greedy | Statement | A | Codeforces Round 939 (Div. 2) {1956} | PROGRAMMING | 500.0 | [Editorial] Codeforces Round 939 (Div. 2) | |
| 759 | 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) | |
| 4890 | 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) | |
| 23082 | Nene and the Card Game | games greedy | Statement | B | Codeforces Round 939 (Div. 2) {1956} | PROGRAMMING | 750.0 | [Editorial] Codeforces Round 939 (Div. 2) | |
| 20814 | 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 |
| 12255 | How Does the Rook Move? | combinatorics dp math | Statement | C | Codeforces Round 940 (Div. 2) and CodeCraft-23 {1957} | PROGRAMMING | 1500.0 | Codeforces Round #940 and CodeCraft-23 (Div. 2) Editorial | 1600 |
| 6045 | A BIT of an Inequality | bitmasks brute force dp math | Statement | D | Codeforces Round 940 (Div. 2) and CodeCraft-23 {1957} | PROGRAMMING | 1750.0 | Codeforces Round #940 and CodeCraft-23 (Div. 2) Editorial | 1900 |
| 1690 | Carousel of Combinations | brute force combinatorics dp math number theory | Statement | E | Codeforces Round 940 (Div. 2) and CodeCraft-23 {1957} | PROGRAMMING | 2250.0 | Codeforces Round #940 and CodeCraft-23 (Div. 2) Editorial | 2400 |
| 734 | Frequency Mismatch (Easy Version) | binary search data structures divide and conquer hashing probabilities trees | Statement | F1 | Codeforces Round 940 (Div. 2) and CodeCraft-23 {1957} | PROGRAMMING | 2250.0 | Codeforces Round #940 and CodeCraft-23 (Div. 2) Editorial | 2600 |
| 726 | Frequency Mismatch (Hard Version) | binary search data structures dfs and similar hashing probabilities trees | Statement | F2 | Codeforces Round 940 (Div. 2) and CodeCraft-23 {1957} | PROGRAMMING | 1250.0 | Codeforces Round #940 and CodeCraft-23 (Div. 2) Editorial | 2700 |
| 25902 | 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 |
| 2622 | 1-3-5 | *special dp | Statement | A | Kotlin Heroes: Episode 10 {1958} | PROGRAMMING | 129483 | 1100 | |
| 1219 | Clock in the Pool | *special math | Statement | B | Kotlin Heroes: Episode 10 {1958} | PROGRAMMING | 129483 | 1400 |