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 ... 44 45 46 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 6399 | Prefixes and Suffixes | strings | Statement | C | Codeforces Round 527 (Div. 3) {1092} | PROGRAMMING | Codeforces Round #527 (Div. 3) Editorial | 1700 | |
| 11726 | 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 | |
| 5906 | Great Vova Wall (Version 1) | greedy implementation math | Statement | D1 | Codeforces Round 527 (Div. 3) {1092} | PROGRAMMING | Codeforces Round #527 (Div. 3) Editorial | 2100 | |
| 3450 | Great Vova Wall (Version 2) | data structures implementation | Statement | D2 | Codeforces Round 527 (Div. 3) {1092} | PROGRAMMING | Codeforces Round #527 (Div. 3) Editorial | 2200 | |
| 2245 | 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 | |
| 29540 | Teams Forming | sortings | Statement | B | Codeforces Round 527 (Div. 3) {1092} | PROGRAMMING | Codeforces Round #527 (Div. 3) Editorial | 700 | |
| 17379 | Uniform String | implementation | Statement | A | Codeforces Round 527 (Div. 3) {1092} | PROGRAMMING | Codeforces Round #527 (Div. 3) Editorial | 800 | |
| 9763 | Mishka and the Last Exam | greedy | Statement | C | Educational Codeforces Round 56 (Rated for Div. 2) {1093} | PROGRAMMING | 63877 | 1200 | |
| 11938 | Beautiful Graph | dfs and similar graphs | Statement | D | Educational Codeforces Round 56 (Rated for Div. 2) {1093} | PROGRAMMING | 63877 | 1600 | |
| 2310 | Multidimensional Queries | bitmasks data structures | Statement | G | Educational Codeforces Round 56 (Rated for Div. 2) {1093} | PROGRAMMING | 63877 | 2200 | |
| 1997 | Intersection of Permutations | data structures | Statement | E | Educational Codeforces Round 56 (Rated for Div. 2) {1093} | PROGRAMMING | 63877 | 2300 | |
| 1445 | Vasya and Array | dp | Statement | F | Educational Codeforces Round 56 (Rated for Div. 2) {1093} | PROGRAMMING | 63877 | 2500 | |
| 18422 | Dice Rolling | math | Statement | A | Educational Codeforces Round 56 (Rated for Div. 2) {1093} | PROGRAMMING | 63877 | 700 | |
| 17881 | Letters Rearranging | constructive algorithms greedy sortings strings | Statement | B | Educational Codeforces Round 56 (Rated for Div. 2) {1093} | PROGRAMMING | 63877 | 900 | |
| 24927 | Array Stabilization | implementation | Statement | B | Codeforces Round 529 (Div. 3) {1095} | PROGRAMMING | Codeforces Round #529 (Div. 3) Editorial | 1000 | |
| 20256 | Powers Of Two | bitmasks greedy | Statement | C | Codeforces Round 529 (Div. 3) {1095} | PROGRAMMING | Codeforces Round #529 (Div. 3) Editorial | 1400 | |
| 8159 | Circular Dance | implementation | Statement | D | Codeforces Round 529 (Div. 3) {1095} | PROGRAMMING | Codeforces Round #529 (Div. 3) Editorial | 1600 | |
| 4596 | Almost Regular Bracket Sequence | implementation | Statement | E | Codeforces Round 529 (Div. 3) {1095} | PROGRAMMING | Codeforces Round #529 (Div. 3) Editorial | 1900 | |
| 7939 | Make It Connected | dsu graphs greedy | Statement | F | Codeforces Round 529 (Div. 3) {1095} | PROGRAMMING | Codeforces Round #529 (Div. 3) Editorial | 2000 | |
| 37350 | Repeating Cipher | implementation | Statement | A | Codeforces Round 529 (Div. 3) {1095} | PROGRAMMING | Codeforces Round #529 (Div. 3) Editorial | 700 | |
| 11927 | Substring Removal | combinatorics math strings | Statement | B | Educational Codeforces Round 57 (Rated for Div. 2) {1096} | PROGRAMMING | Разбор Educational Codeforces Round 57 | 1400 | |
| 7281 | Polygon for the Angle | brute force geometry | Statement | C | Educational Codeforces Round 57 (Rated for Div. 2) {1096} | PROGRAMMING | Разбор Educational Codeforces Round 57 | 1600 | |
| 9643 | Easy Problem | dp | Statement | D | Educational Codeforces Round 57 (Rated for Div. 2) {1096} | PROGRAMMING | Разбор Educational Codeforces Round 57 | 1800 | |
| 2160 | Inversion Expectation | dp math probabilities | Statement | F | Educational Codeforces Round 57 (Rated for Div. 2) {1096} | PROGRAMMING | Разбор Educational Codeforces Round 57 | 2300 | |
| 2131 | Lucky Tickets | divide and conquer dp fft | Statement | G | Educational Codeforces Round 57 (Rated for Div. 2) {1096} | PROGRAMMING | Разбор Educational Codeforces Round 57 | 2400 | |
| 1374 | The Top Scorer | combinatorics dp math probabilities | Statement | E | Educational Codeforces Round 57 (Rated for Div. 2) {1096} | PROGRAMMING | Разбор Educational Codeforces Round 57 | 2600 | |
| 19788 | Find Divisible | greedy implementation math | Statement | A | Educational Codeforces Round 57 (Rated for Div. 2) {1096} | PROGRAMMING | Разбор Educational Codeforces Round 57 | 800 | |
| 37489 | Petr and a Combination Lock | bitmasks brute force dp | Statement | B | Hello 2019 {1097} | PROGRAMMING | 64310 | 1200 | |
| 8840 | Yuhao and a Parenthesis | greedy implementation | Statement | C | Hello 2019 {1097} | PROGRAMMING | 64310 | 1400 | |
| 3348 | Makoto and a Blackboard | dp math number theory probabilities | Statement | D | Hello 2019 {1097} | PROGRAMMING | 64310 | 2200 | |
| 1554 | Alex and a TV Show | bitmasks combinatorics number theory | Statement | F | Hello 2019 {1097} | PROGRAMMING | 64310 | 2400 | |
| 1198 | Vladislav and a Great Legend | combinatorics dp trees | Statement | G | Hello 2019 {1097} | PROGRAMMING | 64310 | 2900 | |
| 268 | Mateusz and an Infinite Sequence | bitmasks brute force dp strings | Statement | H | Hello 2019 {1097} | PROGRAMMING | 64310 | 3000 | |
| 758 | Egor and an RPG game | constructive algorithms greedy | Statement | E | Hello 2019 {1097} | PROGRAMMING | 64310 | 3100 | |
| 44826 | Gennady and a Card Game | brute force implementation | Statement | A | Hello 2019 {1097} | PROGRAMMING | 64310 | 600 | |
| 9725 | Sum in the tree | constructive algorithms dfs and similar greedy trees | Statement | A | Codeforces Round 530 (Div. 1) {1098} | PROGRAMMING | 64331 | 1600 | |
| 1824 | Nice table | brute force constructive algorithms greedy math | Statement | B | Codeforces Round 530 (Div. 1) {1098} | PROGRAMMING | 64331 | 2300 | |
| 1188 | Construct a tree | binary search constructive algorithms dfs and similar graphs greedy trees | Statement | C | Codeforces Round 530 (Div. 1) {1098} | PROGRAMMING | 64331 | 2300 | |
| 980 | Eels | data structures | Statement | D | Codeforces Round 530 (Div. 1) {1098} | PROGRAMMING | 64331 | 2700 | |
| 449 | Fedya the Potter | binary search implementation math number theory | Statement | E | Codeforces Round 530 (Div. 1) {1098} | PROGRAMMING | 64331 | 3400 | |
| 291 | Ж-function | string suffix structures strings | Statement | F | Codeforces Round 530 (Div. 1) {1098} | PROGRAMMING | 64331 | 3500 | |
| 11579 | Squares and Segments | binary search constructive algorithms math | Statement | B | Codeforces Round 530 (Div. 2) {1099} | PROGRAMMING | E | 1100 | |
| 10509 | Postcard | constructive algorithms implementation | Statement | C | Codeforces Round 530 (Div. 2) {1099} | PROGRAMMING | E | 1300 | |
| 1088 | Cookies | binary search data structures dfs and similar dp games trees | Statement | F | Codeforces Round 530 (Div. 2) {1099} | PROGRAMMING | E | 2300 | |
| 13397 | Snowball | implementation | Statement | A | Codeforces Round 530 (Div. 2) {1099} | PROGRAMMING | E | 900 | |
| 10809 | Roman and Browser | implementation | Statement | A | Codeforces Round 532 (Div. 2) {1100} | PROGRAMMING | Unofficial Tutorial | 1000 | |
| 10983 | NN and the Optical Illusion | binary search geometry math | Statement | C | Codeforces Round 532 (Div. 2) {1100} | PROGRAMMING | Unofficial Tutorial | 1300 | |
| 11880 | Build a Contest | data structures implementation | Statement | B | Codeforces Round 532 (Div. 2) {1100} | PROGRAMMING | Unofficial Tutorial | 1300 | |
| 2806 | Andrew and Taxi | binary search dfs and similar graphs | Statement | E | Codeforces Round 532 (Div. 2) {1100} | PROGRAMMING | Unofficial Tutorial | 2200 | |
| 971 | Dasha and Chess | constructive algorithms games interactive | Statement | D | Codeforces Round 532 (Div. 2) {1100} | PROGRAMMING | Unofficial Tutorial | 2400 | |
| 4003 | Ivan and Burgers | data structures divide and conquer greedy math | Statement | F | Codeforces Round 532 (Div. 2) {1100} | PROGRAMMING | Unofficial Tutorial | 2600 | |
| 18974 | Minimum Integer | math | Statement | A | Educational Codeforces Round 58 (Rated for Div. 2) {1101} | PROGRAMMING | 64483 | 1100 | |
| 11172 | Accordion | greedy implementation | Statement | B | Educational Codeforces Round 58 (Rated for Div. 2) {1101} | PROGRAMMING | 64483 | 1300 | |
| 8292 | Polycarp's New Job | implementation | Statement | E | Educational Codeforces Round 58 (Rated for Div. 2) {1101} | PROGRAMMING | 64483 | 1500 | |
| 13043 | Division and Union | sortings | Statement | C | Educational Codeforces Round 58 (Rated for Div. 2) {1101} | PROGRAMMING | 64483 | 1600 | |
| 5616 | 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 | |
| 2320 | (Zero XOR Subset)-less | math matrices | Statement | G | Educational Codeforces Round 58 (Rated for Div. 2) {1101} | PROGRAMMING | 64483 | 2400 | |
| 1728 | Trucks and Cities | binary search dp | Statement | F | Educational Codeforces Round 58 (Rated for Div. 2) {1101} | PROGRAMMING | 64483 | 2500 | |
| 26979 | Integer Sequence Dividing | math | Statement | A | Codeforces Round 531 (Div. 3) {1102} | PROGRAMMING | 64439 | 1000 | |
| 14333 | Doors Breaking and Repairing | games | Statement | C | Codeforces Round 531 (Div. 3) {1102} | PROGRAMMING | 64439 | 1200 | |
| 11230 | Array K-Coloring | greedy sortings | Statement | B | Codeforces Round 531 (Div. 3) {1102} | PROGRAMMING | 64439 | 1400 | |
| 8626 | Balanced Ternary String | greedy strings | Statement | D | Codeforces Round 531 (Div. 3) {1102} | PROGRAMMING | 64439 | 1600 | |
| 7140 | Monotonic Renumeration | combinatorics sortings | Statement | E | Codeforces Round 531 (Div. 3) {1102} | PROGRAMMING | 64439 | 1800 | |
| 2455 | Elongated Matrix | binary search bitmasks brute force dp graphs | Statement | F | Codeforces Round 531 (Div. 3) {1102} | PROGRAMMING | 64439 | 2400 | |
| 10707 | Grid game | constructive algorithms implementation | Statement | A | Codeforces Round 534 (Div. 1) {1103} | PROGRAMMING | Codeforces Round #534 — Editorial | 1400 | |
| 3573 | Game with modulo | binary search constructive algorithms interactive | Statement | B | Codeforces Round 534 (Div. 1) {1103} | PROGRAMMING | Codeforces Round #534 — Editorial | 2000 | |
| 1017 | Johnny Solving | constructive algorithms dfs and similar graphs math | Statement | C | Codeforces Round 534 (Div. 1) {1103} | PROGRAMMING | Codeforces Round #534 — Editorial | 2800 | |
| 565 | Professional layer | bitmasks dp | Statement | D | Codeforces Round 534 (Div. 1) {1103} | PROGRAMMING | Codeforces Round #534 — Editorial | 3000 | |
| 417 | Radix sum | fft math number theory | Statement | E | Codeforces Round 534 (Div. 1) {1103} | PROGRAMMING | Codeforces Round #534 — Editorial | 3300 | |
| 17296 | Game with string | data structures implementation math | Statement | B | Codeforces Round 534 (Div. 2) {1104} | PROGRAMMING | Codeforces Round #534 — Editorial | 1300 | |
| 15964 | Splitting into digits | constructive algorithms implementation math | Statement | A | Codeforces Round 534 (Div. 2) {1104} | PROGRAMMING | Codeforces Round #534 — Editorial | 800 | |
| 11628 | Salem and Sticks | brute force implementation | Statement | A | Codeforces Round 533 (Div. 2) {1105} | PROGRAMMING | Tutorial | 1100 | |
| 10614 | Zuhair and Strings | brute force implementation strings | Statement | B | Codeforces Round 533 (Div. 2) {1105} | PROGRAMMING | Tutorial | 1200 | |
| 11797 | Ayoub and Lost Array | combinatorics dp math | Statement | C | Codeforces Round 533 (Div. 2) {1105} | PROGRAMMING | Tutorial | 1500 | |
| 4477 | Kilani and the Game | dfs and similar graphs implementation shortest paths | Statement | D | Codeforces Round 533 (Div. 2) {1105} | PROGRAMMING | Tutorial | 1900 | |
| 2089 | Helping Hiasat | bitmasks brute force dp meet-in-the-middle | Statement | E | Codeforces Round 533 (Div. 2) {1105} | PROGRAMMING | Tutorial | 2200 | |
| 16378 | Lunar New Year and Number Division | greedy implementation math sortings | Statement | C | Codeforces Round 536 (Div. 2) {1106} | PROGRAMMING | Tutorial | 1000 | |
| 7031 | Lunar New Year and Food Ordering | data structures implementation | Statement | B | Codeforces Round 536 (Div. 2) {1106} | PROGRAMMING | Tutorial | 1500 | |
| 21098 | 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 | |
| 2903 | Lunar New Year and Red Envelopes | data structures dp | Statement | E | Codeforces Round 536 (Div. 2) {1106} | PROGRAMMING | Tutorial | 2100 | |
| 1255 | Lunar New Year and a Recursive Sequence | math matrices number theory | Statement | F | Codeforces Round 536 (Div. 2) {1106} | PROGRAMMING | Tutorial | 2400 | |
| 12959 | Lunar New Year and Cross Counting | implementation | Statement | A | Codeforces Round 536 (Div. 2) {1106} | PROGRAMMING | Tutorial | 800 | |
| 12868 | Digits Sequence Dividing | greedy strings | Statement | A | Educational Codeforces Round 59 (Rated for Div. 2) {1107} | PROGRAMMING | Educational Codeforces Round 59 Editorial | 1000 | |
| 18015 | Digital root | math number theory | Statement | B | Educational Codeforces Round 59 (Rated for Div. 2) {1107} | PROGRAMMING | Educational Codeforces Round 59 Editorial | 1100 | |
| 11099 | Brutality | greedy sortings two pointers | Statement | C | Educational Codeforces Round 59 (Rated for Div. 2) {1107} | PROGRAMMING | Educational Codeforces Round 59 Editorial | 1300 | |
| 3937 | Compression | dp implementation math number theory | Statement | D | Educational Codeforces Round 59 (Rated for Div. 2) {1107} | PROGRAMMING | Educational Codeforces Round 59 Editorial | 1800 | |
| 1308 | 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 | |
| 2965 | Vasya and Binary String | dp | Statement | E | Educational Codeforces Round 59 (Rated for Div. 2) {1107} | PROGRAMMING | Educational Codeforces Round 59 Editorial | 2400 | |
| 1016 | 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 | |
| 25530 | Divisors of Two Integers | brute force greedy math number theory | Statement | B | Codeforces Round 535 (Div. 3) {1108} | PROGRAMMING | 64751 | 1100 | |
| 12815 | Nice Garland | brute force greedy math | Statement | C | Codeforces Round 535 (Div. 3) {1108} | PROGRAMMING | 64751 | 1300 | |
| 16629 | Diverse Garland | constructive algorithms dp greedy | Statement | D | Codeforces Round 535 (Div. 3) {1108} | PROGRAMMING | 64751 | 1400 | |
| 5014 | Array and Segments (Easy version) | brute force greedy implementation | Statement | E1 | Codeforces Round 535 (Div. 3) {1108} | PROGRAMMING | 64751 | 1800 | |
| 3773 | MST Unification | binary search dsu graphs greedy | Statement | F | Codeforces Round 535 (Div. 3) {1108} | PROGRAMMING | 64751 | 2300 | |
| 2795 | Array and Segments (Hard version) | data structures implementation | Statement | E2 | Codeforces Round 535 (Div. 3) {1108} | PROGRAMMING | 64751 | 2300 | |
| 23533 | Two distinct points | implementation | Statement | A | Codeforces Round 535 (Div. 3) {1108} | PROGRAMMING | 64751 | 800 | |
| 9138 | Sasha and a Bit of Relax | dp implementation | Statement | A | Codeforces Round 539 (Div. 1) {1109} | PROGRAMMING | Codeforces Round #539 Editorial | 1600 | |
| 4572 | Sasha and One More Name | constructive algorithms hashing strings | Statement | B | Codeforces Round 539 (Div. 1) {1109} | PROGRAMMING | Codeforces Round #539 Editorial | 1800 | |
| 1555 | 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 | |
| 663 | Sasha and a Very Easy Test | data structures number theory | Statement | E | Codeforces Round 539 (Div. 1) {1109} | PROGRAMMING | Codeforces Round #539 Editorial | 2700 | |
| 346 | Sasha and a Patient Friend | binary search data structures implementation | Statement | C | Codeforces Round 539 (Div. 1) {1109} | PROGRAMMING | Codeforces Round #539 Editorial | 2800 | |
| 452 | Sasha and Algorithm of Silence's Sounds | data structures trees | Statement | F | Codeforces Round 539 (Div. 1) {1109} | PROGRAMMING | Codeforces Round #539 Editorial | 3200 | |
| 16235 | Parity | math | Statement | A | Codeforces Global Round 1 {1110} | PROGRAMMING | The Editorial of the First Codeforces Global Round | 1000 | |
| 17861 | Tape | greedy sortings | Statement | B | Codeforces Global Round 1 {1110} | PROGRAMMING | The Editorial of the First Codeforces Global Round | 1400 | |
| 10124 | Meaningless Operations | constructive algorithms math number theory | Statement | C | Codeforces Global Round 1 {1110} | PROGRAMMING | The Editorial of the First Codeforces Global Round | 1500 | |
| 5123 | Magic Stones | constructive algorithms math sortings | Statement | E | Codeforces Global Round 1 {1110} | PROGRAMMING | The Editorial of the First Codeforces Global Round | 2200 | |
| 4175 | Jongmah | dp | Statement | D | Codeforces Global Round 1 {1110} | PROGRAMMING | The Editorial of the First Codeforces Global Round | 2200 | |
| 2202 | Nearest Leaf | data structures trees | Statement | F | Codeforces Global Round 1 {1110} | PROGRAMMING | The Editorial of the First Codeforces Global Round | 2600 | |
| 779 | Tree-Tac-Toe | constructive algorithms games trees | Statement | G | Codeforces Global Round 1 {1110} | PROGRAMMING | The Editorial of the First Codeforces Global Round | 3000 | |
| 474 | Modest Substrings | dp strings | Statement | H | Codeforces Global Round 1 {1110} | PROGRAMMING | The Editorial of the First Codeforces Global Round | 3500 | |
| 18271 | 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 | |
| 6583 | 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 | |
| 7203 | 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 | |
| 1191 | 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 | |
| 1188 | 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 | |
| 8371 | Sasha and Magnetic Machines | greedy number theory | Statement | B | Codeforces Round 539 (Div. 2) {1113} | PROGRAMMING | Codeforces Round #539 Editorial | 1300 | |
| 18461 | Sasha and His Trip | dp greedy math | Statement | A | Codeforces Round 539 (Div. 2) {1113} | PROGRAMMING | Codeforces Round #539 Editorial | 900 | |
| 9459 | 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 | |
| 8063 | 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 | |
| 8408 | Flood Fill | dp | Statement | D | Codeforces Round 538 (Div. 2) {1114} | PROGRAMMING | Codeforces Round #538 (Div. 2) Editorial | 1900 | |
| 3291 | Arithmetic Progression | binary search interactive number theory probabilities | Statement | E | Codeforces Round 538 (Div. 2) {1114} | PROGRAMMING | Codeforces Round #538 (Div. 2) Editorial | 2100 | |
| 2610 | 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 | |
| 19854 | Got Any Grapes? | brute force greedy implementation | Statement | A | Codeforces Round 538 (Div. 2) {1114} | PROGRAMMING | Codeforces Round #538 (Div. 2) Editorial | 800 | |
| 238 | Palindrome checker oracle | *special | Statement | G3 | Microsoft Q# Coding Contest - Winter 2019 - Warmup {1115} | PROGRAMMING | Warmup editorial | 2200 | |
| 318 | OR oracle | *special | Statement | G2 | Microsoft Q# Coding Contest - Winter 2019 - Warmup {1115} | PROGRAMMING | Warmup editorial | 2200 | |
| 241 | 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 | |
| 271 | Anti-diagonal unitary | *special | Statement | U1 | Microsoft Q# Coding Contest - Winter 2019 - Warmup {1115} | PROGRAMMING | Warmup editorial | 2200 | |
| 404 | AND oracle | *special | Statement | G1 | Microsoft Q# Coding Contest - Winter 2019 - Warmup {1115} | PROGRAMMING | Warmup editorial | 2200 | |
| 208 | X-wing fighter | Statement | D3 | Microsoft Q# Coding Contest - Winter 2019 {1116} | PROGRAMMING | Contest editorial | |||
| 172 | TIE fighter | Statement | D4 | Microsoft Q# Coding Contest - Winter 2019 {1116} | PROGRAMMING | Contest editorial | |||
| 237 | Pattern of increasing blocks | Statement | D2 | Microsoft Q# Coding Contest - Winter 2019 {1116} | PROGRAMMING | Contest editorial | |||
| 63 | Not A, not B or not C? | Statement | B2 | Microsoft Q# Coding Contest - Winter 2019 {1116} | PROGRAMMING | Contest editorial | |||
| 188 | "Is the number of ones divisible by 3?" oracle | Statement | C3 | Microsoft Q# Coding Contest - Winter 2019 {1116} | PROGRAMMING | Contest editorial | |||
| 190 | "Is the bit string periodic?" oracle | Statement | C2 | Microsoft Q# Coding Contest - Winter 2019 {1116} | PROGRAMMING | Contest editorial | |||
| 82 | Hessenberg matrix | Statement | D6 | Microsoft Q# Coding Contest - Winter 2019 {1116} | PROGRAMMING | Contest editorial | |||
| 329 | Generate state |00⟩ + |01⟩ + |10⟩ | Statement | A1 | Microsoft Q# Coding Contest - Winter 2019 {1116} | PROGRAMMING | Contest editorial | |||
| 185 | Generate equal superposition of four basis states | Statement | A2 | Microsoft Q# Coding Contest - Winter 2019 {1116} | PROGRAMMING | Contest editorial | |||
| 137 | Distinguish three-qubit states | Statement | B1 | Microsoft Q# Coding Contest - Winter 2019 {1116} | PROGRAMMING | Contest editorial | |||
| 153 | Creeper | Statement | D5 | Microsoft Q# Coding Contest - Winter 2019 {1116} | PROGRAMMING | Contest editorial | |||
| 279 | Block diagonal matrix | Statement | D1 | Microsoft Q# Coding Contest - Winter 2019 {1116} | PROGRAMMING | Contest editorial | |||
| 268 | Alternating bits oracle | Statement | C1 | Microsoft Q# Coding Contest - Winter 2019 {1116} | PROGRAMMING | Contest editorial | |||
| 16015 | Emotes | greedy math sortings | Statement | B | Educational Codeforces Round 60 (Rated for Div. 2) {1117} | PROGRAMMING | 65365 | 1000 | |
| 11577 | Best Subsegment | implementation math | Statement | A | Educational Codeforces Round 60 (Rated for Div. 2) {1117} | PROGRAMMING | 65365 | 1100 | |
| 9661 | Magic Ship | binary search | Statement | C | Educational Codeforces Round 60 (Rated for Div. 2) {1117} | PROGRAMMING | 65365 | 1800 | |
| 5703 | Magic Gems | dp math matrices | Statement | D | Educational Codeforces Round 60 (Rated for Div. 2) {1117} | PROGRAMMING | 65365 | 2000 | |
| 1672 | 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 | |
| 983 | Recursive Queries | data structures | Statement | G | Educational Codeforces Round 60 (Rated for Div. 2) {1117} | PROGRAMMING | 65365 | 2500 | |
| 711 | Crisp String | bitmasks dp | Statement | F | Educational Codeforces Round 60 (Rated for Div. 2) {1117} | PROGRAMMING | 65365 | 2600 | |
| 13425 | Tanya and Candies | implementation | Statement | B | Codeforces Round 540 (Div. 3) {1118} | PROGRAMMING | 65396 | 1300 | |
| 6140 | Palindromic Matrix | constructive algorithms implementation | Statement | C | Codeforces Round 540 (Div. 3) {1118} | PROGRAMMING | 65396 | 1700 | |
| 6890 | Tree Cutting (Easy Version) | dfs and similar trees | Statement | F1 | Codeforces Round 540 (Div. 3) {1118} | PROGRAMMING | 65396 | 1800 | |
| 6172 | Coffee and Coursework (Easy version) | brute force greedy | Statement | D1 | Codeforces Round 540 (Div. 3) {1118} | PROGRAMMING | 65396 | 1800 | |
| 6957 | Coffee and Coursework (Hard Version) | binary search greedy | Statement | D2 | Codeforces Round 540 (Div. 3) {1118} | PROGRAMMING | 65396 | 1900 | |
| 4498 | Yet Another Ball Problem | constructive algorithms implementation | Statement | E | Codeforces Round 540 (Div. 3) {1118} | PROGRAMMING | 65396 | 2000 | |
| 712 | Tree Cutting (Hard Version) | combinatorics dfs and similar dp trees | Statement | F2 | Codeforces Round 540 (Div. 3) {1118} | PROGRAMMING | 65396 | 2700 | |
| 21868 | Water Buying | math | Statement | A | Codeforces Round 540 (Div. 3) {1118} | PROGRAMMING | 65396 | 800 | |
| 11722 | Ilya and a Colorful Walk | greedy implementation | Statement | A | Codeforces Global Round 2 {1119} | PROGRAMMING | Codeforces Global Round 2 Editorial | 1100 | |
| 17895 | Alyona and a Narrow Fridge | binary search flows greedy sortings | Statement | B | Codeforces Global Round 2 {1119} | PROGRAMMING | Codeforces Global Round 2 Editorial | 1300 | |
| 7215 | Ramesses and Corner Inversion | constructive algorithms greedy implementation math | Statement | C | Codeforces Global Round 2 {1119} | PROGRAMMING | Codeforces Global Round 2 Editorial | 1500 | |
| 5201 | Frets On Fire | binary search sortings | Statement | D | Codeforces Global Round 2 {1119} | PROGRAMMING | Codeforces Global Round 2 Editorial | 1700 | |
| 5618 | Pavel and Triangles | brute force dp fft greedy ternary search | Statement | E | Codeforces Global Round 2 {1119} | PROGRAMMING | Codeforces Global Round 2 Editorial | 1900 | |
| 997 | Niyaz and Small Degrees | data structures dp trees | Statement | F | Codeforces Global Round 2 {1119} | PROGRAMMING | Codeforces Global Round 2 Editorial | 2900 | |
| 643 | Get Ready for the Battle | constructive algorithms implementation | Statement | G | Codeforces Global Round 2 {1119} | PROGRAMMING | Codeforces Global Round 2 Editorial | 3000 | |
| 979 | Triple | fft math | Statement | H | Codeforces Global Round 2 {1119} | PROGRAMMING | Codeforces Global Round 2 Editorial | 3100 | |
| 1755 | 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 | |
| 2528 | Compress String | dp strings | Statement | C | Codeforces Round 543 (Div. 1, based on Technocup 2019 Final Round) {1120} | PROGRAMMING | Разбор задач финала Технокубка 2019 и Codeforces Round #543 | 2200 | |
| 1829 | 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 | |
| 483 | 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 | |
| 332 | 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 | |
| 144 | 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 | |
| 7512 | 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 | |
| 10196 | 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 | |
| 2141 | 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 | |
| 3955 | Toy Train (Simplified) | brute force greedy | Statement | A1 | Codeforces Round 542 [Alex Lopashev Thanks-Round] (Div. 1) {1129} | PROGRAMMING | 65520 | 1700 | |
| 4247 | Toy Train | brute force greedy | Statement | A2 | Codeforces Round 542 [Alex Lopashev Thanks-Round] (Div. 1) {1129} | PROGRAMMING | 65520 | 1800 | |
| 2357 | Wrong Answer | constructive algorithms | Statement | B | Codeforces Round 542 [Alex Lopashev Thanks-Round] (Div. 1) {1129} | PROGRAMMING | 65520 | 2200 | |
| 1034 | 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 | |
| 1424 | Isolation | data structures dp | Statement | D | Codeforces Round 542 [Alex Lopashev Thanks-Round] (Div. 1) {1129} | PROGRAMMING | 65520 | 2800 | |
| 677 | Legendary Tree | binary search interactive trees | Statement | E | Codeforces Round 542 [Alex Lopashev Thanks-Round] (Div. 1) {1129} | PROGRAMMING | 65520 | 3000 | |
| 8490 | Two Cakes | greedy | Statement | B | Codeforces Round 542 [Alex Lopashev Thanks-Round] (Div. 2) {1130} | PROGRAMMING | 65520 | 1200 | |
| 9565 | Connect | brute force dfs and similar dsu | Statement | C | Codeforces Round 542 [Alex Lopashev Thanks-Round] (Div. 2) {1130} | PROGRAMMING | 65520 | 1400 | |
| 12321 | Be Positive | implementation | Statement | A | Codeforces Round 542 [Alex Lopashev Thanks-Round] (Div. 2) {1130} | PROGRAMMING | 65520 | 900 | |
| 15815 | Birthday | binary search greedy sortings | Statement | C | Codeforces Round 541 (Div. 2) {1131} | PROGRAMMING | Codeforces Round #541 Editorial | 1200 | |
| 10434 | Draw! | greedy implementation | Statement | B | Codeforces Round 541 (Div. 2) {1131} | PROGRAMMING | Codeforces Round #541 Editorial | 1300 | |
| 7974 | Asya And Kittens | constructive algorithms dsu | Statement | F | Codeforces Round 541 (Div. 2) {1131} | PROGRAMMING | Codeforces Round #541 Editorial | 1700 | |
| 3725 | Gourmet choice | dfs and similar dp dsu graphs greedy | Statement | D | Codeforces Round 541 (Div. 2) {1131} | PROGRAMMING | Codeforces Round #541 Editorial | 2000 | |
| 1299 | String Multiplication | dp greedy strings | Statement | E | Codeforces Round 541 (Div. 2) {1131} | PROGRAMMING | Codeforces Round #541 Editorial | 2200 | |
| 572 | Most Dangerous Shark | data structures dp two pointers | Statement | G | Codeforces Round 541 (Div. 2) {1131} | PROGRAMMING | Codeforces Round #541 Editorial | 2900 | |
| 12866 | Sea Battle | math | Statement | A | Codeforces Round 541 (Div. 2) {1131} | PROGRAMMING | Codeforces Round #541 Editorial | 800 | |
| 10249 | Regular Bracket Sequence | greedy implementation | Statement | A | Educational Codeforces Round 61 (Rated for Div. 2) {1132} | PROGRAMMING | T | 1100 | |
| 5760 | Painting the Fence | brute force | Statement | C | Educational Codeforces Round 61 (Rated for Div. 2) {1132} | PROGRAMMING | T | 1700 | |
| 11778 | Clear the String | dp | Statement | F | Educational Codeforces Round 61 (Rated for Div. 2) {1132} | PROGRAMMING | T | 2000 | |
| 2332 | Stressful Training | binary search greedy | Statement | D | Educational Codeforces Round 61 (Rated for Div. 2) {1132} | PROGRAMMING | T | 2300 | |
| 2153 | Knapsack | dfs and similar dp greedy | Statement | E | Educational Codeforces Round 61 (Rated for Div. 2) {1132} | PROGRAMMING | T | 2400 | |
| 1307 | Greedy Subsequences | data structures dp trees | Statement | G | Educational Codeforces Round 61 (Rated for Div. 2) {1132} | PROGRAMMING | T | 2600 | |
| 14131 | Discounts | greedy sortings | Statement | B | Educational Codeforces Round 61 (Rated for Div. 2) {1132} | PROGRAMMING | T | 900 | |
| 20054 | Middle of the Contest | implementation | Statement | A | Codeforces Round 544 (Div. 3) {1133} | PROGRAMMING | Codeforces Round #544 (Div. 3) Editorial | 1000 | |
| 14568 | 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 | |
| 29175 | Balanced Team | sortings two pointers | Statement | C | Codeforces Round 544 (Div. 3) {1133} | PROGRAMMING | Codeforces Round #544 (Div. 3) Editorial | 1300 | |
| 17578 | Zero Quantity Maximization | hashing math number theory | Statement | D | Codeforces Round 544 (Div. 3) {1133} | PROGRAMMING | Codeforces Round #544 (Div. 3) Editorial | 1500 | |
| 8899 | Spanning Tree with Maximum Degree | graphs | Statement | F1 | Codeforces Round 544 (Div. 3) {1133} | PROGRAMMING | Codeforces Round #544 (Div. 3) Editorial | 1600 | |
| 6653 | K Balanced Teams | dp sortings two pointers | Statement | E | Codeforces Round 544 (Div. 3) {1133} | PROGRAMMING | Codeforces Round #544 (Div. 3) Editorial | 2000 | |
| 3887 | 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 | |
| 12342 | Nastya Is Playing Computer Games | constructive algorithms math | Statement | B | Codeforces Round 546 (Div. 2) {1136} | PROGRAMMING | Editorial of Round #546(Div.2) | 1000 | |
| 8056 | Nastya Is Transposing Matrices | constructive algorithms sortings | Statement | C | Codeforces Round 546 (Div. 2) {1136} | PROGRAMMING | Editorial of Round #546(Div.2) | 1500 | |
| 4029 | Nastya Is Buying Lunch | greedy | Statement | D | Codeforces Round 546 (Div. 2) {1136} | PROGRAMMING | Editorial of Round #546(Div.2) | 1800 | |
| 1226 | 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 | |
| 17329 | Nastya Is Reading a Book | implementation | Statement | A | Codeforces Round 546 (Div. 2) {1136} | PROGRAMMING | Editorial of Round #546(Div.2) | 700 | |
| 4723 | Skyscrapers | implementation sortings | Statement | A | Codeforces Round 545 (Div. 1) {1137} | PROGRAMMING | Codeforces Round #545 – Editorial | 1600 | |
| 7173 | Camp Schedule | greedy hashing strings | Statement | B | Codeforces Round 545 (Div. 1) {1137} | PROGRAMMING | Codeforces Round #545 – Editorial | 1700 | |
| 2278 | Cooperative Game | constructive algorithms interactive number theory | Statement | D | Codeforces Round 545 (Div. 1) {1137} | PROGRAMMING | Codeforces Round #545 – Editorial | 2500 | |
| 651 | Train Car Selection | data structures greedy | Statement | E | Codeforces Round 545 (Div. 1) {1137} | PROGRAMMING | Codeforces Round #545 – Editorial | 2800 | |
| 1400 | Museums Tour | dp graphs implementation | Statement | C | Codeforces Round 545 (Div. 1) {1137} | PROGRAMMING | Codeforces Round #545 – Editorial | 2800 | |
| 535 | Matches Are Not a Child's Play | data structures trees | Statement | F | Codeforces Round 545 (Div. 1) {1137} | PROGRAMMING | Codeforces Round #545 – Editorial | 3300 | |
| 4229 | Circus | brute force greedy math strings | Statement | B | Codeforces Round 545 (Div. 2) {1138} | PROGRAMMING | Codeforces Round #545 – Editorial | 1700 | |
| 22782 | Sushi for Two | binary search greedy implementation | Statement | A | Codeforces Round 545 (Div. 2) {1138} | PROGRAMMING | Codeforces Round #545 – Editorial | 900 | |
| 19940 | Chocolates | greedy implementation | Statement | B | Codeforces Round 548 (Div. 2) {1139} | PROGRAMMING | Codeforces Round #548 Editorial | 1100 | |
| 17686 | Edgy Trees | dfs and similar dsu graphs math trees | Statement | C | Codeforces Round 548 (Div. 2) {1139} | PROGRAMMING | Codeforces Round #548 Editorial | 1500 | |
| 2848 | Steps to One | dp math number theory probabilities | Statement | D | Codeforces Round 548 (Div. 2) {1139} | PROGRAMMING | Codeforces Round #548 Editorial | 2300 | |
| 2510 | Maximize Mex | flows graph matchings graphs | Statement | E | Codeforces Round 548 (Div. 2) {1139} | PROGRAMMING | Codeforces Round #548 Editorial | 2400 | |
| 733 | Dish Shopping | data structures divide and conquer | Statement | F | Codeforces Round 548 (Div. 2) {1139} | PROGRAMMING | Codeforces Round #548 Editorial | 2800 | |
| 17733 | Even Substrings | implementation strings | Statement | A | Codeforces Round 548 (Div. 2) {1139} | PROGRAMMING | Codeforces Round #548 Editorial | 700 | |
| 12920 | Detective Book | implementation | Statement | A | Educational Codeforces Round 62 (Rated for Div. 2) {1140} | PROGRAMMING | Educational Codeforces Round 62 Editorial | 1000 | |
| 13301 | Minimum Triangulation | dp greedy math | Statement | D | Educational Codeforces Round 62 (Rated for Div. 2) {1140} | PROGRAMMING | Educational Codeforces Round 62 Editorial | 1200 | |
| 11793 | Good String | implementation strings | Statement | B | Educational Codeforces Round 62 (Rated for Div. 2) {1140} | PROGRAMMING | Educational Codeforces Round 62 Editorial | 1200 | |
| 10564 | Playlist | brute force data structures sortings | Statement | C | Educational Codeforces Round 62 (Rated for Div. 2) {1140} | PROGRAMMING | Educational Codeforces Round 62 Editorial | 1600 | |
| 2156 | 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 | |
| 1679 | 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 | |
| 667 | 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 | |
| 23376 | Maximal Continuous Rest | implementation | Statement | B | Codeforces Round 547 (Div. 3) {1141} | PROGRAMMING | 66062 | 1000 | |
| 40679 | Game 23 | implementation math | Statement | A | Codeforces Round 547 (Div. 3) {1141} | PROGRAMMING | 66062 | 1000 | |
| 12406 | Polycarp Restores Permutation | math | Statement | C | Codeforces Round 547 (Div. 3) {1141} | PROGRAMMING | 66062 | 1400 | |
| 9041 | Colored Boots | greedy implementation | Statement | D | Codeforces Round 547 (Div. 3) {1141} | PROGRAMMING | 66062 | 1500 | |
| 7149 | Superhero Battle | math | Statement | E | Codeforces Round 547 (Div. 3) {1141} | PROGRAMMING | 66062 | 1700 | |
| 4222 | Same Sum Blocks (Easy) | greedy | Statement | F1 | Codeforces Round 547 (Div. 3) {1141} | PROGRAMMING | 66062 | 2000 | |
| 4667 | Same Sum Blocks (Hard) | data structures greedy | Statement | F2 | Codeforces Round 547 (Div. 3) {1141} | PROGRAMMING | 66062 | 2200 | |
| 2565 | 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 | |
| 3597 | The Beatles | brute force math | Statement | A | Codeforces Round 549 (Div. 1) {1142} | PROGRAMMING | Codeforces Round #549 Editorial | 1800 | |
| 4024 | Lynyrd Skynyrd | data structures dfs and similar dp math trees | Statement | B | Codeforces Round 549 (Div. 1) {1142} | PROGRAMMING | Codeforces Round #549 Editorial | 2300 | |
| 697 | Foreigner | dp | Statement | D | Codeforces Round 549 (Div. 1) {1142} | PROGRAMMING | Codeforces Round #549 Editorial | 2700 | |
| 1611 | U2 | geometry | Statement | C | Codeforces Round 549 (Div. 1) {1142} | PROGRAMMING | Codeforces Round #549 Editorial | 2800 | |
| 652 | Pink Floyd | graphs interactive | Statement | E | Codeforces Round 549 (Div. 1) {1142} | PROGRAMMING | Codeforces Round #549 Editorial | 3100 | |
| 11770 | Nirvana | brute force math number theory | Statement | B | Codeforces Round 549 (Div. 2) {1143} | PROGRAMMING | Codeforces Round #549 Editorial | 1300 | |
| 18946 | Queen | dfs and similar trees | Statement | C | Codeforces Round 549 (Div. 2) {1143} | PROGRAMMING | Codeforces Round #549 Editorial | 1400 | |
| 14164 | The Doors | implementation | Statement | A | Codeforces Round 549 (Div. 2) {1143} | PROGRAMMING | Codeforces Round #549 Editorial | 700 | |
| 18476 | Parity Alternated Deletions | greedy implementation sortings | Statement | B | Codeforces Round 550 (Div. 3) {1144} | PROGRAMMING | 66307 | 1000 | |
| 16581 | Two Shuffled Sequences | constructive algorithms sortings | Statement | C | Codeforces Round 550 (Div. 3) {1144} | PROGRAMMING | 66307 | 1100 | |
| 10913 | Equalize Them All | constructive algorithms greedy | Statement | D | Codeforces Round 550 (Div. 3) {1144} | PROGRAMMING | 66307 | 1400 | |
| 14968 | Graph Without Long Directed Paths | dfs and similar graphs | Statement | F | Codeforces Round 550 (Div. 3) {1144} | PROGRAMMING | 66307 | 1700 |