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 ... 44 45 46 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 8681 | Micro-World | greedy sortings | Statement | B | Educational Codeforces Round 45 (Rated for Div. 2) {990} | PROGRAMMING | Educational Codeforces Round 45 Editorial | 1200 | |
| 6343 | Bracket Sequences Concatenation Problem | implementation | Statement | C | Educational Codeforces Round 45 (Rated for Div. 2) {990} | PROGRAMMING | Educational Codeforces Round 45 Editorial | 1500 | |
| 4149 | 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 | |
| 2202 | Post Lamps | brute force greedy | Statement | E | Educational Codeforces Round 45 (Rated for Div. 2) {990} | PROGRAMMING | Educational Codeforces Round 45 Editorial | 2000 | |
| 2447 | 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 | |
| 1149 | 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 | |
| 11293 | If at first you don't succeed... | implementation | Statement | A | Codeforces Round 491 (Div. 2) {991} | PROGRAMMING | 60181 | 1100 | |
| 13880 | Getting an A | greedy sortings | Statement | B | Codeforces Round 491 (Div. 2) {991} | PROGRAMMING | 60181 | 1100 | |
| 11699 | Candies | binary search implementation | Statement | C | Codeforces Round 491 (Div. 2) {991} | PROGRAMMING | 60181 | 1500 | |
| 7814 | Bishwock | dp greedy | Statement | D | Codeforces Round 491 (Div. 2) {991} | PROGRAMMING | 60181 | 1500 | |
| 3770 | Bus Number | brute force combinatorics math | Statement | E | Codeforces Round 491 (Div. 2) {991} | PROGRAMMING | 60181 | 1800 | |
| 415 | Concise and clear | brute force greedy implementation math | Statement | F | Codeforces Round 491 (Div. 2) {991} | PROGRAMMING | 60181 | 2800 | |
| 6836 | Nastya Studies Informatics | math number theory | Statement | B | Codeforces Round 489 (Div. 2) {992} | PROGRAMMING | 60083 | 1700 | |
| 4894 | Nastya and a Wardrobe | math | Statement | C | Codeforces Round 489 (Div. 2) {992} | PROGRAMMING | 60083 | 1700 | |
| 2041 | Nastya and a Game | brute force implementation math | Statement | D | Codeforces Round 489 (Div. 2) {992} | PROGRAMMING | 60083 | 2100 | |
| 1838 | Nastya and King-Shamans | binary search data structures | Statement | E | Codeforces Round 489 (Div. 2) {992} | PROGRAMMING | 60083 | 2600 | |
| 14461 | Nastya and an Array | implementation sortings | Statement | A | Codeforces Round 489 (Div. 2) {992} | PROGRAMMING | 60083 | 900 | |
| 4579 | Two Squares | geometry implementation | Statement | A | Codeforces Round 488 by NEAR (Div. 1) {993} | PROGRAMMING | Codeforces Round #488 editorial | 1700 | |
| 2061 | Open Communication | bitmasks brute force | Statement | B | Codeforces Round 488 by NEAR (Div. 1) {993} | PROGRAMMING | Codeforces Round #488 editorial | 1900 | |
| 1843 | Careful Maneuvering | bitmasks brute force geometry | Statement | C | Codeforces Round 488 by NEAR (Div. 1) {993} | PROGRAMMING | Codeforces Round #488 editorial | 2100 | |
| 1918 | 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 | |
| 867 | Compute Power | binary search dp greedy | Statement | D | Codeforces Round 488 by NEAR (Div. 1) {993} | PROGRAMMING | Codeforces Round #488 editorial | 2400 | |
| 202 | The Moral Dilemma | Statement | F | Codeforces Round 488 by NEAR (Div. 1) {993} | PROGRAMMING | Codeforces Round #488 editorial | 3100 | ||
| 6094 | Knights of a Polygonal Table | greedy implementation sortings | Statement | B | Codeforces Round 488 by NEAR (Div. 2) {994} | PROGRAMMING | Codeforces Round #488 editorial | 1400 | |
| 15304 | Fingerprints | implementation | Statement | A | Codeforces Round 488 by NEAR (Div. 2) {994} | PROGRAMMING | Codeforces Round #488 editorial | 700 | |
| 7489 | 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 | |
| 1863 | Tesla | constructive algorithms implementation | Statement | A | Codeforces Round 492 (Div. 1) [Thanks, uDebug!] {995} | PROGRAMMING | Editorial for Codeforces Round #492 [Thanks u-Debug!] | 2100 | |
| 2144 | 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 | |
| 981 | Game | math | Statement | D | Codeforces Round 492 (Div. 1) [Thanks, uDebug!] {995} | PROGRAMMING | Editorial for Codeforces Round #492 [Thanks u-Debug!] | 2400 | |
| 989 | 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 | |
| 1857 | 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 | |
| 10013 | 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 | |
| 123795 | 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 | |
| 8702 | Convert to Ones | brute force greedy implementation math | Statement | A | Codeforces Round 493 (Div. 1) {997} | PROGRAMMING | 60357 | 1500 | |
| 3240 | Roman Digits | brute force combinatorics dp greedy math | Statement | B | Codeforces Round 493 (Div. 1) {997} | PROGRAMMING | 60357 | 2000 | |
| 2470 | Sky Full of Stars | combinatorics math | Statement | C | Codeforces Round 493 (Div. 1) {997} | PROGRAMMING | 60357 | 2600 | |
| 922 | Cycles in product | combinatorics divide and conquer trees | Statement | D | Codeforces Round 493 (Div. 1) {997} | PROGRAMMING | 60357 | 2800 | |
| 1852 | Good Subsegments | data structures | Statement | E | Codeforces Round 493 (Div. 1) {997} | PROGRAMMING | 60357 | 3000 | |
| 10234 | Balloons | constructive algorithms implementation | Statement | A | Codeforces Round 493 (Div. 2) {998} | PROGRAMMING | Codeforces Round #493 — Editorial | 1000 | |
| 14575 | Cutting | dp greedy sortings | Statement | B | Codeforces Round 493 (Div. 2) {998} | PROGRAMMING | Codeforces Round #493 — Editorial | 1200 | |
| 21367 | Alphabetic Removals | implementation | Statement | C | Codeforces Round 490 (Div. 3) {999} | PROGRAMMING | 60138 | 1200 | |
| 8289 | Reachability from the Capital | dfs and similar graphs greedy | Statement | E | Codeforces Round 490 (Div. 3) {999} | PROGRAMMING | 60138 | 1900 | |
| 4974 | Equalize the Remainders | data structures greedy implementation | Statement | D | Codeforces Round 490 (Div. 3) {999} | PROGRAMMING | 60138 | 1900 | |
| 3377 | Cards and Joy | dp | Statement | F | Codeforces Round 490 (Div. 3) {999} | PROGRAMMING | 60138 | 2200 | |
| 25586 | Mishka and Contest | brute force implementation | Statement | A | Codeforces Round 490 (Div. 3) {999} | PROGRAMMING | 60138 | 800 | |
| 19647 | Reversing Encryption | implementation | Statement | B | Codeforces Round 490 (Div. 3) {999} | PROGRAMMING | 60138 | 900 | |
| 9492 | Codehorses T-shirts | greedy implementation | Statement | A | Educational Codeforces Round 46 (Rated for Div. 2) {1000} | PROGRAMMING | 60288 | 1200 | |
| 6234 | Light It Up | greedy | Statement | B | Educational Codeforces Round 46 (Rated for Div. 2) {1000} | PROGRAMMING | 60288 | 1600 | |
| 8847 | Covered Points Count | data structures implementation sortings | Statement | C | Educational Codeforces Round 46 (Rated for Div. 2) {1000} | PROGRAMMING | 60288 | 1700 | |
| 5235 | Yet Another Problem On a Subsequence | combinatorics dp | Statement | D | Educational Codeforces Round 46 (Rated for Div. 2) {1000} | PROGRAMMING | 60288 | 1900 | |
| 7134 | We Need More Bosses | dfs and similar graphs trees | Statement | E | Educational Codeforces Round 46 (Rated for Div. 2) {1000} | PROGRAMMING | 60288 | 2100 | |
| 5177 | One Occurrence | data structures divide and conquer | Statement | F | Educational Codeforces Round 46 (Rated for Div. 2) {1000} | PROGRAMMING | 60288 | 2400 | |
| 802 | Two-Paths | data structures dp trees | Statement | G | Educational Codeforces Round 46 (Rated for Div. 2) {1000} | PROGRAMMING | 60288 | 2800 | |
| 724 | Generate Bell state | *special | Statement | B | Microsoft Q# Coding Contest - Summer 2018 - Warmup {1001} | PROGRAMMING | Full editorial | 2000 | |
| 1045 | Generate plus state or minus state | *special | Statement | A | Microsoft Q# Coding Contest - Summer 2018 - Warmup {1001} | PROGRAMMING | Full editorial | 2200 | |
| 667 | Generate GHZ state | *special | Statement | C | Microsoft Q# Coding Contest - Summer 2018 - Warmup {1001} | PROGRAMMING | Full editorial | 2300 | |
| 701 | Distinguish plus state and minus state | *special | Statement | D | Microsoft Q# Coding Contest - Summer 2018 - Warmup {1001} | PROGRAMMING | Full editorial | 2300 | |
| 551 | 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 | |
| 547 | 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 | |
| 553 | 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 | |
| 571 | Generate superposition of zero state and a basis state | Statement | A2 | Microsoft Q# Coding Contest - Summer 2018 {1002} | PROGRAMMING | Editorial | 1900 | ||
| 484 | Generate superposition of two basis states | Statement | A3 | Microsoft Q# Coding Contest - Summer 2018 {1002} | PROGRAMMING | Editorial | 1900 | ||
| 949 | Generate superposition of all basis states | Statement | A1 | Microsoft Q# Coding Contest - Summer 2018 {1002} | PROGRAMMING | Editorial | 1900 | ||
| 490 | Distinguish zero state and W state | Statement | B1 | Microsoft Q# Coding Contest - Summer 2018 {1002} | PROGRAMMING | Editorial | 2000 | ||
| 420 | Oracle for f(x) = b * x mod 2 | Statement | D1 | Microsoft Q# Coding Contest - Summer 2018 {1002} | PROGRAMMING | Editorial | 2100 | ||
| 395 | Oracle for f(x) = b * x + (1 - b) * (1 - x) mod 2 | Statement | D2 | Microsoft Q# Coding Contest - Summer 2018 {1002} | PROGRAMMING | Editorial | 2100 | ||
| 456 | 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 | ||
| 211 | Another array reconstruction algorithm | Statement | E2 | Microsoft Q# Coding Contest - Summer 2018 {1002} | PROGRAMMING | Editorial | 2400 | ||
| 11666 | Intense Heat | brute force implementation math | Statement | C | Codeforces Round 494 (Div. 3) {1003} | PROGRAMMING | 60417 | 1300 | |
| 12376 | Binary String Constructing | constructive algorithms | Statement | B | Codeforces Round 494 (Div. 3) {1003} | PROGRAMMING | 60417 | 1300 | |
| 8693 | Coins and Queries | greedy | Statement | D | Codeforces Round 494 (Div. 3) {1003} | PROGRAMMING | 60417 | 1600 | |
| 3210 | Tree Constructing | constructive algorithms graphs | Statement | E | Codeforces Round 494 (Div. 3) {1003} | PROGRAMMING | 60417 | 2200 | |
| 1654 | Abbreviation | dp hashing strings | Statement | F | Codeforces Round 494 (Div. 3) {1003} | PROGRAMMING | 60417 | 2400 | |
| 30553 | Polycarp's Pockets | implementation | Statement | A | Codeforces Round 494 (Div. 3) {1003} | PROGRAMMING | 60417 | 700 | |
| 7930 | Sonya and Robots | constructive algorithms implementation | Statement | C | Codeforces Round 495 (Div. 2) {1004} | PROGRAMMING | 60443 | 1400 | |
| 10062 | Sonya and Exhibition | constructive algorithms greedy implementation math | Statement | B | Codeforces Round 495 (Div. 2) {1004} | PROGRAMMING | 60443 | 1400 | |
| 1522 | Sonya and Matrix | brute force constructive algorithms implementation | Statement | D | Codeforces Round 495 (Div. 2) {1004} | PROGRAMMING | 60443 | 2200 | |
| 1316 | Sonya and Ice Cream | binary search data structures dp greedy shortest paths trees | Statement | E | Codeforces Round 495 (Div. 2) {1004} | PROGRAMMING | 60443 | 2400 | |
| 1008 | Sonya and Bitwise OR | bitmasks data structures divide and conquer | Statement | F | Codeforces Round 495 (Div. 2) {1004} | PROGRAMMING | 60443 | 2900 | |
| 11935 | Sonya and Hotels | implementation | Statement | A | Codeforces Round 495 (Div. 2) {1004} | PROGRAMMING | 60443 | 900 | |
| 27968 | 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 | |
| 13262 | 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 | |
| 11631 | 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 | |
| 4436 | Median on Segments (Permutations Edition) | sortings | Statement | E1 | Codeforces Round 496 (Div. 3) {1005} | PROGRAMMING | Codeforces Round 496 (Div. 3): Problem Tutorials | 1900 | |
| 2204 | 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 | |
| 1642 | Median on Segments (General Case Edition) | sortings | Statement | E2 | Codeforces Round 496 (Div. 3) {1005} | PROGRAMMING | Codeforces Round 496 (Div. 3): Problem Tutorials | 2600 | |
| 28525 | Tanya and Stairways | implementation | Statement | A | Codeforces Round 496 (Div. 3) {1005} | PROGRAMMING | Codeforces Round 496 (Div. 3): Problem Tutorials | 700 | |
| 14846 | Polycarp's Practice | greedy implementation sortings | Statement | B | Codeforces Round 498 (Div. 3) {1006} | PROGRAMMING | 60672 | 1200 | |
| 26496 | Three Parts of the Array | binary search data structures two pointers | Statement | C | Codeforces Round 498 (Div. 3) {1006} | PROGRAMMING | 60672 | 1300 | |
| 12082 | Military Problem | dfs and similar graphs trees | Statement | E | Codeforces Round 498 (Div. 3) {1006} | PROGRAMMING | 60672 | 1600 | |
| 6529 | Two Strings Swaps | implementation | Statement | D | Codeforces Round 498 (Div. 3) {1006} | PROGRAMMING | 60672 | 1700 | |
| 7378 | Xor-Paths | bitmasks brute force dp meet-in-the-middle | Statement | F | Codeforces Round 498 (Div. 3) {1006} | PROGRAMMING | 60672 | 2400 | |
| 23063 | Adjacent Replacements | implementation | Statement | A | Codeforces Round 498 (Div. 3) {1006} | PROGRAMMING | 60672 | 700 | |
| 13212 | 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 | |
| 1064 | 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 | |
| 590 | Guess two numbers | binary search interactive | Statement | C | Codeforces Round 497 (Div. 1) {1007} | PROGRAMMING | Editorial for Codeforces Round #497 by Skyglow | 2800 | |
| 423 | Ants | 2-sat data structures trees | Statement | D | Codeforces Round 497 (Div. 1) {1007} | PROGRAMMING | Editorial for Codeforces Round #497 by Skyglow | 3200 | |
| 254 | Mini Metro | dp | Statement | E | Codeforces Round 497 (Div. 1) {1007} | PROGRAMMING | Editorial for Codeforces Round #497 by Skyglow | 3500 | |
| 12740 | Turn the Rectangles | greedy sortings | Statement | B | Codeforces Round 497 (Div. 2) {1008} | PROGRAMMING | Editorial for Codeforces Round #497 by Skyglow | 1100 | |
| 16521 | Romaji | implementation strings | Statement | A | Codeforces Round 497 (Div. 2) {1008} | PROGRAMMING | Editorial for Codeforces Round #497 by Skyglow | 900 | |
| 10811 | Minimum Ternary String | greedy implementation | Statement | B | Educational Codeforces Round 47 (Rated for Div. 2) {1009} | PROGRAMMING | 60630 | 1500 | |
| 6749 | Relatively Prime Graph | brute force constructive algorithms graphs greedy math | Statement | D | Educational Codeforces Round 47 (Rated for Div. 2) {1009} | PROGRAMMING | 60630 | 1700 | |
| 5589 | Annoying Present | greedy math | Statement | C | Educational Codeforces Round 47 (Rated for Div. 2) {1009} | PROGRAMMING | 60630 | 1700 | |
| 3504 | Intercity Travelling | combinatorics math probabilities | Statement | E | Educational Codeforces Round 47 (Rated for Div. 2) {1009} | PROGRAMMING | 60630 | 1900 | |
| 8378 | Dominant Indices | data structures dsu trees | Statement | F | Educational Codeforces Round 47 (Rated for Div. 2) {1009} | PROGRAMMING | 60630 | 2300 | |
| 1102 | Allowed Letters | bitmasks flows graph matchings graphs greedy | Statement | G | Educational Codeforces Round 47 (Rated for Div. 2) {1009} | PROGRAMMING | 60630 | 2500 | |
| 12367 | Game Shopping | implementation | Statement | A | Educational Codeforces Round 47 (Rated for Div. 2) {1009} | PROGRAMMING | 60630 | 800 | |
| 9114 | Fly | binary search math | Statement | A | Codeforces Round 499 (Div. 1) {1010} | PROGRAMMING | 60851 | 1500 | |
| 6491 | Rocket | binary search interactive | Statement | B | Codeforces Round 499 (Div. 1) {1010} | PROGRAMMING | 60851 | 1800 | |
| 6084 | Border | number theory | Statement | C | Codeforces Round 499 (Div. 1) {1010} | PROGRAMMING | 60851 | 1800 | |
| 2633 | Mars rover | dfs and similar graphs implementation trees | Statement | D | Codeforces Round 499 (Div. 1) {1010} | PROGRAMMING | 60851 | 2100 | |
| 435 | Store | data structures | Statement | E | Codeforces Round 499 (Div. 1) {1010} | PROGRAMMING | 60851 | 2700 | |
| 573 | Tree | fft graphs trees | Statement | F | Codeforces Round 499 (Div. 1) {1010} | PROGRAMMING | 60851 | 3400 | |
| 13391 | Stages | greedy implementation sortings | Statement | A | Codeforces Round 499 (Div. 2) {1011} | PROGRAMMING | 60851 | 1000 | |
| 11136 | Planning The Expedition | binary search brute force implementation | Statement | B | Codeforces Round 499 (Div. 2) {1011} | PROGRAMMING | 60851 | 1200 | |
| 6726 | Photo of The Sky | brute force implementation math sortings | Statement | A | Codeforces Round 500 (Div. 1) [based on EJOI] {1012} | PROGRAMMING | 60920 | 1500 | |
| 4458 | Chemical table | constructive algorithms dfs and similar dsu graphs matrices | Statement | B | Codeforces Round 500 (Div. 1) [based on EJOI] {1012} | PROGRAMMING | 60920 | 1900 | |
| 3924 | Hills | dp | Statement | C | Codeforces Round 500 (Div. 1) [based on EJOI] {1012} | PROGRAMMING | 60920 | 2000 | |
| 477 | AB-Strings | constructive algorithms strings | Statement | D | Codeforces Round 500 (Div. 1) [based on EJOI] {1012} | PROGRAMMING | 60920 | 2700 | |
| 622 | Cycle sort | dsu math | Statement | E | Codeforces Round 500 (Div. 1) [based on EJOI] {1012} | PROGRAMMING | 60920 | 3100 | |
| 270 | Passports | dp implementation | Statement | F | Codeforces Round 500 (Div. 1) [based on EJOI] {1012} | PROGRAMMING | 60920 | 3200 | |
| 8384 | And | greedy | Statement | B | Codeforces Round 500 (Div. 2) [based on EJOI] {1013} | PROGRAMMING | Codeforces Round #500 (based on EJOI 2018) — Editorial | 1200 | |
| 11790 | 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 | |
| 21698 | Songs Compression | sortings | Statement | C | Codeforces Round 501 (Div. 3) {1015} | PROGRAMMING | 60949 | 1100 | |
| 12508 | Obtaining the String | implementation | Statement | B | Codeforces Round 501 (Div. 3) {1015} | PROGRAMMING | 60949 | 1300 | |
| 9066 | Walking Between Houses | constructive algorithms greedy | Statement | D | Codeforces Round 501 (Div. 3) {1015} | PROGRAMMING | 60949 | 1600 | |
| 6957 | Stars Drawing (Easy Edition) | brute force dp greedy | Statement | E1 | Codeforces Round 501 (Div. 3) {1015} | PROGRAMMING | 60949 | 1700 | |
| 4082 | Stars Drawing (Hard Edition) | binary search dp greedy | Statement | E2 | Codeforces Round 501 (Div. 3) {1015} | PROGRAMMING | 60949 | 2000 | |
| 1549 | Bracket Substring | dp strings | Statement | F | Codeforces Round 501 (Div. 3) {1015} | PROGRAMMING | 60949 | 2600 | |
| 22734 | Points in Segments | implementation | Statement | A | Codeforces Round 501 (Div. 3) {1015} | PROGRAMMING | 60949 | 700 | |
| 10249 | Segment Occurrences | brute force implementation | Statement | B | Educational Codeforces Round 48 (Rated for Div. 2) {1016} | PROGRAMMING | Разбор Educational Codeforces Round 48 | 1300 | |
| 4020 | Vasya And The Mushrooms | dp implementation | Statement | C | Educational Codeforces Round 48 (Rated for Div. 2) {1016} | PROGRAMMING | Разбор Educational Codeforces Round 48 | 1800 | |
| 5020 | 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 | |
| 1330 | Rest In The Shades | binary search geometry | Statement | E | Educational Codeforces Round 48 (Rated for Div. 2) {1016} | PROGRAMMING | Разбор Educational Codeforces Round 48 | 2400 | |
| 1100 | Road Projects | dfs and similar dp trees | Statement | F | Educational Codeforces Round 48 (Rated for Div. 2) {1016} | PROGRAMMING | Разбор Educational Codeforces Round 48 | 2600 | |
| 364 | Appropriate Team | bitmasks math number theory | Statement | G | Educational Codeforces Round 48 (Rated for Div. 2) {1016} | PROGRAMMING | Разбор Educational Codeforces Round 48 | 2800 | |
| 16114 | Death Note | greedy implementation math | Statement | A | Educational Codeforces Round 48 (Rated for Div. 2) {1016} | PROGRAMMING | Разбор Educational Codeforces Round 48 | 900 | |
| 9727 | The Bits | implementation math | Statement | B | Codeforces Round 502 (in memory of Leopoldo Taravilse, Div. 1 + Div. 2) {1017} | PROGRAMMING | Разбор (англ.) | 1200 | |
| 6547 | The Phone Number | constructive algorithms greedy | Statement | C | Codeforces Round 502 (in memory of Leopoldo Taravilse, Div. 1 + Div. 2) {1017} | PROGRAMMING | Разбор (англ.) | 1600 | |
| 4105 | The Wu | bitmasks brute force data structures | Statement | D | Codeforces Round 502 (in memory of Leopoldo Taravilse, Div. 1 + Div. 2) {1017} | PROGRAMMING | Разбор (англ.) | 1900 | |
| 1132 | The Supersonic Rocket | geometry hashing strings | Statement | E | Codeforces Round 502 (in memory of Leopoldo Taravilse, Div. 1 + Div. 2) {1017} | PROGRAMMING | Разбор (англ.) | 2400 | |
| 1060 | The Neutral Zone | brute force math | Statement | F | Codeforces Round 502 (in memory of Leopoldo Taravilse, Div. 1 + Div. 2) {1017} | PROGRAMMING | Разбор (англ.) | 2500 | |
| 1349 | The Tree | data structures | Statement | G | Codeforces Round 502 (in memory of Leopoldo Taravilse, Div. 1 + Div. 2) {1017} | PROGRAMMING | Разбор (англ.) | 3200 | |
| 319 | The Films | brute force | Statement | H | Codeforces Round 502 (in memory of Leopoldo Taravilse, Div. 1 + Div. 2) {1017} | PROGRAMMING | Разбор (англ.) | 3300 | |
| 21730 | The Rank | implementation | Statement | A | Codeforces Round 502 (in memory of Leopoldo Taravilse, Div. 1 + Div. 2) {1017} | PROGRAMMING | Разбор (англ.) | 700 | |
| 4887 | Elections | brute force greedy | Statement | A | Codeforces Round 503 (by SIS, Div. 1) {1019} | PROGRAMMING | 61161 | 1800 | |
| 2162 | The hat | binary search interactive | Statement | B | Codeforces Round 503 (by SIS, Div. 1) {1019} | PROGRAMMING | 61161 | 2200 | |
| 776 | Large Triangle | binary search geometry sortings | Statement | D | Codeforces Round 503 (by SIS, Div. 1) {1019} | PROGRAMMING | 61161 | 2700 | |
| 1617 | Sergey's problem | constructive algorithms graphs | Statement | C | Codeforces Round 503 (by SIS, Div. 1) {1019} | PROGRAMMING | 61161 | 2800 | |
| 535 | Raining season | data structures divide and conquer trees | Statement | E | Codeforces Round 503 (by SIS, Div. 1) {1019} | PROGRAMMING | 61161 | 3200 | |
| 26153 | 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 | |
| 9504 | 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 | |
| 11866 | 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 | |
| 11077 | 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 | |
| 9396 | 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 | |
| 4363 | 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 | |
| 2275 | 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 | |
| 1077 | 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 | |
| 195 | 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 | |
| 8795 | 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 | |
| 6563 | 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 | |
| 4322 | 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 | |
| 627 | 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 | |
| 955 | 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 | |
| 1050 | 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 | |
| 16759 | 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 | |
| 19305 | Palindromic Twist | implementation strings | Statement | A | Educational Codeforces Round 49 (Rated for Div. 2) {1027} | PROGRAMMING | Educational Codeforces Round 49 Editorial | 1000 | |
| 8812 | Numbers on the Chessboard | implementation math | Statement | B | Educational Codeforces Round 49 (Rated for Div. 2) {1027} | PROGRAMMING | Educational Codeforces Round 49 Editorial | 1300 | |
| 7172 | Minimum Value Rectangle | greedy | Statement | C | Educational Codeforces Round 49 (Rated for Div. 2) {1027} | PROGRAMMING | Educational Codeforces Round 49 Editorial | 1600 | |
| 8693 | Mouse Hunt | dfs and similar graphs | Statement | D | Educational Codeforces Round 49 (Rated for Div. 2) {1027} | PROGRAMMING | Educational Codeforces Round 49 Editorial | 1700 | |
| 2436 | Inverse Coloring | combinatorics dp math | Statement | E | Educational Codeforces Round 49 (Rated for Div. 2) {1027} | PROGRAMMING | Educational Codeforces Round 49 Editorial | 2100 | |
| 2048 | 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 | |
| 388 | 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 | |
| 10463 | Unnatural Conditions | constructive algorithms math | Statement | B | AIM Tech Round 5 (rated, Div. 1 + Div. 2) {1028} | PROGRAMMING | 61493 | 1300 | |
| 5166 | Rectangles | geometry implementation sortings | Statement | C | AIM Tech Round 5 (rated, Div. 1 + Div. 2) {1028} | PROGRAMMING | 61493 | 1600 | |
| 1846 | Order book | combinatorics data structures greedy | Statement | D | AIM Tech Round 5 (rated, Div. 1 + Div. 2) {1028} | PROGRAMMING | 61493 | 2100 | |
| 1232 | Restore Array | constructive algorithms | Statement | E | AIM Tech Round 5 (rated, Div. 1 + Div. 2) {1028} | PROGRAMMING | 61493 | 2400 | |
| 672 | Make Symmetrical | brute force | Statement | F | AIM Tech Round 5 (rated, Div. 1 + Div. 2) {1028} | PROGRAMMING | 61493 | 2800 | |
| 632 | Make Square | math | Statement | H | AIM Tech Round 5 (rated, Div. 1 + Div. 2) {1028} | PROGRAMMING | 61493 | 2900 | |
| 738 | Guess the number | dp interactive | Statement | G | AIM Tech Round 5 (rated, Div. 1 + Div. 2) {1028} | PROGRAMMING | 61493 | 2900 | |
| 11651 | Find Square | implementation | Statement | A | AIM Tech Round 5 (rated, Div. 1 + Div. 2) {1028} | PROGRAMMING | 61493 | 800 | |
| 18754 | Creating the Contest | dp greedy math | Statement | B | Codeforces Round 506 (Div. 3) {1029} | PROGRAMMING | Codeforces Round #506 (Div. 3) Editorial | 1200 | |
| 13653 | Many Equal Substrings | implementation strings | Statement | A | Codeforces Round 506 (Div. 3) {1029} | PROGRAMMING | Codeforces Round #506 (Div. 3) Editorial | 1300 | |
| 8485 | Maximal Intersection | greedy math sortings | Statement | C | Codeforces Round 506 (Div. 3) {1029} | PROGRAMMING | Codeforces Round #506 (Div. 3) Editorial | 1600 | |
| 2893 | 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 | |
| 4334 | Concatenated Multiples | implementation math | Statement | D | Codeforces Round 506 (Div. 3) {1029} | PROGRAMMING | Codeforces Round #506 (Div. 3) Editorial | 2100 | |
| 3552 | Tree with Small Distances | dp graphs greedy | Statement | E | Codeforces Round 506 (Div. 3) {1029} | PROGRAMMING | Codeforces Round #506 (Div. 3) Editorial | 2200 | |
| 13392 | Vasya and Cornfield | geometry | Statement | B | Technocup 2019 - Elimination Round 1 {1030} | PROGRAMMING | Сodeforces Round 512 (and Technocup — Elimination Round 1) Editorial | 1100 | |
| 10021 | Vasya and Golden Ticket | implementation | Statement | C | Technocup 2019 - Elimination Round 1 {1030} | PROGRAMMING | Сodeforces Round 512 (and Technocup — Elimination Round 1) Editorial | 1300 | |
| 6307 | 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 | |
| 3404 | 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 | |
| 967 | Putting Boxes Together | data structures | Statement | F | Technocup 2019 - Elimination Round 1 {1030} | PROGRAMMING | Сodeforces Round 512 (and Technocup — Elimination Round 1) Editorial | 2600 | |
| 494 | Linear Congruential Generator | number theory | Statement | G | Technocup 2019 - Elimination Round 1 {1030} | PROGRAMMING | Сodeforces Round 512 (and Technocup — Elimination Round 1) Editorial | 3000 | |
| 179339 | 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 | |
| 4101 | Curiosity Has No Limits | Statement | B | Technocup 2019 - Elimination Round 2 {1031} | PROGRAMMING | Codeforces Round #517 and Technocup 2019 Elimination Round 2 Editorial | 1500 | ||
| 5636 | Cram Time | greedy | Statement | C | Technocup 2019 - Elimination Round 2 {1031} | PROGRAMMING | Codeforces Round #517 and Technocup 2019 Elimination Round 2 Editorial | 1700 | |
| 3019 | Minimum path | greedy | Statement | D | Technocup 2019 - Elimination Round 2 {1031} | PROGRAMMING | Codeforces Round #517 and Technocup 2019 Elimination Round 2 Editorial | 2000 | |
| 327 | 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 | |
| 606 | Triple Flips | constructive algorithms | Statement | E | Technocup 2019 - Elimination Round 2 {1031} | PROGRAMMING | Codeforces Round #517 and Technocup 2019 Elimination Round 2 Editorial | 2900 | |
| 13449 | Golden Plate | implementation math | Statement | A | Technocup 2019 - Elimination Round 2 {1031} | PROGRAMMING | Codeforces Round #517 and Technocup 2019 Elimination Round 2 Editorial | 700 | |
| 7421 | Kitchen Utensils | Statement | A | Technocup 2019 - Elimination Round 3 {1032} | PROGRAMMING | Codeforces Round #522 and Technocup 2019 Elimination Round 3 Editorial | 1100 | ||
| 5182 | Personalized Cup | Statement | B | Technocup 2019 - Elimination Round 3 {1032} | PROGRAMMING | Codeforces Round #522 and Technocup 2019 Elimination Round 3 Editorial | 1300 | ||
| 4405 | 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 | |
| 2997 | Barcelonian Distance | geometry implementation | Statement | D | Technocup 2019 - Elimination Round 3 {1032} | PROGRAMMING | Codeforces Round #522 and Technocup 2019 Elimination Round 3 Editorial | 1900 | |
| 1920 | 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 | |
| 1188 | 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 | |
| 562 | Chattering | Statement | G | Technocup 2019 - Elimination Round 3 {1032} | PROGRAMMING | Codeforces Round #522 and Technocup 2019 Elimination Round 3 Editorial | 2700 | ||
| 16574 | 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 | |
| 12352 | 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 | |
| 6403 | 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 | |
| 2667 | 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 | |
| 889 | 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 | |
| 513 | 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 | |
| 670 | 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 | |
| 10235 | Enlarge GCD | number theory | Statement | A | Codeforces Round 511 (Div. 1) {1034} | PROGRAMMING | Codeforces Round #511 Editorial | 1700 | |
| 2347 | 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 | |
| 1152 | Region Separation | combinatorics dp number theory trees | Statement | C | Codeforces Round 511 (Div. 1) {1034} | PROGRAMMING | Codeforces Round #511 Editorial | 2900 | |
| 828 | Little C Loves 3 III | bitmasks dp math | Statement | E | Codeforces Round 511 (Div. 1) {1034} | PROGRAMMING | Codeforces Round #511 Editorial | 3200 | |
| 620 | Intervals of Intervals | binary search data structures two pointers | Statement | D | Codeforces Round 511 (Div. 1) {1034} | PROGRAMMING | Codeforces Round #511 Editorial | 3500 | |
| 10694 | Function Height | math | Statement | A | Educational Codeforces Round 50 (Rated for Div. 2) {1036} | PROGRAMMING | 61727 | 1000 | |
| 10847 | Vasya and Arrays | greedy two pointers | Statement | D | Educational Codeforces Round 50 (Rated for Div. 2) {1036} | PROGRAMMING | 61727 | 1600 | |
| 6014 | Diagonal Walking v.2 | math | Statement | B | Educational Codeforces Round 50 (Rated for Div. 2) {1036} | PROGRAMMING | 61727 | 1600 | |
| 14587 | Classy Numbers | combinatorics dp | Statement | C | Educational Codeforces Round 50 (Rated for Div. 2) {1036} | PROGRAMMING | 61727 | 1800 | |
| 1807 | Covered Points | fft geometry number theory | Statement | E | Educational Codeforces Round 50 (Rated for Div. 2) {1036} | PROGRAMMING | 61727 | 2300 | |
| 1910 | Relatively Prime Powers | combinatorics math number theory | Statement | F | Educational Codeforces Round 50 (Rated for Div. 2) {1036} | PROGRAMMING | 61727 | 2400 | |
| 478 | Sources and Sinks | bitmasks brute force dfs and similar | Statement | G | Educational Codeforces Round 50 (Rated for Div. 2) {1036} | PROGRAMMING | 61727 | 2800 | |
| 10963 | Reach Median | greedy | Statement | B | Manthan, Codefest 18 (rated, Div. 1 + Div. 2) {1037} | PROGRAMMING | Tutorial | 1300 | |
| 11901 | Packets | constructive algorithms greedy math | Statement | A | Manthan, Codefest 18 (rated, Div. 1 + Div. 2) {1037} | PROGRAMMING | Tutorial | 1300 | |
| 20289 | Equalize | dp greedy strings | Statement | C | Manthan, Codefest 18 (rated, Div. 1 + Div. 2) {1037} | PROGRAMMING | Tutorial | 1300 | |
| 20352 | Valid BFS? | dfs and similar graphs shortest paths trees | Statement | D | Manthan, Codefest 18 (rated, Div. 1 + Div. 2) {1037} | PROGRAMMING | Tutorial | 1700 | |
| 3194 | Trips | graphs | Statement | E | Manthan, Codefest 18 (rated, Div. 1 + Div. 2) {1037} | PROGRAMMING | Tutorial | 2100 | |
| 1320 | Maximum Reduction | combinatorics data structures math | Statement | F | Manthan, Codefest 18 (rated, Div. 1 + Div. 2) {1037} | PROGRAMMING | Tutorial | 2400 | |
| 1379 | Security | data structures string suffix structures | Statement | H | Manthan, Codefest 18 (rated, Div. 1 + Div. 2) {1037} | PROGRAMMING | Tutorial | 2900 | |
| 390 | A Game on Strings | games | Statement | G | Manthan, Codefest 18 (rated, Div. 1 + Div. 2) {1037} | PROGRAMMING | Tutorial | 2900 | |
| 14990 | Non-Coprime Partition | constructive algorithms math | Statement | B | Codeforces Round 508 (Div. 2) {1038} | PROGRAMMING | Tutorial | 1100 | |
| 9890 | Gambling | greedy sortings | Statement | C | Codeforces Round 508 (Div. 2) {1038} | PROGRAMMING | Tutorial | 1300 | |
| 8987 | Slime | dp greedy implementation | Statement | D | Codeforces Round 508 (Div. 2) {1038} | PROGRAMMING | Tutorial | 1700 | |
| 1170 | Maximum Matching | bitmasks brute force dfs and similar dp graphs | Statement | E | Codeforces Round 508 (Div. 2) {1038} | PROGRAMMING | Tutorial | 2400 | |
| 584 | Wrap Around | dp strings | Statement | F | Codeforces Round 508 (Div. 2) {1038} | PROGRAMMING | Tutorial | 2900 | |
| 15778 | Equality | implementation strings | Statement | A | Codeforces Round 508 (Div. 2) {1038} | PROGRAMMING | Tutorial | 800 | |
| 2625 | Subway Pursuit | binary search interactive probabilities | Statement | B | Codeforces Round 507 (Div. 1, based on Olympiad of Metropolises) {1039} | PROGRAMMING | 61668 | 2100 |