Review the problem statement from Codeforces (link will open a new tab). When you've matched your problem, go to the solutions.
Get exact match for tags using this format, eg: [u'brute force', 'dp']
< 1 2 3 ... 41 42 43 44 45 ... 100 101 102 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 5659 | XOR-pyramid | dp | Statement | B | Codeforces Round 483 (Div. 1) [Thanks, Botan Investments and Victor Shaburov!] {983} | PROGRAMMING | Codeforces Round #483 [Thanks, Botan Investments and Victor Shaburov!] Editoral | 1900 | |
| 844 | Elevator | dp graphs shortest paths | Statement | C | Codeforces Round 483 (Div. 1) [Thanks, Botan Investments and Victor Shaburov!] {983} | PROGRAMMING | Codeforces Round #483 [Thanks, Botan Investments and Victor Shaburov!] Editoral | 2500 | |
| 984 | NN country | binary search data structures trees | Statement | E | Codeforces Round 483 (Div. 1) [Thanks, Botan Investments and Victor Shaburov!] {983} | PROGRAMMING | Codeforces Round #483 [Thanks, Botan Investments and Victor Shaburov!] Editoral | 2700 | |
| 418 | Arkady and Rectangles | data structures | Statement | D | Codeforces Round 483 (Div. 1) [Thanks, Botan Investments and Victor Shaburov!] {983} | PROGRAMMING | Codeforces Round #483 [Thanks, Botan Investments and Victor Shaburov!] Editoral | 3300 | |
| 7449 | Minesweeper | implementation | Statement | B | Codeforces Round 483 (Div. 2) [Thanks, Botan Investments and Victor Shaburov!] {984} | PROGRAMMING | Codeforces Round #483 [Thanks, Botan Investments and Victor Shaburov!] Editoral | 1100 | |
| 19687 | Game | sortings | Statement | A | Codeforces Round 483 (Div. 2) [Thanks, Botan Investments and Victor Shaburov!] {984} | PROGRAMMING | Codeforces Round #483 [Thanks, Botan Investments and Victor Shaburov!] Editoral | 700 | |
| 7481 | Switches and Lamps | implementation | Statement | B | Educational Codeforces Round 44 (Rated for Div. 2) {985} | PROGRAMMING | Educational Codeforces Round 44 Editorial | 1200 | |
| 8216 | Chess Placing | implementation | Statement | A | Educational Codeforces Round 44 (Rated for Div. 2) {985} | PROGRAMMING | Educational Codeforces Round 44 Editorial | 1200 | |
| 5824 | Liebig's Barrels | greedy | Statement | C | Educational Codeforces Round 44 (Rated for Div. 2) {985} | PROGRAMMING | 1500 | ||
| 3725 | Pencils and Boxes | binary search data structures dp greedy two pointers | Statement | E | Educational Codeforces Round 44 (Rated for Div. 2) {985} | PROGRAMMING | Educational Codeforces Round 44 Editorial | 2000 | |
| 2600 | Sand Fortress | binary search constructive algorithms math | Statement | D | Educational Codeforces Round 44 (Rated for Div. 2) {985} | PROGRAMMING | Educational Codeforces Round 44 Editorial | 2100 | |
| 1888 | Isomorphic Strings | hashing strings | Statement | F | Educational Codeforces Round 44 (Rated for Div. 2) {985} | PROGRAMMING | 2400 | ||
| 546 | Team Players | combinatorics | Statement | G | Educational Codeforces Round 44 (Rated for Div. 2) {985} | PROGRAMMING | Educational Codeforces Round 44 Editorial | 2700 | |
| 7124 | Fair | graphs greedy number theory shortest paths | Statement | A | Codeforces Round 485 (Div. 1) {986} | PROGRAMMING | Codeforces Round #485 Editorial | 1600 | |
| 4753 | Petr and Permutations | combinatorics math | Statement | B | Codeforces Round 485 (Div. 1) {986} | PROGRAMMING | Codeforces Round #485 Editorial | 1800 | |
| 2493 | AND Graph | bitmasks dfs and similar ds graphs | Statement | C | Codeforces Round 485 (Div. 1) {986} | PROGRAMMING | Codeforces Round #485 Editorial | 2300 | |
| 333 | Perfect Encoding | fft math | Statement | D | Codeforces Round 485 (Div. 1) {986} | PROGRAMMING | Codeforces Round #485 Editorial | 2600 | |
| 806 | Prince's Problem | brute force data structures math number theory trees | Statement | E | Codeforces Round 485 (Div. 1) {986} | PROGRAMMING | Codeforces Round #485 Editorial | 2900 | |
| 649 | Oppa Funcan Style Remastered | graphs math number theory shortest paths | Statement | F | Codeforces Round 485 (Div. 1) {986} | PROGRAMMING | Codeforces Round #485 Editorial | 3200 | |
| 11720 | High School: Become Human | math | Statement | B | Codeforces Round 485 (Div. 2) {987} | PROGRAMMING | Codeforces Round #485 Editorial | 1200 | |
| 13759 | Three displays | brute force dp implementation | Statement | C | Codeforces Round 485 (Div. 2) {987} | PROGRAMMING | Codeforces Round #485 Editorial | 1400 | |
| 16811 | Infinity Gauntlet | implementation | Statement | A | Codeforces Round 485 (Div. 2) {987} | PROGRAMMING | Codeforces Round #485 Editorial | 700 | |
| 18873 | Substrings Sort | sortings strings | Statement | B | Codeforces Round 486 (Div. 3) {988} | PROGRAMMING | 59810 | 1100 | |
| 10376 | Equal Sums | implementation sortings | Statement | C | Codeforces Round 486 (Div. 3) {988} | PROGRAMMING | 59810 | 1400 | |
| 7423 | Points and Powers of Two | brute force math | Statement | D | Codeforces Round 486 (Div. 3) {988} | PROGRAMMING | 59810 | 1800 | |
| 4052 | Divisibility by 25 | brute force greedy | Statement | E | Codeforces Round 486 (Div. 3) {988} | PROGRAMMING | 59810 | 2100 | |
| 2375 | Rain and Umbrellas | dp | Statement | F | Codeforces Round 486 (Div. 3) {988} | PROGRAMMING | 59810 | 2300 | |
| 25631 | Diverse Team | brute force implementation | Statement | A | Codeforces Round 486 (Div. 3) {988} | PROGRAMMING | 59810 | 800 | |
| 10574 | A Blend of Springtime | implementation strings | Statement | A | Codeforces Round 487 (Div. 2) {989} | PROGRAMMING | Codeforces Round #487 (Div. 2) Editorial | 1000 | |
| 7082 | A Tide of Riverscape | constructive algorithms strings | Statement | B | Codeforces Round 487 (Div. 2) {989} | PROGRAMMING | Codeforces Round #487 (Div. 2) Editorial | 1300 | |
| 3848 | A Mist of Florescence | constructive algorithms graphs | Statement | C | Codeforces Round 487 (Div. 2) {989} | PROGRAMMING | Codeforces Round #487 (Div. 2) Editorial | 1800 | |
| 520 | A Shade of Moonlight | binary search geometry math sortings two pointers | Statement | D | Codeforces Round 487 (Div. 2) {989} | PROGRAMMING | Codeforces Round #487 (Div. 2) Editorial | 2500 | |
| 253 | A Trance of Nightfall | dp geometry matrices probabilities | Statement | E | Codeforces Round 487 (Div. 2) {989} | PROGRAMMING | Codeforces Round #487 (Div. 2) Editorial | 2900 | |
| 10693 | Commentary Boxes | implementation math | Statement | A | Educational Codeforces Round 45 (Rated for Div. 2) {990} | PROGRAMMING | Educational Codeforces Round 45 Editorial | 1000 | |
| 8190 | Micro-World | greedy sortings | Statement | B | Educational Codeforces Round 45 (Rated for Div. 2) {990} | PROGRAMMING | Educational Codeforces Round 45 Editorial | 1200 | |
| 5965 | Bracket Sequences Concatenation Problem | implementation | Statement | C | Educational Codeforces Round 45 (Rated for Div. 2) {990} | PROGRAMMING | Educational Codeforces Round 45 Editorial | 1500 | |
| 3876 | 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 | |
| 2049 | Post Lamps | brute force greedy | Statement | E | Educational Codeforces Round 45 (Rated for Div. 2) {990} | PROGRAMMING | Educational Codeforces Round 45 Editorial | 2000 | |
| 1922 | GCD Counting | divide and conquer dp ds number theory trees | Statement | G | Educational Codeforces Round 45 (Rated for Div. 2) {990} | PROGRAMMING | Educational Codeforces Round 45 Editorial | 2400 | |
| 924 | 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 | |
| 10687 | If at first you don't succeed... | implementation | Statement | A | Codeforces Round 491 (Div. 2) {991} | PROGRAMMING | 60181 | 1100 | |
| 12781 | Getting an A | greedy sortings | Statement | B | Codeforces Round 491 (Div. 2) {991} | PROGRAMMING | 60181 | 1100 | |
| 10683 | Candies | binary search implementation | Statement | C | Codeforces Round 491 (Div. 2) {991} | PROGRAMMING | 60181 | 1500 | |
| 7278 | Bishwock | dp greedy | Statement | D | Codeforces Round 491 (Div. 2) {991} | PROGRAMMING | 60181 | 1500 | |
| 3529 | Bus Number | brute force combinatorics math | Statement | E | Codeforces Round 491 (Div. 2) {991} | PROGRAMMING | 60181 | 1800 | |
| 311 | Concise and clear | brute force greedy implementation math | Statement | F | Codeforces Round 491 (Div. 2) {991} | PROGRAMMING | 60181 | 2800 | |
| 6348 | Nastya Studies Informatics | math number theory | Statement | B | Codeforces Round 489 (Div. 2) {992} | PROGRAMMING | 60083 | 1700 | |
| 4634 | Nastya and a Wardrobe | math | Statement | C | Codeforces Round 489 (Div. 2) {992} | PROGRAMMING | 60083 | 1700 | |
| 1667 | Nastya and a Game | brute force implementation math | Statement | D | Codeforces Round 489 (Div. 2) {992} | PROGRAMMING | 60083 | 2100 | |
| 1482 | Nastya and King-Shamans | binary search data structures | Statement | E | Codeforces Round 489 (Div. 2) {992} | PROGRAMMING | 2600 | ||
| 13358 | Nastya and an Array | implementation sortings | Statement | A | Codeforces Round 489 (Div. 2) {992} | PROGRAMMING | 60083 | 900 | |
| 4181 | Two Squares | geometry implementation | Statement | A | Codeforces Round 488 by NEAR (Div. 1) {993} | PROGRAMMING | Codeforces Round #488 editorial | 1700 | |
| 1970 | Open Communication | bitmasks brute force | Statement | B | Codeforces Round 488 by NEAR (Div. 1) {993} | PROGRAMMING | Codeforces Round #488 editorial | 1900 | |
| 1716 | Careful Maneuvering | bitmasks brute force geometry | Statement | C | Codeforces Round 488 by NEAR (Div. 1) {993} | PROGRAMMING | Codeforces Round #488 editorial | 2100 | |
| 1459 | 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 | |
| 761 | Compute Power | binary search dp greedy | Statement | D | Codeforces Round 488 by NEAR (Div. 1) {993} | PROGRAMMING | 2400 | ||
| 62 | The Moral Dilemma | Statement | F | Codeforces Round 488 by NEAR (Div. 1) {993} | PROGRAMMING | Codeforces Round #488 editorial | 3100 | ||
| 5769 | Knights of a Polygonal Table | greedy implementation sortings | Statement | B | Codeforces Round 488 by NEAR (Div. 2) {994} | PROGRAMMING | Codeforces Round #488 editorial | 1400 | |
| 14334 | Fingerprints | implementation | Statement | A | Codeforces Round 488 by NEAR (Div. 2) {994} | PROGRAMMING | Codeforces Round #488 editorial | 700 | |
| 7133 | 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 | |
| 1712 | Tesla | constructive algorithms implementation | Statement | A | Codeforces Round 492 (Div. 1) [Thanks, uDebug!] {995} | PROGRAMMING | Editorial for Codeforces Round #492 [Thanks u-Debug!] | 2100 | |
| 1923 | 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 | |
| 777 | Game | math | Statement | D | Codeforces Round 492 (Div. 1) [Thanks, uDebug!] {995} | PROGRAMMING | Editorial for Codeforces Round #492 [Thanks u-Debug!] | 2400 | |
| 703 | 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 | |
| 1287 | 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 | |
| 9178 | 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 | |
| 95543 | 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 | |
| 8359 | Convert to Ones | brute force greedy implementation math | Statement | A | Codeforces Round 493 (Div. 1) {997} | PROGRAMMING | 60357 | 1500 | |
| 3017 | Roman Digits | brute force combinatorics dp greedy math | Statement | B | Codeforces Round 493 (Div. 1) {997} | PROGRAMMING | 60357 | 2000 | |
| 1772 | Sky Full of Stars | combinatorics math | Statement | C | Codeforces Round 493 (Div. 1) {997} | PROGRAMMING | 60357 | 2600 | |
| 467 | Cycles in product | combinatorics divide and conquer trees | Statement | D | Codeforces Round 493 (Div. 1) {997} | PROGRAMMING | 60357 | 2800 | |
| 1349 | Good Subsegments | data structures | Statement | E | Codeforces Round 493 (Div. 1) {997} | PROGRAMMING | 60357 | 3000 | |
| 9710 | Balloons | constructive algorithms implementation | Statement | A | Codeforces Round 493 (Div. 2) {998} | PROGRAMMING | Codeforces Round #493 — Editorial | 1000 | |
| 13282 | Cutting | dp greedy sortings | Statement | B | Codeforces Round 493 (Div. 2) {998} | PROGRAMMING | Codeforces Round #493 — Editorial | 1200 | |
| 18727 | Alphabetic Removals | implementation | Statement | C | Codeforces Round 490 (Div. 3) {999} | PROGRAMMING | 60138 | 1200 | |
| 6829 | Reachability from the Capital | dfs and similar graphs greedy | Statement | E | Codeforces Round 490 (Div. 3) {999} | PROGRAMMING | 60138 | 1900 | |
| 4464 | Equalize the Remainders | data structures greedy implementation | Statement | D | Codeforces Round 490 (Div. 3) {999} | PROGRAMMING | 60138 | 1900 | |
| 2793 | Cards and Joy | dp | Statement | F | Codeforces Round 490 (Div. 3) {999} | PROGRAMMING | 60138 | 2200 | |
| 23562 | Mishka and Contest | brute force implementation | Statement | A | Codeforces Round 490 (Div. 3) {999} | PROGRAMMING | 60138 | 800 | |
| 18046 | Reversing Encryption | implementation | Statement | B | Codeforces Round 490 (Div. 3) {999} | PROGRAMMING | 60138 | 900 | |
| 8918 | Codehorses T-shirts | greedy implementation | Statement | A | Educational Codeforces Round 46 (Rated for Div. 2) {1000} | PROGRAMMING | 60288 | 1200 | |
| 5938 | Light It Up | greedy | Statement | B | Educational Codeforces Round 46 (Rated for Div. 2) {1000} | PROGRAMMING | 60288 | 1600 | |
| 6948 | Covered Points Count | data structures implementation sortings | Statement | C | Educational Codeforces Round 46 (Rated for Div. 2) {1000} | PROGRAMMING | 60288 | 1700 | |
| 4374 | Yet Another Problem On a Subsequence | combinatorics dp | Statement | D | Educational Codeforces Round 46 (Rated for Div. 2) {1000} | PROGRAMMING | 60288 | 1900 | |
| 4859 | We Need More Bosses | dfs and similar graphs trees | Statement | E | Educational Codeforces Round 46 (Rated for Div. 2) {1000} | PROGRAMMING | 60288 | 2100 | |
| 3998 | One Occurrence | data structures divide and conquer | Statement | F | Educational Codeforces Round 46 (Rated for Div. 2) {1000} | PROGRAMMING | 60288 | 2400 | |
| 612 | Two-Paths | data structures dp trees | Statement | G | Educational Codeforces Round 46 (Rated for Div. 2) {1000} | PROGRAMMING | 60288 | 2800 | |
| 714 | Generate Bell state | *special | Statement | B | Microsoft Q# Coding Contest - Summer 2018 - Warmup {1001} | PROGRAMMING | Full editorial | 2000 | |
| 1017 | Generate plus state or minus state | *special | Statement | A | Microsoft Q# Coding Contest - Summer 2018 - Warmup {1001} | PROGRAMMING | Full editorial | 2200 | |
| 657 | Generate GHZ state | *special | Statement | C | Microsoft Q# Coding Contest - Summer 2018 - Warmup {1001} | PROGRAMMING | Full editorial | 2300 | |
| 685 | Distinguish plus state and minus state | *special | Statement | D | Microsoft Q# Coding Contest - Summer 2018 - Warmup {1001} | PROGRAMMING | Full editorial | 2300 | |
| 542 | Distinguish multi-qubit basis states | *special | Statement | F | Microsoft Q# Coding Contest - Summer 2018 - Warmup {1001} | PROGRAMMING | Full editorial | 2400 | |
| 559 | Distinguish Bell states | *special | Statement | E | Microsoft Q# Coding Contest - Summer 2018 - Warmup {1001} | PROGRAMMING | Full editorial | 2400 | |
| 536 | 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 | |
| 540 | Oracle for f(x) = k-th element of x | *special | Statement | G | Microsoft Q# Coding Contest - Summer 2018 - Warmup {1001} | PROGRAMMING | Full editorial | 2500 | |
| 403 | Deutsch-Jozsa algorithm | *special | Statement | I | Microsoft Q# Coding Contest - Summer 2018 - Warmup {1001} | PROGRAMMING | Full editorial | 2700 | |
| 561 | Generate superposition of zero state and a basis state | Statement | A2 | Microsoft Q# Coding Contest - Summer 2018 {1002} | PROGRAMMING | Editorial | 1900 | ||
| 478 | Generate superposition of two basis states | Statement | A3 | Microsoft Q# Coding Contest - Summer 2018 {1002} | PROGRAMMING | Editorial | 1900 | ||
| 862 | Generate superposition of all basis states | Statement | A1 | Microsoft Q# Coding Contest - Summer 2018 {1002} | PROGRAMMING | Editorial | 1900 | ||
| 480 | Distinguish zero state and W state | Statement | B1 | Microsoft Q# Coding Contest - Summer 2018 {1002} | PROGRAMMING | Editorial | 2000 |