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 ... 48 49 50 51 52 ... 100 101 102 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 2129 | Compress String | dp strings | Statement | C | Codeforces Round 543 (Div. 1, based on Technocup 2019 Final Round) {1120} | PROGRAMMING | Разбор задач финала Технокубка 2019 и Codeforces Round #543 | 2200 | |
| 1454 | Power Tree | dfs and similar dp ds graphs greedy trees | Statement | D | Codeforces Round 543 (Div. 1, based on Technocup 2019 Final Round) {1120} | PROGRAMMING | Разбор задач финала Технокубка 2019 и Codeforces Round #543 | 2400 | |
| 434 | Once in a casino | constructive algorithms greedy implementation math | Statement | B | Codeforces Round 543 (Div. 1, based on Technocup 2019 Final Round) {1120} | PROGRAMMING | Разбор задач финала Технокубка 2019 и Codeforces Round #543 | 2700 | |
| 261 | Secret Letters | data structures dp greedy | Statement | F | Codeforces Round 543 (Div. 1, based on Technocup 2019 Final Round) {1120} | PROGRAMMING | Разбор задач финала Технокубка 2019 и Codeforces Round #543 | 2900 | |
| 129 | The very same Munchhausen | brute force | Statement | E | Codeforces Round 543 (Div. 1, based on Technocup 2019 Final Round) {1120} | PROGRAMMING | Разбор задач финала Технокубка 2019 и Codeforces Round #543 | 3000 | |
| 7247 | Technogoblet of Fire | implementation sortings | Statement | A | Codeforces Round 543 (Div. 2, based on Technocup 2019 Final Round) {1121} | PROGRAMMING | Codeforces Round #543 and Technocup 2019 Final Round Editorial | 1100 | |
| 9206 | Mike and Children | brute force implementation | Statement | B | Codeforces Round 543 (Div. 2, based on Technocup 2019 Final Round) {1121} | PROGRAMMING | Codeforces Round #543 and Technocup 2019 Final Round Editorial | 1200 | |
| 2025 | System Testing | implementation | Statement | C | Codeforces Round 543 (Div. 2, based on Technocup 2019 Final Round) {1121} | PROGRAMMING | Codeforces Round #543 and Technocup 2019 Final Round Editorial | 1900 | |
| 3838 | Toy Train (Simplified) | brute force greedy | Statement | A1 | Codeforces Round 542 [Alex Lopashev Thanks-Round] (Div. 1) {1129} | PROGRAMMING | 65520 | 1700 | |
| 4116 | Toy Train | brute force greedy | Statement | A2 | Codeforces Round 542 [Alex Lopashev Thanks-Round] (Div. 1) {1129} | PROGRAMMING | 65520 | 1800 | |
| 2231 | Wrong Answer | constructive algorithms | Statement | B | Codeforces Round 542 [Alex Lopashev Thanks-Round] (Div. 1) {1129} | PROGRAMMING | 65520 | 2200 | |
| 934 | Morse Code | binary search data structures dp hashing sortings string suffix structures strings | Statement | C | Codeforces Round 542 [Alex Lopashev Thanks-Round] (Div. 1) {1129} | PROGRAMMING | 65520 | 2300 | |
| 1115 | Isolation | data structures dp | Statement | D | Codeforces Round 542 [Alex Lopashev Thanks-Round] (Div. 1) {1129} | PROGRAMMING | 65520 | 2800 | |
| 453 | Legendary Tree | binary search interactive trees | Statement | E | Codeforces Round 542 [Alex Lopashev Thanks-Round] (Div. 1) {1129} | PROGRAMMING | 65520 | 3000 | |
| 7967 | Two Cakes | greedy | Statement | B | Codeforces Round 542 [Alex Lopashev Thanks-Round] (Div. 2) {1130} | PROGRAMMING | 65520 | 1200 | |
| 8742 | Connect | brute force dfs and similar ds | Statement | C | Codeforces Round 542 [Alex Lopashev Thanks-Round] (Div. 2) {1130} | PROGRAMMING | 65520 | 1400 | |
| 11752 | Be Positive | implementation | Statement | A | Codeforces Round 542 [Alex Lopashev Thanks-Round] (Div. 2) {1130} | PROGRAMMING | 65520 | 900 | |
| 15018 | Birthday | binary search greedy sortings | Statement | C | Codeforces Round 541 (Div. 2) {1131} | PROGRAMMING | Codeforces Round #541 Editorial | 1200 | |
| 9801 | Draw! | greedy implementation | Statement | B | Codeforces Round 541 (Div. 2) {1131} | PROGRAMMING | Codeforces Round #541 Editorial | 1300 | |
| 6846 | Asya And Kittens | constructive algorithms ds | Statement | F | Codeforces Round 541 (Div. 2) {1131} | PROGRAMMING | Codeforces Round #541 Editorial | 1700 | |
| 3363 | Gourmet choice | dfs and similar dp ds graphs greedy | Statement | D | Codeforces Round 541 (Div. 2) {1131} | PROGRAMMING | Codeforces Round #541 Editorial | 2000 | |
| 1163 | String Multiplication | dp greedy strings | Statement | E | Codeforces Round 541 (Div. 2) {1131} | PROGRAMMING | Codeforces Round #541 Editorial | 2200 | |
| 456 | Most Dangerous Shark | data structures dp two pointers | Statement | G | Codeforces Round 541 (Div. 2) {1131} | PROGRAMMING | Codeforces Round #541 Editorial | 2900 | |
| 12519 | Sea Battle | math | Statement | A | Codeforces Round 541 (Div. 2) {1131} | PROGRAMMING | Codeforces Round #541 Editorial | 800 | |
| 9686 | Regular Bracket Sequence | greedy implementation | Statement | A | Educational Codeforces Round 61 (Rated for Div. 2) {1132} | PROGRAMMING | T | 1100 | |
| 5467 | Painting the Fence | brute force | Statement | C | Educational Codeforces Round 61 (Rated for Div. 2) {1132} | PROGRAMMING | T | 1700 | |
| 8549 | Clear the String | dp | Statement | F | Educational Codeforces Round 61 (Rated for Div. 2) {1132} | PROGRAMMING | T | 2000 | |
| 1961 | Stressful Training | binary search greedy | Statement | D | Educational Codeforces Round 61 (Rated for Div. 2) {1132} | PROGRAMMING | T | 2300 | |
| 1528 | Knapsack | dfs and similar dp greedy | Statement | E | Educational Codeforces Round 61 (Rated for Div. 2) {1132} | PROGRAMMING | T | 2400 | |
| 1058 | Greedy Subsequences | data structures dp trees | Statement | G | Educational Codeforces Round 61 (Rated for Div. 2) {1132} | PROGRAMMING | T | 2600 | |
| 13145 | Discounts | greedy sortings | Statement | B | Educational Codeforces Round 61 (Rated for Div. 2) {1132} | PROGRAMMING | T | 900 | |
| 17909 | Middle of the Contest | implementation | Statement | A | Codeforces Round 544 (Div. 3) {1133} | PROGRAMMING | Codeforces Round #544 (Div. 3) Editorial | 1000 | |
| 13081 | Preparation for International Women's Day | math number theory | Statement | B | Codeforces Round 544 (Div. 3) {1133} | PROGRAMMING | Codeforces Round #544 (Div. 3) Editorial | 1300 | |
| 23910 | Balanced Team | sortings two pointers | Statement | C | Codeforces Round 544 (Div. 3) {1133} | PROGRAMMING | Codeforces Round #544 (Div. 3) Editorial | 1300 | |
| 12483 | Zero Quantity Maximization | hashing math number theory | Statement | D | Codeforces Round 544 (Div. 3) {1133} | PROGRAMMING | Codeforces Round #544 (Div. 3) Editorial | 1500 | |
| 8004 | Spanning Tree with Maximum Degree | graphs | Statement | F1 | Codeforces Round 544 (Div. 3) {1133} | PROGRAMMING | Codeforces Round #544 (Div. 3) Editorial | 1600 | |
| 5666 | K Balanced Teams | dp sortings two pointers | Statement | E | Codeforces Round 544 (Div. 3) {1133} | PROGRAMMING | Codeforces Round #544 (Div. 3) Editorial | 2000 | |
| 3462 | Spanning Tree with One Fixed Degree | constructive algorithms dfs and similar ds graphs greedy | Statement | F2 | Codeforces Round 544 (Div. 3) {1133} | PROGRAMMING | Codeforces Round #544 (Div. 3) Editorial | 2200 | |
| 11805 | Nastya Is Playing Computer Games | constructive algorithms math | Statement | B | Codeforces Round 546 (Div. 2) {1136} | PROGRAMMING | Editorial of Round #546(Div.2) | 1000 | |
| 7769 | Nastya Is Transposing Matrices | constructive algorithms sortings | Statement | C | Codeforces Round 546 (Div. 2) {1136} | PROGRAMMING | Editorial of Round #546(Div.2) | 1500 | |
| 3871 | Nastya Is Buying Lunch | greedy | Statement | D | Codeforces Round 546 (Div. 2) {1136} | PROGRAMMING | Editorial of Round #546(Div.2) | 1800 | |
| 1093 | Nastya Hasn't Written a Legend | binary search data structures | Statement | E | Codeforces Round 546 (Div. 2) {1136} | PROGRAMMING | Editorial of Round #546(Div.2) | 2500 | |
| 16518 | Nastya Is Reading a Book | implementation | Statement | A | Codeforces Round 546 (Div. 2) {1136} | PROGRAMMING | Editorial of Round #546(Div.2) | 700 | |
| 4507 | Skyscrapers | implementation sortings | Statement | A | Codeforces Round 545 (Div. 1) {1137} | PROGRAMMING | Codeforces Round #545 – Editorial | 1600 | |
| 6242 | Camp Schedule | greedy hashing strings | Statement | B | Codeforces Round 545 (Div. 1) {1137} | PROGRAMMING | Codeforces Round #545 – Editorial | 1700 | |
| 1707 | Cooperative Game | constructive algorithms interactive number theory | Statement | D | Codeforces Round 545 (Div. 1) {1137} | PROGRAMMING | Codeforces Round #545 – Editorial | 2500 | |
| 525 | Train Car Selection | data structures greedy | Statement | E | Codeforces Round 545 (Div. 1) {1137} | PROGRAMMING | Codeforces Round #545 – Editorial | 2800 | |
| 1222 | Museums Tour | dp graphs implementation | Statement | C | Codeforces Round 545 (Div. 1) {1137} | PROGRAMMING | Codeforces Round #545 – Editorial | 2800 | |
| 472 | Matches Are Not a Child's Play | data structures trees | Statement | F | Codeforces Round 545 (Div. 1) {1137} | PROGRAMMING | Codeforces Round #545 – Editorial | 3300 | |
| 4049 | Circus | brute force greedy math strings | Statement | B | Codeforces Round 545 (Div. 2) {1138} | PROGRAMMING | Codeforces Round #545 – Editorial | 1700 | |
| 18986 | Sushi for Two | binary search greedy implementation | Statement | A | Codeforces Round 545 (Div. 2) {1138} | PROGRAMMING | Codeforces Round #545 – Editorial | 900 | |
| 16875 | Chocolates | greedy implementation | Statement | B | Codeforces Round 548 (Div. 2) {1139} | PROGRAMMING | Codeforces Round #548 Editorial | 1100 | |
| 13034 | Edgy Trees | dfs and similar ds graphs math trees | Statement | C | Codeforces Round 548 (Div. 2) {1139} | PROGRAMMING | Codeforces Round #548 Editorial | 1500 | |
| 2405 | Steps to One | dp math number theory probabilities | Statement | D | Codeforces Round 548 (Div. 2) {1139} | PROGRAMMING | Codeforces Round #548 Editorial | 2300 | |
| 1871 | Maximize Mex | flows graph matchings graphs | Statement | E | Codeforces Round 548 (Div. 2) {1139} | PROGRAMMING | Codeforces Round #548 Editorial | 2400 | |
| 443 | Dish Shopping | data structures divide and conquer | Statement | F | Codeforces Round 548 (Div. 2) {1139} | PROGRAMMING | Codeforces Round #548 Editorial | 2800 | |
| 16913 | Even Substrings | implementation strings | Statement | A | Codeforces Round 548 (Div. 2) {1139} | PROGRAMMING | Codeforces Round #548 Editorial | 700 | |
| 12408 | Detective Book | implementation | Statement | A | Educational Codeforces Round 62 (Rated for Div. 2) {1140} | PROGRAMMING | Educational Codeforces Round 62 Editorial | 1000 | |
| 12721 | Minimum Triangulation | dp greedy math | Statement | D | Educational Codeforces Round 62 (Rated for Div. 2) {1140} | PROGRAMMING | Educational Codeforces Round 62 Editorial | 1200 | |
| 11412 | Good String | implementation strings | Statement | B | Educational Codeforces Round 62 (Rated for Div. 2) {1140} | PROGRAMMING | Educational Codeforces Round 62 Editorial | 1200 | |
| 9701 | Playlist | brute force data structures sortings | Statement | C | Educational Codeforces Round 62 (Rated for Div. 2) {1140} | PROGRAMMING | Educational Codeforces Round 62 Editorial | 1600 | |
| 1970 | Palindrome-less Arrays | combinatorics divide and conquer dp | Statement | E | Educational Codeforces Round 62 (Rated for Div. 2) {1140} | PROGRAMMING | Educational Codeforces Round 62 Editorial | 2200 | |
| 1275 | Extending Set of Points | data structures divide and conquer ds | Statement | F | Educational Codeforces Round 62 (Rated for Div. 2) {1140} | PROGRAMMING | Educational Codeforces Round 62 Editorial | 2700 | |
| 513 | Double Tree | data structures divide and conquer shortest paths trees | Statement | G | Educational Codeforces Round 62 (Rated for Div. 2) {1140} | PROGRAMMING | Educational Codeforces Round 62 Editorial | 2900 | |
| 21625 | Maximal Continuous Rest | implementation | Statement | B | Codeforces Round 547 (Div. 3) {1141} | PROGRAMMING | 66062 | 1000 | |
| 32961 | Game 23 | implementation math | Statement | A | Codeforces Round 547 (Div. 3) {1141} | PROGRAMMING | 66062 | 1000 | |
| 11604 | Polycarp Restores Permutation | math | Statement | C | Codeforces Round 547 (Div. 3) {1141} | PROGRAMMING | 66062 | 1400 | |
| 8624 | Colored Boots | greedy implementation | Statement | D | Codeforces Round 547 (Div. 3) {1141} | PROGRAMMING | 66062 | 1500 | |
| 6828 | Superhero Battle | math | Statement | E | Codeforces Round 547 (Div. 3) {1141} | PROGRAMMING | 66062 | 1700 | |
| 3925 | Same Sum Blocks (Easy) | greedy | Statement | F1 | Codeforces Round 547 (Div. 3) {1141} | PROGRAMMING | 66062 | 2000 | |
| 4268 | Same Sum Blocks (Hard) | data structures greedy | Statement | F2 | Codeforces Round 547 (Div. 3) {1141} | PROGRAMMING | 66062 | 2200 | |
| 2330 | Privatization of Roads in Treeland | binary search constructive algorithms dfs and similar graphs greedy trees | Statement | G | Codeforces Round 547 (Div. 3) {1141} | PROGRAMMING | 66062 | 2500 | |
| 3474 | The Beatles | brute force math | Statement | A | Codeforces Round 549 (Div. 1) {1142} | PROGRAMMING | Codeforces Round #549 Editorial | 1800 | |
| 3139 | Lynyrd Skynyrd | data structures dfs and similar dp math trees | Statement | B | Codeforces Round 549 (Div. 1) {1142} | PROGRAMMING | Codeforces Round #549 Editorial | 2300 | |
| 540 | Foreigner | dp | Statement | D | Codeforces Round 549 (Div. 1) {1142} | PROGRAMMING | Codeforces Round #549 Editorial | 2700 | |
| 1405 | U2 | geometry | Statement | C | Codeforces Round 549 (Div. 1) {1142} | PROGRAMMING | Codeforces Round #549 Editorial | 2800 | |
| 525 | Pink Floyd | graphs interactive | Statement | E | Codeforces Round 549 (Div. 1) {1142} | PROGRAMMING | Codeforces Round #549 Editorial | 3100 | |
| 10719 | Nirvana | brute force math number theory | Statement | B | Codeforces Round 549 (Div. 2) {1143} | PROGRAMMING | Codeforces Round #549 Editorial | 1300 | |
| 13137 | Queen | dfs and similar trees | Statement | C | Codeforces Round 549 (Div. 2) {1143} | PROGRAMMING | Codeforces Round #549 Editorial | 1400 | |
| 13345 | The Doors | implementation | Statement | A | Codeforces Round 549 (Div. 2) {1143} | PROGRAMMING | Codeforces Round #549 Editorial | 700 | |
| 17265 | Parity Alternated Deletions | greedy implementation sortings | Statement | B | Codeforces Round 550 (Div. 3) {1144} | PROGRAMMING | 66307 | 1000 | |
| 15577 | Two Shuffled Sequences | constructive algorithms sortings | Statement | C | Codeforces Round 550 (Div. 3) {1144} | PROGRAMMING | 66307 | 1100 | |
| 10433 | Equalize Them All | constructive algorithms greedy | Statement | D | Codeforces Round 550 (Div. 3) {1144} | PROGRAMMING | 66307 | 1400 | |
| 11972 | Graph Without Long Directed Paths | dfs and similar graphs | Statement | F | Codeforces Round 550 (Div. 3) {1144} | PROGRAMMING | 66307 | 1700 | |
| 4221 | Median String | bitmasks math number theory strings | Statement | E | Codeforces Round 550 (Div. 3) {1144} | PROGRAMMING | 66307 | 1900 | |
| 2058 | Two Merged Sequences | dp greedy | Statement | G | Codeforces Round 550 (Div. 3) {1144} | PROGRAMMING | 66307 | 2600 | |
| 19528 | Diverse Strings | implementation strings | Statement | A | Codeforces Round 550 (Div. 3) {1144} | PROGRAMMING | 66307 | 900 | |
| 8714 | Thanos Sort | implementation | Statement | A | April Fools Day Contest 2019 {1145} | PROGRAMMING | 66327 | ||
| 1166 | Pigeon d'Or | implementation | Statement | D | April Fools Day Contest 2019 {1145} | PROGRAMMING | 66327 | ||
| 516 | Neat Words | Statement | F | April Fools Day Contest 2019 {1145} | PROGRAMMING | 66327 | |||
| 808 | Mystery Circuit | bitmasks brute force | Statement | C | April Fools Day Contest 2019 {1145} | PROGRAMMING | 66327 | ||
| 1463 | Kanban Numbers | brute force | Statement | B | April Fools Day Contest 2019 {1145} | PROGRAMMING | 66327 | ||
| 430 | Fourier Doodles | Statement | E | April Fools Day Contest 2019 {1145} | PROGRAMMING | 66327 | |||
| 177 | AI Takeover | Statement | G | April Fools Day Contest 2019 {1145} | PROGRAMMING | ||||
| 8689 | Hate "A" | implementation strings | Statement | B | Forethought Future Cup - Elimination Round {1146} | PROGRAMMING | 66639 | 1100 | |
| 3758 | Tree Diameter | bitmasks graphs interactive | Statement | C | Forethought Future Cup - Elimination Round {1146} | PROGRAMMING | 66639 | 1700 | |
| 1114 | Frog Jumping | dfs and similar math number theory | Statement | D | Forethought Future Cup - Elimination Round {1146} | PROGRAMMING | 66639 | 2100 | |
| 1204 | Leaf Partition | dp trees | Statement | F | Forethought Future Cup - Elimination Round {1146} | PROGRAMMING | 66639 | 2400 | |
| 938 | Hot is Cold | bitmasks data structures divide and conquer implementation | Statement | E | Forethought Future Cup - Elimination Round {1146} | PROGRAMMING | 66639 | 2400 | |
| 864 | Zoning Restrictions | dp flows graphs | Statement | G | Forethought Future Cup - Elimination Round {1146} | PROGRAMMING | 66639 | 2600 |