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 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 4378 | Looking for Order | bitmasks dp | Statement | C | Codeforces Beta Round 8 {8} | PROGRAMMING | Codeforces Beta Round #8 Tutorial | 2000 | |
| 6677 | A Simple Task | bitmasks dp graphs | Statement | D | Codeforces Beta Round 11 {11} | PROGRAMMING | 2200 | ||
| 6741 | Fish | bitmasks dp probabilities | Statement | E | Codeforces Beta Round 16 (Div. 2 Only) {16} | PROGRAMMING | Codeforces Beta Round #16 Tutorial | 2100 | |
| 1366 | Traveling Graph | bitmasks graph matchings graphs | Statement | D | Codeforces Alpha Round 21 (Codeforces format) {21} | PROGRAMMING | 2500 | ||
| 5952 | Tournament | bitmasks brute force dfs and similar greedy | Statement | B | Codeforces Beta Round 27 (Codeforces format, Div. 2) {27} | PROGRAMMING | Codeforces Beta #27 - Tutorial | 2000 | |
| 1320 | Dead Ends | bitmasks dp | Statement | E | Codeforces Beta Round 49 (Div. 2) {53} | PROGRAMMING | Tutorial for problems of Codeforces Beta Round #49 (Div.2). All problems now. | 2500 | |
| 879 | Sweets Game | bitmasks dfs and similar dp games implementation | Statement | E | Codeforces Beta Round 59 (Div. 2) {63} | PROGRAMMING | Разбор задач Codeforces Round #59 (Div. 2) | 2200 | |
| 978 | Nuclear Fusion | bitmasks dp | Statement | E | Codeforces Beta Round 65 (Div. 2) {71} | PROGRAMMING | Разбор задач Codeforces Beta Round #65 (Div. 2) | 2200 | |
| 385 | Mutation | bitmasks dp math | Statement | C | All-Ukrainian School Olympiad in Informatics {76} | PROGRAMMING | All-Ukrainian School Olympiad in Informatics: editorial (A,B,C,D,E,F) | 2700 | |
| 1429 | Password | bitmasks dp shortest paths | Statement | D | Codeforces Beta Round 71 {79} | PROGRAMMING | Codeforces Beta Round #71 - разбор (перевод A-D) | 2700 | |
| 567 | Two Subsequences | bitmasks dp | Statement | E | Codeforces Beta Round 72 (Div. 1 Only) {83} | PROGRAMMING | разбор E | 2800 | |
| 19575 | Lucky Numbers (easy) | binary search bitmasks brute force | Statement | B | Codeforces Beta Round 77 (Div. 2 Only) {96} | PROGRAMMING | Codeforces Beta Round #77 (Div. 2 Only) Question A - D | 1400 | |
| 358 | Robot in Basement | bitmasks brute force implementation | Statement | D | Yandex.Algorithm 2011: Finals {97} | PROGRAMMING | Финал Яндекс.Алгоритм: разбор A-B | 2600 | |
| 495 | Arrangement | bitmasks dp | Statement | C | Codeforces Beta Round 83 (Div. 1 Only) {107} | PROGRAMMING | Tutorial | 2500 | |
| 1613 | Petya and Spiders | bitmasks dp dsu | Statement | C | Codeforces Beta Round 85 (Div. 1 Only) {111} | PROGRAMMING | Codeforces Beta Round #85: Разбор задач | 2100 | |
| 4310 | PFAST Inc. | bitmasks brute force graphs | Statement | B | Codeforces Beta Round 86 (Div. 2 Only) {114} | PROGRAMMING | Codeforces Beta Round #86 Editorial | 1500 | |
| 599 | Garden | bitmasks dp graphs trees | Statement | E | Codeforces Round 108 (Div. 2) {152} | PROGRAMMING | Разбор задач Codeforces Round #108 (Div. 2) | 2400 | |
| 9761 | Compatible Numbers | bitmasks brute force dfs and similar dp | Statement | E | Codeforces Round 112 (Div. 2) {165} | PROGRAMMING | Codeforces Round #112 (Div. 2) Tutorial | 2100 | |
| 481 | Brand New Problem | bitmasks brute force dp | Statement | D | Codeforces Round 127 (Div. 1) {201} | PROGRAMMING | 2500 | ||
| 20000 | LLPS | binary search bitmasks brute force greedy implementation strings | Statement | A | Codeforces Round 127 (Div. 2) {202} | PROGRAMMING | 900 | ||
| 386 | Polycarpus is Looking for Good Substrings | bitmasks hashing implementation | Statement | B | VK Cup 2012 Finals (unofficial online-version) {212} | PROGRAMMING | 2300 | ||
| 282 | Bitonix' Patrol | bitmasks brute force combinatorics dfs and similar math | Statement | D | Codeforces Round 134 (Div. 1) {217} | PROGRAMMING | Editorial for Codeforces Round #134 | 2800 | |
| 8061 | Array | bitmasks implementation two pointers | Statement | B | Codeforces Round 138 (Div. 2) {224} | PROGRAMMING | Tutorial | 1500 | |
| 1073 | Snake | bitmasks dfs and similar graphs implementation | Statement | D | Codeforces Round 139 (Div. 2) {225} | PROGRAMMING | Tutorial | 2300 | |
| 1687 | Table | bitmasks combinatorics dp math | Statement | B | Codeforces Round 144 (Div. 1) {232} | PROGRAMMING | Editorial for Codeforces Round #144 | 2200 | |
| 970 | Quick Tortoise | bitmasks divide and conquer dp | Statement | E | Codeforces Round 144 (Div. 1) {232} | PROGRAMMING | Editorial for Codeforces Round #144 | 2900 | |
| 1013 | Friends | binary search bitmasks data structures math | Statement | B | Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements) {241} | PROGRAMMING | 2700 | ||
| 12265 | XOR on Segment | bitmasks data structures | Statement | E | Codeforces Round 149 (Div. 2) {242} | PROGRAMMING | Codeforces Round #149 (Div. 2) Tutorial | 2000 | |
| 4502 | The Brand New Function | bitmasks | Statement | A | Codeforces Round 150 (Div. 1) {243} | PROGRAMMING | Editorial for Codeforces Round #150 | 1900 | |
| 4968 | Undoubtedly Lucky Numbers | bitmasks brute force dfs and similar | Statement | B | Codeforces Round 150 (Div. 2) {244} | PROGRAMMING | Editorial for Codeforces Round #150 | 1600 | |
| 720 | Two Sets | bitmasks math | Statement | D | Codeforces Round 153 (Div. 1) {251} | PROGRAMMING | Editorial of Codeforces Round #153 | 2500 | |
| 16732 | Little Girl and Maximum XOR | bitmasks dp greedy implementation math | Statement | D | Codeforces Round 169 (Div. 2) {276} | PROGRAMMING | Codeforces Round #169 — Unofficial Editorial | 1800 | |
| 868 | The Minimum Number of Variables | bitmasks dp | Statement | D | Codeforces Round 171 (Div. 2) {279} | PROGRAMMING | Unofficial editorial for Codeforces Round #171 (Div. 2) | 2600 | |
| 4641 | Sausage Maximization | bitmasks data structures trees | Statement | E | Codeforces Round 173 (Div. 2) {282} | PROGRAMMING | Round #173 — Editorial | 2100 | |
| 1702 | Permutation Sum | bitmasks combinatorics dp implementation meet-in-the-middle | Statement | D | Codeforces Round 175 (Div. 2) {285} | PROGRAMMING | Codeforces Round #175 (Div. 2) Tutorial | 1900 | |
| 1882 | Network Mask | *special bitmasks brute force implementation | Statement | C | Croc Champ 2013 - Qualification Round {291} | PROGRAMMING | 2100 | ||
| 1497 | Memory for Arrays | binary search bitmasks greedy | Statement | C | Croc Champ 2013 - Finals (online version, Div. 1) {309} | PROGRAMMING | Чемпионат КРОК 2013 — Финальный раунд — Разбор | 1900 | |
| 1621 | Axis Walking | bitmasks combinatorics constructive algorithms dp meet-in-the-middle | Statement | E | Codeforces Round 191 (Div. 2) {327} | PROGRAMMING | Codeforces Round #191 — Tutorial | 2500 | |
| 2265 | Characteristics of Rectangles | binary search bitmasks brute force implementation sortings | Statement | D | Codeforces Round 194 (Div. 1) {333} | PROGRAMMING | Codeforces Round 194 — Editoral | 2100 | |
| 1278 | Summer Earnings | binary search bitmasks brute force geometry sortings | Statement | E | Codeforces Round 194 (Div. 1) {333} | PROGRAMMING | Codeforces Round 194 — Editoral | 2400 | |
| 158 | Vasily the Bear and Painting Square | bitmasks combinatorics dp implementation | Statement | E | Codeforces Round 195 (Div. 2) {336} | PROGRAMMING | Tutorial Codeforces Round #195 (Div. 2) | 2600 | |
| 584 | Xenia and Dominoes | bitmasks dfs and similar dp | Statement | D | Codeforces Round 199 (Div. 2) {342} | PROGRAMMING | Tutorial | 2500 | |
| 522 | Game with Strings | bitmasks dp games | Statement | B | Codeforces Round 206 (Div. 1) {354} | PROGRAMMING | Codeforces Round #206 — Editorial | 2500 | |
| 1124 | Bags and Coins | bitmasks constructive algorithms dp greedy | Statement | D | Codeforces Round 207 (Div. 1) {356} | PROGRAMMING | 9210 | 2500 | |
| 707 | Sereja and Sets | bitmasks dfs and similar | Statement | D | Codeforces Round 215 (Div. 1) {367} | PROGRAMMING | Codeforces Round #215 — tutorial | 2400 | |
| 665 | Circling Round Treasures | bitmasks shortest paths | Statement | C | Codeforces Round 221 (Div. 1) {375} | PROGRAMMING | Codeforces Round #221 Tutorial | 2600 | |
| 1424 | Captains Mode | bitmasks dp games | Statement | C | Codeforces Round 222 (Div. 1) {377} | PROGRAMMING | Codeforces Round #222 — Problem Analysis | 2400 | |
| 1681 | New Year Letter | bitmasks brute force dp | Statement | D | Good Bye 2013 {379} | PROGRAMMING | Tutorial Good Bye 2013 | 2000 | |
| 965 | Bear and Floodlight | bitmasks dp geometry | Statement | D | Codeforces Round 226 (Div. 2) {385} | PROGRAMMING | Codeforces Round #226 (Div. 2) — Editorial | 2500 | |
| 2609 | Fox and Minimal path | bitmasks constructive algorithms graphs implementation math | Statement | B | Codeforces Round 228 (Div. 1) {388} | PROGRAMMING | Codeforces Round #228 — Editorial | 2000 | |
| 1062 | Inna and Binary Logic | binary search bitmasks data structures | Statement | E | Codeforces Round 234 (Div. 2) {400} | PROGRAMMING | Codeforces Round #234 (Div. 2) — Tutorial | 2400 | |
| 4694 | Roman and Numbers | bitmasks brute force combinatorics dp number theory | Statement | D | Codeforces Round 235 (Div. 2) {401} | PROGRAMMING | Codeforces Round #235 (Div. 2) — Tutorial | 2000 | |
| 921 | 2048 | bitmasks dp | Statement | D | Coder-Strike 2014 - Round 2 {413} | PROGRAMMING | Editorial of Coder-Strike 2014 Round 2 | 2100 | |
| 2962 | Cunning Gena | bitmasks dp greedy sortings | Statement | D | RCC 2014 Warmup (Div. 2) {417} | PROGRAMMING | 2000 | ||
| 1436 | Sereja and Table | bitmasks greedy | Statement | B | Codeforces Round 243 (Div. 1) {425} | PROGRAMMING | Codeforces Round #243 tutorial | 2400 | |
| 1053 | Guess the Tree | bitmasks constructive algorithms dp greedy trees | Statement | C | Codeforces Round 245 (Div. 1) {429} | PROGRAMMING | Codeforces Round #245 — Editorial | 2400 | |
| 2933 | Random Task | binary search bitmasks combinatorics dp math | Statement | D | Codeforces Round 247 (Div. 2) {431} | PROGRAMMING | Editorial Codeforces Round #247 (Div. 2) | 2200 | |
| 10530 | The Child and Set | bitmasks greedy implementation sortings | Statement | B | Codeforces Round 250 (Div. 2) {437} | PROGRAMMING | 12513 | 1500 | |
| 832 | Valera and Number | bitmasks dp math probabilities | Statement | E | Codeforces Round 252 (Div. 2) {441} | PROGRAMMING | Разбор Codeforces Round #252 (Div. 2) | 2700 | |
| 2364 | Borya and Hanabi | bitmasks brute force implementation | Statement | A | Codeforces Round 253 (Div. 1) {442} | PROGRAMMING | Codeforces #253 editorial | 2000 | |
| 6386 | Jzzhu and Numbers | bitmasks combinatorics dp | Statement | D | Codeforces Round 257 (Div. 1) {449} | PROGRAMMING | Codeforces Round #257 Editorial | 2400 | |
| 4712 | Devu and Flowers | bitmasks combinatorics number theory | Statement | E | Codeforces Round 258 (Div. 2) {451} | PROGRAMMING | Codeforces Round #258 Editorial | 2400 | |
| 5529 | Little Pony and Harmony Chest | bitmasks brute force dp | Statement | B | Codeforces Round 259 (Div. 1) {453} | PROGRAMMING | Codeforces Round #259 Editorial | 2200 | |
| 43564 | Fedor and New Game | bitmasks brute force constructive algorithms implementation | Statement | B | Codeforces Round 267 (Div. 2) {467} | PROGRAMMING | Разбор задач | 1200 | |
| 485 | Design Tutorial: Increase the Constraints | bitmasks data structures fft | Statement | G | Codeforces Round 270 {472} | PROGRAMMING | Editorial | 2800 | |
| 37831 | Dreamoon and WiFi | bitmasks brute force combinatorics dp math probabilities | Statement | B | Codeforces Round 272 (Div. 2) {476} | PROGRAMMING | 1300 | ||
| 1018 | Game with Strings | bitmasks dp probabilities | Statement | C | Codeforces Round 275 (Div. 1) {482} | PROGRAMMING | Codeforces Round #275 Editorial | 2800 | |
| 13735 | Bits | bitmasks constructive algorithms | Statement | A | Codeforces Round 276 (Div. 1) {484} | PROGRAMMING | Codeforces Round #276 — Editorial | 1700 | |
| 380 | Misha and XOR | bitmasks | Statement | D | Codeforces Round 285 (Div. 1) {504} | PROGRAMMING | 15743 | 2700 | |
| 6505 | Fox And Jumping | bitmasks brute force dp math | Statement | D | Codeforces Round 290 (Div. 2) {510} | PROGRAMMING | Codeforces Round #290 Editorial | 2100 | |
| 2941 | Permutations | bitmasks divide and conquer math | Statement | B2 | Rockethon 2015 {513} | PROGRAMMING | 16260 | 1800 | |
| 1694 | Second price auction | bitmasks probabilities | Statement | C | Rockethon 2015 {513} | PROGRAMMING | 16260 | 2000 | |
| 4285 | Anya and Cubes | binary search bitmasks brute force dp math meet-in-the-middle | Statement | E | Codeforces Round 297 (Div. 2) {525} | PROGRAMMING | Codeforces Round #297 (Div.2) Editorial | 2200 | |
| 2963 | Fuzzy Search | bitmasks brute force fft | Statement | D | Codeforces Round 296 (Div. 1) {528} | PROGRAMMING | Codeforces Round #296 Editorial | 2500 | |
| 549 | Simplified Nonogram | bitmasks dp hashing meet-in-the-middle | Statement | F | Codeforces Round 298 (Div. 2) {534} | PROGRAMMING | 2900 | ||
| 26967 | Tavas and SaDDas | bitmasks brute force combinatorics implementation | Statement | B | Codeforces Round 299 (Div. 2) {535} | PROGRAMMING | Codeforces Round #299 Editorial | 1100 | |
| 1588 | Remembering Strings | bitmasks dp | Statement | C | Codeforces Round 302 (Div. 1) {543} | PROGRAMMING | Editorial Codeforces Round #302 | 2600 | |
| 3504 | Mike and Foam | bitmasks combinatorics dp math number theory | Statement | C | Codeforces Round 305 (Div. 1) {547} | PROGRAMMING | Codeforces Round #305 Editorial | 2700 | |
| 28381 | Preparing Olympiad | bitmasks brute force | Statement | B | Codeforces Round 306 (Div. 2) {550} | PROGRAMMING | Разбор задач Codeforces Round #306 (Div. 2) | 1500 | |
| 719 | Restoring Map | bitmasks constructive algorithms trees | Statement | E | VK Cup 2015 - Finals, online mirror {566} | PROGRAMMING | Editorial for VK Cup 2015 — Finals | 3200 | |
| 9292 | Tree Requests | binary search bitmasks constructive algorithms dfs and similar graphs trees | Statement | D | Codeforces Round 316 (Div. 2) {570} | PROGRAMMING | Codeforces Round #316 Editorial | 2400 | |
| 237 | Party | bitmasks brute force graph matchings | Statement | C | Bubble Cup 8 - Finals [Online Mirror] {575} | PROGRAMMING | Bubble Cup finals 2015 Results and Editorial | 2800 | |
| 81092 | Raising Bacteria | bitmasks | Statement | A | Codeforces Round 320 (Div. 2) [Bayan Thanks-Round] {579} | PROGRAMMING | Codeforces Round #320 [Bayan Thanks-Round] Editorial | 1000 | |
| 12326 | Kefa and Dishes | bitmasks dp | Statement | D | Codeforces Round 321 (Div. 2) {580} | PROGRAMMING | Codeforces Round #321 Editorial | 1900 | |
| 4864 | Three Logos | bitmasks brute force constructive algorithms geometry implementation math | Statement | D | Codeforces Round 322 (Div. 2) {581} | PROGRAMMING | Codeforces Round #322 (Div.2) Editorial | 1700 | |
| 645 | Boolean Function | bitmasks dp expression parsing | Statement | E | Codeforces Round 323 (Div. 1) {582} | PROGRAMMING | Codeforces Round #323 Editorial | 2900 | |
| 810 | Sandy and Nuts | bitmasks dp trees | Statement | E | Codeforces Round 332 (Div. 2) {599} | PROGRAMMING | Editorial Codeforces Round #332 (Div. 2) | 2100 | |
| 11233 | New Year and Old Property | bitmasks brute force implementation | Statement | B | Good Bye 2015 {611} | PROGRAMMING | Tutorial | 1300 | |
| 7399 | New Year Tree | bitmasks data structures trees | Statement | E | Educational Codeforces Round 6 {620} | PROGRAMMING | Editorial of Educational Codeforces Round 6 | 2100 | |
| 913 | Yash And Trees | bitmasks data structures dfs and similar math number theory | Statement | G | Manthan, Codefest 16 {633} | PROGRAMMING | Manthan, Codefest 16: Editorials | 2700 | |
| 619 | Gambling Nim | bitmasks math matrices probabilities | Statement | A | CROC 2016 - Final Round [Private, For Onsite Finalists Only] {662} | PROGRAMMING | Editorial for CROC 2016 Finals and Codeforces Round #347 | 2400 | |
| 2537 | Binary Table | bitmasks brute force divide and conquer dp fft math | Statement | C | CROC 2016 - Final Round [Private, For Onsite Finalists Only] {662} | PROGRAMMING | Editorial for CROC 2016 Finals and Codeforces Round #347 | 2800 | |
| 7035 | Vanya and Label | bitmasks combinatorics implementation strings | Statement | C | Codeforces Round 355 (Div. 2) {677} | PROGRAMMING | Codeforces Round #355 (Div. 2) Editorial | 1500 | |
| 2825 | Another Sith Tournament | bitmasks dp | Statement | E | Educational Codeforces Round 13 {678} | PROGRAMMING | Editorial | 2200 | |
| 625 | Travelling Through the Snow Queen's Kingdom | bitmasks brute force divide and conquer graphs | Statement | E | Codeforces Round 359 (Div. 1) {685} | PROGRAMMING | Codeforces Round #359 Editorial | 2700 | |
| 1466 | LRU | bitmasks dp math probabilities | Statement | C | Codeforces Round 363 (Div. 1) {698} | PROGRAMMING | Solution | 2700 | |
| 13011 | Vasiliy's Multiset | binary search bitmasks data structures trees | Statement | D | Codeforces Round 367 (Div. 2) {706} | PROGRAMMING | Tutorial | 1800 | |
| 3083 | Persistent Bookcase | bitmasks data structures dfs and similar implementation | Statement | D | Codeforces Round 368 (Div. 2) {707} | PROGRAMMING | 46662 | 2100 | |
| 465 | Matvey's Birthday | bitmasks graphs | Statement | E | Codeforces Round 373 (Div. 1) {718} | PROGRAMMING | Codeforces Round #373 — Editorial | 3400 | |
| 1575 | Xor-matic Number of the Graph | bitmasks graphs math number theory trees | Statement | G | Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined) {724} | PROGRAMMING | Tutorial | 2600 | |
| 1433 | Anton and School | bitmasks constructive algorithms implementation math | Statement | F | Codeforces Round 379 (Div. 2) {734} | PROGRAMMING | Tutorial of Codeforces Round #379 (Div. 2) | 2600 | |
| 16154 | Chloe and the sequence | binary search bitmasks constructive algorithms implementation | Statement | B | Codeforces Round 384 (Div. 2) {743} | PROGRAMMING | Codeforces Round #384 Editorial | 1200 | |
| 1654 | Vladik and cards | binary search bitmasks brute force dp | Statement | E | Codeforces Round 384 (Div. 2) {743} | PROGRAMMING | Codeforces Round #384 Editorial | 2300 | |
| 1969 | Hongcow's Game | bitmasks divide and conquer interactive | Statement | B | Codeforces Round 385 (Div. 1) {744} | PROGRAMMING | Codeforces Round #385 Editorial | 2000 | |
| 1357 | Hongcow Buys a Deck of Cards | bitmasks brute force dp | Statement | C | Codeforces Round 385 (Div. 1) {744} | PROGRAMMING | Codeforces Round #385 Editorial | 2500 | |
| 580 | New Year and Binary Tree Paths | bitmasks brute force combinatorics dp | Statement | G | Good Bye 2016 {750} | PROGRAMMING | Good Bye 2016 — hints and codes | 3100 | |
| 591 | Dasha and cyclic table | bitmasks brute force fft strings trees | Statement | E | Codeforces Round 390 (Div. 2) {754} | PROGRAMMING | 2800 | ||
| 1964 | PolandBall and Gifts | bitmasks dp greedy | Statement | F | 8VC Venture Cup 2017 - Elimination Round {755} | PROGRAMMING | 8VC Venture Cup 2017 — Elimination Round [Editorial] | 2600 | |
| 1572 | Felicity's Big Secret Revealed | bitmasks dp | Statement | D | Codecraft-17 and Codeforces Round 391 (Div. 1 + Div. 2, combined) {757} | PROGRAMMING | CodeCraft-17 and Codeforces Round #391 (Div. 1 + Div. 2, combined) Editorial | 2200 | |
| 3574 | Mahmoud and a xor trip | bitmasks constructive algorithms data structures dfs and similar dp math trees | Statement | E | Codeforces Round 396 (Div. 2) {766} | PROGRAMMING | Codeforces round #396 editorial | 2200 | |
| 3647 | Game of Stones | bitmasks dp games | Statement | E | Divide by Zero 2017 and Codeforces Round 399 (Div. 1 + Div. 2, combined) {768} | PROGRAMMING | Editorial Divide by Zero and Codeforces Round #399 (Div. 1+2, combined) | 2000 | |
| 2568 | k-Interesting Pairs Of Integers | *special bitmasks brute force meet-in-the-middle | Statement | D | VK Cup 2017 - Qualification 1 {769} | PROGRAMMING | Tutorial | 1800 | |
| 830 | Varying Kibibits | bitmasks dp | Statement | D | VK Cup 2017 - Round 2 {772} | PROGRAMMING | VK Cup Round 2 + Codeforces Round #409 Tutorial | 2700 | |
| 392 | Sherlock and the Encrypted Data | bitmasks combinatorics dp | Statement | G | ICM Technex 2017 and Codeforces Round 400 (Div. 1 + Div. 2, combined) {776} | PROGRAMMING | ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined) Editorial | 2800 | |
| 2547 | Bitwise Formula | bitmasks brute force dfs and similar expression parsing implementation | Statement | B | Codeforces Round 402 (Div. 1) {778} | PROGRAMMING | Codeforces Round #402, Editorial | 2000 | |
| 1299 | Axel and Marston in Bitland | bitmasks dp graphs matrices | Statement | F | Технокубок 2017 - Финал (только для онсайт-финалистов) {780} | PROGRAMMING | Technocup 2017 Finals and Codeforces Round #403 Editorial | 2800 | |
| 3449 | Paths in a Complete Binary Tree | bitmasks trees | Statement | D | Educational Codeforces Round 18 {792} | PROGRAMMING | Educational Codeforces Round 18 - Editorial | 1800 | |
| 435 | Sequence Recovery | bitmasks data structures greedy | Statement | F | Codeforces Round 408 (Div. 2) {796} | PROGRAMMING | Tutorial | 2800 | |
| 4894 | Coprime Subsequences | bitmasks combinatorics number theory | Statement | F | Educational Codeforces Round 20 {803} | PROGRAMMING | 51768 | 2100 | |
| 5573 | Sagheer, the Hausmeister | bitmasks brute force dp | Statement | B | Codeforces Round 417 (Div. 2) {812} | PROGRAMMING | [Editorial] Codeforces Round #417 (Div. 2) | 1600 | |
| 3859 | Choosing The Commander | bitmasks data structures trees | Statement | E | Educational Codeforces Round 23 {817} | PROGRAMMING | 52638 | 2100 | |
| 666 | Guards In The Storehouse | bitmasks dp | Statement | F | Educational Codeforces Round 27 {845} | PROGRAMMING | 53986 | 2600 | |
| 1983 | Arpa and a game with Mojtaba | bitmasks dp games | Statement | C | Codeforces Round 432 (Div. 1, based on IndiaHacks Final Round 2017) {850} | PROGRAMMING | Codeforces Round #432 editorial | 2400 | |
| 559 | Random Elections | bitmasks brute force divide and conquer fft math | Statement | E | Codeforces Round 432 (Div. 1, based on IndiaHacks Final Round 2017) {850} | PROGRAMMING | Codeforces Round #432 editorial | 2800 | |
| 2199 | Salazar Slytherin's Locket | bitmasks dp | Statement | E | Manthan, Codefest 17 {855} | PROGRAMMING | 54750 | 2200 | |
| 162 | Hex Dyslexia | bitmasks brute force dp graphs | Statement | E | MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists) {865} | PROGRAMMING | MemSQL Start[c]UP 3.0 Round 2 Editorial | 2700 | |
| 81 | Egg Roulette | bitmasks brute force divide and conquer math meet-in-the-middle | Statement | F | MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists) {865} | PROGRAMMING | MemSQL Start[c]UP 3.0 Round 2 Editorial | 3300 | |
| 5052 | Qualification Rounds | bitmasks brute force constructive algorithms dp | Statement | C | Codeforces Round 438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined) {868} | PROGRAMMING | 55046 | 1500 | |
| 1024 | Huge Strings | bitmasks brute force dp implementation strings | Statement | D | Codeforces Round 438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined) {868} | PROGRAMMING | 55046 | 2100 | |
| 2568 | High Cry | binary search bitmasks combinatorics data structures divide and conquer | Statement | D | Codeforces Round 441 (Div. 1, by Moscow Team Olympiad) {875} | PROGRAMMING | Codeforces Round #441. Editorial. | 2200 | |
| 5757 | Danil and a Part-time Job | bitmasks data structures trees | Statement | E | Codeforces Round 442 (Div. 2) {877} | PROGRAMMING | 55362 | 2000 | |
| 6022 | Short Program | bitmasks constructive algorithms | Statement | A | Codeforces Round 443 (Div. 1) {878} | PROGRAMMING | Editorial | 1600 | |
| 902 | Magic Breeding | bitmasks | Statement | D | Codeforces Round 443 (Div. 1) {878} | PROGRAMMING | Editorial | 2900 | |
| 9516 | Maximum Subsequence | bitmasks divide and conquer meet-in-the-middle | Statement | E | Educational Codeforces Round 32 {888} | PROGRAMMING | Educational Codeforces Round 32 - Editorial | 1800 | |
| 6025 | Xor-MST | bitmasks constructive algorithms data structures | Statement | G | Educational Codeforces Round 32 {888} | PROGRAMMING | Educational Codeforces Round 32 - Editorial | 2300 | |
| 7594 | Square Subsets | bitmasks combinatorics dp math | Statement | C | Codeforces Round 448 (Div. 2) {895} | PROGRAMMING | Codeforces Round #448(Div.2) Editorial | 2000 | |
| 3869 | Unusual Sequences | bitmasks combinatorics dp math number theory | Statement | D | Codeforces Round 450 (Div. 2) {900} | PROGRAMMING | Codeforces Round #450(Div. 2). Editorial. | 2100 | |
| 794 | Clear The Matrix | bitmasks dp | Statement | F | Educational Codeforces Round 34 (Rated for Div. 2) {903} | PROGRAMMING | Educational Codeforces Round 34 Editorial | 2400 | |
| 1546 | Party | bitmasks brute force dp graphs | Statement | C | Codeforces Round 454 (Div. 1, based on Technocup 2018 Elimination Round 4) {906} | PROGRAMMING | Editorial Codeforces Round 454 (and Technocup 2018 — Elimination Round 4) | 2300 | |
| 866 | New Year and Entity Enumeration | bitmasks combinatorics dp math | Statement | E | Good Bye 2017 {908} | PROGRAMMING | Good Bye 2017 Editorial | 2400 | |
| 14147 | New Year's Eve | bitmasks constructive algorithms number theory | Statement | B | Codeforces Round 456 (Div. 2) {912} | PROGRAMMING | Codeforces Round #456 (Div. 2) Editorial | 1400 | |
| 8525 | Party Lemonade | bitmasks dp greedy | Statement | C | Hello 2018 {913} | PROGRAMMING | Tutorial | 1600 | |
| 901 | Logical Expression | bitmasks dp shortest paths | Statement | E | Hello 2018 {913} | PROGRAMMING | Tutorial | 2400 | |
| 1988 | Palindromes in a Tree | bitmasks data structures divide and conquer trees | Statement | E | Codecraft-18 and Codeforces Round 458 (Div. 1 + Div. 2, combined) {914} | PROGRAMMING | Tutorial | 2400 | |
| 1231 | Sum the Fibonacci | bitmasks divide and conquer dp fft math | Statement | G | Codecraft-18 and Codeforces Round 458 (Div. 1 + Div. 2, combined) {914} | PROGRAMMING | Tutorial | 2500 | |
| 2477 | Substrings in a String | bitmasks brute force data structures string suffix structures strings | Statement | F | Codecraft-18 and Codeforces Round 458 (Div. 1 + Div. 2, combined) {914} | PROGRAMMING | Tutorial | 2900 | |
| 2027 | Jamie and Binary Sequence (changed after round) | bitmasks greedy math | Statement | B | Codeforces Round 457 (Div. 2) {916} | PROGRAMMING | Codeforces Round #457 (Div. 2) Editorial | 1700 | |
| 2044 | List Of Integers | binary search bitmasks brute force combinatorics math number theory | Statement | G | Educational Codeforces Round 37 (Rated for Div. 2) {920} | PROGRAMMING | T | 2300 | |
| 639 | Erasing Substrings | bitmasks dp greedy | Statement | F | Educational Codeforces Round 38 (Rated for Div. 2) {938} | PROGRAMMING | Educational Codeforces Round 38 — Editorial | 2600 | |
| 1178 | Shortest Path Queries | bitmasks data structures dsu graphs | Statement | G | Educational Codeforces Round 38 (Rated for Div. 2) {938} | PROGRAMMING | Educational Codeforces Round 38 — Editorial | 2900 | |
| 3783 | Mahmoud and Ehab and the xor-MST | bitmasks dp graphs implementation math | Statement | E | Codeforces Round 473 (Div. 2) {959} | PROGRAMMING | Codeforces round #473 editorial | 1900 | |
| 2930 | Mahmoud and Ehab and yet another xor task | bitmasks dp math matrices | Statement | F | Codeforces Round 473 (Div. 2) {959} | PROGRAMMING | Codeforces round #473 editorial | 2600 | |
| 4186 | Subsequence Counting | bitmasks constructive algorithms greedy implementation | Statement | C | Divide by Zero 2018 and Codeforces Round 474 (Div. 1 + Div. 2, combined) {960} | PROGRAMMING | Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined) Editorial | 1700 | |
| 5652 | Chessboard | bitmasks brute force implementation | Statement | C | Educational Codeforces Round 41 (Rated for Div. 2) {961} | PROGRAMMING | Educational Codeforces Round 41 Editorial | 1400 | |
| 2233 | Kuro and GCD and XOR and SUM | binary search bitmasks brute force data structures dp dsu greedy math number theory strings trees | Statement | D | Codeforces Round 482 (Div. 2) {979} | PROGRAMMING | 1750.0 | Codeforces Round #482 (Div. 2) Editorial | 2200 |
| 3581 | Bookshelves | bitmasks dp greedy | Statement | D | Avito Code Challenge 2018 {981} | PROGRAMMING | Avito Code Challenge 2018 — разбор | 1800 | |
| 2595 | Addition on Segments | bitmasks data structures divide and conquer dp | Statement | E | Avito Code Challenge 2018 {981} | PROGRAMMING | Avito Code Challenge 2018 — разбор | 2100 | |
| 2773 | AND Graph | bitmasks dfs and similar dsu graphs | Statement | C | Codeforces Round 485 (Div. 1) {986} | PROGRAMMING | Codeforces Round #485 Editorial | 2300 | |
| 2057 | Open Communication | bitmasks brute force | Statement | B | Codeforces Round 488 by NEAR (Div. 1) {993} | PROGRAMMING | Codeforces Round #488 editorial | 1900 | |
| 1833 | Careful Maneuvering | bitmasks brute force geometry | Statement | C | Codeforces Round 488 by NEAR (Div. 1) {993} | PROGRAMMING | Codeforces Round #488 editorial | 2100 | |
| 968 | Sonya and Bitwise OR | bitmasks data structures divide and conquer | Statement | F | Codeforces Round 495 (Div. 2) {1004} | PROGRAMMING | 60443 | 2900 | |
| 7188 | Xor-Paths | bitmasks brute force dp meet-in-the-middle | Statement | F | Codeforces Round 498 (Div. 3) {1006} | PROGRAMMING | 60672 | 2400 | |
| 1053 | Pave the Parallelepiped | bitmasks brute force combinatorics math number theory | Statement | B | Codeforces Round 497 (Div. 1) {1007} | PROGRAMMING | Editorial for Codeforces Round #497 by Skyglow | 2400 | |
| 1088 | Allowed Letters | bitmasks flows graph matchings graphs greedy | Statement | G | Educational Codeforces Round 47 (Rated for Div. 2) {1009} | PROGRAMMING | 60630 | 2500 | |
| 360 | Appropriate Team | bitmasks math number theory | Statement | G | Educational Codeforces Round 48 (Rated for Div. 2) {1016} | PROGRAMMING | Разбор Educational Codeforces Round 48 | 2800 | |
| 4018 | The Wu | bitmasks brute force data structures | Statement | D | Codeforces Round 502 (in memory of Leopoldo Taravilse, Div. 1 + Div. 2) {1017} | PROGRAMMING | Разбор (англ.) | 1900 | |
| 381 | X-mouse in the Campus | bitmasks math number theory | Statement | G | Educational Codeforces Round 49 (Rated for Div. 2) {1027} | PROGRAMMING | Educational Codeforces Round 49 Editorial | 2800 | |
| 3383 | Vasya and Good Sequences | bitmasks dp | Statement | E | Technocup 2019 - Elimination Round 1 {1030} | PROGRAMMING | Сodeforces Round 512 (and Technocup — Elimination Round 1) Editorial | 2100 | |
| 489 | Boolean Computer | bitmasks brute force fft math | Statement | F | Lyft Level 5 Challenge 2018 - Elimination Round {1033} | PROGRAMMING | The Lyft Level 5 Challenge 2018 Elimination Round (Div. 1 + Div. 2) Editorial | 2800 | |
| 809 | Little C Loves 3 III | bitmasks dp math | Statement | E | Codeforces Round 511 (Div. 1) {1034} | PROGRAMMING | Codeforces Round #511 Editorial | 3200 | |
| 456 | Sources and Sinks | bitmasks brute force dfs and similar | Statement | G | Educational Codeforces Round 50 (Rated for Div. 2) {1036} | PROGRAMMING | 61727 | 2800 | |
| 1140 | Maximum Matching | bitmasks brute force dfs and similar dp graphs | Statement | E | Codeforces Round 508 (Div. 2) {1038} | PROGRAMMING | Tutorial | 2400 | |
| 19525 | Vitamins | bitmasks brute force dp implementation | Statement | B | Codeforces Round 510 (Div. 2) {1042} | PROGRAMMING | Tutorial | 1200 | |
| 3106 | Make It One | bitmasks combinatorics dp math number theory shortest paths | Statement | F | Codeforces Round 519 by Botan Investments {1043} | PROGRAMMING | Codeforces Round #519 Editorial | 2500 | |
| 8241 | Bicolorings | bitmasks dp | Statement | D | Educational Codeforces Round 51 (Rated for Div. 2) {1051} | PROGRAMMING | Educational Codeforces Round 51 Editorial | 1700 | |
| 3754 | Segment Sum | bitmasks combinatorics dp math | Statement | E | Educational Codeforces Round 53 (Rated for Div. 2) {1073} | PROGRAMMING | 62742 | 2300 | |
| 3222 | Ehab and another another xor problem | bitmasks constructive algorithms implementation interactive | Statement | D | Codeforces Round 525 (Div. 2) {1088} | PROGRAMMING | Codeforces round #525 editorial | 2000 | |
| 2265 | Multidimensional Queries | bitmasks data structures | Statement | G | Educational Codeforces Round 56 (Rated for Div. 2) {1093} | PROGRAMMING | 63877 | 2200 | |
| 20086 | Powers Of Two | bitmasks greedy | Statement | C | Codeforces Round 529 (Div. 3) {1095} | PROGRAMMING | Codeforces Round #529 (Div. 3) Editorial | 1400 | |
| 36881 | Petr and a Combination Lock | bitmasks brute force dp | Statement | B | Hello 2019 {1097} | PROGRAMMING | 64310 | 1200 | |
| 1511 | Alex and a TV Show | bitmasks combinatorics number theory | Statement | F | Hello 2019 {1097} | PROGRAMMING | 64310 | 2400 | |
| 234 | Mateusz and an Infinite Sequence | bitmasks brute force dp strings | Statement | H | Hello 2019 {1097} | PROGRAMMING | 64310 | 3000 | |
| 2418 | Elongated Matrix | binary search bitmasks brute force dp graphs | Statement | F | Codeforces Round 531 (Div. 3) {1102} | PROGRAMMING | 64439 | 2400 | |
| 532 | Professional layer | bitmasks dp | Statement | D | Codeforces Round 534 (Div. 1) {1103} | PROGRAMMING | Codeforces Round #534 — Editorial | 3000 | |
| 1941 | Helping Hiasat | bitmasks brute force dp meet-in-the-middle | Statement | E | Codeforces Round 533 (Div. 2) {1105} | PROGRAMMING | Tutorial | 2200 | |
| 2541 | 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 | |
| 1661 | 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 | |
| 699 | Crisp String | bitmasks dp | Statement | F | Educational Codeforces Round 60 (Rated for Div. 2) {1117} | PROGRAMMING | 65365 | 2600 | |
| 4455 | Median String | bitmasks math number theory strings | Statement | E | Codeforces Round 550 (Div. 3) {1144} | PROGRAMMING | 66307 | 1900 | |
| 837 | Mystery Circuit | bitmasks brute force | Statement | C | April Fools Day Contest 2019 {1145} | PROGRAMMING | 66327 | ||
| 4257 | Tree Diameter | bitmasks graphs interactive | Statement | C | Forethought Future Cup - Elimination Round {1146} | PROGRAMMING | 66639 | 1700 | |
| 1068 | Hot is Cold | bitmasks data structures divide and conquer implementation | Statement | E | Forethought Future Cup - Elimination Round {1146} | PROGRAMMING | 66639 | 2400 | |
| 1153 | Foo Fighters | bitmasks constructive algorithms | Statement | F | Codeforces Global Round 3 {1148} | PROGRAMMING | Codeforces Global Round 3 Editorial | 2500 | |
| 13075 | Dima and a Bad XOR | bitmasks brute force constructive algorithms dp | Statement | B | Codeforces Round 553 (Div. 2) {1151} | PROGRAMMING | Codeforces Round #553 (Div. 2) Editorial | 1600 | |
| 9401 | Neko Performs Cat Furrier Transform | bitmasks constructive algorithms dfs and similar math | Statement | B | Codeforces Round 554 (Div. 2) {1152} | PROGRAMMING | T | 1300 | |
| 783 | Neko Rules the Catniverse (Small Version) | bitmasks dp matrices | Statement | F1 | Codeforces Round 554 (Div. 2) {1152} | PROGRAMMING | T | 2900 | |
| 999 | Neko Rules the Catniverse (Large Version) | bitmasks dp matrices | Statement | F2 | Codeforces Round 554 (Div. 2) {1152} | PROGRAMMING | T | 2900 | |
| 1047 | Magical Permutation | bitmasks brute force constructive algorithms data structures graphs math | Statement | E | Codeforces Round 558 (Div. 2) {1163} | PROGRAMMING | 66943 | 2800 | |
| 3032 | The LCMs Must be Large | bitmasks brute force constructive algorithms math number theory | Statement | E | Codeforces Round 561 (Div. 2) {1166} | PROGRAMMING | Codeforces Round #561 (Div. 2) Editorial | 2000 | |
| 2760 | And Reachability | bitmasks dp | Statement | C | Codeforces Round 562 (Div. 1) {1168} | PROGRAMMING | Codeforces Round #562 — Editorial | 2400 | |
| 5106 | Ehab and the Expected XOR Problem | bitmasks constructive algorithms | Statement | D | Codeforces Round 563 (Div. 2) {1174} | PROGRAMMING | Codeforces round #563 editorial | 1900 | |
| 3249 | Playlist for Polycarp (easy version) | bitmasks combinatorics dp | Statement | G1 | Codeforces Round 568 (Div. 2) {1185} | PROGRAMMING | Editorial for Codeforces Round #568 (Div. 2) | 2100 | |
| 2268 | Two Pizzas | bitmasks brute force | Statement | F | Codeforces Round 568 (Div. 2) {1185} | PROGRAMMING | Editorial for Codeforces Round #568 (Div. 2) | 2200 | |
| 2090 | Count The Rectangles | bitmasks brute force data structures geometry sortings | Statement | E | Educational Codeforces Round 68 (Rated for Div. 2) {1194} | PROGRAMMING | Разбор Educational Codeforces Round 68 | 2200 | |
| 10864 | You Are Given Two Binary Strings... | bitmasks greedy | Statement | A | Educational Codeforces Round 70 (Rated for Div. 2) {1202} | PROGRAMMING | 68972 | 1100 | |
| 7589 | Shortest Cycle | bitmasks brute force graphs shortest paths | Statement | B | Codeforces Round 580 (Div. 1) {1205} | PROGRAMMING | 69158 | 1900 | |
| 6707 | XOR Guessing | bitmasks interactive math | Statement | E | Educational Codeforces Round 71 (Rated for Div. 2) {1207} | PROGRAMMING | Educational Codeforces Round 71 Editorial | 1800 | |
| 3439 | Bits And Pieces | bitmasks dfs and similar dp greedy | Statement | F | Manthan, Codefest 19 (open for everyone, rated, Div. 1 + Div. 2) {1208} | PROGRAMMING | 69357 | 2600 | |
| 3286 | Rotate Columns (easy version) | bitmasks brute force dp greedy sortings | Statement | E1 | Codeforces Round 584 - Dasha Code Championship - Elimination Round (rated, open for everyone, Div. 1 + Div. 2) {1209} | PROGRAMMING | 69791 | 2000 | |
| 2363 | Rotate Columns (hard version) | bitmasks dp greedy sortings | Statement | E2 | Codeforces Round 584 - Dasha Code Championship - Elimination Round (rated, open for everyone, Div. 1 + Div. 2) {1209} | PROGRAMMING | 69791 | 2400 | |
| 376 | Feeling Good | bitmasks data structures | Statement | G | Codeforces Round 583 (Div. 1 + Div. 2, based on Olympiad of Metropolises) {1214} | PROGRAMMING | Tutorial | 3100 | |
| 3501 | Marbles | bitmasks dp | Statement | E | Codeforces Round 585 (Div. 2) {1215} | PROGRAMMING | Codeforces Round #585 Editorial | 2200 | |
| 7896 | The Number Of Good Substrings | binary search bitmasks brute force | Statement | C | Educational Codeforces Round 72 (Rated for Div. 2) {1217} | PROGRAMMING | Educational Codeforces Round 72 Editorial | 1600 | |
| 4148 | Alex and Julian | bitmasks math number theory | Statement | D | Codeforces Round 586 (Div. 1 + Div. 2) {1220} | PROGRAMMING | Codeforces Round #586 Editorial | 1900 | |
| 943 | Graph And Numbers | bitmasks brute force combinatorics dp meet-in-the-middle | Statement | G | Educational Codeforces Round 73 (Rated for Div. 2) {1221} | PROGRAMMING | Разбор Educational Codeforces Round 73 | 2900 | |
| 9859 | p-binary | bitmasks brute force math | Statement | C | Technocup 2020 - Elimination Round 2 {1225} | PROGRAMMING | 70898 | 1600 | |
| 665 | To Make 1 | bitmasks constructive algorithms dp greedy number theory | Statement | G | Technocup 2020 - Elimination Round 2 {1225} | PROGRAMMING | 70898 | 3000 | |
| 3008 | Yet Another Substring Reverse | bitmasks dp | Statement | F | Codeforces Round 590 (Div. 3) {1234} | PROGRAMMING | Codeforces Round #590 (Div. 3) Editorial | 2400 | |
| 3552 | Keyboard Purchase | bitmasks dp | Statement | E | Educational Codeforces Round 74 (Rated for Div. 2) {1238} | PROGRAMMING | Educational Codeforces Round 74 Editorial | 2200 | |
| 1977 | Sum Balance | bitmasks dfs and similar dp graphs | Statement | C | Codeforces Round 599 (Div. 1) {1242} | PROGRAMMING | Codeforces Round #599 Editorial | 2400 | |
| 2303 | Daniel and Spring Cleaning | bitmasks brute force combinatorics dp | Statement | F | Codeforces Round 597 (Div. 2) {1245} | PROGRAMMING | Codeforces Round #597 (Div. 2) Editorial | 2300 | |
| 2404 | Make Them Similar | bitmasks brute force hashing meet-in-the-middle | Statement | F | Educational Codeforces Round 76 (Rated for Div. 2) {1257} | PROGRAMMING | Educational Codeforces Round 76 Editorial | 2400 | |
| 495 | Xor-Set | bitmasks divide and conquer math | Statement | F | Codeforces Round 602 (Div. 1, based on Technocup 2020 Elimination Round 3) {1261} | PROGRAMMING | Tutorial | 3100 | |
| 15173 | Make Good | bitmasks constructive algorithms math | Statement | C | Good Bye 2019 {1270} | PROGRAMMING | Разбор Goodbye 2019 | 1500 | |
| 8711 | Dr. Evil Underscores | bitmasks brute force dfs and similar divide and conquer dp greedy strings trees | Statement | D | Codeforces Round 613 (Div. 2) {1285} | PROGRAMMING | Codeforces Round #613 (Div. 2) Editorial | 1800 | |
| 8490 | Minimax Problem | binary search bitmasks | Statement | D | Educational Codeforces Round 80 (Rated for Div. 2) {1288} | PROGRAMMING | Educational Codeforces Round 80 Editorial | 2000 | |
| 418 | Nora's Toy Boxes | bitmasks combinatorics dp | Statement | F | Codeforces Round 614 (Div. 1) {1292} | PROGRAMMING | 2750.0 | Codeforces Round #614 Editorial | 3400 |
| 615 | Around the World | bitmasks combinatorics dfs and similar dp graphs graphs math trees | Statement | D | Codeforces Round 618 (Div. 1) {1299} | PROGRAMMING | 1750.0 | Codeforces Round #618 Editorial | 2900 |
| 76 | Keep talking and nobody explodes -- easy | bitmasks brute force expression parsing | Statement | F | AIM Tech Poorly Prepared Contest (unrated, funny, Div. 1 preferred) {1302} | PROGRAMMING | 73599 | ||
| 7862 | Fill The Bag | bitmasks greedy | Statement | D | Educational Codeforces Round 82 (Rated for Div. 2) {1303} | PROGRAMMING | Educational Codeforces Round 82 | 1800 | |
| 1431 | Kuroni and Antihype | bitmasks dp dsu graphs | Statement | G | Ozon Tech Challenge 2020 (Div.1 + Div.2, Rated, T-shirts + prizes!) {1305} | PROGRAMMING | 3250.0 | Ozon Tech Challenge 2020 Editorial | 3300 |
| 18502 | Adding Powers | bitmasks greedy implementation math number theory ternary search | Statement | C | Educational Codeforces Round 83 (Rated for Div. 2) {1312} | PROGRAMMING | 74640 | ||
| 1562 | Happy New Year | bitmasks dp implementation | Statement | D | Codeforces Round 622 (Div. 2) {1313} | PROGRAMMING | 2000.0 | Editorial | 2600 |
| 5650 | Team Building | bitmasks dp greedy sortings | Statement | E | CodeCraft-20 (Div. 2) {1316} | PROGRAMMING | 2250.0 | Codecraft-20 (Div.2) Editorial | 2300 |
| 4702 | Present | binary search bitmasks constructive algorithms data structures math sortings | Statement | B | Codeforces Round 626 (Div. 1, based on Moscow Open Olympiad in Informatics) {1322} | PROGRAMMING | 1000.0 | Codeforces Round #626 Editorial | |
| 906 | Reality Show | bitmasks dp | Statement | D | Codeforces Round 626 (Div. 1, based on Moscow Open Olympiad in Informatics) {1322} | PROGRAMMING | 2000.0 | Codeforces Round #626 Editorial | |
| 13778 | Ehab the Xorcist | bitmasks constructive algorithms greedy number theory | Statement | D | Codeforces Round 628 (Div. 2) {1325} | PROGRAMMING | 1750.0 | 74235 | 1700 |
| 1048 | Wise Men (Easy Version) | bitmasks brute force dp meet-in-the-middle | Statement | F1 | Codeforces Global Round 7 {1326} | PROGRAMMING | 2000.0 | 74961 | 2600 |
| 724 | Wise Men (Hard Version) | bitmasks dp math | Statement | F2 | Codeforces Global Round 7 {1326} | PROGRAMMING | 1500.0 | 74961 | 3200 |
| 2107 | AND Segments | bitmasks combinatorics data structures dp two pointers | Statement | F | Educational Codeforces Round 84 (Rated for Div. 2) {1327} | PROGRAMMING | Educational Codeforces Round 84 Editorial | 2500 | |
| 570 | Letters and Question Marks | bitmasks dp string suffix structures | Statement | G | Educational Codeforces Round 84 (Rated for Div. 2) {1327} | PROGRAMMING | Educational Codeforces Round 84 Editorial | 2900 | |
| 7182 | Dreamoon Likes Sequences | bitmasks combinatorics dp math | Statement | B | Codeforces Round 631 (Div. 1) - Thanks, Denis aramis Shitov! {1329} | PROGRAMMING | 750.0 | Codeforces Round #631 Editorial | 1900 |
| 3217 | ...And after happily lived ever they | bitmasks | Statement | C | April Fools Day Contest 2020 {1331} | PROGRAMMING | April Fools Day Contest 2020: editorial | ||
| 8471 | Walk on Matrix | bitmasks constructive algorithms math | Statement | D | Codeforces Round 630 (Div. 2) {1332} | PROGRAMMING | 1250.0 | Codeforces Round #630 Editorial | 1700 |
| 883 | Chiori and Doll Picking (easy version) | bitmasks brute force combinatorics math | Statement | E1 | Codeforces Round 635 (Div. 1) {1336} | PROGRAMMING | 1750.0 | Codeforces Round #635 Editorial | 2600 |
| 605 | Chiori and Doll Picking (hard version) | bitmasks brute force combinatorics math | Statement | E2 | Codeforces Round 635 (Div. 1) {1336} | PROGRAMMING | 1500.0 | Codeforces Round #635 Editorial | 3400 |
| 3482 | Perfect Triples | bitmasks brute force constructive algorithms divide and conquer greedy implementation math | Statement | C | Codeforces Round 633 (Div. 1) {1338} | PROGRAMMING | 1500.0 | Editorial | |
| 9664 | Edge Weight Assignment | bitmasks constructive algorithms greedy math trees | Statement | B | Codeforces Round 633 (Div. 1) {1338} | PROGRAMMING | 1000.0 | Editorial | |
| 8348 | Nastya and Scoreboard | bitmasks dp greedy | Statement | B | Codeforces Round 637 (Div. 1) - Thanks, Ivan Belonogov! {1340} | PROGRAMMING | 750.0 | Codeforces Round #637 Editorial | |
| 1044 | Make It Ascending | bitmasks brute force dp | Statement | F | Educational Codeforces Round 86 (Rated for Div. 2) {1342} | PROGRAMMING | 76633 | 2900 |