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 ... 18 19 20 21 22 ... 43 44 45 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 6326 | Prefixes and Suffixes | strings | Statement | C | Codeforces Round 527 (Div. 3) {1092} | PROGRAMMING | Codeforces Round #527 (Div. 3) Editorial | 1700 | |
| 10752 | Tree with Maximum Cost | dfs and similar dp trees | Statement | F | Codeforces Round 527 (Div. 3) {1092} | PROGRAMMING | Codeforces Round #527 (Div. 3) Editorial | 2100 | |
| 5648 | Great Vova Wall (Version 1) | greedy implementation math | Statement | D1 | Codeforces Round 527 (Div. 3) {1092} | PROGRAMMING | Codeforces Round #527 (Div. 3) Editorial | 2100 | |
| 3372 | Great Vova Wall (Version 2) | data structures implementation | Statement | D2 | Codeforces Round 527 (Div. 3) {1092} | PROGRAMMING | Codeforces Round #527 (Div. 3) Editorial | 2200 | |
| 1980 | Minimal Diameter Forest | constructive algorithms dfs and similar greedy trees | Statement | E | Codeforces Round 527 (Div. 3) {1092} | PROGRAMMING | Codeforces Round #527 (Div. 3) Editorial | 2500 | |
| 29108 | Teams Forming | sortings | Statement | B | Codeforces Round 527 (Div. 3) {1092} | PROGRAMMING | Codeforces Round #527 (Div. 3) Editorial | 700 | |
| 17260 | Uniform String | implementation | Statement | A | Codeforces Round 527 (Div. 3) {1092} | PROGRAMMING | Codeforces Round #527 (Div. 3) Editorial | 800 | |
| 9717 | Mishka and the Last Exam | greedy | Statement | C | Educational Codeforces Round 56 (Rated for Div. 2) {1093} | PROGRAMMING | 63877 | 1200 | |
| 11309 | Beautiful Graph | dfs and similar graphs | Statement | D | Educational Codeforces Round 56 (Rated for Div. 2) {1093} | PROGRAMMING | 63877 | 1600 | |
| 2215 | Multidimensional Queries | bitmasks data structures | Statement | G | Educational Codeforces Round 56 (Rated for Div. 2) {1093} | PROGRAMMING | 63877 | 2200 | |
| 1850 | Intersection of Permutations | data structures | Statement | E | Educational Codeforces Round 56 (Rated for Div. 2) {1093} | PROGRAMMING | 63877 | 2300 | |
| 1358 | Vasya and Array | dp | Statement | F | Educational Codeforces Round 56 (Rated for Div. 2) {1093} | PROGRAMMING | 63877 | 2500 | |
| 18352 | Dice Rolling | math | Statement | A | Educational Codeforces Round 56 (Rated for Div. 2) {1093} | PROGRAMMING | 63877 | 700 | |
| 17681 | Letters Rearranging | constructive algorithms greedy sortings strings | Statement | B | Educational Codeforces Round 56 (Rated for Div. 2) {1093} | PROGRAMMING | 63877 | 900 | |
| 24300 | Array Stabilization | implementation | Statement | B | Codeforces Round 529 (Div. 3) {1095} | PROGRAMMING | Codeforces Round #529 (Div. 3) Editorial | 1000 | |
| 19553 | Powers Of Two | bitmasks greedy | Statement | C | Codeforces Round 529 (Div. 3) {1095} | PROGRAMMING | Codeforces Round #529 (Div. 3) Editorial | 1400 | |
| 8086 | Circular Dance | implementation | Statement | D | Codeforces Round 529 (Div. 3) {1095} | PROGRAMMING | Codeforces Round #529 (Div. 3) Editorial | 1600 | |
| 4474 | Almost Regular Bracket Sequence | implementation | Statement | E | Codeforces Round 529 (Div. 3) {1095} | PROGRAMMING | Codeforces Round #529 (Div. 3) Editorial | 1900 | |
| 7490 | Make It Connected | dsu graphs greedy | Statement | F | Codeforces Round 529 (Div. 3) {1095} | PROGRAMMING | Codeforces Round #529 (Div. 3) Editorial | 2000 | |
| 36422 | Repeating Cipher | implementation | Statement | A | Codeforces Round 529 (Div. 3) {1095} | PROGRAMMING | Codeforces Round #529 (Div. 3) Editorial | 700 | |
| 11674 | Substring Removal | combinatorics math strings | Statement | B | Educational Codeforces Round 57 (Rated for Div. 2) {1096} | PROGRAMMING | Разбор Educational Codeforces Round 57 | 1400 | |
| 7180 | Polygon for the Angle | brute force geometry | Statement | C | Educational Codeforces Round 57 (Rated for Div. 2) {1096} | PROGRAMMING | Разбор Educational Codeforces Round 57 | 1600 | |
| 9378 | Easy Problem | dp | Statement | D | Educational Codeforces Round 57 (Rated for Div. 2) {1096} | PROGRAMMING | Разбор Educational Codeforces Round 57 | 1800 | |
| 2058 | Inversion Expectation | dp math probabilities | Statement | F | Educational Codeforces Round 57 (Rated for Div. 2) {1096} | PROGRAMMING | Разбор Educational Codeforces Round 57 | 2300 | |
| 1959 | Lucky Tickets | divide and conquer dp fft | Statement | G | Educational Codeforces Round 57 (Rated for Div. 2) {1096} | PROGRAMMING | Разбор Educational Codeforces Round 57 | 2400 | |
| 1278 | The Top Scorer | combinatorics dp math probabilities | Statement | E | Educational Codeforces Round 57 (Rated for Div. 2) {1096} | PROGRAMMING | Разбор Educational Codeforces Round 57 | 2600 | |
| 19607 | Find Divisible | greedy implementation math | Statement | A | Educational Codeforces Round 57 (Rated for Div. 2) {1096} | PROGRAMMING | Разбор Educational Codeforces Round 57 | 800 | |
| 35812 | Petr and a Combination Lock | bitmasks brute force dp | Statement | B | Hello 2019 {1097} | PROGRAMMING | 64310 | 1200 | |
| 8748 | Yuhao and a Parenthesis | greedy implementation | Statement | C | Hello 2019 {1097} | PROGRAMMING | 64310 | 1400 | |
| 3165 | Makoto and a Blackboard | dp math number theory probabilities | Statement | D | Hello 2019 {1097} | PROGRAMMING | 64310 | 2200 | |
| 1471 | Alex and a TV Show | bitmasks combinatorics number theory | Statement | F | Hello 2019 {1097} | PROGRAMMING | 64310 | 2400 | |
| 1052 | Vladislav and a Great Legend | combinatorics dp trees | Statement | G | Hello 2019 {1097} | PROGRAMMING | 64310 | 2900 | |
| 139 | Mateusz and an Infinite Sequence | bitmasks brute force dp strings | Statement | H | Hello 2019 {1097} | PROGRAMMING | 64310 | 3000 | |
| 534 | Egor and an RPG game | constructive algorithms greedy | Statement | E | Hello 2019 {1097} | PROGRAMMING | 64310 | 3100 | |
| 43711 | Gennady and a Card Game | brute force implementation | Statement | A | Hello 2019 {1097} | PROGRAMMING | 64310 | 600 | |
| 9541 | Sum in the tree | constructive algorithms dfs and similar greedy trees | Statement | A | Codeforces Round 530 (Div. 1) {1098} | PROGRAMMING | 64331 | 1600 | |
| 1797 | Nice table | brute force constructive algorithms greedy math | Statement | B | Codeforces Round 530 (Div. 1) {1098} | PROGRAMMING | 64331 | 2300 | |
| 1161 | Construct a tree | binary search constructive algorithms dfs and similar graphs greedy trees | Statement | C | Codeforces Round 530 (Div. 1) {1098} | PROGRAMMING | 64331 | 2300 | |
| 879 | Eels | data structures | Statement | D | Codeforces Round 530 (Div. 1) {1098} | PROGRAMMING | 64331 | 2700 | |
| 273 | Fedya the Potter | binary search implementation math number theory | Statement | E | Codeforces Round 530 (Div. 1) {1098} | PROGRAMMING | 64331 | 3400 | |
| 276 | Ж-function | string suffix structures strings | Statement | F | Codeforces Round 530 (Div. 1) {1098} | PROGRAMMING | 64331 | 3500 | |
| 11475 | Squares and Segments | binary search constructive algorithms math | Statement | B | Codeforces Round 530 (Div. 2) {1099} | PROGRAMMING | E | 1100 | |
| 10415 | Postcard | constructive algorithms implementation | Statement | C | Codeforces Round 530 (Div. 2) {1099} | PROGRAMMING | E | 1300 | |
| 1034 | Cookies | binary search data structures dfs and similar dp games trees | Statement | F | Codeforces Round 530 (Div. 2) {1099} | PROGRAMMING | E | 2300 | |
| 13347 | Snowball | implementation | Statement | A | Codeforces Round 530 (Div. 2) {1099} | PROGRAMMING | E | 900 | |
| 10668 | Roman and Browser | implementation | Statement | A | Codeforces Round 532 (Div. 2) {1100} | PROGRAMMING | Unofficial Tutorial | 1000 | |
| 10872 | NN and the Optical Illusion | binary search geometry math | Statement | C | Codeforces Round 532 (Div. 2) {1100} | PROGRAMMING | Unofficial Tutorial | 1300 | |
| 11749 | Build a Contest | data structures implementation | Statement | B | Codeforces Round 532 (Div. 2) {1100} | PROGRAMMING | Unofficial Tutorial | 1300 | |
| 2617 | Andrew and Taxi | binary search dfs and similar graphs | Statement | E | Codeforces Round 532 (Div. 2) {1100} | PROGRAMMING | Unofficial Tutorial | 2200 | |
| 916 | Dasha and Chess | constructive algorithms games interactive | Statement | D | Codeforces Round 532 (Div. 2) {1100} | PROGRAMMING | Unofficial Tutorial | 2400 | |
| 3662 | Ivan and Burgers | data structures divide and conquer greedy math | Statement | F | Codeforces Round 532 (Div. 2) {1100} | PROGRAMMING | Unofficial Tutorial | 2600 | |
| 18801 | Minimum Integer | math | Statement | A | Educational Codeforces Round 58 (Rated for Div. 2) {1101} | PROGRAMMING | 64483 | 1100 | |
| 11114 | Accordion | greedy implementation | Statement | B | Educational Codeforces Round 58 (Rated for Div. 2) {1101} | PROGRAMMING | 64483 | 1300 | |
| 8257 | Polycarp's New Job | implementation | Statement | E | Educational Codeforces Round 58 (Rated for Div. 2) {1101} | PROGRAMMING | 64483 | 1500 | |
| 11980 | Division and Union | sortings | Statement | C | Educational Codeforces Round 58 (Rated for Div. 2) {1101} | PROGRAMMING | 64483 | 1600 | |
| 5414 | GCD Counting | data structures dfs and similar dp number theory trees | Statement | D | Educational Codeforces Round 58 (Rated for Div. 2) {1101} | PROGRAMMING | 64483 | 2000 | |
| 2188 | (Zero XOR Subset)-less | math matrices | Statement | G | Educational Codeforces Round 58 (Rated for Div. 2) {1101} | PROGRAMMING | 64483 | 2400 | |
| 1630 | Trucks and Cities | binary search dp | Statement | F | Educational Codeforces Round 58 (Rated for Div. 2) {1101} | PROGRAMMING | 64483 | 2500 | |
| 26597 | Integer Sequence Dividing | math | Statement | A | Codeforces Round 531 (Div. 3) {1102} | PROGRAMMING | 64439 | 1000 | |
| 14150 | Doors Breaking and Repairing | games | Statement | C | Codeforces Round 531 (Div. 3) {1102} | PROGRAMMING | 64439 | 1200 | |
| 11144 | Array K-Coloring | greedy sortings | Statement | B | Codeforces Round 531 (Div. 3) {1102} | PROGRAMMING | 64439 | 1400 | |
| 8556 | Balanced Ternary String | greedy strings | Statement | D | Codeforces Round 531 (Div. 3) {1102} | PROGRAMMING | 64439 | 1600 | |
| 6889 | Monotonic Renumeration | combinatorics sortings | Statement | E | Codeforces Round 531 (Div. 3) {1102} | PROGRAMMING | 64439 | 1800 | |
| 2351 | Elongated Matrix | binary search bitmasks brute force dp graphs | Statement | F | Codeforces Round 531 (Div. 3) {1102} | PROGRAMMING | 64439 | 2400 | |
| 10592 | Grid game | constructive algorithms implementation | Statement | A | Codeforces Round 534 (Div. 1) {1103} | PROGRAMMING | Codeforces Round #534 — Editorial | 1400 | |
| 3523 | Game with modulo | binary search constructive algorithms interactive | Statement | B | Codeforces Round 534 (Div. 1) {1103} | PROGRAMMING | Codeforces Round #534 — Editorial | 2000 | |
| 953 | Johnny Solving | constructive algorithms dfs and similar graphs math | Statement | C | Codeforces Round 534 (Div. 1) {1103} | PROGRAMMING | Codeforces Round #534 — Editorial | 2800 | |
| 492 | Professional layer | bitmasks dp | Statement | D | Codeforces Round 534 (Div. 1) {1103} | PROGRAMMING | Codeforces Round #534 — Editorial | 3000 | |
| 281 | Radix sum | fft math number theory | Statement | E | Codeforces Round 534 (Div. 1) {1103} | PROGRAMMING | Codeforces Round #534 — Editorial | 3300 | |
| 16789 | Game with string | data structures implementation math | Statement | B | Codeforces Round 534 (Div. 2) {1104} | PROGRAMMING | Codeforces Round #534 — Editorial | 1300 | |
| 15895 | Splitting into digits | constructive algorithms implementation math | Statement | A | Codeforces Round 534 (Div. 2) {1104} | PROGRAMMING | Codeforces Round #534 — Editorial | 800 | |
| 11541 | Salem and Sticks | brute force implementation | Statement | A | Codeforces Round 533 (Div. 2) {1105} | PROGRAMMING | Tutorial | 1100 | |
| 10273 | Zuhair and Strings | brute force implementation strings | Statement | B | Codeforces Round 533 (Div. 2) {1105} | PROGRAMMING | Tutorial | 1200 | |
| 11344 | Ayoub and Lost Array | combinatorics dp math | Statement | C | Codeforces Round 533 (Div. 2) {1105} | PROGRAMMING | Tutorial | 1500 | |
| 4419 | Kilani and the Game | dfs and similar graphs implementation shortest paths | Statement | D | Codeforces Round 533 (Div. 2) {1105} | PROGRAMMING | Tutorial | 1900 | |
| 1909 | Helping Hiasat | bitmasks brute force dp meet-in-the-middle | Statement | E | Codeforces Round 533 (Div. 2) {1105} | PROGRAMMING | Tutorial | 2200 | |
| 15895 | Lunar New Year and Number Division | greedy implementation math sortings | Statement | C | Codeforces Round 536 (Div. 2) {1106} | PROGRAMMING | Tutorial | 1000 | |
| 6996 | Lunar New Year and Food Ordering | data structures implementation | Statement | B | Codeforces Round 536 (Div. 2) {1106} | PROGRAMMING | Tutorial | 1500 | |
| 19576 | Lunar New Year and a Wander | data structures dfs and similar graphs greedy shortest paths | Statement | D | Codeforces Round 536 (Div. 2) {1106} | PROGRAMMING | Tutorial | 1500 | |
| 2815 | Lunar New Year and Red Envelopes | data structures dp | Statement | E | Codeforces Round 536 (Div. 2) {1106} | PROGRAMMING | Tutorial | 2100 | |
| 1182 | Lunar New Year and a Recursive Sequence | math matrices number theory | Statement | F | Codeforces Round 536 (Div. 2) {1106} | PROGRAMMING | Tutorial | 2400 | |
| 12856 | Lunar New Year and Cross Counting | implementation | Statement | A | Codeforces Round 536 (Div. 2) {1106} | PROGRAMMING | Tutorial | 800 | |
| 12765 | Digits Sequence Dividing | greedy strings | Statement | A | Educational Codeforces Round 59 (Rated for Div. 2) {1107} | PROGRAMMING | Educational Codeforces Round 59 Editorial | 1000 | |
| 17704 | Digital root | math number theory | Statement | B | Educational Codeforces Round 59 (Rated for Div. 2) {1107} | PROGRAMMING | Educational Codeforces Round 59 Editorial | 1100 | |
| 11011 | Brutality | greedy sortings two pointers | Statement | C | Educational Codeforces Round 59 (Rated for Div. 2) {1107} | PROGRAMMING | Educational Codeforces Round 59 Editorial | 1300 | |
| 3900 | Compression | dp implementation math number theory | Statement | D | Educational Codeforces Round 59 (Rated for Div. 2) {1107} | PROGRAMMING | Educational Codeforces Round 59 Editorial | 1800 | |
| 1240 | Vasya and Maximum Profit | binary search constructive algorithms data structures dp dsu | Statement | G | Educational Codeforces Round 59 (Rated for Div. 2) {1107} | PROGRAMMING | Educational Codeforces Round 59 Editorial | 2400 | |
| 2775 | Vasya and Binary String | dp | Statement | E | Educational Codeforces Round 59 (Rated for Div. 2) {1107} | PROGRAMMING | Educational Codeforces Round 59 Editorial | 2400 | |
| 951 | Vasya and Endless Credits | dp flows graph matchings graphs sortings | Statement | F | Educational Codeforces Round 59 (Rated for Div. 2) {1107} | PROGRAMMING | Educational Codeforces Round 59 Editorial | 2700 | |
| 25167 | Divisors of Two Integers | brute force greedy math number theory | Statement | B | Codeforces Round 535 (Div. 3) {1108} | PROGRAMMING | 64751 | 1100 | |
| 12650 | Nice Garland | brute force greedy math | Statement | C | Codeforces Round 535 (Div. 3) {1108} | PROGRAMMING | 64751 | 1300 | |
| 16451 | Diverse Garland | constructive algorithms dp greedy | Statement | D | Codeforces Round 535 (Div. 3) {1108} | PROGRAMMING | 64751 | 1400 | |
| 4882 | Array and Segments (Easy version) | brute force greedy implementation | Statement | E1 | Codeforces Round 535 (Div. 3) {1108} | PROGRAMMING | 64751 | 1800 | |
| 3556 | MST Unification | binary search dsu graphs greedy | Statement | F | Codeforces Round 535 (Div. 3) {1108} | PROGRAMMING | 64751 | 2300 | |
| 2513 | Array and Segments (Hard version) | data structures implementation | Statement | E2 | Codeforces Round 535 (Div. 3) {1108} | PROGRAMMING | 64751 | 2300 | |
| 23328 | Two distinct points | implementation | Statement | A | Codeforces Round 535 (Div. 3) {1108} | PROGRAMMING | 64751 | 800 | |
| 9032 | Sasha and a Bit of Relax | dp implementation | Statement | A | Codeforces Round 539 (Div. 1) {1109} | PROGRAMMING | Codeforces Round #539 Editorial | 1600 | |
| 4536 | Sasha and One More Name | constructive algorithms hashing strings | Statement | B | Codeforces Round 539 (Div. 1) {1109} | PROGRAMMING | Codeforces Round #539 Editorial | 1800 | |
| 1499 | Sasha and Interesting Fact from Graph Theory | brute force combinatorics dp math trees | Statement | D | Codeforces Round 539 (Div. 1) {1109} | PROGRAMMING | Codeforces Round #539 Editorial | 2600 | |
| 599 | Sasha and a Very Easy Test | data structures number theory | Statement | E | Codeforces Round 539 (Div. 1) {1109} | PROGRAMMING | Codeforces Round #539 Editorial | 2700 | |
| 287 | Sasha and a Patient Friend | binary search data structures implementation | Statement | C | Codeforces Round 539 (Div. 1) {1109} | PROGRAMMING | Codeforces Round #539 Editorial | 2800 | |
| 365 | Sasha and Algorithm of Silence's Sounds | data structures trees | Statement | F | Codeforces Round 539 (Div. 1) {1109} | PROGRAMMING | Codeforces Round #539 Editorial | 3200 | |
| 15987 | Parity | math | Statement | A | Codeforces Global Round 1 {1110} | PROGRAMMING | The Editorial of the First Codeforces Global Round | 1000 | |
| 16495 | Tape | greedy sortings | Statement | B | Codeforces Global Round 1 {1110} | PROGRAMMING | The Editorial of the First Codeforces Global Round | 1400 | |
| 10006 | Meaningless Operations | constructive algorithms math number theory | Statement | C | Codeforces Global Round 1 {1110} | PROGRAMMING | The Editorial of the First Codeforces Global Round | 1500 | |
| 4702 | Magic Stones | constructive algorithms math sortings | Statement | E | Codeforces Global Round 1 {1110} | PROGRAMMING | The Editorial of the First Codeforces Global Round | 2200 | |
| 3988 | Jongmah | dp | Statement | D | Codeforces Global Round 1 {1110} | PROGRAMMING | The Editorial of the First Codeforces Global Round | 2200 | |
| 2041 | Nearest Leaf | data structures trees | Statement | F | Codeforces Global Round 1 {1110} | PROGRAMMING | The Editorial of the First Codeforces Global Round | 2600 | |
| 742 | Tree-Tac-Toe | constructive algorithms games trees | Statement | G | Codeforces Global Round 1 {1110} | PROGRAMMING | The Editorial of the First Codeforces Global Round | 3000 | |
| 433 | Modest Substrings | dp strings | Statement | H | Codeforces Global Round 1 {1110} | PROGRAMMING | The Editorial of the First Codeforces Global Round | 3500 | |
| 18078 | Superhero Transformation | implementation strings | Statement | A | CodeCraft-19 and Codeforces Round 537 (Div. 2) {1111} | PROGRAMMING | CodeCraft-19 and Codeforces Round #537 (Div. 2) Editorial | 1000 | |
| 6509 | Average Superhero Gang Power | brute force implementation math | Statement | B | CodeCraft-19 and Codeforces Round 537 (Div. 2) {1111} | PROGRAMMING | CodeCraft-19 and Codeforces Round #537 (Div. 2) Editorial | 1600 | |
| 6997 | Creative Snap | binary search brute force divide and conquer math | Statement | C | CodeCraft-19 and Codeforces Round 537 (Div. 2) {1111} | PROGRAMMING | CodeCraft-19 and Codeforces Round #537 (Div. 2) Editorial | 1700 | |
| 1146 | Destroy the Colony | combinatorics dp math | Statement | D | CodeCraft-19 and Codeforces Round 537 (Div. 2) {1111} | PROGRAMMING | CodeCraft-19 and Codeforces Round #537 (Div. 2) Editorial | 2500 | |
| 1091 | Tree | data structures dfs and similar dp graphs trees | Statement | E | CodeCraft-19 and Codeforces Round 537 (Div. 2) {1111} | PROGRAMMING | CodeCraft-19 and Codeforces Round #537 (Div. 2) Editorial | 2800 | |
| 8149 | Sasha and Magnetic Machines | greedy number theory | Statement | B | Codeforces Round 539 (Div. 2) {1113} | PROGRAMMING | Codeforces Round #539 Editorial | 1300 | |
| 18302 | Sasha and His Trip | dp greedy math | Statement | A | Codeforces Round 539 (Div. 2) {1113} | PROGRAMMING | Codeforces Round #539 Editorial | 900 | |
| 9391 | Yet Another Array Partitioning Task | constructive algorithms greedy sortings | Statement | B | Codeforces Round 538 (Div. 2) {1114} | PROGRAMMING | Codeforces Round #538 (Div. 2) Editorial | 1500 | |
| 7874 | Trailing Loves (or L'oeufs?) | brute force implementation math number theory | Statement | C | Codeforces Round 538 (Div. 2) {1114} | PROGRAMMING | Codeforces Round #538 (Div. 2) Editorial | 1700 | |
| 7908 | Flood Fill | dp | Statement | D | Codeforces Round 538 (Div. 2) {1114} | PROGRAMMING | Codeforces Round #538 (Div. 2) Editorial | 1900 | |
| 3186 | Arithmetic Progression | binary search interactive number theory probabilities | Statement | E | Codeforces Round 538 (Div. 2) {1114} | PROGRAMMING | Codeforces Round #538 (Div. 2) Editorial | 2100 | |
| 2426 | Please, another Queries on Array? | bitmasks data structures divide and conquer math number theory | Statement | F | Codeforces Round 538 (Div. 2) {1114} | PROGRAMMING | Codeforces Round #538 (Div. 2) Editorial | 2500 | |
| 19741 | Got Any Grapes? | brute force greedy implementation | Statement | A | Codeforces Round 538 (Div. 2) {1114} | PROGRAMMING | Codeforces Round #538 (Div. 2) Editorial | 800 | |
| 236 | Palindrome checker oracle | *special | Statement | G3 | Microsoft Q# Coding Contest - Winter 2019 - Warmup {1115} | PROGRAMMING | Warmup editorial | 2200 | |
| 316 | OR oracle | *special | Statement | G2 | Microsoft Q# Coding Contest - Winter 2019 - Warmup {1115} | PROGRAMMING | Warmup editorial | 2200 | |
| 239 | Chessboard unitary | *special | Statement | U2 | Microsoft Q# Coding Contest - Winter 2019 - Warmup {1115} | PROGRAMMING | Warmup editorial | 2200 | |
| 201 | Block unitary | *special | Statement | U3 | Microsoft Q# Coding Contest - Winter 2019 - Warmup {1115} | PROGRAMMING | Warmup editorial | 2200 | |
| 269 | Anti-diagonal unitary | *special | Statement | U1 | Microsoft Q# Coding Contest - Winter 2019 - Warmup {1115} | PROGRAMMING | Warmup editorial | 2200 | |
| 400 | AND oracle | *special | Statement | G1 | Microsoft Q# Coding Contest - Winter 2019 - Warmup {1115} | PROGRAMMING | Warmup editorial | 2200 | |
| 207 | X-wing fighter | Statement | D3 | Microsoft Q# Coding Contest - Winter 2019 {1116} | PROGRAMMING | Contest editorial | |||
| 171 | TIE fighter | Statement | D4 | Microsoft Q# Coding Contest - Winter 2019 {1116} | PROGRAMMING | Contest editorial | |||
| 236 | Pattern of increasing blocks | Statement | D2 | Microsoft Q# Coding Contest - Winter 2019 {1116} | PROGRAMMING | Contest editorial | |||
| 62 | Not A, not B or not C? | Statement | B2 | Microsoft Q# Coding Contest - Winter 2019 {1116} | PROGRAMMING | Contest editorial | |||
| 187 | "Is the number of ones divisible by 3?" oracle | Statement | C3 | Microsoft Q# Coding Contest - Winter 2019 {1116} | PROGRAMMING | Contest editorial | |||
| 189 | "Is the bit string periodic?" oracle | Statement | C2 | Microsoft Q# Coding Contest - Winter 2019 {1116} | PROGRAMMING | Contest editorial | |||
| 81 | Hessenberg matrix | Statement | D6 | Microsoft Q# Coding Contest - Winter 2019 {1116} | PROGRAMMING | Contest editorial | |||
| 328 | Generate state |00⟩ + |01⟩ + |10⟩ | Statement | A1 | Microsoft Q# Coding Contest - Winter 2019 {1116} | PROGRAMMING | Contest editorial | |||
| 184 | Generate equal superposition of four basis states | Statement | A2 | Microsoft Q# Coding Contest - Winter 2019 {1116} | PROGRAMMING | Contest editorial | |||
| 136 | Distinguish three-qubit states | Statement | B1 | Microsoft Q# Coding Contest - Winter 2019 {1116} | PROGRAMMING | Contest editorial | |||
| 152 | Creeper | Statement | D5 | Microsoft Q# Coding Contest - Winter 2019 {1116} | PROGRAMMING | Contest editorial | |||
| 278 | Block diagonal matrix | Statement | D1 | Microsoft Q# Coding Contest - Winter 2019 {1116} | PROGRAMMING | Contest editorial | |||
| 267 | Alternating bits oracle | Statement | C1 | Microsoft Q# Coding Contest - Winter 2019 {1116} | PROGRAMMING | Contest editorial | |||
| 15724 | Emotes | greedy math sortings | Statement | B | Educational Codeforces Round 60 (Rated for Div. 2) {1117} | PROGRAMMING | 65365 | 1000 | |
| 11447 | Best Subsegment | implementation math | Statement | A | Educational Codeforces Round 60 (Rated for Div. 2) {1117} | PROGRAMMING | 65365 | 1100 | |
| 9098 | Magic Ship | binary search | Statement | C | Educational Codeforces Round 60 (Rated for Div. 2) {1117} | PROGRAMMING | 65365 | 1800 | |
| 5191 | Magic Gems | dp math matrices | Statement | D | Educational Codeforces Round 60 (Rated for Div. 2) {1117} | PROGRAMMING | 65365 | 2000 | |
| 1635 | Decypher the String | bitmasks chinese remainder theorem constructive algorithms interactive math | Statement | E | Educational Codeforces Round 60 (Rated for Div. 2) {1117} | PROGRAMMING | 65365 | 2200 | |
| 912 | Recursive Queries | data structures | Statement | G | Educational Codeforces Round 60 (Rated for Div. 2) {1117} | PROGRAMMING | 65365 | 2500 | |
| 673 | Crisp String | bitmasks dp | Statement | F | Educational Codeforces Round 60 (Rated for Div. 2) {1117} | PROGRAMMING | 65365 | 2600 | |
| 13225 | Tanya and Candies | implementation | Statement | B | Codeforces Round 540 (Div. 3) {1118} | PROGRAMMING | 65396 | 1300 | |
| 6094 | Palindromic Matrix | constructive algorithms implementation | Statement | C | Codeforces Round 540 (Div. 3) {1118} | PROGRAMMING | 65396 | 1700 | |
| 6685 | Tree Cutting (Easy Version) | dfs and similar trees | Statement | F1 | Codeforces Round 540 (Div. 3) {1118} | PROGRAMMING | 65396 | 1800 | |
| 6067 | Coffee and Coursework (Easy version) | brute force greedy | Statement | D1 | Codeforces Round 540 (Div. 3) {1118} | PROGRAMMING | 65396 | 1800 | |
| 6780 | Coffee and Coursework (Hard Version) | binary search greedy | Statement | D2 | Codeforces Round 540 (Div. 3) {1118} | PROGRAMMING | 65396 | 1900 | |
| 4448 | Yet Another Ball Problem | constructive algorithms implementation | Statement | E | Codeforces Round 540 (Div. 3) {1118} | PROGRAMMING | 65396 | 2000 | |
| 632 | Tree Cutting (Hard Version) | combinatorics dfs and similar dp trees | Statement | F2 | Codeforces Round 540 (Div. 3) {1118} | PROGRAMMING | 65396 | 2700 | |
| 21540 | Water Buying | math | Statement | A | Codeforces Round 540 (Div. 3) {1118} | PROGRAMMING | 65396 | 800 | |
| 11495 | Ilya and a Colorful Walk | greedy implementation | Statement | A | Codeforces Global Round 2 {1119} | PROGRAMMING | Codeforces Global Round 2 Editorial | 1100 | |
| 16297 | Alyona and a Narrow Fridge | binary search flows greedy sortings | Statement | B | Codeforces Global Round 2 {1119} | PROGRAMMING | Codeforces Global Round 2 Editorial | 1300 | |
| 7177 | Ramesses and Corner Inversion | constructive algorithms greedy implementation math | Statement | C | Codeforces Global Round 2 {1119} | PROGRAMMING | Codeforces Global Round 2 Editorial | 1500 | |
| 5168 | Frets On Fire | binary search sortings | Statement | D | Codeforces Global Round 2 {1119} | PROGRAMMING | Codeforces Global Round 2 Editorial | 1700 | |
| 5552 | Pavel and Triangles | brute force dp fft greedy ternary search | Statement | E | Codeforces Global Round 2 {1119} | PROGRAMMING | Codeforces Global Round 2 Editorial | 1900 | |
| 875 | Niyaz and Small Degrees | data structures dp trees | Statement | F | Codeforces Global Round 2 {1119} | PROGRAMMING | Codeforces Global Round 2 Editorial | 2900 | |
| 569 | Get Ready for the Battle | constructive algorithms implementation | Statement | G | Codeforces Global Round 2 {1119} | PROGRAMMING | Codeforces Global Round 2 Editorial | 3000 | |
| 792 | Triple | fft math | Statement | H | Codeforces Global Round 2 {1119} | PROGRAMMING | Codeforces Global Round 2 Editorial | 3100 | |
| 1737 | Diana and Liana | greedy implementation two pointers | Statement | A | Codeforces Round 543 (Div. 1, based on Technocup 2019 Final Round) {1120} | PROGRAMMING | Разбор задач финала Технокубка 2019 и Codeforces Round #543 | 2200 | |
| 2443 | Compress String | dp strings | Statement | C | Codeforces Round 543 (Div. 1, based on Technocup 2019 Final Round) {1120} | PROGRAMMING | Разбор задач финала Технокубка 2019 и Codeforces Round #543 | 2200 | |
| 1770 | Power Tree | dfs and similar dp dsu graphs greedy trees | Statement | D | Codeforces Round 543 (Div. 1, based on Technocup 2019 Final Round) {1120} | PROGRAMMING | Разбор задач финала Технокубка 2019 и Codeforces Round #543 | 2400 | |
| 480 | Once in a casino | constructive algorithms greedy implementation math | Statement | B | Codeforces Round 543 (Div. 1, based on Technocup 2019 Final Round) {1120} | PROGRAMMING | Разбор задач финала Технокубка 2019 и Codeforces Round #543 | 2700 | |
| 328 | Secret Letters | data structures dp greedy | Statement | F | Codeforces Round 543 (Div. 1, based on Technocup 2019 Final Round) {1120} | PROGRAMMING | Разбор задач финала Технокубка 2019 и Codeforces Round #543 | 2900 | |
| 141 | The very same Munchhausen | brute force | Statement | E | Codeforces Round 543 (Div. 1, based on Technocup 2019 Final Round) {1120} | PROGRAMMING | Разбор задач финала Технокубка 2019 и Codeforces Round #543 | 3000 | |
| 7461 | Technogoblet of Fire | implementation sortings | Statement | A | Codeforces Round 543 (Div. 2, based on Technocup 2019 Final Round) {1121} | PROGRAMMING | Codeforces Round #543 and Technocup 2019 Final Round Editorial | 1100 | |
| 10003 | Mike and Children | brute force implementation | Statement | B | Codeforces Round 543 (Div. 2, based on Technocup 2019 Final Round) {1121} | PROGRAMMING | Codeforces Round #543 and Technocup 2019 Final Round Editorial | 1200 | |
| 2118 | System Testing | implementation | Statement | C | Codeforces Round 543 (Div. 2, based on Technocup 2019 Final Round) {1121} | PROGRAMMING | Codeforces Round #543 and Technocup 2019 Final Round Editorial | 1900 | |
| 3943 | Toy Train (Simplified) | brute force greedy | Statement | A1 | Codeforces Round 542 [Alex Lopashev Thanks-Round] (Div. 1) {1129} | PROGRAMMING | 65520 | 1700 | |
| 4241 | Toy Train | brute force greedy | Statement | A2 | Codeforces Round 542 [Alex Lopashev Thanks-Round] (Div. 1) {1129} | PROGRAMMING | 65520 | 1800 | |
| 2330 | Wrong Answer | constructive algorithms | Statement | B | Codeforces Round 542 [Alex Lopashev Thanks-Round] (Div. 1) {1129} | PROGRAMMING | 65520 | 2200 | |
| 1001 | Morse Code | binary search data structures dp hashing sortings string suffix structures strings | Statement | C | Codeforces Round 542 [Alex Lopashev Thanks-Round] (Div. 1) {1129} | PROGRAMMING | 65520 | 2300 | |
| 1306 | Isolation | data structures dp | Statement | D | Codeforces Round 542 [Alex Lopashev Thanks-Round] (Div. 1) {1129} | PROGRAMMING | 65520 | 2800 | |
| 566 | Legendary Tree | binary search interactive trees | Statement | E | Codeforces Round 542 [Alex Lopashev Thanks-Round] (Div. 1) {1129} | PROGRAMMING | 65520 | 3000 | |
| 8341 | Two Cakes | greedy | Statement | B | Codeforces Round 542 [Alex Lopashev Thanks-Round] (Div. 2) {1130} | PROGRAMMING | 65520 | 1200 | |
| 9400 | Connect | brute force dfs and similar dsu | Statement | C | Codeforces Round 542 [Alex Lopashev Thanks-Round] (Div. 2) {1130} | PROGRAMMING | 65520 | 1400 | |
| 12217 | Be Positive | implementation | Statement | A | Codeforces Round 542 [Alex Lopashev Thanks-Round] (Div. 2) {1130} | PROGRAMMING | 65520 | 900 | |
| 15653 | Birthday | binary search greedy sortings | Statement | C | Codeforces Round 541 (Div. 2) {1131} | PROGRAMMING | Codeforces Round #541 Editorial | 1200 | |
| 10385 | Draw! | greedy implementation | Statement | B | Codeforces Round 541 (Div. 2) {1131} | PROGRAMMING | Codeforces Round #541 Editorial | 1300 | |
| 7734 | Asya And Kittens | constructive algorithms dsu | Statement | F | Codeforces Round 541 (Div. 2) {1131} | PROGRAMMING | Codeforces Round #541 Editorial | 1700 | |
| 3630 | Gourmet choice | dfs and similar dp dsu graphs greedy | Statement | D | Codeforces Round 541 (Div. 2) {1131} | PROGRAMMING | Codeforces Round #541 Editorial | 2000 | |
| 1260 | String Multiplication | dp greedy strings | Statement | E | Codeforces Round 541 (Div. 2) {1131} | PROGRAMMING | Codeforces Round #541 Editorial | 2200 | |
| 540 | Most Dangerous Shark | data structures dp two pointers | Statement | G | Codeforces Round 541 (Div. 2) {1131} | PROGRAMMING | Codeforces Round #541 Editorial | 2900 | |
| 12803 | Sea Battle | math | Statement | A | Codeforces Round 541 (Div. 2) {1131} | PROGRAMMING | Codeforces Round #541 Editorial | 800 | |
| 10172 | Regular Bracket Sequence | greedy implementation | Statement | A | Educational Codeforces Round 61 (Rated for Div. 2) {1132} | PROGRAMMING | T | 1100 | |
| 5701 | Painting the Fence | brute force | Statement | C | Educational Codeforces Round 61 (Rated for Div. 2) {1132} | PROGRAMMING | T | 1700 | |
| 10645 | Clear the String | dp | Statement | F | Educational Codeforces Round 61 (Rated for Div. 2) {1132} | PROGRAMMING | T | 2000 | |
| 2261 | Stressful Training | binary search greedy | Statement | D | Educational Codeforces Round 61 (Rated for Div. 2) {1132} | PROGRAMMING | T | 2300 | |
| 1967 | Knapsack | dfs and similar dp greedy | Statement | E | Educational Codeforces Round 61 (Rated for Div. 2) {1132} | PROGRAMMING | T | 2400 | |
| 1226 | Greedy Subsequences | data structures dp trees | Statement | G | Educational Codeforces Round 61 (Rated for Div. 2) {1132} | PROGRAMMING | T | 2600 | |
| 13990 | Discounts | greedy sortings | Statement | B | Educational Codeforces Round 61 (Rated for Div. 2) {1132} | PROGRAMMING | T | 900 | |
| 19662 | Middle of the Contest | implementation | Statement | A | Codeforces Round 544 (Div. 3) {1133} | PROGRAMMING | Codeforces Round #544 (Div. 3) Editorial | 1000 | |
| 14341 | Preparation for International Women's Day | math number theory | Statement | B | Codeforces Round 544 (Div. 3) {1133} | PROGRAMMING | Codeforces Round #544 (Div. 3) Editorial | 1300 | |
| 27991 | Balanced Team | sortings two pointers | Statement | C | Codeforces Round 544 (Div. 3) {1133} | PROGRAMMING | Codeforces Round #544 (Div. 3) Editorial | 1300 | |
| 16384 | Zero Quantity Maximization | hashing math number theory | Statement | D | Codeforces Round 544 (Div. 3) {1133} | PROGRAMMING | Codeforces Round #544 (Div. 3) Editorial | 1500 | |
| 8769 | Spanning Tree with Maximum Degree | graphs | Statement | F1 | Codeforces Round 544 (Div. 3) {1133} | PROGRAMMING | Codeforces Round #544 (Div. 3) Editorial | 1600 | |
| 6422 | K Balanced Teams | dp sortings two pointers | Statement | E | Codeforces Round 544 (Div. 3) {1133} | PROGRAMMING | Codeforces Round #544 (Div. 3) Editorial | 2000 | |
| 3805 | Spanning Tree with One Fixed Degree | constructive algorithms dfs and similar dsu graphs greedy | Statement | F2 | Codeforces Round 544 (Div. 3) {1133} | PROGRAMMING | Codeforces Round #544 (Div. 3) Editorial | 2200 | |
| 12270 | Nastya Is Playing Computer Games | constructive algorithms math | Statement | B | Codeforces Round 546 (Div. 2) {1136} | PROGRAMMING | Editorial of Round #546(Div.2) | 1000 | |
| 8025 | Nastya Is Transposing Matrices | constructive algorithms sortings | Statement | C | Codeforces Round 546 (Div. 2) {1136} | PROGRAMMING | Editorial of Round #546(Div.2) | 1500 | |
| 4001 | Nastya Is Buying Lunch | greedy | Statement | D | Codeforces Round 546 (Div. 2) {1136} | PROGRAMMING | Editorial of Round #546(Div.2) | 1800 | |
| 1188 | Nastya Hasn't Written a Legend | binary search data structures | Statement | E | Codeforces Round 546 (Div. 2) {1136} | PROGRAMMING | Editorial of Round #546(Div.2) | 2500 | |
| 17237 | Nastya Is Reading a Book | implementation | Statement | A | Codeforces Round 546 (Div. 2) {1136} | PROGRAMMING | Editorial of Round #546(Div.2) | 700 | |
| 4674 | Skyscrapers | implementation sortings | Statement | A | Codeforces Round 545 (Div. 1) {1137} | PROGRAMMING | Codeforces Round #545 – Editorial | 1600 | |
| 6999 | Camp Schedule | greedy hashing strings | Statement | B | Codeforces Round 545 (Div. 1) {1137} | PROGRAMMING | Codeforces Round #545 – Editorial | 1700 | |
| 2146 | Cooperative Game | constructive algorithms interactive number theory | Statement | D | Codeforces Round 545 (Div. 1) {1137} | PROGRAMMING | Codeforces Round #545 – Editorial | 2500 | |
| 600 | Train Car Selection | data structures greedy | Statement | E | Codeforces Round 545 (Div. 1) {1137} | PROGRAMMING | Codeforces Round #545 – Editorial | 2800 | |
| 1315 | Museums Tour | dp graphs implementation | Statement | C | Codeforces Round 545 (Div. 1) {1137} | PROGRAMMING | Codeforces Round #545 – Editorial | 2800 | |
| 525 | Matches Are Not a Child's Play | data structures trees | Statement | F | Codeforces Round 545 (Div. 1) {1137} | PROGRAMMING | Codeforces Round #545 – Editorial | 3300 | |
| 4201 | Circus | brute force greedy math strings | Statement | B | Codeforces Round 545 (Div. 2) {1138} | PROGRAMMING | Codeforces Round #545 – Editorial | 1700 | |
| 21975 | Sushi for Two | binary search greedy implementation | Statement | A | Codeforces Round 545 (Div. 2) {1138} | PROGRAMMING | Codeforces Round #545 – Editorial | 900 | |
| 19348 | Chocolates | greedy implementation | Statement | B | Codeforces Round 548 (Div. 2) {1139} | PROGRAMMING | Codeforces Round #548 Editorial | 1100 | |
| 16596 | Edgy Trees | dfs and similar dsu graphs math trees | Statement | C | Codeforces Round 548 (Div. 2) {1139} | PROGRAMMING | Codeforces Round #548 Editorial | 1500 | |
| 2697 | Steps to One | dp math number theory probabilities | Statement | D | Codeforces Round 548 (Div. 2) {1139} | PROGRAMMING | Codeforces Round #548 Editorial | 2300 | |
| 2269 | Maximize Mex | flows graph matchings graphs | Statement | E | Codeforces Round 548 (Div. 2) {1139} | PROGRAMMING | Codeforces Round #548 Editorial | 2400 | |
| 511 | Dish Shopping | data structures divide and conquer | Statement | F | Codeforces Round 548 (Div. 2) {1139} | PROGRAMMING | Codeforces Round #548 Editorial | 2800 | |
| 17633 | Even Substrings | implementation strings | Statement | A | Codeforces Round 548 (Div. 2) {1139} | PROGRAMMING | Codeforces Round #548 Editorial | 700 | |
| 12797 | Detective Book | implementation | Statement | A | Educational Codeforces Round 62 (Rated for Div. 2) {1140} | PROGRAMMING | Educational Codeforces Round 62 Editorial | 1000 | |
| 13159 | Minimum Triangulation | dp greedy math | Statement | D | Educational Codeforces Round 62 (Rated for Div. 2) {1140} | PROGRAMMING | Educational Codeforces Round 62 Editorial | 1200 | |
| 11716 | Good String | implementation strings | Statement | B | Educational Codeforces Round 62 (Rated for Div. 2) {1140} | PROGRAMMING | Educational Codeforces Round 62 Editorial | 1200 | |
| 10392 | Playlist | brute force data structures sortings | Statement | C | Educational Codeforces Round 62 (Rated for Div. 2) {1140} | PROGRAMMING | Educational Codeforces Round 62 Editorial | 1600 | |
| 2112 | Palindrome-less Arrays | combinatorics divide and conquer dp | Statement | E | Educational Codeforces Round 62 (Rated for Div. 2) {1140} | PROGRAMMING | Educational Codeforces Round 62 Editorial | 2200 | |
| 1547 | Extending Set of Points | data structures divide and conquer dsu | Statement | F | Educational Codeforces Round 62 (Rated for Div. 2) {1140} | PROGRAMMING | Educational Codeforces Round 62 Editorial | 2700 | |
| 611 | Double Tree | data structures divide and conquer shortest paths trees | Statement | G | Educational Codeforces Round 62 (Rated for Div. 2) {1140} | PROGRAMMING | Educational Codeforces Round 62 Editorial | 2900 | |
| 23054 | Maximal Continuous Rest | implementation | Statement | B | Codeforces Round 547 (Div. 3) {1141} | PROGRAMMING | 66062 | 1000 | |
| 39223 | Game 23 | implementation math | Statement | A | Codeforces Round 547 (Div. 3) {1141} | PROGRAMMING | 66062 | 1000 | |
| 12277 | Polycarp Restores Permutation | math | Statement | C | Codeforces Round 547 (Div. 3) {1141} | PROGRAMMING | 66062 | 1400 | |
| 8954 | Colored Boots | greedy implementation | Statement | D | Codeforces Round 547 (Div. 3) {1141} | PROGRAMMING | 66062 | 1500 | |
| 7100 | Superhero Battle | math | Statement | E | Codeforces Round 547 (Div. 3) {1141} | PROGRAMMING | 66062 | 1700 | |
| 4153 | Same Sum Blocks (Easy) | greedy | Statement | F1 | Codeforces Round 547 (Div. 3) {1141} | PROGRAMMING | 66062 | 2000 | |
| 4573 | Same Sum Blocks (Hard) | data structures greedy | Statement | F2 | Codeforces Round 547 (Div. 3) {1141} | PROGRAMMING | 66062 | 2200 | |
| 2543 | Privatization of Roads in Treeland | binary search constructive algorithms dfs and similar graphs greedy trees | Statement | G | Codeforces Round 547 (Div. 3) {1141} | PROGRAMMING | 66062 | 2500 | |
| 3579 | The Beatles | brute force math | Statement | A | Codeforces Round 549 (Div. 1) {1142} | PROGRAMMING | Codeforces Round #549 Editorial | 1800 | |
| 3726 | Lynyrd Skynyrd | data structures dfs and similar dp math trees | Statement | B | Codeforces Round 549 (Div. 1) {1142} | PROGRAMMING | Codeforces Round #549 Editorial | 2300 | |
| 615 | Foreigner | dp | Statement | D | Codeforces Round 549 (Div. 1) {1142} | PROGRAMMING | Codeforces Round #549 Editorial | 2700 | |
| 1547 | U2 | geometry | Statement | C | Codeforces Round 549 (Div. 1) {1142} | PROGRAMMING | Codeforces Round #549 Editorial | 2800 | |
| 633 | Pink Floyd | graphs interactive | Statement | E | Codeforces Round 549 (Div. 1) {1142} | PROGRAMMING | Codeforces Round #549 Editorial | 3100 | |
| 11536 | Nirvana | brute force math number theory | Statement | B | Codeforces Round 549 (Div. 2) {1143} | PROGRAMMING | Codeforces Round #549 Editorial | 1300 | |
| 17577 | Queen | dfs and similar trees | Statement | C | Codeforces Round 549 (Div. 2) {1143} | PROGRAMMING | Codeforces Round #549 Editorial | 1400 | |
| 13730 | The Doors | implementation | Statement | A | Codeforces Round 549 (Div. 2) {1143} | PROGRAMMING | Codeforces Round #549 Editorial | 700 | |
| 18316 | Parity Alternated Deletions | greedy implementation sortings | Statement | B | Codeforces Round 550 (Div. 3) {1144} | PROGRAMMING | 66307 | 1000 | |
| 16337 | Two Shuffled Sequences | constructive algorithms sortings | Statement | C | Codeforces Round 550 (Div. 3) {1144} | PROGRAMMING | 66307 | 1100 | |
| 10827 | Equalize Them All | constructive algorithms greedy | Statement | D | Codeforces Round 550 (Div. 3) {1144} | PROGRAMMING | 66307 | 1400 | |
| 14059 | Graph Without Long Directed Paths | dfs and similar graphs | Statement | F | Codeforces Round 550 (Div. 3) {1144} | PROGRAMMING | 66307 | 1700 |