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 ... 42 43 44 45 46 ... 100 101 102 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 407 | Oracle for f(x) = b * x mod 2 | Statement | D1 | Microsoft Q# Coding Contest - Summer 2018 {1002} | PROGRAMMING | Editorial | 2100 | ||
| 384 | Oracle for f(x) = b * x + (1 - b) * (1 - x) mod 2 | Statement | D2 | Microsoft Q# Coding Contest - Summer 2018 {1002} | PROGRAMMING | Editorial | 2100 | ||
| 448 | Distinguish GHZ state and W state | Statement | B2 | Microsoft Q# Coding Contest - Summer 2018 {1002} | PROGRAMMING | Editorial | 2100 | ||
| 413 | Distinguish four 2-qubit states | Statement | B3 | Microsoft Q# Coding Contest - Summer 2018 {1002} | PROGRAMMING | Editorial | 2100 | ||
| 323 | Bernstein-Vazirani algorithm | Statement | E1 | Microsoft Q# Coding Contest - Summer 2018 {1002} | PROGRAMMING | Editorial | 2100 | ||
| 335 | Oracle for majority function | Statement | D3 | Microsoft Q# Coding Contest - Summer 2018 {1002} | PROGRAMMING | Editorial | 2200 | ||
| 311 | Distinguish four 2-qubit states - 2 | Statement | B4 | Microsoft Q# Coding Contest - Summer 2018 {1002} | PROGRAMMING | Editorial | 2200 | ||
| 303 | Distinguish zero state and plus state with minimum error | Statement | C1 | Microsoft Q# Coding Contest - Summer 2018 {1002} | PROGRAMMING | Editorial | 2300 | ||
| 269 | Generate W state | Statement | A4 | Microsoft Q# Coding Contest - Summer 2018 {1002} | PROGRAMMING | Editorial | 2400 | ||
| 268 | Distinguish zero state and plus state without errors | Statement | C2 | Microsoft Q# Coding Contest - Summer 2018 {1002} | PROGRAMMING | Editorial | 2400 | ||
| 204 | Another array reconstruction algorithm | Statement | E2 | Microsoft Q# Coding Contest - Summer 2018 {1002} | PROGRAMMING | Editorial | 2400 | ||
| 10724 | Intense Heat | brute force implementation math | Statement | C | Codeforces Round 494 (Div. 3) {1003} | PROGRAMMING | 60417 | 1300 | |
| 11478 | Binary String Constructing | constructive algorithms | Statement | B | Codeforces Round 494 (Div. 3) {1003} | PROGRAMMING | 60417 | 1300 | |
| 7908 | Coins and Queries | greedy | Statement | D | Codeforces Round 494 (Div. 3) {1003} | PROGRAMMING | 60417 | 1600 | |
| 2765 | Tree Constructing | constructive algorithms graphs | Statement | E | Codeforces Round 494 (Div. 3) {1003} | PROGRAMMING | 60417 | 2200 | |
| 1402 | Abbreviation | dp hashing strings | Statement | F | Codeforces Round 494 (Div. 3) {1003} | PROGRAMMING | 60417 | 2400 | |
| 27542 | Polycarp's Pockets | implementation | Statement | A | Codeforces Round 494 (Div. 3) {1003} | PROGRAMMING | 60417 | 700 | |
| 7583 | Sonya and Robots | constructive algorithms implementation | Statement | C | Codeforces Round 495 (Div. 2) {1004} | PROGRAMMING | 60443 | 1400 | |
| 9574 | Sonya and Exhibition | constructive algorithms greedy implementation math | Statement | B | Codeforces Round 495 (Div. 2) {1004} | PROGRAMMING | 60443 | 1400 | |
| 1434 | Sonya and Matrix | brute force constructive algorithms implementation | Statement | D | Codeforces Round 495 (Div. 2) {1004} | PROGRAMMING | 60443 | 2200 | |
| 1092 | Sonya and Ice Cream | binary search data structures dp greedy shortest paths trees | Statement | E | Codeforces Round 495 (Div. 2) {1004} | PROGRAMMING | 60443 | 2400 | |
| 778 | Sonya and Bitwise OR | bitmasks data structures divide and conquer | Statement | F | Codeforces Round 495 (Div. 2) {1004} | PROGRAMMING | 60443 | 2900 | |
| 11424 | Sonya and Hotels | implementation | Statement | A | Codeforces Round 495 (Div. 2) {1004} | PROGRAMMING | 60443 | 900 | |
| 24143 | 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 | |
| 11885 | 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 | |
| 10356 | 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 | |
| 3987 | Median on Segments (Permutations Edition) | sortings | Statement | E1 | Codeforces Round 496 (Div. 3) {1005} | PROGRAMMING | Codeforces Round 496 (Div. 3): Problem Tutorials | 1900 | |
| 1799 | 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 | |
| 1326 | Median on Segments (General Case Edition) | sortings | Statement | E2 | Codeforces Round 496 (Div. 3) {1005} | PROGRAMMING | Codeforces Round 496 (Div. 3): Problem Tutorials | 2600 | |
| 24166 | Tanya and Stairways | implementation | Statement | A | Codeforces Round 496 (Div. 3) {1005} | PROGRAMMING | Codeforces Round 496 (Div. 3): Problem Tutorials | 700 | |
| 13481 | Polycarp's Practice | greedy implementation sortings | Statement | B | Codeforces Round 498 (Div. 3) {1006} | PROGRAMMING | 60672 | 1200 | |
| 21773 | Three Parts of the Array | binary search data structures two pointers | Statement | C | Codeforces Round 498 (Div. 3) {1006} | PROGRAMMING | 60672 | 1300 | |
| 10142 | Military Problem | dfs and similar graphs trees | Statement | E | Codeforces Round 498 (Div. 3) {1006} | PROGRAMMING | 60672 | 1600 | |
| 6049 | Two Strings Swaps | implementation | Statement | D | Codeforces Round 498 (Div. 3) {1006} | PROGRAMMING | 60672 | 1700 | |
| 5583 | Xor-Paths | bitmasks brute force dp meet-in-the-middle | Statement | F | Codeforces Round 498 (Div. 3) {1006} | PROGRAMMING | 60672 | 2400 | |
| 21807 | Adjacent Replacements | implementation | Statement | A | Codeforces Round 498 (Div. 3) {1006} | PROGRAMMING | 60672 | 700 | |
| 12256 | 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 | |
| 965 | 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 | |
| 420 | Guess two numbers | binary search interactive | Statement | C | Codeforces Round 497 (Div. 1) {1007} | PROGRAMMING | Editorial for Codeforces Round #497 by Skyglow | 2800 | |
| 293 | Ants | 2-sat data structures trees | Statement | D | Codeforces Round 497 (Div. 1) {1007} | PROGRAMMING | Editorial for Codeforces Round #497 by Skyglow | 3200 | |
| 220 | Mini Metro | dp | Statement | E | Codeforces Round 497 (Div. 1) {1007} | PROGRAMMING | Editorial for Codeforces Round #497 by Skyglow | 3500 | |
| 11527 | Turn the Rectangles | greedy sortings | Statement | B | Codeforces Round 497 (Div. 2) {1008} | PROGRAMMING | Editorial for Codeforces Round #497 by Skyglow | 1100 | |
| 15324 | Romaji | implementation strings | Statement | A | Codeforces Round 497 (Div. 2) {1008} | PROGRAMMING | Editorial for Codeforces Round #497 by Skyglow | 900 | |
| 10213 | Minimum Ternary String | greedy implementation | Statement | B | Educational Codeforces Round 47 (Rated for Div. 2) {1009} | PROGRAMMING | 60630 | 1500 | |
| 6296 | Relatively Prime Graph | brute force constructive algorithms graphs greedy math | Statement | D | Educational Codeforces Round 47 (Rated for Div. 2) {1009} | PROGRAMMING | 60630 | 1700 | |
| 5319 | Annoying Present | greedy math | Statement | C | Educational Codeforces Round 47 (Rated for Div. 2) {1009} | PROGRAMMING | 60630 | 1700 | |
| 3037 | Intercity Travelling | combinatorics math probabilities | Statement | E | Educational Codeforces Round 47 (Rated for Div. 2) {1009} | PROGRAMMING | 60630 | 1900 | |
| 6022 | Dominant Indices | data structures ds trees | Statement | F | Educational Codeforces Round 47 (Rated for Div. 2) {1009} | PROGRAMMING | 60630 | 2300 | |
| 862 | Allowed Letters | bitmasks flows graph matchings graphs greedy | Statement | G | Educational Codeforces Round 47 (Rated for Div. 2) {1009} | PROGRAMMING | 60630 | 2500 | |
| 11860 | Game Shopping | implementation | Statement | A | Educational Codeforces Round 47 (Rated for Div. 2) {1009} | PROGRAMMING | 60630 | 800 | |
| 8130 | Fly | binary search math | Statement | A | Codeforces Round 499 (Div. 1) {1010} | PROGRAMMING | 60851 | 1500 | |
| 5260 | Rocket | binary search interactive | Statement | B | Codeforces Round 499 (Div. 1) {1010} | PROGRAMMING | 60851 | 1800 | |
| 4928 | Border | number theory | Statement | C | Codeforces Round 499 (Div. 1) {1010} | PROGRAMMING | 60851 | 1800 | |
| 2403 | Mars rover | dfs and similar graphs implementation trees | Statement | D | Codeforces Round 499 (Div. 1) {1010} | PROGRAMMING | 60851 | 2100 | |
| 347 | Store | data structures | Statement | E | Codeforces Round 499 (Div. 1) {1010} | PROGRAMMING | 60851 | 2700 | |
| 225 | Tree | fft graphs trees | Statement | F | Codeforces Round 499 (Div. 1) {1010} | PROGRAMMING | 60851 | 3400 | |
| 12362 | Stages | greedy implementation sortings | Statement | A | Codeforces Round 499 (Div. 2) {1011} | PROGRAMMING | 60851 | 1000 | |
| 10278 | Planning The Expedition | binary search brute force implementation | Statement | B | Codeforces Round 499 (Div. 2) {1011} | PROGRAMMING | 60851 | 1200 | |
| 6454 | Photo of The Sky | brute force implementation math sortings | Statement | A | Codeforces Round 500 (Div. 1) [based on EJOI] {1012} | PROGRAMMING | 60920 | 1500 | |
| 4075 | Chemical table | constructive algorithms dfs and similar ds graphs matrices | Statement | B | Codeforces Round 500 (Div. 1) [based on EJOI] {1012} | PROGRAMMING | 1900 | ||
| 3544 | Hills | dp | Statement | C | Codeforces Round 500 (Div. 1) [based on EJOI] {1012} | PROGRAMMING | 2000 | ||
| 387 | AB-Strings | constructive algorithms strings | Statement | D | Codeforces Round 500 (Div. 1) [based on EJOI] {1012} | PROGRAMMING | 60920 | 2700 | |
| 333 | Cycle sort | ds math | Statement | E | Codeforces Round 500 (Div. 1) [based on EJOI] {1012} | PROGRAMMING | 60920 | 3100 | |
| 161 | Passports | dp implementation | Statement | F | Codeforces Round 500 (Div. 1) [based on EJOI] {1012} | PROGRAMMING | 3200 | ||
| 7750 | And | greedy | Statement | B | Codeforces Round 500 (Div. 2) [based on EJOI] {1013} | PROGRAMMING | Codeforces Round #500 (based on EJOI 2018) — Editorial | 1200 | |
| 11025 | 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 | |
| 18435 | Songs Compression | sortings | Statement | C | Codeforces Round 501 (Div. 3) {1015} | PROGRAMMING | 60949 | 1100 | |
| 11705 | Obtaining the String | implementation | Statement | B | Codeforces Round 501 (Div. 3) {1015} | PROGRAMMING | 60949 | 1300 | |
| 8368 | Walking Between Houses | constructive algorithms greedy | Statement | D | Codeforces Round 501 (Div. 3) {1015} | PROGRAMMING | 60949 | 1600 | |
| 6010 | Stars Drawing (Easy Edition) | brute force dp greedy | Statement | E1 | Codeforces Round 501 (Div. 3) {1015} | PROGRAMMING | 60949 | 1700 | |
| 3682 | Stars Drawing (Hard Edition) | binary search dp greedy | Statement | E2 | Codeforces Round 501 (Div. 3) {1015} | PROGRAMMING | 60949 | 2000 | |
| 1180 | Bracket Substring | dp strings | Statement | F | Codeforces Round 501 (Div. 3) {1015} | PROGRAMMING | 60949 | 2600 | |
| 21217 | Points in Segments | implementation | Statement | A | Codeforces Round 501 (Div. 3) {1015} | PROGRAMMING | 60949 | 700 | |
| 9578 | Segment Occurrences | brute force implementation | Statement | B | Educational Codeforces Round 48 (Rated for Div. 2) {1016} | PROGRAMMING | Разбор Educational Codeforces Round 48 | 1300 | |
| 3793 | Vasya And The Mushrooms | dp implementation | Statement | C | Educational Codeforces Round 48 (Rated for Div. 2) {1016} | PROGRAMMING | Разбор Educational Codeforces Round 48 | 1800 | |
| 4750 | 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 | |
| 1202 | Rest In The Shades | binary search geometry | Statement | E | Educational Codeforces Round 48 (Rated for Div. 2) {1016} | PROGRAMMING | Разбор Educational Codeforces Round 48 | 2400 | |
| 825 | Road Projects | dfs and similar dp trees | Statement | F | Educational Codeforces Round 48 (Rated for Div. 2) {1016} | PROGRAMMING | Разбор Educational Codeforces Round 48 | 2600 | |
| 273 | Appropriate Team | bitmasks math number theory | Statement | G | Educational Codeforces Round 48 (Rated for Div. 2) {1016} | PROGRAMMING | Разбор Educational Codeforces Round 48 | 2800 | |
| 15019 | Death Note | greedy implementation math | Statement | A | Educational Codeforces Round 48 (Rated for Div. 2) {1016} | PROGRAMMING | Разбор Educational Codeforces Round 48 | 900 | |
| 9194 | The Bits | implementation math | Statement | B | Codeforces Round 502 (in memory of Leopoldo Taravilse, Div. 1 + Div. 2) {1017} | PROGRAMMING | Разбор (англ.) | 1200 | |
| 6068 | The Phone Number | constructive algorithms greedy | Statement | C | Codeforces Round 502 (in memory of Leopoldo Taravilse, Div. 1 + Div. 2) {1017} | PROGRAMMING | Разбор (англ.) | 1600 | |
| 3597 | The Wu | bitmasks brute force data structures | Statement | D | Codeforces Round 502 (in memory of Leopoldo Taravilse, Div. 1 + Div. 2) {1017} | PROGRAMMING | Разбор (англ.) | 1900 | |
| 1031 | The Supersonic Rocket | geometry hashing strings | Statement | E | Codeforces Round 502 (in memory of Leopoldo Taravilse, Div. 1 + Div. 2) {1017} | PROGRAMMING | Разбор (англ.) | 2400 | |
| 839 | The Neutral Zone | brute force math | Statement | F | Codeforces Round 502 (in memory of Leopoldo Taravilse, Div. 1 + Div. 2) {1017} | PROGRAMMING | Разбор (англ.) | 2500 | |
| 936 | The Tree | data structures | Statement | G | Codeforces Round 502 (in memory of Leopoldo Taravilse, Div. 1 + Div. 2) {1017} | PROGRAMMING | Разбор (англ.) | 3200 | |
| 149 | The Films | brute force | Statement | H | Codeforces Round 502 (in memory of Leopoldo Taravilse, Div. 1 + Div. 2) {1017} | PROGRAMMING | Разбор (англ.) | 3300 | |
| 20716 | The Rank | implementation | Statement | A | Codeforces Round 502 (in memory of Leopoldo Taravilse, Div. 1 + Div. 2) {1017} | PROGRAMMING | Разбор (англ.) | 700 | |
| 4666 | Elections | brute force greedy | Statement | A | Codeforces Round 503 (by SIS, Div. 1) {1019} | PROGRAMMING | 61161 | 1800 | |
| 1977 | The hat | binary search interactive | Statement | B | Codeforces Round 503 (by SIS, Div. 1) {1019} | PROGRAMMING | 2200 | ||
| 665 | Large Triangle | binary search geometry sortings | Statement | D | Codeforces Round 503 (by SIS, Div. 1) {1019} | PROGRAMMING | 61161 | 2700 | |
| 1197 | Sergey's problem | constructive algorithms graphs | Statement | C | Codeforces Round 503 (by SIS, Div. 1) {1019} | PROGRAMMING | 61161 | 2800 | |
| 343 | Raining season | data structures divide and conquer trees | Statement | E | Codeforces Round 503 (by SIS, Div. 1) {1019} | PROGRAMMING | 61161 | 3200 | |
| 21881 | 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 | |
| 9072 | 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 | |
| 10985 | 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 | |
| 10066 | 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 | |
| 8764 | 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 | |
| 4060 | 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 | |
| 2062 | 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 |