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 ... 57 58 59 60 61 ... 100 101 102 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 23 | Keep talking and nobody explodes -- medium | Statement | G | AIM Tech Poorly Prepared Contest (unrated, funny, Div. 1 preferred) {1302} | PROGRAMMING | 73599 | |||
| 10 | Keep talking and nobody explodes -- hard | Statement | J | AIM Tech Poorly Prepared Contest (unrated, funny, Div. 1 preferred) {1302} | PROGRAMMING | 73599 | |||
| 74 | Keep talking and nobody explodes -- easy | bitmasks brute force expression parsing | Statement | F | AIM Tech Poorly Prepared Contest (unrated, funny, Div. 1 preferred) {1302} | PROGRAMMING | 73599 | ||
| 96 | Dijkstra | Statement | D | AIM Tech Poorly Prepared Contest (unrated, funny, Div. 1 preferred) {1302} | PROGRAMMING | 73599 | |||
| 4 | Deja vu | Statement | I | AIM Tech Poorly Prepared Contest (unrated, funny, Div. 1 preferred) {1302} | PROGRAMMING | 73599 | |||
| 146 | DAG | constructive algorithms | Statement | B | AIM Tech Poorly Prepared Contest (unrated, funny, Div. 1 preferred) {1302} | PROGRAMMING | 73599 | ||
| 46 | Amazing bitset | Statement | E | AIM Tech Poorly Prepared Contest (unrated, funny, Div. 1 preferred) {1302} | PROGRAMMING | 73599 | |||
| 15970 | National Project | math | Statement | B | Educational Codeforces Round 82 (Rated for Div. 2) {1303} | PROGRAMMING | Educational Codeforces Round 82 | 1300 | |
| 12289 | Perfect Keyboard | dfs and similar greedy implementation | Statement | C | Educational Codeforces Round 82 (Rated for Div. 2) {1303} | PROGRAMMING | Educational Codeforces Round 82 | 1500 | |
| 7229 | Fill The Bag | bitmasks greedy | Statement | D | Educational Codeforces Round 82 (Rated for Div. 2) {1303} | PROGRAMMING | Educational Codeforces Round 82 | 1800 | |
| 2869 | Erase Subsequences | brute force dp greedy strings | Statement | E | Educational Codeforces Round 82 (Rated for Div. 2) {1303} | PROGRAMMING | Educational Codeforces Round 82 | 2200 | |
| 831 | Sum of Prefix Sums | data structures divide and conquer geometry trees | Statement | G | Educational Codeforces Round 82 (Rated for Div. 2) {1303} | PROGRAMMING | Educational Codeforces Round 82 | 2700 | |
| 544 | Number of Components | ds implementation | Statement | F | Educational Codeforces Round 82 (Rated for Div. 2) {1303} | PROGRAMMING | Educational Codeforces Round 82 | 2800 | |
| 33047 | Erasing Zeroes | implementation strings | Statement | A | Educational Codeforces Round 82 (Rated for Div. 2) {1303} | PROGRAMMING | Educational Codeforces Round 82 | 700 | |
| 18198 | Longest Palindrome | brute force constructive algorithms greedy implementation strings | Statement | B | Codeforces Round 620 (Div. 2) {1304} | PROGRAMMING | 1000.0 | Codeforces Round #620 (Div. 2) Editorial | 1100 |
| 16603 | Air Conditioner | dp greedy implementation sortings two pointers | Statement | C | Codeforces Round 620 (Div. 2) {1304} | PROGRAMMING | 1500.0 | Codeforces Round #620 (Div. 2) Editorial | 1500 |
| 6384 | Shortest and Longest LIS | constructive algorithms graphs greedy two pointers | Statement | D | Codeforces Round 620 (Div. 2) {1304} | PROGRAMMING | 1750.0 | Codeforces Round #620 (Div. 2) Editorial | 1800 |
| 5354 | 1-Trees and Queries | data structures dfs and similar shortest paths trees | Statement | E | Codeforces Round 620 (Div. 2) {1304} | PROGRAMMING | 2000.0 | Codeforces Round #620 (Div. 2) Editorial | 2000 |
| 1794 | Animal Observation (easy version) | data structures dp | Statement | F1 | Codeforces Round 620 (Div. 2) {1304} | PROGRAMMING | 2000.0 | Codeforces Round #620 (Div. 2) Editorial | 2400 |
| 1569 | Animal Observation (hard version) | data structures dp greedy | Statement | F2 | Codeforces Round 620 (Div. 2) {1304} | PROGRAMMING | 1000.0 | Codeforces Round #620 (Div. 2) Editorial | 2600 |
| 25857 | Two Rabbits | math | Statement | A | Codeforces Round 620 (Div. 2) {1304} | PROGRAMMING | 500.0 | Codeforces Round #620 (Div. 2) Editorial | 800 |
| 11840 | Kuroni and Simple Strings | constructive algorithms greedy strings two pointers | Statement | B | Ozon Tech Challenge 2020 (Div.1 + Div.2, Rated, T-shirts + prizes!) {1305} | PROGRAMMING | 1000.0 | Ozon Tech Challenge 2020 Editorial | 1300 |
| 15239 | Kuroni and Impossible Calculation | brute force combinatorics math number theory | Statement | C | Ozon Tech Challenge 2020 (Div.1 + Div.2, Rated, T-shirts + prizes!) {1305} | PROGRAMMING | 1250.0 | Ozon Tech Challenge 2020 Editorial | 1600 |
| 5087 | Kuroni and the Celebration | constructive algorithms dfs and similar graphs interactive trees | Statement | D | Ozon Tech Challenge 2020 (Div.1 + Div.2, Rated, T-shirts + prizes!) {1305} | PROGRAMMING | 1750.0 | Ozon Tech Challenge 2020 Editorial | 1900 |
| 3153 | Kuroni and the Score Distribution | constructive algorithms greedy implementation math | Statement | E | Ozon Tech Challenge 2020 (Div.1 + Div.2, Rated, T-shirts + prizes!) {1305} | PROGRAMMING | 2000.0 | Ozon Tech Challenge 2020 Editorial | 2100 |
| 2757 | Kuroni and the Punishment | math number theory probabilities | Statement | F | Ozon Tech Challenge 2020 (Div.1 + Div.2, Rated, T-shirts + prizes!) {1305} | PROGRAMMING | 2500.0 | Ozon Tech Challenge 2020 Editorial | 2500 |
| 1053 | Kuroni and Antihype | bitmasks dp ds graphs | Statement | G | Ozon Tech Challenge 2020 (Div.1 + Div.2, Rated, T-shirts + prizes!) {1305} | PROGRAMMING | 3250.0 | Ozon Tech Challenge 2020 Editorial | 3300 |
| 125 | Kuroni the Private Tutor | binary search greedy | Statement | H | Ozon Tech Challenge 2020 (Div.1 + Div.2, Rated, T-shirts + prizes!) {1305} | PROGRAMMING | 4000.0 | Ozon Tech Challenge 2020 Editorial | 3600 |
| 14204 | Kuroni and the Gifts | brute force constructive algorithms greedy sortings | Statement | A | Ozon Tech Challenge 2020 (Div.1 + Div.2, Rated, T-shirts + prizes!) {1305} | PROGRAMMING | 500.0 | Ozon Tech Challenge 2020 Editorial | 800 |
| 13413 | Cow and Friend | geometry greedy math | Statement | B | Codeforces Round 621 (Div. 1 + Div. 2) {1307} | PROGRAMMING | 1000.0 | Codeforces Round #621 (Div. 1 + Div. 2) Editorial | 1300 |
| 11944 | Cow and Message | brute force dp math strings | Statement | C | Codeforces Round 621 (Div. 1 + Div. 2) {1307} | PROGRAMMING | 1500.0 | Codeforces Round #621 (Div. 1 + Div. 2) Editorial | 1500 |
| 6520 | Cow and Fields | binary search data structures dfs and similar graphs greedy shortest paths sortings | Statement | D | Codeforces Round 621 (Div. 1 + Div. 2) {1307} | PROGRAMMING | 2000.0 | Codeforces Round #621 (Div. 1 + Div. 2) Editorial | 1900 |
| 1295 | Cow and Treats | binary search combinatorics dp greedy implementation math | Statement | E | Codeforces Round 621 (Div. 1 + Div. 2) {1307} | PROGRAMMING | 2500.0 | Codeforces Round #621 (Div. 1 + Div. 2) Editorial | 2400 |
| 508 | Cow and Exercise | flows graphs shortest paths | Statement | G | Codeforces Round 621 (Div. 1 + Div. 2) {1307} | PROGRAMMING | 3500.0 | Codeforces Round #621 (Div. 1 + Div. 2) Editorial | 3000 |
| 600 | Cow and Vacation | dfs and similar ds trees | Statement | F | Codeforces Round 621 (Div. 1 + Div. 2) {1307} | PROGRAMMING | 3000.0 | Codeforces Round #621 (Div. 1 + Div. 2) Editorial | 3200 |
| 15035 | Cow and Haybales | greedy implementation | Statement | A | Codeforces Round 621 (Div. 1 + Div. 2) {1307} | PROGRAMMING | 500.0 | Codeforces Round #621 (Div. 1 + Div. 2) Editorial | 800 |
| 5217 | Recommendations | data structures greedy sortings | Statement | A | VK Cup 2019-2020 - Elimination Round (Engine) {1310} | PROGRAMMING | 500.0 | VK Cup 2019-2020 - Elimination Round (Engine) and Codeforces Round #623 | 1700 |
| 1640 | Tourism | brute force dp graphs probabilities | Statement | D | VK Cup 2019-2020 - Elimination Round (Engine) {1310} | PROGRAMMING | 2250.0 | VK Cup 2019-2020 - Elimination Round (Engine) and Codeforces Round #623 | 2300 |
| 525 | Double Elimination | dp implementation | Statement | B | VK Cup 2019-2020 - Elimination Round (Engine) {1310} | PROGRAMMING | 1000.0 | VK Cup 2019-2020 - Elimination Round (Engine) and Codeforces Round #623 | 2500 |
| 536 | Au Pont Rouge | binary search dp strings | Statement | C | VK Cup 2019-2020 - Elimination Round (Engine) {1310} | PROGRAMMING | 1500.0 | VK Cup 2019-2020 - Elimination Round (Engine) and Codeforces Round #623 | 2800 |
| 352 | Strange Function | dp | Statement | E | VK Cup 2019-2020 - Elimination Round (Engine) {1310} | PROGRAMMING | 2250.0 | VK Cup 2019-2020 - Elimination Round (Engine) and Codeforces Round #623 | 2900 |
| 77 | Bad Cryptography | math number theory | Statement | F | VK Cup 2019-2020 - Elimination Round (Engine) {1310} | PROGRAMMING | 3500.0 | VK Cup 2019-2020 - Elimination Round (Engine) and Codeforces Round #623 | 3300 |
| 19169 | WeirdSort | dfs and similar sortings | Statement | B | Codeforces Round 624 (Div. 3) {1311} | PROGRAMMING | 74224 | 1200 | |
| 16186 | Perform the Combo | brute force | Statement | C | Codeforces Round 624 (Div. 3) {1311} | PROGRAMMING | 74224 | 1300 | |
| 9229 | Three Integers | brute force math | Statement | D | Codeforces Round 624 (Div. 3) {1311} | PROGRAMMING | 74224 | 1900 | |
| 4339 | Moving Points | data structures divide and conquer implementation sortings | Statement | F | Codeforces Round 624 (Div. 3) {1311} | PROGRAMMING | 74224 | 2100 | |
| 2436 | Construct the Binary Tree | brute force constructive algorithms dfs and similar trees | Statement | E | Codeforces Round 624 (Div. 3) {1311} | PROGRAMMING | 74224 | 2400 | |
| 43046 | Add Odd or Subtract Even | greedy implementation math | Statement | A | Codeforces Round 624 (Div. 3) {1311} | PROGRAMMING | 74224 | 700 | |
| 26171 | Two Regular Polygons | geometry math number theory | Statement | A | Educational Codeforces Round 83 (Rated for Div. 2) {1312} | PROGRAMMING | 74640 | ||
| 9642 | Count the Arrays | combinatorics math | Statement | D | Educational Codeforces Round 83 (Rated for Div. 2) {1312} | PROGRAMMING | 74640 | ||
| 28182 | Bogosort | constructive algorithms sortings | Statement | B | Educational Codeforces Round 83 (Rated for Div. 2) {1312} | PROGRAMMING | 74640 | ||
| 1004 | Autocompletion | data structures dfs and similar dp | Statement | G | Educational Codeforces Round 83 (Rated for Div. 2) {1312} | PROGRAMMING | 74640 | ||
| 926 | Attack on Red Kingdom | games two pointers | Statement | F | Educational Codeforces Round 83 (Rated for Div. 2) {1312} | PROGRAMMING | 74640 | ||
| 6139 | Array Shrinking | dp | Statement | E | Educational Codeforces Round 83 (Rated for Div. 2) {1312} | PROGRAMMING | 74640 | ||
| 16912 | Adding Powers | bitmasks greedy implementation math number theory ternary search | Statement | C | Educational Codeforces Round 83 (Rated for Div. 2) {1312} | PROGRAMMING | 74640 | ||
| 10534 | Skyscrapers (easy version) | brute force data structures dp greedy | Statement | C1 | Codeforces Round 622 (Div. 2) {1313} | PROGRAMMING | 1000.0 | Editorial | 1500 |
| 6749 | Different Rules | binary search constructive algorithms greedy implementation math | Statement | B | Codeforces Round 622 (Div. 2) {1313} | PROGRAMMING | 1000.0 | Editorial | 1700 |
| 6623 | Skyscrapers (hard version) | data structures dp greedy | Statement | C2 | Codeforces Round 622 (Div. 2) {1313} | PROGRAMMING | 1000.0 | Editorial | 1900 |
| 1371 | Happy New Year | bitmasks dp implementation | Statement | D | Codeforces Round 622 (Div. 2) {1313} | PROGRAMMING | 2000.0 | Editorial | 2600 |
| 589 | Concatenation with intersection | data structures hashing strings two pointers | Statement | E | Codeforces Round 622 (Div. 2) {1313} | PROGRAMMING | 2500.0 | Editorial | 2800 |
| 15642 | Fast Food Restaurant | brute force greedy implementation | Statement | A | Codeforces Round 622 (Div. 2) {1313} | PROGRAMMING | 500.0 | Editorial | 900 |
| 10168 | Restoring Permutation | greedy | Statement | C | Codeforces Round 623 (Div. 2, based on VK Cup 2019-2020 - Elimination Round, Engine) {1315} | PROGRAMMING | 1500.0 | VK Cup 2019-2020 - Elimination Round (Engine) and Codeforces Round #623 | 1200 |
| 9266 | Homecoming | binary search dp greedy strings | Statement | B | Codeforces Round 623 (Div. 2, based on VK Cup 2019-2020 - Elimination Round, Engine) {1315} | PROGRAMMING | 1000.0 | VK Cup 2019-2020 - Elimination Round (Engine) and Codeforces Round #623 | 1300 |
| 12220 | Dead Pixel | implementation | Statement | A | Codeforces Round 623 (Div. 2, based on VK Cup 2019-2020 - Elimination Round, Engine) {1315} | PROGRAMMING | 500.0 | VK Cup 2019-2020 - Elimination Round (Engine) and Codeforces Round #623 | 700 |
| 11348 | String Modification | brute force constructive algorithms implementation sortings strings | Statement | B | CodeCraft-20 (Div. 2) {1316} | PROGRAMMING | 1000.0 | Codecraft-20 (Div.2) Editorial | 1400 |
| 7344 | Primitive Primes | constructive algorithms math ternary search | Statement | C | CodeCraft-20 (Div. 2) {1316} | PROGRAMMING | 1500.0 | Codecraft-20 (Div.2) Editorial | 1700 |
| 3410 | Nash Matrix | constructive algorithms dfs and similar graphs implementation | Statement | D | CodeCraft-20 (Div. 2) {1316} | PROGRAMMING | 1750.0 | Codecraft-20 (Div.2) Editorial | 2000 |
| 4300 | Team Building | bitmasks dp greedy sortings | Statement | E | CodeCraft-20 (Div. 2) {1316} | PROGRAMMING | 2250.0 | Codecraft-20 (Div.2) Editorial | 2300 |
| 819 | Battalion Strength | data structures divide and conquer probabilities | Statement | F | CodeCraft-20 (Div. 2) {1316} | PROGRAMMING | 2500.0 | Codecraft-20 (Div.2) Editorial | 2800 |
| 18848 | Grade Allocation | implementation | Statement | A | CodeCraft-20 (Div. 2) {1316} | PROGRAMMING | 500.0 | Codecraft-20 (Div.2) Editorial | 700 |
| 3177 | World of Darkraft: Battle for Azathoth | data structures sortings | Statement | C | Codeforces Round 625 (Div. 1, based on Technocup 2020 Final Round) {1320} | PROGRAMMING | 1500.0 | Codeforces Round #625 Editorial | |
| 870 | Treeland and Viruses | shortest paths trees | Statement | E | Codeforces Round 625 (Div. 1, based on Technocup 2020 Final Round) {1320} | PROGRAMMING | 2500.0 | Codeforces Round #625 Editorial | |
| 1557 | Reachable Strings | data structures hashing string suffix structures strings strings | Statement | D | Codeforces Round 625 (Div. 1, based on Technocup 2020 Final Round) {1320} | PROGRAMMING | 2000.0 | Codeforces Round #625 Editorial | |
| 6088 | Navigation System | dfs and similar shortest paths | Statement | B | Codeforces Round 625 (Div. 1, based on Technocup 2020 Final Round) {1320} | PROGRAMMING | 1000.0 | Codeforces Round #625 Editorial | |
| 16963 | Journey Planning | data structures math sortings | Statement | A | Codeforces Round 625 (Div. 1, based on Technocup 2020 Final Round) {1320} | PROGRAMMING | 500.0 | Codeforces Round #625 Editorial | |
| 163 | Blocks and Sensors | Statement | F | Codeforces Round 625 (Div. 1, based on Technocup 2020 Final Round) {1320} | PROGRAMMING | 2500.0 | Codeforces Round #625 Editorial | ||
| 9940 | Remove Adjacent | brute force greedy | Statement | C | Codeforces Round 625 (Div. 2, based on Technocup 2020 Final Round) {1321} | PROGRAMMING | 1250.0 | Codeforces Round #625 Editorial | |
| 14395 | Contest for Robots | Statement | A | Codeforces Round 625 (Div. 2, based on Technocup 2020 Final Round) {1321} | PROGRAMMING | 500.0 | Codeforces Round #625 Editorial | ||
| 12496 | Unusual Competitions | greedy | Statement | A | Codeforces Round 626 (Div. 1, based on Moscow Open Olympiad in Informatics) {1322} | PROGRAMMING | 500.0 | Codeforces Round #626 Editorial | |
| 780 | Reality Show | bitmasks dp | Statement | D | Codeforces Round 626 (Div. 1, based on Moscow Open Olympiad in Informatics) {1322} | PROGRAMMING | 2000.0 | Codeforces Round #626 Editorial | |
| 4288 | Present | binary search bitmasks constructive algorithms data structures math sortings | Statement | B | Codeforces Round 626 (Div. 1, based on Moscow Open Olympiad in Informatics) {1322} | PROGRAMMING | 1000.0 | Codeforces Round #626 Editorial | |
| 309 | Median Mountain Range | data structures | Statement | E | Codeforces Round 626 (Div. 1, based on Moscow Open Olympiad in Informatics) {1322} | PROGRAMMING | 2500.0 | Codeforces Round #626 Editorial | |
| 2508 | Instant Noodles | graphs hashing math number theory | Statement | C | Codeforces Round 626 (Div. 1, based on Moscow Open Olympiad in Informatics) {1322} | PROGRAMMING | 1500.0 | Codeforces Round #626 Editorial | |
| 104 | Assigning Fares | dp dp dp trees | Statement | F | Codeforces Round 626 (Div. 1, based on Moscow Open Olympiad in Informatics) {1322} | PROGRAMMING | 3000.0 | Codeforces Round #626 Editorial | |
| 19960 | Even Subset Sum Problem | brute force dp greedy implementation | Statement | A | Codeforces Round 626 (Div. 2, based on Moscow Open Olympiad in Informatics) {1323} | PROGRAMMING | 500.0 | Codeforces Round #626 Editorial | |
| 9308 | Count Subrectangles | greedy implementation | Statement | B | Codeforces Round 626 (Div. 2, based on Moscow Open Olympiad in Informatics) {1323} | PROGRAMMING | 1000.0 | Codeforces Round #626 Editorial | |
| 26210 | Yet Another Tetris Problem | implementation number theory | Statement | A | Codeforces Round 627 (Div. 3) {1324} | PROGRAMMING | Codeforces Round #627 (Div. 3) Editorial | ||
| 28886 | Yet Another Palindrome Problem | strings | Statement | B | Codeforces Round 627 (Div. 3) {1324} | PROGRAMMING | Codeforces Round #627 (Div. 3) Editorial | ||
| 14166 | Sleeping Schedule | dp | Statement | E | Codeforces Round 627 (Div. 3) {1324} | PROGRAMMING | Codeforces Round #627 (Div. 3) Editorial | ||
| 29423 | Pair of Topics | binary search data structures sortings two pointers | Statement | D | Codeforces Round 627 (Div. 3) {1324} | PROGRAMMING | Codeforces Round #627 (Div. 3) Editorial | ||
| 10487 | Maximum White Subtree | dfs and similar dp graphs trees | Statement | F | Codeforces Round 627 (Div. 3) {1324} | PROGRAMMING | Codeforces Round #627 (Div. 3) Editorial | ||
| 28518 | Frog Jumps | binary search data structures greedy implementation | Statement | C | Codeforces Round 627 (Div. 3) {1324} | PROGRAMMING | Codeforces Round #627 (Div. 3) Editorial | ||
| 14045 | Ehab and Path-etic MEXs | constructive algorithms dfs and similar greedy trees | Statement | C | Codeforces Round 628 (Div. 2) {1325} | PROGRAMMING | 1250.0 | 74235 | 1500 |
| 12299 | Ehab the Xorcist | bitmasks constructive algorithms greedy number theory | Statement | D | Codeforces Round 628 (Div. 2) {1325} | PROGRAMMING | 1750.0 | 74235 | 1700 |
| 2038 | Ehab's Last Theorem | constructive algorithms dfs and similar graphs greedy | Statement | F | Codeforces Round 628 (Div. 2) {1325} | PROGRAMMING | 2750.0 | 74235 | 2600 |
| 2090 | Ehab's REAL Number Theory Problem | brute force dfs and similar graphs number theory shortest paths | Statement | E | Codeforces Round 628 (Div. 2) {1325} | PROGRAMMING | 2500.0 | 74235 | 2700 |
| 41154 | EhAb AnD gCd | constructive algorithms greedy number theory | Statement | A | Codeforces Round 628 (Div. 2) {1325} | PROGRAMMING | 500.0 | 74235 | 800 |
| 36588 | CopyCopyCopyCopyCopy | greedy implementation | Statement | B | Codeforces Round 628 (Div. 2) {1325} | PROGRAMMING | 750.0 | 74235 | 800 |
| 30800 | Bad Ugly Numbers | constructive algorithms number theory | Statement | A | Codeforces Global Round 7 {1326} | PROGRAMMING | 500.0 | 74961 | 1000 |
| 15764 | Permutation Partitions | combinatorics greedy math | Statement | C | Codeforces Global Round 7 {1326} | PROGRAMMING | 1000.0 | 74961 | 1300 |