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 ... 26 27 28 29 30 ... 44 45 46 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 34087 | Add and Divide | brute force greedy math ternary search | Statement | A | Codeforces Round 701 (Div. 2) {1485} | PROGRAMMING | 500.0 | Editorial of Codeforces Round #701 (Div. 2) | 1000 |
| 17967 | Replace and Keep Sorted | dp implementation math | Statement | B | Codeforces Round 701 (Div. 2) {1485} | PROGRAMMING | 1000.0 | Editorial of Codeforces Round #701 (Div. 2) | 1200 |
| 11101 | Floor and Mod | binary search brute force data structures math number theory | Statement | C | Codeforces Round 701 (Div. 2) {1485} | PROGRAMMING | 1500.0 | Editorial of Codeforces Round #701 (Div. 2) | 1700 |
| 5674 | Multiples and Power Differences | constructive algorithms math number theory | Statement | D | Codeforces Round 701 (Div. 2) {1485} | PROGRAMMING | 1750.0 | Editorial of Codeforces Round #701 (Div. 2) | 2200 |
| 2344 | Copy or Prefix Sum | combinatorics data structures dp sortings | Statement | F | Codeforces Round 701 (Div. 2) {1485} | PROGRAMMING | 3000.0 | Editorial of Codeforces Round #701 (Div. 2) | 2400 |
| 1534 | Move and Swap | dp greedy trees | Statement | E | Codeforces Round 701 (Div. 2) {1485} | PROGRAMMING | 2500.0 | Editorial of Codeforces Round #701 (Div. 2) | 2500 |
| 27130 | Shifting Stacks | greedy implementation | Statement | A | Codeforces Round 703 (Div. 2) {1486} | PROGRAMMING | 500.0 | Codeforces Round #703 (Div. 2) Editorial | |
| 818 | Pairs of Paths | combinatorics data structures trees | Statement | F | Codeforces Round 703 (Div. 2) {1486} | PROGRAMMING | 3000.0 | Codeforces Round #703 (Div. 2) Editorial | |
| 3388 | Paired Payment | binary search constructive algorithms dp graphs shortest paths | Statement | E | Codeforces Round 703 (Div. 2) {1486} | PROGRAMMING | 2250.0 | Codeforces Round #703 (Div. 2) Editorial | |
| 9904 | Max Median | binary search data structures dp two pointers | Statement | D | Codeforces Round 703 (Div. 2) {1486} | PROGRAMMING | 1750.0 | Codeforces Round #703 (Div. 2) Editorial | |
| 10077 | Guessing the Greatest (hard version) | binary search interactive | Statement | C2 | Codeforces Round 703 (Div. 2) {1486} | PROGRAMMING | 750.0 | Codeforces Round #703 (Div. 2) Editorial | |
| 14380 | Guessing the Greatest (easy version) | binary search interactive | Statement | C1 | Codeforces Round 703 (Div. 2) {1486} | PROGRAMMING | 750.0 | Codeforces Round #703 (Div. 2) Editorial | |
| 20864 | Eastern Exhibition | geometry shortest paths sortings | Statement | B | Codeforces Round 703 (Div. 2) {1486} | PROGRAMMING | 1000.0 | Codeforces Round #703 (Div. 2) Editorial | |
| 711 | String Counting | combinatorics dp math | Statement | G | Educational Codeforces Round 104 (Rated for Div. 2) {1487} | PROGRAMMING | 87873 | ||
| 20740 | Pythagorean Triples | binary search math number theory | Statement | D | Educational Codeforces Round 104 (Rated for Div. 2) {1487} | PROGRAMMING | 87873 | ||
| 504 | Ones | dp greedy | Statement | F | Educational Codeforces Round 104 (Rated for Div. 2) {1487} | PROGRAMMING | 87873 | ||
| 15489 | Minimum Ties | brute force constructive algorithms dfs and similar graphs greedy implementation math | Statement | C | Educational Codeforces Round 104 (Rated for Div. 2) {1487} | PROGRAMMING | 87873 | ||
| 5149 | Cheap Dinner | data structures dp implementation sortings two pointers | Statement | E | Educational Codeforces Round 104 (Rated for Div. 2) {1487} | PROGRAMMING | 87873 | ||
| 29387 | Cat Cycle | math number theory | Statement | B | Educational Codeforces Round 104 (Rated for Div. 2) {1487} | PROGRAMMING | 87873 | ||
| 27620 | Arena | implementation sortings | Statement | A | Educational Codeforces Round 104 (Rated for Div. 2) {1487} | PROGRAMMING | 87873 | ||
| 482 | Two Policemen | *special binary search brute force math | Statement | C | Kotlin Heroes: Episode 6 {1488} | PROGRAMMING | 88522 | ||
| 603 | RBS Deletion | *special greedy | Statement | B | Kotlin Heroes: Episode 6 {1488} | PROGRAMMING | 88522 | ||
| 360 | Problemsolving Marathon | *special binary search greedy | Statement | D | Kotlin Heroes: Episode 6 {1488} | PROGRAMMING | 88522 | ||
| 232 | Palindromic Doubles | *special data structures dp | Statement | E | Kotlin Heroes: Episode 6 {1488} | PROGRAMMING | 88522 | ||
| 135 | Painting Numbers | *special data structures greedy number theory | Statement | G | Kotlin Heroes: Episode 6 {1488} | PROGRAMMING | 88522 | ||
| 1825 | From Zero To Y | *special math | Statement | A | Kotlin Heroes: Episode 6 {1488} | PROGRAMMING | 88522 | ||
| 43 | Flower Shop | *special fft math | Statement | J | Kotlin Heroes: Episode 6 {1488} | PROGRAMMING | 88522 | ||
| 190 | Dogecoin | *special *special binary search data structures | Statement | F | Kotlin Heroes: Episode 6 {1488} | PROGRAMMING | 88522 | ||
| 47 | Demonic Invasion | *special flows | Statement | I | Kotlin Heroes: Episode 6 {1488} | PROGRAMMING | 88522 | ||
| 71 | Build From Suffixes | *special combinatorics data structures | Statement | H | Kotlin Heroes: Episode 6 {1488} | PROGRAMMING | 88522 | ||
| 39110 | Sum of Cubes | binary search brute force brute force math | Statement | C | Codeforces Round 702 (Div. 3) {1490} | PROGRAMMING | Codeforces Round #702 (Div. 3) Editorial | ||
| 21846 | Permutation Transformation | dfs and similar divide and conquer implementation | Statement | D | Codeforces Round 702 (Div. 3) {1490} | PROGRAMMING | Codeforces Round #702 (Div. 3) Editorial | ||
| 6212 | Old Floppy Drive | binary search data structures math | Statement | G | Codeforces Round 702 (Div. 3) {1490} | PROGRAMMING | Codeforces Round #702 (Div. 3) Editorial | ||
| 18531 | Equalize the Array | binary search data structures greedy math sortings | Statement | F | Codeforces Round 702 (Div. 3) {1490} | PROGRAMMING | Codeforces Round #702 (Div. 3) Editorial | ||
| 33055 | Dense Array | greedy math | Statement | A | Codeforces Round 702 (Div. 3) {1490} | PROGRAMMING | Codeforces Round #702 (Div. 3) Editorial | ||
| 27988 | Balanced Remainders | brute force constructive algorithms math | Statement | B | Codeforces Round 702 (Div. 3) {1490} | PROGRAMMING | Codeforces Round #702 (Div. 3) Editorial | ||
| 21095 | Accidental Victory | binary search data structures greedy | Statement | E | Codeforces Round 702 (Div. 3) {1490} | PROGRAMMING | Codeforces Round #702 (Div. 3) Editorial | ||
| 8365 | Zookeeper and The Infinite Zoo | bitmasks constructive algorithms math | Statement | D | Codeforces Global Round 13 {1491} | PROGRAMMING | 1250.0 | Codeforces Global Round 13 Editorial | |
| 1225 | Yuezheng Ling and Dynamic Tree | data structures | Statement | H | Codeforces Global Round 13 {1491} | PROGRAMMING | 3000.0 | Codeforces Global Round 13 Editorial | |
| 1021 | Switch and Flip | constructive algorithms math | Statement | G | Codeforces Global Round 13 {1491} | PROGRAMMING | 2250.0 | Codeforces Global Round 13 Editorial | |
| 109 | Ruler Of The Zoo | brute force | Statement | I | Codeforces Global Round 13 {1491} | PROGRAMMING | 5000.0 | Codeforces Global Round 13 Editorial | |
| 8417 | Pekora and Trampoline | brute force data structures dp graphs greedy implementation | Statement | C | Codeforces Global Round 13 {1491} | PROGRAMMING | 1000.0 | Codeforces Global Round 13 Editorial | |
| 14267 | Minimal Cost | brute force greedy implementation math | Statement | B | Codeforces Global Round 13 {1491} | PROGRAMMING | 750.0 | Codeforces Global Round 13 Editorial | |
| 1140 | Magnets | binary search constructive algorithms interactive | Statement | F | Codeforces Global Round 13 {1491} | PROGRAMMING | 2000.0 | Codeforces Global Round 13 Editorial | |
| 19088 | K-th Largest Value | brute force greedy implementation | Statement | A | Codeforces Global Round 13 {1491} | PROGRAMMING | 500.0 | Codeforces Global Round 13 Editorial | |
| 2357 | Fib-tree | brute force divide and conquer trees | Statement | E | Codeforces Global Round 13 {1491} | PROGRAMMING | 1750.0 | Codeforces Global Round 13 Editorial | |
| 23417 | Three swimmers | math | Statement | A | Codeforces Round 704 (Div. 2) {1492} | PROGRAMMING | 500.0 | Codeforces Round #704 Editorial | |
| 17585 | Maximum width | data structures dp greedy two pointers | Statement | C | Codeforces Round 704 (Div. 2) {1492} | PROGRAMMING | 1500.0 | Codeforces Round #704 Editorial | |
| 6526 | Genius's Gambit | bitmasks constructive algorithms math | Statement | D | Codeforces Round 704 (Div. 2) {1492} | PROGRAMMING | 2250.0 | Codeforces Round #704 Editorial | |
| 20964 | Card Deck | data structures greedy math | Statement | B | Codeforces Round 704 (Div. 2) {1492} | PROGRAMMING | 1000.0 | Codeforces Round #704 Editorial | |
| 1292 | Almost Fault-Tolerant Database | brute force constructive algorithms dfs and similar greedy implementation | Statement | E | Codeforces Round 704 (Div. 2) {1492} | PROGRAMMING | 3000.0 | Codeforces Round #704 Editorial | |
| 12590 | Planet Lapituletti | brute force implementation | Statement | B | Codeforces Round 705 (Div. 2) {1493} | PROGRAMMING | 1250.0 | Codeforces Round #705 (Div.2) Editorial | |
| 4965 | K-beautiful Strings | binary search brute force greedy implementation strings | Statement | C | Codeforces Round 705 (Div. 2) {1493} | PROGRAMMING | 1750.0 | Codeforces Round #705 (Div.2) Editorial | |
| 5792 | GCD of an Array | data structures math number theory sortings two pointers | Statement | D | Codeforces Round 705 (Div. 2) {1493} | PROGRAMMING | 2250.0 | Codeforces Round #705 (Div.2) Editorial | |
| 1092 | Enormous XOR | bitmasks greedy strings two pointers | Statement | E | Codeforces Round 705 (Div. 2) {1493} | PROGRAMMING | 2750.0 | Codeforces Round #705 (Div.2) Editorial | |
| 507 | Enchanted Matrix | bitmasks interactive number theory | Statement | F | Codeforces Round 705 (Div. 2) {1493} | PROGRAMMING | 3250.0 | Codeforces Round #705 (Div.2) Editorial | |
| 19788 | Anti-knapsack | constructive algorithms greedy | Statement | A | Codeforces Round 705 (Div. 2) {1493} | PROGRAMMING | 750.0 | Codeforces Round #705 (Div.2) Editorial | |
| 2826 | Dogeforces | brute force constructive algorithms divide and conquer dsu greedy implementation trees | Statement | D | Educational Codeforces Round 105 (Rated for Div. 2) {1494} | PROGRAMMING | Educational Codeforces Round 105 Editorial | ||
| 498 | Delete The Edges | graphs | Statement | F | Educational Codeforces Round 105 (Rated for Div. 2) {1494} | PROGRAMMING | Educational Codeforces Round 105 Editorial | ||
| 15369 | Berland Crossword | binary search bitmasks brute force greedy implementation | Statement | B | Educational Codeforces Round 105 (Rated for Div. 2) {1494} | PROGRAMMING | Educational Codeforces Round 105 Editorial | ||
| 2069 | A-Z Graph | constructive algorithms data structures graphs | Statement | E | Educational Codeforces Round 105 (Rated for Div. 2) {1494} | PROGRAMMING | Educational Codeforces Round 105 Editorial | ||
| 22888 | ABC String | bitmasks brute force implementation | Statement | A | Educational Codeforces Round 105 (Rated for Div. 2) {1494} | PROGRAMMING | Educational Codeforces Round 105 Editorial | ||
| 5746 | 1D Sokoban | binary search implementation two pointers | Statement | C | Educational Codeforces Round 105 (Rated for Div. 2) {1494} | PROGRAMMING | Educational Codeforces Round 105 Editorial | ||
| 423 | Squares | constructive algorithms data structures graphs trees | Statement | F | Codeforces Round 706 (Div. 1) {1495} | PROGRAMMING | 3250.0 | Codeforces Round #706 Editorial | |
| 541 | Qingshan and Daniel | brute force data structures greedy implementation | Statement | E | Codeforces Round 706 (Div. 1) {1495} | PROGRAMMING | 2500.0 | Codeforces Round #706 Editorial | |
| 6347 | Let's Go Hiking | constructive algorithms games greedy implementation | Statement | B | Codeforces Round 706 (Div. 1) {1495} | PROGRAMMING | 1000.0 | Codeforces Round #706 Editorial | |
| 2910 | Garden of the Sun | constructive algorithms graphs | Statement | C | Codeforces Round 706 (Div. 1) {1495} | PROGRAMMING | 1500.0 | Codeforces Round #706 Editorial | |
| 17937 | Diamond Miner | geometry greedy math sortings | Statement | A | Codeforces Round 706 (Div. 1) {1495} | PROGRAMMING | 500.0 | Codeforces Round #706 Editorial | |
| 1548 | BFS Trees | combinatorics dfs and similar graphs math shortest paths trees | Statement | D | Codeforces Round 706 (Div. 1) {1495} | PROGRAMMING | 2000.0 | Codeforces Round #706 Editorial | |
| 22320 | Split it! | brute force constructive algorithms greedy strings | Statement | A | Codeforces Round 706 (Div. 2) {1496} | PROGRAMMING | 500.0 | Codeforces Round #706 Editorial | |
| 18325 | Max and Mex | implementation math | Statement | B | Codeforces Round 706 (Div. 2) {1496} | PROGRAMMING | 1000.0 | Codeforces Round #706 Editorial | |
| 28013 | M-arrays | constructive algorithms greedy math | Statement | B | Codeforces Round 708 (Div. 2) {1497} | PROGRAMMING | 750.0 | Codeforces Round #708 Editorial | 1200 |
| 29389 | k-LCM (easy version) | constructive algorithms math | Statement | C1 | Codeforces Round 708 (Div. 2) {1497} | PROGRAMMING | 750.0 | Codeforces Round #708 Editorial | 1200 |
| 19603 | k-LCM (hard version) | constructive algorithms math | Statement | C2 | Codeforces Round 708 (Div. 2) {1497} | PROGRAMMING | 500.0 | Codeforces Round #708 Editorial | 1600 |
| 9149 | Square-free division (easy version) | data structures dp greedy math number theory | Statement | E1 | Codeforces Round 708 (Div. 2) {1497} | PROGRAMMING | 1500.0 | Codeforces Round #708 Editorial | 1700 |
| 1923 | Square-free division (hard version) | data structures dp greedy hashing math number theory | Statement | E2 | Codeforces Round 708 (Div. 2) {1497} | PROGRAMMING | 1500.0 | Codeforces Round #708 Editorial | 2500 |
| 1747 | Genius | bitmasks dp graphs | Statement | D | Codeforces Round 708 (Div. 2) {1497} | PROGRAMMING | 1750.0 | Codeforces Round #708 Editorial | 2500 |
| 26221 | Meximization | brute force data structures greedy sortings | Statement | A | Codeforces Round 708 (Div. 2) {1497} | PROGRAMMING | 500.0 | Codeforces Round #708 Editorial | 800 |
| 2146 | Two Houses | brute force combinatorics graphs interactive probabilities sortings | Statement | E | CodeCraft-21 and Codeforces Round 711 (Div. 2) {1498} | PROGRAMMING | 2500.0 | CodeCraft-21 and Codeforces Round #711 (Div. 2) Editorial | |
| 12322 | Planar Reflections | brute force combinatorics data structures dp | Statement | C | CodeCraft-21 and Codeforces Round 711 (Div. 2) {1498} | PROGRAMMING | 1750.0 | CodeCraft-21 and Codeforces Round #711 (Div. 2) Editorial | |
| 24825 | GCD Sum | brute force math | Statement | A | CodeCraft-21 and Codeforces Round 711 (Div. 2) {1498} | PROGRAMMING | 500.0 | CodeCraft-21 and Codeforces Round #711 (Div. 2) Editorial | |
| 1062 | Christmas Game | data structures dfs and similar dp games math trees | Statement | F | CodeCraft-21 and Codeforces Round 711 (Div. 2) {1498} | PROGRAMMING | 3000.0 | CodeCraft-21 and Codeforces Round #711 (Div. 2) Editorial | |
| 23927 | Box Fitting | binary search bitmasks data structures greedy | Statement | B | CodeCraft-21 and Codeforces Round 711 (Div. 2) {1498} | PROGRAMMING | 1000.0 | CodeCraft-21 and Codeforces Round #711 (Div. 2) Editorial | |
| 2508 | Bananas in a Microwave | dfs and similar dp greedy shortest paths | Statement | D | CodeCraft-21 and Codeforces Round 711 (Div. 2) {1498} | PROGRAMMING | 2500.0 | CodeCraft-21 and Codeforces Round #711 (Div. 2) Editorial | |
| 7149 | The Number of Pairs | math number theory | Statement | D | Educational Codeforces Round 106 (Rated for Div. 2) {1499} | PROGRAMMING | Educational Codeforces Round 106 Editorial | ||
| 13468 | Minimum Grid Path | brute force data structures dp greedy | Statement | C | Educational Codeforces Round 106 (Rated for Div. 2) {1499} | PROGRAMMING | Educational Codeforces Round 106 Editorial | ||
| 243 | Graph Coloring | data structures graphs interactive | Statement | G | Educational Codeforces Round 106 (Rated for Div. 2) {1499} | PROGRAMMING | Educational Codeforces Round 106 Editorial | ||
| 21988 | Domino on Windowsill | constructive algorithms math | Statement | A | Educational Codeforces Round 106 (Rated for Div. 2) {1499} | PROGRAMMING | Educational Codeforces Round 106 Editorial | ||
| 1611 | Diameter Cuts | dfs and similar dp trees | Statement | F | Educational Codeforces Round 106 (Rated for Div. 2) {1499} | PROGRAMMING | Educational Codeforces Round 106 Editorial | ||
| 1670 | Chaotic Merge | combinatorics dp | Statement | E | Educational Codeforces Round 106 (Rated for Div. 2) {1499} | PROGRAMMING | Educational Codeforces Round 106 Editorial | ||
| 22058 | Binary Removals | brute force dp greedy implementation | Statement | B | Educational Codeforces Round 106 (Rated for Div. 2) {1499} | PROGRAMMING | Educational Codeforces Round 106 Editorial | ||
| 9563 | Going Home | brute force implementation math | Statement | A | Codeforces Round 707 (Div. 1, based on Moscow Open Olympiad in Informatics) {1500} | PROGRAMMING | 750.0 | Codeforces Round #707 Editorial | 1800 |
| 2324 | Two chandeliers | binary search brute force chinese remainder theorem math number theory | Statement | B | Codeforces Round 707 (Div. 1, based on Moscow Open Olympiad in Informatics) {1500} | PROGRAMMING | 750.0 | Codeforces Round #707 Editorial | 2200 |
| 918 | Matrix Sorting | bitmasks constructive algorithms dfs and similar greedy hashing string suffix structures two pointers | Statement | C | Codeforces Round 707 (Div. 1, based on Moscow Open Olympiad in Informatics) {1500} | PROGRAMMING | 1500.0 | Codeforces Round #707 Editorial | 2600 |
| 599 | Tiles for Bathroom | two pointers | Statement | D | Codeforces Round 707 (Div. 1, based on Moscow Open Olympiad in Informatics) {1500} | PROGRAMMING | 2000.0 | Codeforces Round #707 Editorial | 2900 |
| 384 | Subset Trick | binary search data structures | Statement | E | Codeforces Round 707 (Div. 1, based on Moscow Open Olympiad in Informatics) {1500} | PROGRAMMING | 2500.0 | Codeforces Round #707 Editorial | 3300 |
| 435 | Cupboards Jumps | dp | Statement | F | Codeforces Round 707 (Div. 1, based on Moscow Open Olympiad in Informatics) {1500} | PROGRAMMING | 3000.0 | Codeforces Round #707 Editorial | 3500 |
| 12332 | Alexey and Train | implementation | Statement | A | Codeforces Round 707 (Div. 2, based on Moscow Open Olympiad in Informatics) {1501} | PROGRAMMING | 500.0 | Codeforces Round #707 Editorial | 800 |
| 21204 | Napoleon Cake | dp implementation sortings | Statement | B | Codeforces Round 707 (Div. 2, based on Moscow Open Olympiad in Informatics) {1501} | PROGRAMMING | 1000.0 | Codeforces Round #707 Editorial | 900 |
| 14793 | Balance the Bits | constructive algorithms greedy | Statement | A | Codeforces Round 712 (Div. 1) {1503} | PROGRAMMING | 750.0 | T | 1600 |
| 7708 | 3-Coloring | constructive algorithms games interactive | Statement | B | Codeforces Round 712 (Div. 1) {1503} | PROGRAMMING | 1000.0 | T | 1700 |
| 3865 | Travelling Salesman Problem | binary search data structures dp greedy shortest paths sortings | Statement | C | Codeforces Round 712 (Div. 1) {1503} | PROGRAMMING | 1250.0 | T | 2200 |
| 1267 | Flip the Cards | 2-sat constructive algorithms data structures dsu greedy sortings | Statement | D | Codeforces Round 712 (Div. 1) {1503} | PROGRAMMING | 1750.0 | T | 2600 |
| 899 | 2-Coloring | combinatorics dp math | Statement | E | Codeforces Round 712 (Div. 1) {1503} | PROGRAMMING | 2500.0 | T | 3100 |
| 235 | Balance the Cards | constructive algorithms data structures divide and conquer geometry graphs implementation | Statement | F | Codeforces Round 712 (Div. 1) {1503} | PROGRAMMING | 4000.0 | T | 3500 |
| 26345 | Flip the Bits | constructive algorithms greedy implementation math | Statement | B | Codeforces Round 712 (Div. 2) {1504} | PROGRAMMING | 1000.0 | Codeforces Round #712 Editorial | 1200 |
| 22854 | Déjà Vu | constructive algorithms strings | Statement | A | Codeforces Round 712 (Div. 2) {1504} | PROGRAMMING | 500.0 | Codeforces Round #712 Editorial | 800 |
| 889 | Xenolith? Hippodrome? | Statement | D | April Fools Day Contest 2021 {1505} | PROGRAMMING | tutorial | |||
| 610 | Mysterious language again, seriously? | Statement | I | April Fools Day Contest 2021 {1505} | PROGRAMMING | tutorial | |||
| 1592 | Math | constructive algorithms | Statement | F | April Fools Day Contest 2021 {1505} | PROGRAMMING | tutorial | ||
| 564 | L BREAK into program | Statement | H | April Fools Day Contest 2021 {1505} | PROGRAMMING | tutorial | |||
| 16144 | Is it rated - 2 | implementation interactive | Statement | A | April Fools Day Contest 2021 {1505} | PROGRAMMING | tutorial | ||
| 6718 | Fibonacci Words | constructive algorithms implementation | Statement | C | April Fools Day Contest 2021 {1505} | PROGRAMMING | tutorial | ||
| 352 | Encoded message | Statement | G | April Fools Day Contest 2021 {1505} | PROGRAMMING | tutorial | |||
| 6541 | DMCA | constructive algorithms implementation | Statement | B | April Fools Day Contest 2021 {1505} | PROGRAMMING | tutorial | ||
| 1925 | Cakewalk | constructive algorithms greedy implementation shortest paths | Statement | E | April Fools Day Contest 2021 {1505} | PROGRAMMING | tutorial | ||
| 3716 | Triangular Paths | constructive algorithms greedy math shortest paths sortings | Statement | F | Codeforces Round 710 (Div. 3) {1506} | PROGRAMMING | Editorial | ||
| 32605 | Strange Table | math | Statement | A | Codeforces Round 710 (Div. 3) {1506} | PROGRAMMING | Editorial | ||
| 14240 | Restoring the Permutation | constructive algorithms data structures dsu greedy | Statement | E | Codeforces Round 710 (Div. 3) {1506} | PROGRAMMING | Editorial | ||
| 21196 | Partial Replacement | greedy implementation | Statement | B | Codeforces Round 710 (Div. 3) {1506} | PROGRAMMING | Editorial | ||
| 4851 | Maximize the Remaining String | brute force data structures dp greedy strings two pointers | Statement | G | Codeforces Round 710 (Div. 3) {1506} | PROGRAMMING | Editorial | ||
| 25751 | Epic Transformation | constructive algorithms greedy | Statement | D | Codeforces Round 710 (Div. 3) {1506} | PROGRAMMING | Editorial | ||
| 36488 | Double-ended Strings | brute force dp hashing strings | Statement | C | Codeforces Round 710 (Div. 3) {1506} | PROGRAMMING | Editorial | ||
| 397 | Tree Calendar | brute force constructive algorithms dfs and similar sortings | Statement | E | Codeforces Round 715 (Div. 1) {1508} | PROGRAMMING | 2250.0 | Codeforces Round #715 Editorial | |
| 733 | Swap Pass | constructive algorithms geometry sortings | Statement | D | Codeforces Round 715 (Div. 1) {1508} | PROGRAMMING | 2250.0 | Codeforces Round #715 Editorial | |
| 160 | Optimal Encoding | brute force data structures | Statement | F | Codeforces Round 715 (Div. 1) {1508} | PROGRAMMING | 4000.0 | Codeforces Round #715 Editorial | |
| 1738 | Complete the MST | data structures dfs and similar dsu graphs greedy math | Statement | C | Codeforces Round 715 (Div. 1) {1508} | PROGRAMMING | 1500.0 | Codeforces Round #715 Editorial | |
| 6705 | Binary Literature | constructive algorithms greedy implementation math strings two pointers | Statement | A | Codeforces Round 715 (Div. 1) {1508} | PROGRAMMING | 750.0 | Codeforces Round #715 Editorial | |
| 4470 | Almost Sorted | binary search bitmasks combinatorics constructive algorithms dp implementation math | Statement | B | Codeforces Round 715 (Div. 1) {1508} | PROGRAMMING | 1000.0 | Codeforces Round #715 Editorial | |
| 23141 | TMT Document | greedy | Statement | B | Codeforces Round 715 (Div. 2) {1509} | PROGRAMMING | 1000.0 | Codeforces Round #715 Editorial | |
| 15521 | The Sports Festival | dp greedy | Statement | C | Codeforces Round 715 (Div. 2) {1509} | PROGRAMMING | 1500.0 | Codeforces Round #715 Editorial | |
| 27326 | Average Height | constructive algorithms | Statement | A | Codeforces Round 715 (Div. 2) {1509} | PROGRAMMING | 500.0 | Codeforces Round #715 Editorial | |
| 6000 | King's Task | brute force graphs implementation | Statement | K | 2020-2021 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1510} | PROGRAMMING | nerc-2020-offline-tutorial.pdf | ||
| 563 | Japanese Game | constructive algorithms math | Statement | J | 2020-2021 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1510} | PROGRAMMING | nerc-2020-offline-tutorial.pdf | ||
| 595 | Is It Rated? | greedy interactive math probabilities | Statement | I | 2020-2021 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1510} | PROGRAMMING | nerc-2020-offline-tutorial.pdf | ||
| 139 | Hard Optimization | dp | Statement | H | 2020-2021 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1510} | PROGRAMMING | nerc-2020-offline-tutorial.pdf | ||
| 1384 | Guide | Statement | G | 2020-2021 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1510} | PROGRAMMING | ||||
| 64 | Fiber Shape | Statement | F | 2020-2021 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1510} | PROGRAMMING | nerc-2020-offline-tutorial.pdf | |||
| 271 | Equilibrium Point /\textbackslash/\textbackslash | Statement | E | 2020-2021 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1510} | PROGRAMMING | ||||
| 2122 | Digits | brute force dp math number theory | Statement | D | 2020-2021 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1510} | PROGRAMMING | nerc-2020-offline-tutorial.pdf | ||
| 240 | Cactus Not Enough | dfs and similar graphs | Statement | C | 2020-2021 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1510} | PROGRAMMING | nerc-2020-offline-tutorial.pdf | ||
| 979 | Button Lock | flows graph matchings | Statement | B | 2020-2021 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1510} | PROGRAMMING | nerc-2020-offline-tutorial.pdf | ||
| 168 | ASCII Automata Art | Statement | A | 2020-2021 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1510} | PROGRAMMING | ||||
| 33538 | Yet Another Card Deck | brute force data structures implementation trees | Statement | C | Educational Codeforces Round 107 (Rated for Div. 2) {1511} | PROGRAMMING | 89634 | ||
| 28915 | Review Site | greedy | Statement | A | Educational Codeforces Round 107 (Rated for Div. 2) {1511} | PROGRAMMING | 89634 | ||
| 12499 | Min Cost String | brute force constructive algorithms dfs and similar graphs greedy | Statement | D | Educational Codeforces Round 107 (Rated for Div. 2) {1511} | PROGRAMMING | 89634 | ||
| 24772 | GCD Length | constructive algorithms math number theory | Statement | B | Educational Codeforces Round 107 (Rated for Div. 2) {1511} | PROGRAMMING | 89634 | ||
| 2907 | Colorings and Dominoes | combinatorics dp math | Statement | E | Educational Codeforces Round 107 (Rated for Div. 2) {1511} | PROGRAMMING | 89634 | ||
| 940 | Chips on a Board | bitmasks brute force data structures games sortings | Statement | G | Educational Codeforces Round 107 (Rated for Div. 2) {1511} | PROGRAMMING | 89634 | ||
| 548 | Chainword | data structures dp math matrices strings | Statement | F | Educational Codeforces Round 107 (Rated for Div. 2) {1511} | PROGRAMMING | 89634 | ||
| 81150 | Spy Detected! | brute force implementation | Statement | A | Codeforces Round 713 (Div. 3) {1512} | PROGRAMMING | Codeforces Round #713 (Div. 3) Editorial | ||
| 9566 | Short Task | brute force dp math number theory | Statement | G | Codeforces Round 713 (Div. 3) {1512} | PROGRAMMING | Codeforces Round #713 (Div. 3) Editorial | ||
| 11422 | Permutation by Sum | greedy math | Statement | E | Codeforces Round 713 (Div. 3) {1512} | PROGRAMMING | Codeforces Round #713 (Div. 3) Editorial | ||
| 6835 | Education | binary search greedy implementation math | Statement | F | Codeforces Round 713 (Div. 3) {1512} | PROGRAMMING | Codeforces Round #713 (Div. 3) Editorial | ||
| 24663 | Corrupted Array | constructive algorithms data structures greedy | Statement | D | Codeforces Round 713 (Div. 3) {1512} | PROGRAMMING | Codeforces Round #713 (Div. 3) Editorial | ||
| 26631 | Almost Rectangle | implementation | Statement | B | Codeforces Round 713 (Div. 3) {1512} | PROGRAMMING | Codeforces Round #713 (Div. 3) Editorial | ||
| 21843 | A-B Palindrome | constructive algorithms implementation strings | Statement | C | Codeforces Round 713 (Div. 3) {1512} | PROGRAMMING | Codeforces Round #713 (Div. 3) Editorial | ||
| 1435 | Swapping Problem | brute force constructive algorithms data structures sortings | Statement | F | Divide by Zero 2021 and Codeforces Round 714 (Div. 2) {1513} | PROGRAMMING | 3500.0 | Divide by Zero 2021 and Codeforces Round #714 (Div. 2) Editorial | |
| 6548 | GCD and MST | constructive algorithms data structures dsu graphs implementation number theory sortings | Statement | D | Divide by Zero 2021 and Codeforces Round 714 (Div. 2) {1513} | PROGRAMMING | 2000.0 | Divide by Zero 2021 and Codeforces Round #714 (Div. 2) Editorial | |
| 1736 | Cost Equilibrium | combinatorics constructive algorithms math sortings | Statement | E | Divide by Zero 2021 and Codeforces Round 714 (Div. 2) {1513} | PROGRAMMING | 2750.0 | Divide by Zero 2021 and Codeforces Round #714 (Div. 2) Editorial | |
| 20047 | Array and Peaks | constructive algorithms implementation | Statement | A | Divide by Zero 2021 and Codeforces Round 714 (Div. 2) {1513} | PROGRAMMING | 500.0 | Divide by Zero 2021 and Codeforces Round #714 (Div. 2) Editorial | |
| 20524 | AND Sequences | bitmasks combinatorics constructive algorithms | Statement | B | Divide by Zero 2021 and Codeforces Round 714 (Div. 2) {1513} | PROGRAMMING | 1250.0 | Divide by Zero 2021 and Codeforces Round #714 (Div. 2) Editorial | |
| 16674 | Add One | dp matrices | Statement | C | Divide by Zero 2021 and Codeforces Round 714 (Div. 2) {1513} | PROGRAMMING | 1500.0 | Divide by Zero 2021 and Codeforces Round #714 (Div. 2) Editorial | |
| 18504 | Product 1 Modulo N | constructive algorithms math number theory | Statement | C | Codeforces Round 716 (Div. 2) {1514} | PROGRAMMING | 1500.0 | Codeforces round #716 editorial | |
| 25410 | Perfectly Imperfect Array | math number theory | Statement | A | Codeforces Round 716 (Div. 2) {1514} | PROGRAMMING | 500.0 | Codeforces round #716 editorial | |
| 4838 | Cut and Stick | binary search data structures greedy probabilities sortings | Statement | D | Codeforces Round 716 (Div. 2) {1514} | PROGRAMMING | 2000.0 | Codeforces round #716 editorial | |
| 707 | Baby Ehab's Hyper Apartment | binary search graphs interactive sortings | Statement | E | Codeforces Round 716 (Div. 2) {1514} | PROGRAMMING | 2500.0 | Codeforces round #716 editorial | |
| 35721 | AND 0, Sum Big | bitmasks combinatorics math | Statement | B | Codeforces Round 716 (Div. 2) {1514} | PROGRAMMING | 1000.0 | Codeforces round #716 editorial | |
| 18847 | Phoenix and Towers | constructive algorithms data structures greedy | Statement | C | Codeforces Global Round 14 {1515} | PROGRAMMING | 1500.0 | Editorial | |
| 12854 | Phoenix and Socks | greedy sortings two pointers | Statement | D | Codeforces Global Round 14 {1515} | PROGRAMMING | 2000.0 | Editorial | |
| 27158 | Phoenix and Puzzle | geometry math | Statement | B | Codeforces Global Round 14 {1515} | PROGRAMMING | 1000.0 | Editorial | |
| 1374 | Phoenix and Odometers | dfs and similar graphs math number theory | Statement | G | Codeforces Global Round 14 {1515} | PROGRAMMING | 3500.0 | Editorial | |
| 21278 | Phoenix and Gold | constructive algorithms math | Statement | A | Codeforces Global Round 14 {1515} | PROGRAMMING | 500.0 | Editorial | |
| 2093 | Phoenix and Earthquake | constructive algorithms dfs and similar dsu graphs greedy trees | Statement | F | Codeforces Global Round 14 {1515} | PROGRAMMING | 3250.0 | Editorial | |
| 431 | Phoenix and Diamonds | binary search data structures sortings | Statement | I | Codeforces Global Round 14 {1515} | PROGRAMMING | 5000.0 | Editorial | |
| 4522 | Phoenix and Computers | combinatorics dp math | Statement | E | Codeforces Global Round 14 {1515} | PROGRAMMING | 2750.0 | Editorial | |
| 352 | Phoenix and Bits | bitmasks data structures | Statement | H | Codeforces Global Round 14 {1515} | PROGRAMMING | 4250.0 | Editorial | |
| 24750 | Tit for Tat | greedy | Statement | A | Codeforces Round 717 (Div. 2) {1516} | PROGRAMMING | 500.0 | Codeforces round #717 editorial | |
| 5237 | Cut | binary search data structures graphs number theory | Statement | D | Codeforces Round 717 (Div. 2) {1516} | PROGRAMMING | 2000.0 | Codeforces round #717 editorial | |
| 1017 | Baby Ehab Plays with Permutations | combinatorics dp math | Statement | E | Codeforces Round 717 (Div. 2) {1516} | PROGRAMMING | 2750.0 | Codeforces round #717 editorial | |
| 14270 | Baby Ehab Partitions Again | bitmasks constructive algorithms dp math | Statement | C | Codeforces Round 717 (Div. 2) {1516} | PROGRAMMING | 1500.0 | Codeforces round #717 editorial | |
| 26048 | AGAGA XOOORRR | bitmasks brute force dp greedy | Statement | B | Codeforces Round 717 (Div. 2) {1516} | PROGRAMMING | 1000.0 | Codeforces round #717 editorial | |
| 26932 | Sum of 2050 | greedy math | Statement | A | Contest 2050 and Codeforces Round 718 (Div. 1 + Div. 2) {1517} | PROGRAMMING | 500.0 | Contest 2050 and Codeforces Round #718 (Div.1 + Div.2) Editorial | |
| 719 | Starry Night Camping | flows graphs | Statement | G | Contest 2050 and Codeforces Round 718 (Div. 1 + Div. 2) {1517} | PROGRAMMING | 3000.0 | Contest 2050 and Codeforces Round #718 (Div.1 + Div.2) Editorial | |
| 609 | Reunion | dp trees | Statement | F | Contest 2050 and Codeforces Round 718 (Div. 1 + Div. 2) {1517} | PROGRAMMING | 3000.0 | Contest 2050 and Codeforces Round #718 (Div.1 + Div.2) Editorial | |
| 13857 | Morning Jogging | constructive algorithms greedy sortings | Statement | B | Contest 2050 and Codeforces Round 718 (Div. 1 + Div. 2) {1517} | PROGRAMMING | 1250.0 | Contest 2050 and Codeforces Round #718 (Div.1 + Div.2) Editorial | |
| 1034 | Group Photo | binary search combinatorics implementation two pointers | Statement | E | Contest 2050 and Codeforces Round 718 (Div. 1 + Div. 2) {1517} | PROGRAMMING | 2500.0 | Contest 2050 and Codeforces Round #718 (Div.1 + Div.2) Editorial | |
| 91 | Fly Around the World | dp dp dp dp geometry geometry | Statement | H | Contest 2050 and Codeforces Round 718 (Div. 1 + Div. 2) {1517} | PROGRAMMING | 4000.0 | Contest 2050 and Codeforces Round #718 (Div.1 + Div.2) Editorial | |
| 14208 | Fillomino 2 | constructive algorithms greedy implementation | Statement | C | Contest 2050 and Codeforces Round 718 (Div. 1 + Div. 2) {1517} | PROGRAMMING | 1500.0 | Contest 2050 and Codeforces Round #718 (Div.1 + Div.2) Editorial | |
| 9320 | Explorer Space | dp graphs shortest paths | Statement | D | Contest 2050 and Codeforces Round 718 (Div. 1 + Div. 2) {1517} | PROGRAMMING | 1750.0 | Contest 2050 and Codeforces Round #718 (Div.1 + Div.2) Editorial | |
| 33499 | The Cake Is a Lie | dp math | Statement | B | Educational Codeforces Round 108 (Rated for Div. 2) {1519} | PROGRAMMING | Educational Codeforces Round 108 Editorial | ||
| 30650 | Red and Blue Beans | math | Statement | A | Educational Codeforces Round 108 (Rated for Div. 2) {1519} | PROGRAMMING | Educational Codeforces Round 108 Editorial | ||
| 907 | Off by One | constructive algorithms dfs and similar geometry graphs sortings trees | Statement | E | Educational Codeforces Round 108 (Rated for Div. 2) {1519} | PROGRAMMING | Educational Codeforces Round 108 Editorial | ||
| 17724 | Maximum Sum of Products | brute force dp implementation math ternary search two pointers | Statement | D | Educational Codeforces Round 108 (Rated for Div. 2) {1519} | PROGRAMMING | Educational Codeforces Round 108 Editorial | ||
| 685 | Chests and Keys | dp flows | Statement | F | Educational Codeforces Round 108 (Rated for Div. 2) {1519} | PROGRAMMING | Educational Codeforces Round 108 Editorial | ||
| 22928 | Berland Regional | brute force greedy sortings two pointers | Statement | C | Educational Codeforces Round 108 (Rated for Div. 2) {1519} | PROGRAMMING | Educational Codeforces Round 108 Editorial | ||
| 4268 | To Go Or Not To Go? | dfs and similar graphs greedy shortest paths | Statement | G | Codeforces Round 719 (Div. 3) {1520} | PROGRAMMING | Editorial | ||
| 66177 | Same Differences | data structures hashing math | Statement | D | Codeforces Round 719 (Div. 3) {1520} | PROGRAMMING | Editorial | ||
| 49988 | Ordinary Numbers | brute force math number theory | Statement | B | Codeforces Round 719 (Div. 3) {1520} | PROGRAMMING | Editorial | ||
| 34684 | Not Adjacent Matrix | constructive algorithms | Statement | C | Codeforces Round 719 (Div. 3) {1520} | PROGRAMMING | Editorial | ||
| 3375 | Guess the K-th Zero (Hard version) | binary search data structures interactive | Statement | F2 | Codeforces Round 719 (Div. 3) {1520} | PROGRAMMING | Editorial | ||
| 14582 | Guess the K-th Zero (Easy version) | binary search interactive | Statement | F1 | Codeforces Round 719 (Div. 3) {1520} | PROGRAMMING | Editorial | ||
| 58873 | Do Not Be Distracted! | brute force implementation | Statement | A | Codeforces Round 719 (Div. 3) {1520} | PROGRAMMING | Editorial | ||
| 29201 | Arranging The Sheep | dp greedy math | Statement | E | Codeforces Round 719 (Div. 3) {1520} | PROGRAMMING | Editorial | ||
| 2325 | Nastia Plays with a Tree | constructive algorithms data structures dfs and similar dp flows graphs greedy implementation trees | Statement | D | Codeforces Round 720 (Div. 2) {1521} | PROGRAMMING | 2250.0 | 90477 | |
| 42280 | Nastia and Nearly Good Numbers | constructive algorithms math | Statement | A | Codeforces Round 720 (Div. 2) {1521} | PROGRAMMING | 500.0 | 90477 | |
| 4631 | Nastia and a Hidden Permutation | constructive algorithms interactive | Statement | C | Codeforces Round 720 (Div. 2) {1521} | PROGRAMMING | 1750.0 | 90477 | |
| 23004 | Nastia and a Good Array | constructive algorithms math | Statement | B | Codeforces Round 720 (Div. 2) {1521} | PROGRAMMING | 1000.0 | 90477 | |
| 735 | Nastia and a Beautiful Matrix | binary search constructive algorithms greedy math | Statement | E | Codeforces Round 720 (Div. 2) {1521} | PROGRAMMING | 2750.0 | 90477 | |
| 12530 | Lord of the Values | constructive algorithms | Statement | B | Deltix Round, Spring 2021 (open for everyone, rated, Div. 1 + Div. 2) {1523} | PROGRAMMING | 1000.0 | Deltix Round, Spring 2021. Editorial | 1100 |
| 9197 | Compression and Expansion | brute force data structures greedy implementation trees | Statement | C | Deltix Round, Spring 2021 (open for everyone, rated, Div. 1 + Div. 2) {1523} | PROGRAMMING | 1500.0 | Deltix Round, Spring 2021. Editorial | 1600 |
| 2491 | Love-Hate | bitmasks brute force dp probabilities | Statement | D | Deltix Round, Spring 2021 (open for everyone, rated, Div. 1 + Div. 2) {1523} | PROGRAMMING | 2250.0 | Deltix Round, Spring 2021. Editorial | 2400 |
| 1949 | Crypto Lights | combinatorics dp probabilities | Statement | E | Deltix Round, Spring 2021 (open for everyone, rated, Div. 1 + Div. 2) {1523} | PROGRAMMING | 2250.0 | Deltix Round, Spring 2021. Editorial | 2600 |
| 526 | Try Booking | data structures divide and conquer | Statement | G | Deltix Round, Spring 2021 (open for everyone, rated, Div. 1 + Div. 2) {1523} | PROGRAMMING | 3250.0 | Deltix Round, Spring 2021. Editorial | 3200 |
| 485 | Favorite Game | dp | Statement | F | Deltix Round, Spring 2021 (open for everyone, rated, Div. 1 + Div. 2) {1523} | PROGRAMMING | 3000.0 | Deltix Round, Spring 2021. Editorial | 3300 |
| 445 | Hopping Around the Array | data structures dp | Statement | H | Deltix Round, Spring 2021 (open for everyone, rated, Div. 1 + Div. 2) {1523} | PROGRAMMING | 3250.0 | Deltix Round, Spring 2021. Editorial | 3500 |
| 14072 | Game of Life | implementation | Statement | A | Deltix Round, Spring 2021 (open for everyone, rated, Div. 1 + Div. 2) {1523} | PROGRAMMING | 500.0 | Deltix Round, Spring 2021. Editorial | 800 |
| 4837 | Robot Collisions | data structures greedy implementation sortings | Statement | C | Educational Codeforces Round 109 (Rated for Div. 2) {1525} | PROGRAMMING | 90793 | ||
| 27052 | Potion-making | math number theory | Statement | A | Educational Codeforces Round 109 (Rated for Div. 2) {1525} | PROGRAMMING | 90793 | ||
| 26713 | Permutation Sort | constructive algorithms greedy | Statement | B | Educational Codeforces Round 109 (Rated for Div. 2) {1525} | PROGRAMMING | 90793 | ||
| 402 | Goblins And Gnomes | brute force dp graph matchings | Statement | F | Educational Codeforces Round 109 (Rated for Div. 2) {1525} | PROGRAMMING | 90793 | ||
| 2469 | Assimilation IV | combinatorics dp math probabilities | Statement | E | Educational Codeforces Round 109 (Rated for Div. 2) {1525} | PROGRAMMING | 90793 | ||
| 10909 | Armchairs | brute force dp greedy | Statement | D | Educational Codeforces Round 109 (Rated for Div. 2) {1525} | PROGRAMMING | 90793 | ||
| 30898 | Potions (Hard Version) | data structures greedy | Statement | C2 | Codeforces Round 723 (Div. 2) {1526} | PROGRAMMING | 1000.0 | Codeforces Round #723 (Div. 2) Editorial | |
| 27480 | Potions (Easy Version) | brute force data structures dp greedy | Statement | C1 | Codeforces Round 723 (Div. 2) {1526} | PROGRAMMING | 750.0 | Codeforces Round #723 (Div. 2) Editorial | |
| 1508 | Oolimry and Suffix Array | combinatorics constructive algorithms math string suffix structures | Statement | E | Codeforces Round 723 (Div. 2) {1526} | PROGRAMMING | 2500.0 | Codeforces Round #723 (Div. 2) Editorial | |
| 394 | Median Queries | constructive algorithms interactive probabilities | Statement | F | Codeforces Round 723 (Div. 2) {1526} | PROGRAMMING | 3500.0 | Codeforces Round #723 (Div. 2) Editorial | |
| 25066 | Mean Inequality | constructive algorithms sortings | Statement | A | Codeforces Round 723 (Div. 2) {1526} | PROGRAMMING | 500.0 | Codeforces Round #723 (Div. 2) Editorial | |
| 2809 | Kill Anton | brute force constructive algorithms data structures math strings | Statement | D | Codeforces Round 723 (Div. 2) {1526} | PROGRAMMING | 2250.0 | Codeforces Round #723 (Div. 2) Editorial | |
| 37120 | I Hate 1111 | dp math number theory | Statement | B | Codeforces Round 723 (Div. 2) {1526} | PROGRAMMING | 1000.0 | Codeforces Round #723 (Div. 2) Editorial | |
| 35221 | Palindrome Game (easy version) | dp games | Statement | B1 | Codeforces Round 721 (Div. 2) {1527} | PROGRAMMING | 750.0 | Tutorial | 1200 |
| 15145 | Sequence Pair Weight | implementation math | Statement | C | Codeforces Round 721 (Div. 2) {1527} | PROGRAMMING | 1500.0 | Tutorial | 1600 |
| 8760 | Palindrome Game (hard version) | dp games | Statement | B2 | Codeforces Round 721 (Div. 2) {1527} | PROGRAMMING | 1500.0 | Tutorial | 1900 |
| 2293 | MEX Tree | combinatorics constructive algorithms data structures dfs and similar math trees | Statement | D | Codeforces Round 721 (Div. 2) {1527} | PROGRAMMING | 2250.0 | Tutorial | 2400 |
| 2940 | Partition Game | binary search data structures divide and conquer dp | Statement | E | Codeforces Round 721 (Div. 2) {1527} | PROGRAMMING | 3000.0 | Tutorial | 2500 |
| 42276 | And Then There Were K | bitmasks | Statement | A | Codeforces Round 721 (Div. 2) {1527} | PROGRAMMING | 500.0 | Tutorial | 800 |
| 2986 | Trees of Tranquillity | data structures dfs and similar greedy trees | Statement | C | Codeforces Round 722 (Div. 1) {1528} | PROGRAMMING | 1750.0 | Codeforces Round #722 Editorial | |
| 19366 | Parsa's Humongous Tree | brute force dfs and similar dp greedy trees | Statement | A | Codeforces Round 722 (Div. 1) {1528} | PROGRAMMING | 750.0 | Codeforces Round #722 Editorial | |
| 601 | Mashtali and Hagh Trees | combinatorics dp trees | Statement | E | Codeforces Round 722 (Div. 1) {1528} | PROGRAMMING | 2750.0 | Codeforces Round #722 Editorial | |
| 10780 | Kavi on Pairing Duty | 2-sat dp | Statement | B | Codeforces Round 722 (Div. 1) {1528} | PROGRAMMING | 1000.0 | Codeforces Round #722 Editorial | |
| 1708 | It's a bird! No, it's a plane! No, it's AaParsa! | graphs shortest paths | Statement | D | Codeforces Round 722 (Div. 1) {1528} | PROGRAMMING | 2000.0 | Codeforces Round #722 Editorial | |
| 342 | AmShZ Farm | combinatorics fft math | Statement | F | Codeforces Round 722 (Div. 1) {1528} | PROGRAMMING | 3000.0 | Codeforces Round #722 Editorial | |
| 21244 | Sifid and Strange Subsequences | greedy sortings | Statement | B | Codeforces Round 722 (Div. 2) {1529} | PROGRAMMING | 1250.0 | Codeforces Round #722 Editorial | |
| 31077 | Eshag Loves Big Arrays | constructive algorithms greedy | Statement | A | Codeforces Round 722 (Div. 2) {1529} | PROGRAMMING | 500.0 | Codeforces Round #722 Editorial | |
| 185 | What a Reversal | constructive algorithms | Statement | G | Codeforces Round 733 (Div. 1 + Div. 2, based on VK Cup 2021 - Elimination (Engine)) {1530} | PROGRAMMING | 3750.0 | Codeforces Round #733 Editorial (all problems) | |
| 204 | Turing's Award | data structures dp | Statement | H | Codeforces Round 733 (Div. 1 + Div. 2, based on VK Cup 2021 - Elimination (Engine)) {1530} | PROGRAMMING | 4750.0 | Codeforces Round #733 Editorial (all problems) | |
| 10143 | Secret Santa | constructive algorithms flows graphs math probabilities | Statement | D | Codeforces Round 733 (Div. 1 + Div. 2, based on VK Cup 2021 - Elimination (Engine)) {1530} | PROGRAMMING | 1500.0 | Codeforces Round #733 Editorial (all problems) | |
| 16299 | Putting Plates | constructive algorithms implementation | Statement | B | Codeforces Round 733 (Div. 1 + Div. 2, based on VK Cup 2021 - Elimination (Engine)) {1530} | PROGRAMMING | 750.0 | Codeforces Round #733 Editorial (all problems) | |
| 15616 | Pursuit | binary search greedy sortings | Statement | C | Codeforces Round 733 (Div. 1 + Div. 2, based on VK Cup 2021 - Elimination (Engine)) {1530} | PROGRAMMING | 1000.0 | Codeforces Round #733 Editorial (all problems) | |
| 3297 | Minimax | constructive algorithms greedy implementation strings | Statement | E | Codeforces Round 733 (Div. 1 + Div. 2, based on VK Cup 2021 - Elimination (Engine)) {1530} | PROGRAMMING | 2000.0 | Codeforces Round #733 Editorial (all problems) |