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 ... 16 17 18 19 20 ... 43 44 45 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 8604 | Micro-World | greedy sortings | Statement | B | Educational Codeforces Round 45 (Rated for Div. 2) {990} | PROGRAMMING | Educational Codeforces Round 45 Editorial | 1200 | |
| 6291 | Bracket Sequences Concatenation Problem | implementation | Statement | C | Educational Codeforces Round 45 (Rated for Div. 2) {990} | PROGRAMMING | Educational Codeforces Round 45 Editorial | 1500 | |
| 4110 | Graph And Its Complement | constructive algorithms graphs implementation | Statement | D | Educational Codeforces Round 45 (Rated for Div. 2) {990} | PROGRAMMING | Educational Codeforces Round 45 Editorial | 1700 | |
| 2163 | Post Lamps | brute force greedy | Statement | E | Educational Codeforces Round 45 (Rated for Div. 2) {990} | PROGRAMMING | Educational Codeforces Round 45 Editorial | 2000 | |
| 2300 | GCD Counting | divide and conquer dp dsu number theory trees | Statement | G | Educational Codeforces Round 45 (Rated for Div. 2) {990} | PROGRAMMING | Educational Codeforces Round 45 Editorial | 2400 | |
| 1056 | Flow Control | dfs and similar dp greedy trees | Statement | F | Educational Codeforces Round 45 (Rated for Div. 2) {990} | PROGRAMMING | Educational Codeforces Round 45 Editorial | 2500 | |
| 11224 | If at first you don't succeed... | implementation | Statement | A | Codeforces Round 491 (Div. 2) {991} | PROGRAMMING | 60181 | 1100 | |
| 13724 | Getting an A | greedy sortings | Statement | B | Codeforces Round 491 (Div. 2) {991} | PROGRAMMING | 60181 | 1100 | |
| 11495 | Candies | binary search implementation | Statement | C | Codeforces Round 491 (Div. 2) {991} | PROGRAMMING | 60181 | 1500 | |
| 7730 | Bishwock | dp greedy | Statement | D | Codeforces Round 491 (Div. 2) {991} | PROGRAMMING | 60181 | 1500 | |
| 3726 | Bus Number | brute force combinatorics math | Statement | E | Codeforces Round 491 (Div. 2) {991} | PROGRAMMING | 60181 | 1800 | |
| 340 | Concise and clear | brute force greedy implementation math | Statement | F | Codeforces Round 491 (Div. 2) {991} | PROGRAMMING | 60181 | 2800 | |
| 6753 | Nastya Studies Informatics | math number theory | Statement | B | Codeforces Round 489 (Div. 2) {992} | PROGRAMMING | 60083 | 1700 | |
| 4867 | Nastya and a Wardrobe | math | Statement | C | Codeforces Round 489 (Div. 2) {992} | PROGRAMMING | 60083 | 1700 | |
| 1751 | Nastya and a Game | brute force implementation math | Statement | D | Codeforces Round 489 (Div. 2) {992} | PROGRAMMING | 60083 | 2100 | |
| 1676 | Nastya and King-Shamans | binary search data structures | Statement | E | Codeforces Round 489 (Div. 2) {992} | PROGRAMMING | 60083 | 2600 | |
| 14312 | Nastya and an Array | implementation sortings | Statement | A | Codeforces Round 489 (Div. 2) {992} | PROGRAMMING | 60083 | 900 | |
| 4455 | Two Squares | geometry implementation | Statement | A | Codeforces Round 488 by NEAR (Div. 1) {993} | PROGRAMMING | Codeforces Round #488 editorial | 1700 | |
| 2052 | Open Communication | bitmasks brute force | Statement | B | Codeforces Round 488 by NEAR (Div. 1) {993} | PROGRAMMING | Codeforces Round #488 editorial | 1900 | |
| 1808 | Careful Maneuvering | bitmasks brute force geometry | Statement | C | Codeforces Round 488 by NEAR (Div. 1) {993} | PROGRAMMING | Codeforces Round #488 editorial | 2100 | |
| 1778 | Nikita and Order Statistics | chinese remainder theorem fft math | Statement | E | Codeforces Round 488 by NEAR (Div. 1) {993} | PROGRAMMING | Codeforces Round #488 editorial | 2300 | |
| 835 | Compute Power | binary search dp greedy | Statement | D | Codeforces Round 488 by NEAR (Div. 1) {993} | PROGRAMMING | Codeforces Round #488 editorial | 2400 | |
| 67 | The Moral Dilemma | Statement | F | Codeforces Round 488 by NEAR (Div. 1) {993} | PROGRAMMING | Codeforces Round #488 editorial | 3100 | ||
| 6044 | Knights of a Polygonal Table | greedy implementation sortings | Statement | B | Codeforces Round 488 by NEAR (Div. 2) {994} | PROGRAMMING | Codeforces Round #488 editorial | 1400 | |
| 15208 | Fingerprints | implementation | Statement | A | Codeforces Round 488 by NEAR (Div. 2) {994} | PROGRAMMING | Codeforces Round #488 editorial | 700 | |
| 7440 | Suit and Tie | greedy implementation math | Statement | B | Codeforces Round 492 (Div. 1) [Thanks, uDebug!] {995} | PROGRAMMING | Editorial for Codeforces Round #492 [Thanks u-Debug!] | 1500 | |
| 1806 | Tesla | constructive algorithms implementation | Statement | A | Codeforces Round 492 (Div. 1) [Thanks, uDebug!] {995} | PROGRAMMING | Editorial for Codeforces Round #492 [Thanks u-Debug!] | 2100 | |
| 2051 | Leaving the Bar | brute force data structures geometry greedy math sortings | Statement | C | Codeforces Round 492 (Div. 1) [Thanks, uDebug!] {995} | PROGRAMMING | Editorial for Codeforces Round #492 [Thanks u-Debug!] | 2200 | |
| 899 | Game | math | Statement | D | Codeforces Round 492 (Div. 1) [Thanks, uDebug!] {995} | PROGRAMMING | Editorial for Codeforces Round #492 [Thanks u-Debug!] | 2400 | |
| 926 | Number Clicker | divide and conquer graphs meet-in-the-middle number theory | Statement | E | Codeforces Round 492 (Div. 1) [Thanks, uDebug!] {995} | PROGRAMMING | Editorial for Codeforces Round #492 [Thanks u-Debug!] | 2700 | |
| 1608 | Cowmpany Cowmpensation | combinatorics dp math trees | Statement | F | Codeforces Round 492 (Div. 1) [Thanks, uDebug!] {995} | PROGRAMMING | Editorial for Codeforces Round #492 [Thanks u-Debug!] | 2700 | |
| 9896 | World Cup | binary search math | Statement | B | Codeforces Round 492 (Div. 2) [Thanks, uDebug!] {996} | PROGRAMMING | Editorial for Codeforces Round #492 [Thanks u-Debug!] | 1300 | |
| 117923 | Hit the Lottery | dp greedy | Statement | A | Codeforces Round 492 (Div. 2) [Thanks, uDebug!] {996} | PROGRAMMING | Editorial for Codeforces Round #492 [Thanks u-Debug!] | 600 | |
| 8658 | Convert to Ones | brute force greedy implementation math | Statement | A | Codeforces Round 493 (Div. 1) {997} | PROGRAMMING | 60357 | 1500 | |
| 3135 | Roman Digits | brute force combinatorics dp greedy math | Statement | B | Codeforces Round 493 (Div. 1) {997} | PROGRAMMING | 60357 | 2000 | |
| 2174 | Sky Full of Stars | combinatorics math | Statement | C | Codeforces Round 493 (Div. 1) {997} | PROGRAMMING | 60357 | 2600 | |
| 517 | Cycles in product | combinatorics divide and conquer trees | Statement | D | Codeforces Round 493 (Div. 1) {997} | PROGRAMMING | 60357 | 2800 | |
| 1660 | Good Subsegments | data structures | Statement | E | Codeforces Round 493 (Div. 1) {997} | PROGRAMMING | 60357 | 3000 | |
| 10095 | Balloons | constructive algorithms implementation | Statement | A | Codeforces Round 493 (Div. 2) {998} | PROGRAMMING | Codeforces Round #493 — Editorial | 1000 | |
| 14386 | Cutting | dp greedy sortings | Statement | B | Codeforces Round 493 (Div. 2) {998} | PROGRAMMING | Codeforces Round #493 — Editorial | 1200 | |
| 20927 | Alphabetic Removals | implementation | Statement | C | Codeforces Round 490 (Div. 3) {999} | PROGRAMMING | 60138 | 1200 | |
| 7816 | Reachability from the Capital | dfs and similar graphs greedy | Statement | E | Codeforces Round 490 (Div. 3) {999} | PROGRAMMING | 60138 | 1900 | |
| 4890 | Equalize the Remainders | data structures greedy implementation | Statement | D | Codeforces Round 490 (Div. 3) {999} | PROGRAMMING | 60138 | 1900 | |
| 3262 | Cards and Joy | dp | Statement | F | Codeforces Round 490 (Div. 3) {999} | PROGRAMMING | 60138 | 2200 | |
| 25302 | Mishka and Contest | brute force implementation | Statement | A | Codeforces Round 490 (Div. 3) {999} | PROGRAMMING | 60138 | 800 | |
| 19412 | Reversing Encryption | implementation | Statement | B | Codeforces Round 490 (Div. 3) {999} | PROGRAMMING | 60138 | 900 | |
| 9362 | Codehorses T-shirts | greedy implementation | Statement | A | Educational Codeforces Round 46 (Rated for Div. 2) {1000} | PROGRAMMING | 60288 | 1200 | |
| 6160 | Light It Up | greedy | Statement | B | Educational Codeforces Round 46 (Rated for Div. 2) {1000} | PROGRAMMING | 60288 | 1600 | |
| 8371 | Covered Points Count | data structures implementation sortings | Statement | C | Educational Codeforces Round 46 (Rated for Div. 2) {1000} | PROGRAMMING | 60288 | 1700 | |
| 5032 | Yet Another Problem On a Subsequence | combinatorics dp | Statement | D | Educational Codeforces Round 46 (Rated for Div. 2) {1000} | PROGRAMMING | 60288 | 1900 | |
| 6476 | We Need More Bosses | dfs and similar graphs trees | Statement | E | Educational Codeforces Round 46 (Rated for Div. 2) {1000} | PROGRAMMING | 60288 | 2100 | |
| 4826 | One Occurrence | data structures divide and conquer | Statement | F | Educational Codeforces Round 46 (Rated for Div. 2) {1000} | PROGRAMMING | 60288 | 2400 | |
| 714 | Two-Paths | data structures dp trees | Statement | G | Educational Codeforces Round 46 (Rated for Div. 2) {1000} | PROGRAMMING | 60288 | 2800 | |
| 721 | Generate Bell state | *special | Statement | B | Microsoft Q# Coding Contest - Summer 2018 - Warmup {1001} | PROGRAMMING | Full editorial | 2000 | |
| 1040 | Generate plus state or minus state | *special | Statement | A | Microsoft Q# Coding Contest - Summer 2018 - Warmup {1001} | PROGRAMMING | Full editorial | 2200 | |
| 666 | Generate GHZ state | *special | Statement | C | Microsoft Q# Coding Contest - Summer 2018 - Warmup {1001} | PROGRAMMING | Full editorial | 2300 | |
| 696 | Distinguish plus state and minus state | *special | Statement | D | Microsoft Q# Coding Contest - Summer 2018 - Warmup {1001} | PROGRAMMING | Full editorial | 2300 | |
| 550 | Distinguish multi-qubit basis states | *special | Statement | F | Microsoft Q# Coding Contest - Summer 2018 - Warmup {1001} | PROGRAMMING | Full editorial | 2400 | |
| 568 | Distinguish Bell states | *special | Statement | E | Microsoft Q# Coding Contest - Summer 2018 - Warmup {1001} | PROGRAMMING | Full editorial | 2400 | |
| 546 | Oracle for f(x) = parity of the number of 1s in x | *special | Statement | H | Microsoft Q# Coding Contest - Summer 2018 - Warmup {1001} | PROGRAMMING | Full editorial | 2500 | |
| 552 | Oracle for f(x) = k-th element of x | *special | Statement | G | Microsoft Q# Coding Contest - Summer 2018 - Warmup {1001} | PROGRAMMING | Full editorial | 2500 | |
| 413 | Deutsch-Jozsa algorithm | *special | Statement | I | Microsoft Q# Coding Contest - Summer 2018 - Warmup {1001} | PROGRAMMING | Full editorial | 2700 | |
| 570 | Generate superposition of zero state and a basis state | Statement | A2 | Microsoft Q# Coding Contest - Summer 2018 {1002} | PROGRAMMING | Editorial | 1900 | ||
| 483 | Generate superposition of two basis states | Statement | A3 | Microsoft Q# Coding Contest - Summer 2018 {1002} | PROGRAMMING | Editorial | 1900 | ||
| 928 | Generate superposition of all basis states | Statement | A1 | Microsoft Q# Coding Contest - Summer 2018 {1002} | PROGRAMMING | Editorial | 1900 | ||
| 488 | Distinguish zero state and W state | Statement | B1 | Microsoft Q# Coding Contest - Summer 2018 {1002} | PROGRAMMING | Editorial | 2000 | ||
| 418 | Oracle for f(x) = b * x mod 2 | Statement | D1 | Microsoft Q# Coding Contest - Summer 2018 {1002} | PROGRAMMING | Editorial | 2100 | ||
| 390 | Oracle for f(x) = b * x + (1 - b) * (1 - x) mod 2 | Statement | D2 | Microsoft Q# Coding Contest - Summer 2018 {1002} | PROGRAMMING | Editorial | 2100 | ||
| 455 | Distinguish GHZ state and W state | Statement | B2 | Microsoft Q# Coding Contest - Summer 2018 {1002} | PROGRAMMING | Editorial | 2100 | ||
| 421 | Distinguish four 2-qubit states | Statement | B3 | Microsoft Q# Coding Contest - Summer 2018 {1002} | PROGRAMMING | Editorial | 2100 | ||
| 329 | Bernstein-Vazirani algorithm | Statement | E1 | Microsoft Q# Coding Contest - Summer 2018 {1002} | PROGRAMMING | Editorial | 2100 | ||
| 341 | Oracle for majority function | Statement | D3 | Microsoft Q# Coding Contest - Summer 2018 {1002} | PROGRAMMING | Editorial | 2200 | ||
| 317 | Distinguish four 2-qubit states - 2 | Statement | B4 | Microsoft Q# Coding Contest - Summer 2018 {1002} | PROGRAMMING | Editorial | 2200 | ||
| 309 | Distinguish zero state and plus state with minimum error | Statement | C1 | Microsoft Q# Coding Contest - Summer 2018 {1002} | PROGRAMMING | Editorial | 2300 | ||
| 274 | Generate W state | Statement | A4 | Microsoft Q# Coding Contest - Summer 2018 {1002} | PROGRAMMING | Editorial | 2400 | ||
| 273 | Distinguish zero state and plus state without errors | Statement | C2 | Microsoft Q# Coding Contest - Summer 2018 {1002} | PROGRAMMING | Editorial | 2400 | ||
| 209 | Another array reconstruction algorithm | Statement | E2 | Microsoft Q# Coding Contest - Summer 2018 {1002} | PROGRAMMING | Editorial | 2400 | ||
| 11495 | Intense Heat | brute force implementation math | Statement | C | Codeforces Round 494 (Div. 3) {1003} | PROGRAMMING | 60417 | 1300 | |
| 12195 | Binary String Constructing | constructive algorithms | Statement | B | Codeforces Round 494 (Div. 3) {1003} | PROGRAMMING | 60417 | 1300 | |
| 8548 | Coins and Queries | greedy | Statement | D | Codeforces Round 494 (Div. 3) {1003} | PROGRAMMING | 60417 | 1600 | |
| 3027 | Tree Constructing | constructive algorithms graphs | Statement | E | Codeforces Round 494 (Div. 3) {1003} | PROGRAMMING | 60417 | 2200 | |
| 1600 | Abbreviation | dp hashing strings | Statement | F | Codeforces Round 494 (Div. 3) {1003} | PROGRAMMING | 60417 | 2400 | |
| 29925 | Polycarp's Pockets | implementation | Statement | A | Codeforces Round 494 (Div. 3) {1003} | PROGRAMMING | 60417 | 700 | |
| 7878 | Sonya and Robots | constructive algorithms implementation | Statement | C | Codeforces Round 495 (Div. 2) {1004} | PROGRAMMING | 60443 | 1400 | |
| 9932 | Sonya and Exhibition | constructive algorithms greedy implementation math | Statement | B | Codeforces Round 495 (Div. 2) {1004} | PROGRAMMING | 60443 | 1400 | |
| 1497 | Sonya and Matrix | brute force constructive algorithms implementation | Statement | D | Codeforces Round 495 (Div. 2) {1004} | PROGRAMMING | 60443 | 2200 | |
| 1233 | Sonya and Ice Cream | binary search data structures dp greedy shortest paths trees | Statement | E | Codeforces Round 495 (Div. 2) {1004} | PROGRAMMING | 60443 | 2400 | |
| 927 | Sonya and Bitwise OR | bitmasks data structures divide and conquer | Statement | F | Codeforces Round 495 (Div. 2) {1004} | PROGRAMMING | 60443 | 2900 | |
| 11834 | Sonya and Hotels | implementation | Statement | A | Codeforces Round 495 (Div. 2) {1004} | PROGRAMMING | 60443 | 900 | |
| 27329 | Delete from the Left | brute force implementation strings | Statement | B | Codeforces Round 496 (Div. 3) {1005} | PROGRAMMING | Codeforces Round 496 (Div. 3): Problem Tutorials | 1000 | |
| 13015 | Summarize to the Power of Two | brute force greedy implementation | Statement | C | Codeforces Round 496 (Div. 3) {1005} | PROGRAMMING | Codeforces Round 496 (Div. 3): Problem Tutorials | 1400 | |
| 11269 | Polycarp and Div 3 | dp greedy number theory | Statement | D | Codeforces Round 496 (Div. 3) {1005} | PROGRAMMING | Codeforces Round 496 (Div. 3): Problem Tutorials | 1500 | |
| 4339 | Median on Segments (Permutations Edition) | sortings | Statement | E1 | Codeforces Round 496 (Div. 3) {1005} | PROGRAMMING | Codeforces Round 496 (Div. 3): Problem Tutorials | 1900 | |
| 2098 | Berland and the Shortest Paths | brute force dfs and similar graphs shortest paths | Statement | F | Codeforces Round 496 (Div. 3) {1005} | PROGRAMMING | Codeforces Round 496 (Div. 3): Problem Tutorials | 2400 | |
| 1530 | Median on Segments (General Case Edition) | sortings | Statement | E2 | Codeforces Round 496 (Div. 3) {1005} | PROGRAMMING | Codeforces Round 496 (Div. 3): Problem Tutorials | 2600 | |
| 26965 | Tanya and Stairways | implementation | Statement | A | Codeforces Round 496 (Div. 3) {1005} | PROGRAMMING | Codeforces Round 496 (Div. 3): Problem Tutorials | 700 | |
| 14636 | Polycarp's Practice | greedy implementation sortings | Statement | B | Codeforces Round 498 (Div. 3) {1006} | PROGRAMMING | 60672 | 1200 | |
| 25215 | Three Parts of the Array | binary search data structures two pointers | Statement | C | Codeforces Round 498 (Div. 3) {1006} | PROGRAMMING | 60672 | 1300 | |
| 11588 | Military Problem | dfs and similar graphs trees | Statement | E | Codeforces Round 498 (Div. 3) {1006} | PROGRAMMING | 60672 | 1600 | |
| 6476 | Two Strings Swaps | implementation | Statement | D | Codeforces Round 498 (Div. 3) {1006} | PROGRAMMING | 60672 | 1700 | |
| 6859 | Xor-Paths | bitmasks brute force dp meet-in-the-middle | Statement | F | Codeforces Round 498 (Div. 3) {1006} | PROGRAMMING | 60672 | 2400 | |
| 22862 | Adjacent Replacements | implementation | Statement | A | Codeforces Round 498 (Div. 3) {1006} | PROGRAMMING | 60672 | 700 | |
| 13046 | Reorder the Array | combinatorics data structures math sortings two pointers | Statement | A | Codeforces Round 497 (Div. 1) {1007} | PROGRAMMING | Editorial for Codeforces Round #497 by Skyglow | 1300 | |
| 1037 | 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 | |
| 527 | Guess two numbers | binary search interactive | Statement | C | Codeforces Round 497 (Div. 1) {1007} | PROGRAMMING | Editorial for Codeforces Round #497 by Skyglow | 2800 | |
| 322 | Ants | 2-sat data structures trees | Statement | D | Codeforces Round 497 (Div. 1) {1007} | PROGRAMMING | Editorial for Codeforces Round #497 by Skyglow | 3200 | |
| 248 | Mini Metro | dp | Statement | E | Codeforces Round 497 (Div. 1) {1007} | PROGRAMMING | Editorial for Codeforces Round #497 by Skyglow | 3500 | |
| 12556 | Turn the Rectangles | greedy sortings | Statement | B | Codeforces Round 497 (Div. 2) {1008} | PROGRAMMING | Editorial for Codeforces Round #497 by Skyglow | 1100 | |
| 16343 | Romaji | implementation strings | Statement | A | Codeforces Round 497 (Div. 2) {1008} | PROGRAMMING | Editorial for Codeforces Round #497 by Skyglow | 900 | |
| 10705 | Minimum Ternary String | greedy implementation | Statement | B | Educational Codeforces Round 47 (Rated for Div. 2) {1009} | PROGRAMMING | 60630 | 1500 | |
| 6630 | Relatively Prime Graph | brute force constructive algorithms graphs greedy math | Statement | D | Educational Codeforces Round 47 (Rated for Div. 2) {1009} | PROGRAMMING | 60630 | 1700 | |
| 5539 | Annoying Present | greedy math | Statement | C | Educational Codeforces Round 47 (Rated for Div. 2) {1009} | PROGRAMMING | 60630 | 1700 | |
| 3321 | Intercity Travelling | combinatorics math probabilities | Statement | E | Educational Codeforces Round 47 (Rated for Div. 2) {1009} | PROGRAMMING | 60630 | 1900 | |
| 7701 | Dominant Indices | data structures dsu trees | Statement | F | Educational Codeforces Round 47 (Rated for Div. 2) {1009} | PROGRAMMING | 60630 | 2300 | |
| 1049 | Allowed Letters | bitmasks flows graph matchings graphs greedy | Statement | G | Educational Codeforces Round 47 (Rated for Div. 2) {1009} | PROGRAMMING | 60630 | 2500 | |
| 12291 | Game Shopping | implementation | Statement | A | Educational Codeforces Round 47 (Rated for Div. 2) {1009} | PROGRAMMING | 60630 | 800 | |
| 8997 | Fly | binary search math | Statement | A | Codeforces Round 499 (Div. 1) {1010} | PROGRAMMING | 60851 | 1500 | |
| 6372 | Rocket | binary search interactive | Statement | B | Codeforces Round 499 (Div. 1) {1010} | PROGRAMMING | 60851 | 1800 | |
| 5924 | Border | number theory | Statement | C | Codeforces Round 499 (Div. 1) {1010} | PROGRAMMING | 60851 | 1800 | |
| 2562 | Mars rover | dfs and similar graphs implementation trees | Statement | D | Codeforces Round 499 (Div. 1) {1010} | PROGRAMMING | 60851 | 2100 | |
| 386 | Store | data structures | Statement | E | Codeforces Round 499 (Div. 1) {1010} | PROGRAMMING | 60851 | 2700 | |
| 260 | Tree | fft graphs trees | Statement | F | Codeforces Round 499 (Div. 1) {1010} | PROGRAMMING | 60851 | 3400 | |
| 13241 | Stages | greedy implementation sortings | Statement | A | Codeforces Round 499 (Div. 2) {1011} | PROGRAMMING | 60851 | 1000 | |
| 11018 | Planning The Expedition | binary search brute force implementation | Statement | B | Codeforces Round 499 (Div. 2) {1011} | PROGRAMMING | 60851 | 1200 | |
| 6687 | Photo of The Sky | brute force implementation math sortings | Statement | A | Codeforces Round 500 (Div. 1) [based on EJOI] {1012} | PROGRAMMING | 60920 | 1500 | |
| 4383 | Chemical table | constructive algorithms dfs and similar dsu graphs matrices | Statement | B | Codeforces Round 500 (Div. 1) [based on EJOI] {1012} | PROGRAMMING | 60920 | 1900 | |
| 3823 | Hills | dp | Statement | C | Codeforces Round 500 (Div. 1) [based on EJOI] {1012} | PROGRAMMING | 60920 | 2000 | |
| 426 | AB-Strings | constructive algorithms strings | Statement | D | Codeforces Round 500 (Div. 1) [based on EJOI] {1012} | PROGRAMMING | 60920 | 2700 | |
| 396 | Cycle sort | dsu math | Statement | E | Codeforces Round 500 (Div. 1) [based on EJOI] {1012} | PROGRAMMING | 60920 | 3100 | |
| 207 | Passports | dp implementation | Statement | F | Codeforces Round 500 (Div. 1) [based on EJOI] {1012} | PROGRAMMING | 60920 | 3200 | |
| 8297 | And | greedy | Statement | B | Codeforces Round 500 (Div. 2) [based on EJOI] {1013} | PROGRAMMING | Codeforces Round #500 (based on EJOI 2018) — Editorial | 1200 | |
| 11701 | Piles With Stones | math | Statement | A | Codeforces Round 500 (Div. 2) [based on EJOI] {1013} | PROGRAMMING | Codeforces Round #500 (based on EJOI 2018) — Editorial | 800 | |
| 21333 | Songs Compression | sortings | Statement | C | Codeforces Round 501 (Div. 3) {1015} | PROGRAMMING | 60949 | 1100 | |
| 12399 | Obtaining the String | implementation | Statement | B | Codeforces Round 501 (Div. 3) {1015} | PROGRAMMING | 60949 | 1300 | |
| 8938 | Walking Between Houses | constructive algorithms greedy | Statement | D | Codeforces Round 501 (Div. 3) {1015} | PROGRAMMING | 60949 | 1600 | |
| 6796 | Stars Drawing (Easy Edition) | brute force dp greedy | Statement | E1 | Codeforces Round 501 (Div. 3) {1015} | PROGRAMMING | 60949 | 1700 | |
| 4034 | Stars Drawing (Hard Edition) | binary search dp greedy | Statement | E2 | Codeforces Round 501 (Div. 3) {1015} | PROGRAMMING | 60949 | 2000 | |
| 1469 | Bracket Substring | dp strings | Statement | F | Codeforces Round 501 (Div. 3) {1015} | PROGRAMMING | 60949 | 2600 | |
| 22424 | Points in Segments | implementation | Statement | A | Codeforces Round 501 (Div. 3) {1015} | PROGRAMMING | 60949 | 700 | |
| 10145 | Segment Occurrences | brute force implementation | Statement | B | Educational Codeforces Round 48 (Rated for Div. 2) {1016} | PROGRAMMING | Разбор Educational Codeforces Round 48 | 1300 | |
| 3991 | Vasya And The Mushrooms | dp implementation | Statement | C | Educational Codeforces Round 48 (Rated for Div. 2) {1016} | PROGRAMMING | Разбор Educational Codeforces Round 48 | 1800 | |
| 4984 | Vasya And The Matrix | constructive algorithms flows math | Statement | D | Educational Codeforces Round 48 (Rated for Div. 2) {1016} | PROGRAMMING | Разбор Educational Codeforces Round 48 | 1800 | |
| 1295 | Rest In The Shades | binary search geometry | Statement | E | Educational Codeforces Round 48 (Rated for Div. 2) {1016} | PROGRAMMING | Разбор Educational Codeforces Round 48 | 2400 | |
| 1025 | Road Projects | dfs and similar dp trees | Statement | F | Educational Codeforces Round 48 (Rated for Div. 2) {1016} | PROGRAMMING | Разбор Educational Codeforces Round 48 | 2600 | |
| 315 | Appropriate Team | bitmasks math number theory | Statement | G | Educational Codeforces Round 48 (Rated for Div. 2) {1016} | PROGRAMMING | Разбор Educational Codeforces Round 48 | 2800 | |
| 15676 | Death Note | greedy implementation math | Statement | A | Educational Codeforces Round 48 (Rated for Div. 2) {1016} | PROGRAMMING | Разбор Educational Codeforces Round 48 | 900 | |
| 9620 | The Bits | implementation math | Statement | B | Codeforces Round 502 (in memory of Leopoldo Taravilse, Div. 1 + Div. 2) {1017} | PROGRAMMING | Разбор (англ.) | 1200 | |
| 6455 | The Phone Number | constructive algorithms greedy | Statement | C | Codeforces Round 502 (in memory of Leopoldo Taravilse, Div. 1 + Div. 2) {1017} | PROGRAMMING | Разбор (англ.) | 1600 | |
| 3949 | The Wu | bitmasks brute force data structures | Statement | D | Codeforces Round 502 (in memory of Leopoldo Taravilse, Div. 1 + Div. 2) {1017} | PROGRAMMING | Разбор (англ.) | 1900 | |
| 1077 | The Supersonic Rocket | geometry hashing strings | Statement | E | Codeforces Round 502 (in memory of Leopoldo Taravilse, Div. 1 + Div. 2) {1017} | PROGRAMMING | Разбор (англ.) | 2400 | |
| 943 | The Neutral Zone | brute force math | Statement | F | Codeforces Round 502 (in memory of Leopoldo Taravilse, Div. 1 + Div. 2) {1017} | PROGRAMMING | Разбор (англ.) | 2500 | |
| 1206 | The Tree | data structures | Statement | G | Codeforces Round 502 (in memory of Leopoldo Taravilse, Div. 1 + Div. 2) {1017} | PROGRAMMING | Разбор (англ.) | 3200 | |
| 184 | The Films | brute force | Statement | H | Codeforces Round 502 (in memory of Leopoldo Taravilse, Div. 1 + Div. 2) {1017} | PROGRAMMING | Разбор (англ.) | 3300 | |
| 21572 | The Rank | implementation | Statement | A | Codeforces Round 502 (in memory of Leopoldo Taravilse, Div. 1 + Div. 2) {1017} | PROGRAMMING | Разбор (англ.) | 700 | |
| 4847 | Elections | brute force greedy | Statement | A | Codeforces Round 503 (by SIS, Div. 1) {1019} | PROGRAMMING | 61161 | 1800 | |
| 2110 | The hat | binary search interactive | Statement | B | Codeforces Round 503 (by SIS, Div. 1) {1019} | PROGRAMMING | 61161 | 2200 | |
| 724 | Large Triangle | binary search geometry sortings | Statement | D | Codeforces Round 503 (by SIS, Div. 1) {1019} | PROGRAMMING | 61161 | 2700 | |
| 1440 | Sergey's problem | constructive algorithms graphs | Statement | C | Codeforces Round 503 (by SIS, Div. 1) {1019} | PROGRAMMING | 61161 | 2800 | |
| 407 | Raining season | data structures divide and conquer trees | Statement | E | Codeforces Round 503 (by SIS, Div. 1) {1019} | PROGRAMMING | 61161 | 3200 | |
| 25049 | Badge | brute force dfs and similar graphs | Statement | B | Codeforces Round 503 (by SIS, Div. 2) {1020} | PROGRAMMING | Codeforces Round #503 (based on SIS olympiad) — Editorial | 1000 | |
| 9449 | New Building for SIS | math | Statement | A | Codeforces Round 503 (by SIS, Div. 2) {1020} | PROGRAMMING | Codeforces Round #503 (based on SIS olympiad) — Editorial | 1100 | |
| 11652 | Pair of Toys | math | Statement | B | Codeforces Round 504 (rated, Div. 1 + Div. 2, based on VK Cup 2018 Final) {1023} | PROGRAMMING | Codeforces Round 504 Editorial | 1100 | |
| 10749 | Bracket Subsequence | greedy | Statement | C | Codeforces Round 504 (rated, Div. 1 + Div. 2, based on VK Cup 2018 Final) {1023} | PROGRAMMING | Codeforces Round 504 Editorial | 1200 | |
| 9261 | Single Wildcard Pattern Matching | brute force implementation strings | Statement | A | Codeforces Round 504 (rated, Div. 1 + Div. 2, based on VK Cup 2018 Final) {1023} | PROGRAMMING | Codeforces Round 504 Editorial | 1300 | |
| 4280 | Array Restoration | constructive algorithms data structures | Statement | D | Codeforces Round 504 (rated, Div. 1 + Div. 2, based on VK Cup 2018 Final) {1023} | PROGRAMMING | Codeforces Round 504 Editorial | 1700 | |
| 2218 | Down or Right | constructive algorithms interactive matrices | Statement | E | Codeforces Round 504 (rated, Div. 1 + Div. 2, based on VK Cup 2018 Final) {1023} | PROGRAMMING | Codeforces Round 504 Editorial | 2100 | |
| 1009 | Mobile Phone Network | dfs and similar dsu graphs trees | Statement | F | Codeforces Round 504 (rated, Div. 1 + Div. 2, based on VK Cup 2018 Final) {1023} | PROGRAMMING | Codeforces Round 504 Editorial | 2600 | |
| 188 | Pisces | data structures flows trees | Statement | G | Codeforces Round 504 (rated, Div. 1 + Div. 2, based on VK Cup 2018 Final) {1023} | PROGRAMMING | Codeforces Round 504 Editorial | 3300 | |
| 8500 | Weakened Common Divisor | brute force greedy number theory | Statement | B | Codeforces Round 505 (rated, Div. 1 + Div. 2, based on VK Cup 2018 Final) {1025} | PROGRAMMING | Codeforces Round #505 Editorial | 1600 | |
| 6490 | Plasticine zebra | constructive algorithms implementation | Statement | C | Codeforces Round 505 (rated, Div. 1 + Div. 2, based on VK Cup 2018 Final) {1025} | PROGRAMMING | Codeforces Round #505 Editorial | 1600 | |
| 4113 | Recovering BST | brute force dp math number theory trees | Statement | D | Codeforces Round 505 (rated, Div. 1 + Div. 2, based on VK Cup 2018 Final) {1025} | PROGRAMMING | Codeforces Round #505 Editorial | 2000 | |
| 617 | Colored Cubes | constructive algorithms implementation matrices | Statement | E | Codeforces Round 505 (rated, Div. 1 + Div. 2, based on VK Cup 2018 Final) {1025} | PROGRAMMING | Codeforces Round #505 Editorial | 2600 | |
| 858 | Disjoint Triangles | geometry | Statement | F | Codeforces Round 505 (rated, Div. 1 + Div. 2, based on VK Cup 2018 Final) {1025} | PROGRAMMING | Codeforces Round #505 Editorial | 2700 | |
| 864 | Company Acquisitions | constructive algorithms math | Statement | G | Codeforces Round 505 (rated, Div. 1 + Div. 2, based on VK Cup 2018 Final) {1025} | PROGRAMMING | Codeforces Round #505 Editorial | 3100 | |
| 16505 | Doggo Recoloring | implementation sortings | Statement | A | Codeforces Round 505 (rated, Div. 1 + Div. 2, based on VK Cup 2018 Final) {1025} | PROGRAMMING | Codeforces Round #505 Editorial | 900 | |
| 18767 | Palindromic Twist | implementation strings | Statement | A | Educational Codeforces Round 49 (Rated for Div. 2) {1027} | PROGRAMMING | Educational Codeforces Round 49 Editorial | 1000 | |
| 8743 | Numbers on the Chessboard | implementation math | Statement | B | Educational Codeforces Round 49 (Rated for Div. 2) {1027} | PROGRAMMING | Educational Codeforces Round 49 Editorial | 1300 | |
| 7148 | Minimum Value Rectangle | greedy | Statement | C | Educational Codeforces Round 49 (Rated for Div. 2) {1027} | PROGRAMMING | Educational Codeforces Round 49 Editorial | 1600 | |
| 8350 | Mouse Hunt | dfs and similar graphs | Statement | D | Educational Codeforces Round 49 (Rated for Div. 2) {1027} | PROGRAMMING | Educational Codeforces Round 49 Editorial | 1700 | |
| 2360 | Inverse Coloring | combinatorics dp math | Statement | E | Educational Codeforces Round 49 (Rated for Div. 2) {1027} | PROGRAMMING | Educational Codeforces Round 49 Editorial | 2100 | |
| 1947 | Session in BSU | binary search dfs and similar dsu graph matchings graphs | Statement | F | Educational Codeforces Round 49 (Rated for Div. 2) {1027} | PROGRAMMING | Educational Codeforces Round 49 Editorial | 2400 | |
| 359 | 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 | |
| 10222 | Unnatural Conditions | constructive algorithms math | Statement | B | AIM Tech Round 5 (rated, Div. 1 + Div. 2) {1028} | PROGRAMMING | 61493 | 1300 | |
| 5040 | Rectangles | geometry implementation sortings | Statement | C | AIM Tech Round 5 (rated, Div. 1 + Div. 2) {1028} | PROGRAMMING | 61493 | 1600 | |
| 1821 | Order book | combinatorics data structures greedy | Statement | D | AIM Tech Round 5 (rated, Div. 1 + Div. 2) {1028} | PROGRAMMING | 61493 | 2100 | |
| 1202 | Restore Array | constructive algorithms | Statement | E | AIM Tech Round 5 (rated, Div. 1 + Div. 2) {1028} | PROGRAMMING | 61493 | 2400 | |
| 565 | Make Symmetrical | brute force | Statement | F | AIM Tech Round 5 (rated, Div. 1 + Div. 2) {1028} | PROGRAMMING | 61493 | 2800 | |
| 564 | Make Square | math | Statement | H | AIM Tech Round 5 (rated, Div. 1 + Div. 2) {1028} | PROGRAMMING | 61493 | 2900 | |
| 645 | Guess the number | dp interactive | Statement | G | AIM Tech Round 5 (rated, Div. 1 + Div. 2) {1028} | PROGRAMMING | 61493 | 2900 | |
| 11511 | Find Square | implementation | Statement | A | AIM Tech Round 5 (rated, Div. 1 + Div. 2) {1028} | PROGRAMMING | 61493 | 800 | |
| 18433 | Creating the Contest | dp greedy math | Statement | B | Codeforces Round 506 (Div. 3) {1029} | PROGRAMMING | Codeforces Round #506 (Div. 3) Editorial | 1200 | |
| 13419 | Many Equal Substrings | implementation strings | Statement | A | Codeforces Round 506 (Div. 3) {1029} | PROGRAMMING | Codeforces Round #506 (Div. 3) Editorial | 1300 | |
| 8247 | Maximal Intersection | greedy math sortings | Statement | C | Codeforces Round 506 (Div. 3) {1029} | PROGRAMMING | Codeforces Round #506 (Div. 3) Editorial | 1600 | |
| 2750 | Multicolored Markers | binary search brute force math number theory | Statement | F | Codeforces Round 506 (Div. 3) {1029} | PROGRAMMING | Codeforces Round #506 (Div. 3) Editorial | 2100 | |
| 4228 | Concatenated Multiples | implementation math | Statement | D | Codeforces Round 506 (Div. 3) {1029} | PROGRAMMING | Codeforces Round #506 (Div. 3) Editorial | 2100 | |
| 3409 | Tree with Small Distances | dp graphs greedy | Statement | E | Codeforces Round 506 (Div. 3) {1029} | PROGRAMMING | Codeforces Round #506 (Div. 3) Editorial | 2200 | |
| 13154 | Vasya and Cornfield | geometry | Statement | B | Technocup 2019 - Elimination Round 1 {1030} | PROGRAMMING | Сodeforces Round 512 (and Technocup — Elimination Round 1) Editorial | 1100 | |
| 9921 | Vasya and Golden Ticket | implementation | Statement | C | Technocup 2019 - Elimination Round 1 {1030} | PROGRAMMING | Сodeforces Round 512 (and Technocup — Elimination Round 1) Editorial | 1300 | |
| 6249 | Vasya and Triangle | geometry number theory | Statement | D | Technocup 2019 - Elimination Round 1 {1030} | PROGRAMMING | Сodeforces Round 512 (and Technocup — Elimination Round 1) Editorial | 1700 | |
| 3350 | 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 | |
| 904 | Putting Boxes Together | data structures | Statement | F | Technocup 2019 - Elimination Round 1 {1030} | PROGRAMMING | Сodeforces Round 512 (and Technocup — Elimination Round 1) Editorial | 2600 | |
| 398 | Linear Congruential Generator | number theory | Statement | G | Technocup 2019 - Elimination Round 1 {1030} | PROGRAMMING | Сodeforces Round 512 (and Technocup — Elimination Round 1) Editorial | 3000 | |
| 170247 | In Search of an Easy Problem | implementation | Statement | A | Technocup 2019 - Elimination Round 1 {1030} | PROGRAMMING | Сodeforces Round 512 (and Technocup — Elimination Round 1) Editorial | 500 | |
| 4058 | Curiosity Has No Limits | Statement | B | Technocup 2019 - Elimination Round 2 {1031} | PROGRAMMING | Codeforces Round #517 and Technocup 2019 Elimination Round 2 Editorial | 1500 | ||
| 5606 | Cram Time | greedy | Statement | C | Technocup 2019 - Elimination Round 2 {1031} | PROGRAMMING | Codeforces Round #517 and Technocup 2019 Elimination Round 2 Editorial | 1700 | |
| 2981 | Minimum path | greedy | Statement | D | Technocup 2019 - Elimination Round 2 {1031} | PROGRAMMING | Codeforces Round #517 and Technocup 2019 Elimination Round 2 Editorial | 2000 | |
| 310 | Familiar Operations | brute force graphs math | Statement | F | Technocup 2019 - Elimination Round 2 {1031} | PROGRAMMING | Codeforces Round #517 and Technocup 2019 Elimination Round 2 Editorial | 2700 | |
| 571 | Triple Flips | constructive algorithms | Statement | E | Technocup 2019 - Elimination Round 2 {1031} | PROGRAMMING | Codeforces Round #517 and Technocup 2019 Elimination Round 2 Editorial | 2900 | |
| 13395 | Golden Plate | implementation math | Statement | A | Technocup 2019 - Elimination Round 2 {1031} | PROGRAMMING | Codeforces Round #517 and Technocup 2019 Elimination Round 2 Editorial | 700 | |
| 7332 | Kitchen Utensils | Statement | A | Technocup 2019 - Elimination Round 3 {1032} | PROGRAMMING | Codeforces Round #522 and Technocup 2019 Elimination Round 3 Editorial | 1100 | ||
| 5144 | Personalized Cup | Statement | B | Technocup 2019 - Elimination Round 3 {1032} | PROGRAMMING | Codeforces Round #522 and Technocup 2019 Elimination Round 3 Editorial | 1300 | ||
| 4328 | Playing Piano | constructive algorithms dp | Statement | C | Technocup 2019 - Elimination Round 3 {1032} | PROGRAMMING | Codeforces Round #522 and Technocup 2019 Elimination Round 3 Editorial | 1800 | |
| 2974 | Barcelonian Distance | geometry implementation | Statement | D | Technocup 2019 - Elimination Round 3 {1032} | PROGRAMMING | Codeforces Round #522 and Technocup 2019 Elimination Round 3 Editorial | 1900 | |
| 1865 | The Unbearable Lightness of Weights | dp math | Statement | E | Technocup 2019 - Elimination Round 3 {1032} | PROGRAMMING | Codeforces Round #522 and Technocup 2019 Elimination Round 3 Editorial | 2300 | |
| 1138 | Vasya and Maximum Matching | dp trees | Statement | F | Technocup 2019 - Elimination Round 3 {1032} | PROGRAMMING | Codeforces Round #522 and Technocup 2019 Elimination Round 3 Editorial | 2600 | |
| 511 | Chattering | Statement | G | Technocup 2019 - Elimination Round 3 {1032} | PROGRAMMING | Codeforces Round #522 and Technocup 2019 Elimination Round 3 Editorial | 2700 | ||
| 15854 | King Escape | dfs and similar graphs implementation | Statement | A | Lyft Level 5 Challenge 2018 - Elimination Round {1033} | PROGRAMMING | The Lyft Level 5 Challenge 2018 Elimination Round (Div. 1 + Div. 2) Editorial | 1000 | |
| 11925 | Square Difference | math number theory | Statement | B | Lyft Level 5 Challenge 2018 - Elimination Round {1033} | PROGRAMMING | The Lyft Level 5 Challenge 2018 Elimination Round (Div. 1 + Div. 2) Editorial | 1100 | |
| 6210 | Permutation Game | brute force dp games | Statement | C | Lyft Level 5 Challenge 2018 - Elimination Round {1033} | PROGRAMMING | The Lyft Level 5 Challenge 2018 Elimination Round (Div. 1 + Div. 2) Editorial | 1600 | |
| 2606 | Divisors | interactive math number theory | Statement | D | Lyft Level 5 Challenge 2018 - Elimination Round {1033} | PROGRAMMING | The Lyft Level 5 Challenge 2018 Elimination Round (Div. 1 + Div. 2) Editorial | 2000 | |
| 787 | Hidden Bipartite Graph | binary search constructive algorithms dfs and similar graphs interactive | Statement | E | Lyft Level 5 Challenge 2018 - Elimination Round {1033} | PROGRAMMING | The Lyft Level 5 Challenge 2018 Elimination Round (Div. 1 + Div. 2) Editorial | 2700 | |
| 461 | 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 | |
| 500 | Chip Game | games | Statement | G | Lyft Level 5 Challenge 2018 - Elimination Round {1033} | PROGRAMMING | The Lyft Level 5 Challenge 2018 Elimination Round (Div. 1 + Div. 2) Editorial | 3200 | |
| 9902 | Enlarge GCD | number theory | Statement | A | Codeforces Round 511 (Div. 1) {1034} | PROGRAMMING | Codeforces Round #511 Editorial | 1700 | |
| 2289 | Little C Loves 3 II | brute force constructive algorithms flows graph matchings | Statement | B | Codeforces Round 511 (Div. 1) {1034} | PROGRAMMING | Codeforces Round #511 Editorial | 2100 | |
| 993 | Region Separation | combinatorics dp number theory trees | Statement | C | Codeforces Round 511 (Div. 1) {1034} | PROGRAMMING | Codeforces Round #511 Editorial | 2900 | |
| 749 | Little C Loves 3 III | bitmasks dp math | Statement | E | Codeforces Round 511 (Div. 1) {1034} | PROGRAMMING | Codeforces Round #511 Editorial | 3200 | |
| 585 | Intervals of Intervals | binary search data structures two pointers | Statement | D | Codeforces Round 511 (Div. 1) {1034} | PROGRAMMING | Codeforces Round #511 Editorial | 3500 | |
| 10579 | Function Height | math | Statement | A | Educational Codeforces Round 50 (Rated for Div. 2) {1036} | PROGRAMMING | 61727 | 1000 | |
| 10607 | Vasya and Arrays | greedy two pointers | Statement | D | Educational Codeforces Round 50 (Rated for Div. 2) {1036} | PROGRAMMING | 61727 | 1600 | |
| 5962 | Diagonal Walking v.2 | math | Statement | B | Educational Codeforces Round 50 (Rated for Div. 2) {1036} | PROGRAMMING | 61727 | 1600 | |
| 13298 | Classy Numbers | combinatorics dp | Statement | C | Educational Codeforces Round 50 (Rated for Div. 2) {1036} | PROGRAMMING | 61727 | 1800 | |
| 1769 | Covered Points | fft geometry number theory | Statement | E | Educational Codeforces Round 50 (Rated for Div. 2) {1036} | PROGRAMMING | 61727 | 2300 | |
| 1852 | Relatively Prime Powers | combinatorics math number theory | Statement | F | Educational Codeforces Round 50 (Rated for Div. 2) {1036} | PROGRAMMING | 61727 | 2400 | |
| 431 | Sources and Sinks | bitmasks brute force dfs and similar | Statement | G | Educational Codeforces Round 50 (Rated for Div. 2) {1036} | PROGRAMMING | 61727 | 2800 | |
| 10874 | Reach Median | greedy | Statement | B | Manthan, Codefest 18 (rated, Div. 1 + Div. 2) {1037} | PROGRAMMING | Tutorial | 1300 | |
| 11818 | Packets | constructive algorithms greedy math | Statement | A | Manthan, Codefest 18 (rated, Div. 1 + Div. 2) {1037} | PROGRAMMING | Tutorial | 1300 | |
| 20101 | Equalize | dp greedy strings | Statement | C | Manthan, Codefest 18 (rated, Div. 1 + Div. 2) {1037} | PROGRAMMING | Tutorial | 1300 | |
| 19020 | Valid BFS? | dfs and similar graphs shortest paths trees | Statement | D | Manthan, Codefest 18 (rated, Div. 1 + Div. 2) {1037} | PROGRAMMING | Tutorial | 1700 | |
| 3123 | Trips | graphs | Statement | E | Manthan, Codefest 18 (rated, Div. 1 + Div. 2) {1037} | PROGRAMMING | Tutorial | 2100 | |
| 1268 | Maximum Reduction | combinatorics data structures math | Statement | F | Manthan, Codefest 18 (rated, Div. 1 + Div. 2) {1037} | PROGRAMMING | Tutorial | 2400 | |
| 1208 | Security | data structures string suffix structures | Statement | H | Manthan, Codefest 18 (rated, Div. 1 + Div. 2) {1037} | PROGRAMMING | Tutorial | 2900 | |
| 371 | A Game on Strings | games | Statement | G | Manthan, Codefest 18 (rated, Div. 1 + Div. 2) {1037} | PROGRAMMING | Tutorial | 2900 | |
| 14689 | Non-Coprime Partition | constructive algorithms math | Statement | B | Codeforces Round 508 (Div. 2) {1038} | PROGRAMMING | Tutorial | 1100 | |
| 9800 | Gambling | greedy sortings | Statement | C | Codeforces Round 508 (Div. 2) {1038} | PROGRAMMING | Tutorial | 1300 | |
| 8854 | Slime | dp greedy implementation | Statement | D | Codeforces Round 508 (Div. 2) {1038} | PROGRAMMING | Tutorial | 1700 | |
| 1094 | Maximum Matching | bitmasks brute force dfs and similar dp graphs | Statement | E | Codeforces Round 508 (Div. 2) {1038} | PROGRAMMING | Tutorial | 2400 | |
| 478 | Wrap Around | dp strings | Statement | F | Codeforces Round 508 (Div. 2) {1038} | PROGRAMMING | Tutorial | 2900 | |
| 15637 | Equality | implementation strings | Statement | A | Codeforces Round 508 (Div. 2) {1038} | PROGRAMMING | Tutorial | 800 | |
| 2582 | Subway Pursuit | binary search interactive probabilities | Statement | B | Codeforces Round 507 (Div. 1, based on Olympiad of Metropolises) {1039} | PROGRAMMING | 61668 | 2100 |