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 4 5 6 7 8 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 12375 | Binary String Constructing | constructive algorithms | Statement | B | Codeforces Round 494 (Div. 3) {1003} | PROGRAMMING | 60417 | 1300 | |
| 3210 | Tree Constructing | constructive algorithms graphs | Statement | E | Codeforces Round 494 (Div. 3) {1003} | PROGRAMMING | 60417 | 2200 | |
| 10062 | Sonya and Exhibition | constructive algorithms greedy implementation math | Statement | B | Codeforces Round 495 (Div. 2) {1004} | PROGRAMMING | 60443 | 1400 | |
| 7929 | Sonya and Robots | constructive algorithms implementation | Statement | C | 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 | |
| 6748 | Relatively Prime Graph | brute force constructive algorithms graphs greedy math | Statement | D | Educational Codeforces Round 47 (Rated for Div. 2) {1009} | PROGRAMMING | 60630 | 1700 | |
| 4456 | Chemical table | constructive algorithms dfs and similar dsu graphs matrices | Statement | B | Codeforces Round 500 (Div. 1) [based on EJOI] {1012} | PROGRAMMING | 60920 | 1900 | |
| 476 | AB-Strings | constructive algorithms strings | Statement | D | Codeforces Round 500 (Div. 1) [based on EJOI] {1012} | PROGRAMMING | 60920 | 2700 | |
| 9065 | Walking Between Houses | constructive algorithms greedy | Statement | D | Codeforces Round 501 (Div. 3) {1015} | PROGRAMMING | 60949 | 1600 | |
| 5018 | 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 | |
| 6547 | The Phone Number | constructive algorithms greedy | Statement | C | Codeforces Round 502 (in memory of Leopoldo Taravilse, Div. 1 + Div. 2) {1017} | PROGRAMMING | Разбор (англ.) | 1600 | |
| 1617 | Sergey's problem | constructive algorithms graphs | Statement | C | Codeforces Round 503 (by SIS, Div. 1) {1019} | PROGRAMMING | 61161 | 2800 | |
| 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 | |
| 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 | |
| 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 | |
| 1049 | 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 | |
| 10462 | Unnatural Conditions | constructive algorithms math | Statement | B | AIM Tech Round 5 (rated, Div. 1 + Div. 2) {1028} | PROGRAMMING | 61493 | 1300 | |
| 1232 | Restore Array | constructive algorithms | Statement | E | AIM Tech Round 5 (rated, Div. 1 + Div. 2) {1028} | PROGRAMMING | 61493 | 2400 | |
| 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 | |
| 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 | |
| 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 | |
| 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 | |
| 11901 | Packets | constructive algorithms greedy math | Statement | A | Manthan, Codefest 18 (rated, Div. 1 + Div. 2) {1037} | PROGRAMMING | Tutorial | 1300 | |
| 14990 | Non-Coprime Partition | constructive algorithms math | Statement | B | Codeforces Round 508 (Div. 2) {1038} | PROGRAMMING | Tutorial | 1100 | |
| 894 | Timetable | constructive algorithms data structures greedy math | Statement | A | Codeforces Round 507 (Div. 1, based on Olympiad of Metropolises) {1039} | PROGRAMMING | 61668 | 2400 | |
| 3915 | Tree Reconstruction | constructive algorithms data structures graphs greedy | Statement | E | Codeforces Round 509 (Div. 2) {1041} | PROGRAMMING | Codeforces Round #509 (Div. 2) Editorial | 1900 | |
| 5003 | Array Product | constructive algorithms greedy math | Statement | C | Codeforces Round 510 (Div. 2) {1042} | PROGRAMMING | Tutorial | 1700 | |
| 7282 | Smallest Word | constructive algorithms greedy implementation | Statement | C | Codeforces Round 519 by Botan Investments {1043} | PROGRAMMING | Codeforces Round #519 Editorial | 1500 | |
| 3486 | Train Hard, Win Easy | constructive algorithms greedy math sortings | Statement | E | Codeforces Round 519 by Botan Investments {1043} | PROGRAMMING | Codeforces Round #519 Editorial | 1900 | |
| 261 | Ancient civilizations | constructive algorithms geometry | Statement | E | Bubble Cup 11 - Finals [Online Mirror, Div. 1] {1045} | PROGRAMMING | E | 2800 | |
| 272 | Euler tour | constructive algorithms trees | Statement | E | Codeforces Round 512 (Div. 1, based on Technocup 2019 Elimination Round 1) {1053} | PROGRAMMING | Сodeforces Round 512 (and Technocup — Elimination Round 1) Editorial | 3500 | |
| 4520 | Candies Distribution | constructive algorithms implementation | Statement | C | Mail.Ru Cup 2018 Round 1 {1054} | PROGRAMMING | Editorial | 1400 | |
| 519 | Chips Puzzle | constructive algorithms implementation math | Statement | E | Mail.Ru Cup 2018 Round 1 {1054} | PROGRAMMING | Editorial | 2400 | |
| 962 | New Road Network | constructive algorithms greedy math | Statement | G | Mail.Ru Cup 2018 Round 1 {1054} | PROGRAMMING | Editorial | 2900 | |
| 6859 | Decorate Apple Tree | constructive algorithms dfs and similar dp graphs greedy sortings trees | Statement | D | Mail.Ru Cup 2018 Round 3 {1056} | PROGRAMMING | Mail.Ru Cup 2018 Round 3 Editorial | 1600 | |
| 7613 | Sequence Transformation | constructive algorithms math | Statement | C | Codeforces Round 514 (Div. 2) {1059} | PROGRAMMING | Codeforces Round #514 (Div. 2) Editorial | 1500 | |
| 387 | Sophisticated Device | constructive algorithms | Statement | H | Codeforces Round 513 by Barcelona Bootcamp (rated, Div. 1 + Div. 2) {1060} | PROGRAMMING | User editorial for Codeforces Round 513 by Barcelona Bootcamp (rated, Div. 1 + Div. 2) | 2900 | |
| 11178 | Oh Those Palindromes | constructive algorithms strings | Statement | A | Codeforces Round 516 (Div. 1, by Moscow Team Olympiad) {1063} | PROGRAMMING | Editorial | 1400 | |
| 3309 | Dwarves, Hats and Extrasensory Abilities | binary search constructive algorithms geometry interactive | Statement | C | Codeforces Round 516 (Div. 1, by Moscow Team Olympiad) {1063} | PROGRAMMING | 1900 | ||
| 420 | Lasers and Mirrors | constructive algorithms math | Statement | E | Codeforces Round 516 (Div. 1, by Moscow Team Olympiad) {1063} | PROGRAMMING | Editorial | 3000 | |
| 11745 | Vasya and Isolated Vertices | constructive algorithms graphs | Statement | B | Educational Codeforces Round 52 (Rated for Div. 2) {1065} | PROGRAMMING | Educational Codeforces Round 52 Editorial | 1300 | |
| 724 | Knights | constructive algorithms | Statement | C | Codeforces Round 518 (Div. 1) [Thanks, Mail.Ru!] {1067} | PROGRAMMING | Tutorial | 2800 | |
| 3377 | Colored Rooks | constructive algorithms graphs | Statement | C | Codeforces Round 518 (Div. 2) [Thanks, Mail.Ru!] {1068} | PROGRAMMING | E | 1700 | |
| 434 | Odd Federalization | constructive algorithms | Statement | L | 2018-2019 ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {1070} | PROGRAMMING | Solution to problem M. Algoland and Berland of 2018-2019 ICPC, NEERC | 2800 | |
| 92 | Algoland and Berland | constructive algorithms divide and conquer geometry | Statement | M | 2018-2019 ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {1070} | PROGRAMMING | Solution to problem M. Algoland and Berland of 2018-2019 ICPC, NEERC | 3100 | |
| 108 | Negative Time Summation | constructive algorithms | Statement | E | Codeforces Round 522 (Div. 1, based on Technocup 2019 Elimination Round 3) {1078} | PROGRAMMING | Codeforces Round #522 and Technocup 2019 Elimination Round 3 Editorial | 3500 | |
| 1701 | Olya and magical square | constructive algorithms implementation math | Statement | D | Codeforces Round 524 (Div. 2) {1080} | PROGRAMMING | Codeforces Round #524 (Div. 2) Editorial | 2000 | |
| 4718 | Farewell Party | constructive algorithms implementation | Statement | B | Avito Cool Challenge 2018 {1081} | PROGRAMMING | 63888 | 1500 | |
| 2849 | Missing Numbers | binary search constructive algorithms greedy math number theory | Statement | E | Avito Cool Challenge 2018 {1081} | PROGRAMMING | 63888 | 1900 | |
| 574 | Tricky Interactor | constructive algorithms implementation interactive | Statement | F | Avito Cool Challenge 2018 {1081} | PROGRAMMING | 63888 | 2500 | |
| 13359 | Definite Game | constructive algorithms math | Statement | A | Avito Cool Challenge 2018 {1081} | PROGRAMMING | 63888 | 800 | |
| 4174 | Maximum Diameter Graph | constructive algorithms graphs implementation | Statement | D | Educational Codeforces Round 55 (Rated for Div. 2) {1082} | PROGRAMMING | 63544 | 1800 | |
| 5984 | Minimum Diameter Tree | constructive algorithms implementation trees | Statement | D | Technocup 2019 - Elimination Round 4 {1085} | PROGRAMMING | Technocup 2019 — Elimination Round 4 + Codeforces Round 528: editorial | 1700 | |
| 8559 | Ehab and a 2-operation task | constructive algorithms greedy math | Statement | C | Codeforces Round 525 (Div. 2) {1088} | PROGRAMMING | Codeforces round #525 editorial | 1400 | |
| 3247 | Ehab and another another xor problem | bitmasks constructive algorithms implementation interactive | Statement | D | Codeforces Round 525 (Div. 2) {1088} | PROGRAMMING | Codeforces round #525 editorial | 2000 | |
| 17715 | Ehab and another construction problem | brute force constructive algorithms | Statement | A | Codeforces Round 525 (Div. 2) {1088} | PROGRAMMING | Codeforces round #525 editorial | 800 | |
| 2153 | Easy Chess | constructive algorithms | Statement | E | 2018-2019 ICPC, NEERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1089} | PROGRAMMING | 1800 | ||
| 657 | Minegraphed | constructive algorithms graphs | Statement | M | 2018-2019 ICPC, NEERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1089} | PROGRAMMING | 2600 | ||
| 2383 | Similar Arrays | constructive algorithms | Statement | D | 2018-2019 Russia Open High School Programming Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1090} | PROGRAMMING | ru-olymp-team-russia-2018-presentation.pdf | 1900 | |
| 385 | How to Learn You Score | constructive algorithms | Statement | F | 2018-2019 Russia Open High School Programming Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1090} | PROGRAMMING | 2800 | ||
| 11057 | New Year and the Treasure Geolocation | brute force constructive algorithms greedy implementation | Statement | B | Good Bye 2018 {1091} | PROGRAMMING | Editorial | 1200 | |
| 938 | New Year and the Mallard Expedition | constructive algorithms greedy | Statement | F | Good Bye 2018 {1091} | PROGRAMMING | Editorial | 2600 | |
| 2244 | Minimal Diameter Forest | constructive algorithms dfs and similar greedy trees | Statement | E | Codeforces Round 527 (Div. 3) {1092} | PROGRAMMING | Codeforces Round #527 (Div. 3) Editorial | 2500 | |
| 17881 | Letters Rearranging | constructive algorithms greedy sortings strings | Statement | B | Educational Codeforces Round 56 (Rated for Div. 2) {1093} | PROGRAMMING | 63877 | 900 | |
| 758 | Egor and an RPG game | constructive algorithms greedy | Statement | E | Hello 2019 {1097} | PROGRAMMING | 64310 | 3100 | |
| 9724 | Sum in the tree | constructive algorithms dfs and similar greedy trees | Statement | A | Codeforces Round 530 (Div. 1) {1098} | PROGRAMMING | 64331 | 1600 | |
| 1187 | Construct a tree | binary search constructive algorithms dfs and similar graphs greedy trees | Statement | C | Codeforces Round 530 (Div. 1) {1098} | PROGRAMMING | 64331 | 2300 | |
| 1824 | Nice table | brute force constructive algorithms greedy math | Statement | B | Codeforces Round 530 (Div. 1) {1098} | PROGRAMMING | 64331 | 2300 | |
| 11579 | Squares and Segments | binary search constructive algorithms math | Statement | B | Codeforces Round 530 (Div. 2) {1099} | PROGRAMMING | E | 1100 | |
| 10508 | Postcard | constructive algorithms implementation | Statement | C | Codeforces Round 530 (Div. 2) {1099} | PROGRAMMING | E | 1300 | |
| 971 | Dasha and Chess | constructive algorithms games interactive | Statement | D | Codeforces Round 532 (Div. 2) {1100} | PROGRAMMING | Unofficial Tutorial | 2400 | |
| 10706 | Grid game | constructive algorithms implementation | Statement | A | Codeforces Round 534 (Div. 1) {1103} | PROGRAMMING | Codeforces Round #534 — Editorial | 1400 | |
| 3573 | Game with modulo | binary search constructive algorithms interactive | Statement | B | Codeforces Round 534 (Div. 1) {1103} | PROGRAMMING | Codeforces Round #534 — Editorial | 2000 | |
| 1017 | Johnny Solving | constructive algorithms dfs and similar graphs math | Statement | C | Codeforces Round 534 (Div. 1) {1103} | PROGRAMMING | Codeforces Round #534 — Editorial | 2800 | |
| 15964 | Splitting into digits | constructive algorithms implementation math | Statement | A | Codeforces Round 534 (Div. 2) {1104} | PROGRAMMING | Codeforces Round #534 — Editorial | 800 | |
| 1308 | Vasya and Maximum Profit | binary search constructive algorithms data structures dp dsu | Statement | G | Educational Codeforces Round 59 (Rated for Div. 2) {1107} | PROGRAMMING | Educational Codeforces Round 59 Editorial | 2400 | |
| 16628 | Diverse Garland | constructive algorithms dp greedy | Statement | D | Codeforces Round 535 (Div. 3) {1108} | PROGRAMMING | 64751 | 1400 | |
| 4572 | Sasha and One More Name | constructive algorithms hashing strings | Statement | B | Codeforces Round 539 (Div. 1) {1109} | PROGRAMMING | Codeforces Round #539 Editorial | 1800 | |
| 10122 | Meaningless Operations | constructive algorithms math number theory | Statement | C | Codeforces Global Round 1 {1110} | PROGRAMMING | The Editorial of the First Codeforces Global Round | 1500 | |
| 5121 | Magic Stones | constructive algorithms math sortings | Statement | E | Codeforces Global Round 1 {1110} | PROGRAMMING | The Editorial of the First Codeforces Global Round | 2200 | |
| 778 | Tree-Tac-Toe | constructive algorithms games trees | Statement | G | Codeforces Global Round 1 {1110} | PROGRAMMING | The Editorial of the First Codeforces Global Round | 3000 | |
| 9459 | Yet Another Array Partitioning Task | constructive algorithms greedy sortings | Statement | B | Codeforces Round 538 (Div. 2) {1114} | PROGRAMMING | Codeforces Round #538 (Div. 2) Editorial | 1500 | |
| 1672 | Decypher the String | bitmasks chinese remainder theorem constructive algorithms interactive math | Statement | E | Educational Codeforces Round 60 (Rated for Div. 2) {1117} | PROGRAMMING | 65365 | 2200 | |
| 6140 | Palindromic Matrix | constructive algorithms implementation | Statement | C | Codeforces Round 540 (Div. 3) {1118} | PROGRAMMING | 65396 | 1700 | |
| 4497 | Yet Another Ball Problem | constructive algorithms implementation | Statement | E | Codeforces Round 540 (Div. 3) {1118} | PROGRAMMING | 65396 | 2000 | |
| 7215 | Ramesses and Corner Inversion | constructive algorithms greedy implementation math | Statement | C | Codeforces Global Round 2 {1119} | PROGRAMMING | Codeforces Global Round 2 Editorial | 1500 | |
| 643 | Get Ready for the Battle | constructive algorithms implementation | Statement | G | Codeforces Global Round 2 {1119} | PROGRAMMING | Codeforces Global Round 2 Editorial | 3000 | |
| 483 | 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 | |
| 2357 | Wrong Answer | constructive algorithms | Statement | B | Codeforces Round 542 [Alex Lopashev Thanks-Round] (Div. 1) {1129} | PROGRAMMING | 65520 | 2200 | |
| 7973 | Asya And Kittens | constructive algorithms dsu | Statement | F | Codeforces Round 541 (Div. 2) {1131} | PROGRAMMING | Codeforces Round #541 Editorial | 1700 | |
| 3885 | Spanning Tree with One Fixed Degree | constructive algorithms dfs and similar dsu graphs greedy | Statement | F2 | Codeforces Round 544 (Div. 3) {1133} | PROGRAMMING | Codeforces Round #544 (Div. 3) Editorial | 2200 | |
| 12342 | Nastya Is Playing Computer Games | constructive algorithms math | Statement | B | Codeforces Round 546 (Div. 2) {1136} | PROGRAMMING | Editorial of Round #546(Div.2) | 1000 | |
| 8056 | Nastya Is Transposing Matrices | constructive algorithms sortings | Statement | C | Codeforces Round 546 (Div. 2) {1136} | PROGRAMMING | Editorial of Round #546(Div.2) | 1500 | |
| 2275 | Cooperative Game | constructive algorithms interactive number theory | Statement | D | Codeforces Round 545 (Div. 1) {1137} | PROGRAMMING | Codeforces Round #545 – Editorial | 2500 | |
| 2565 | 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 | |
| 16581 | Two Shuffled Sequences | constructive algorithms sortings | Statement | C | Codeforces Round 550 (Div. 3) {1144} | PROGRAMMING | 66307 | 1100 | |
| 10913 | Equalize Them All | constructive algorithms greedy | Statement | D | Codeforces Round 550 (Div. 3) {1144} | PROGRAMMING | 66307 | 1400 | |
| 5701 | Crazy Diamond | constructive algorithms sortings | Statement | C | Codeforces Global Round 3 {1148} | PROGRAMMING | Codeforces Global Round 3 Editorial | 1700 | |
| 1863 | Earth Wind and Fire | constructive algorithms greedy math sortings two pointers | Statement | E | Codeforces Global Round 3 {1148} | PROGRAMMING | Codeforces Global Round 3 Editorial | 2300 | |
| 1192 | Foo Fighters | bitmasks constructive algorithms | Statement | F | Codeforces Global Round 3 {1148} | PROGRAMMING | Codeforces Global Round 3 Editorial | 2500 | |
| 664 | Gold Experience | constructive algorithms graphs math number theory probabilities | Statement | G | Codeforces Global Round 3 {1148} | PROGRAMMING | Codeforces Global Round 3 Editorial | 3100 | |
| 18255 | Prefix Sum Primes | constructive algorithms greedy math number theory | Statement | A | Codeforces Round 556 (Div. 1) {1149} | PROGRAMMING | 66783 | 1300 | |
| 13194 | Dima and a Bad XOR | bitmasks brute force constructive algorithms dp | Statement | B | Codeforces Round 553 (Div. 2) {1151} | PROGRAMMING | Codeforces Round #553 (Div. 2) Editorial | 1600 | |
| 5642 | Problem for Nazar | constructive algorithms math | Statement | C | Codeforces Round 553 (Div. 2) {1151} | PROGRAMMING | Codeforces Round #553 (Div. 2) Editorial | 1700 | |
| 9478 | Neko Performs Cat Furrier Transform | bitmasks constructive algorithms dfs and similar math | Statement | B | Codeforces Round 554 (Div. 2) {1152} | PROGRAMMING | T | 1300 | |
| 1172 | Neko and Flashback | constructive algorithms dfs and similar graphs | Statement | E | Codeforces Round 554 (Div. 2) {1152} | PROGRAMMING | T | 2500 | |
| 9439 | Serval and Toy Bricks | constructive algorithms greedy | Statement | B | Codeforces Round 551 (Div. 2) {1153} | PROGRAMMING | Editorial | 1200 | |
| 4036 | N Problems During K Days | constructive algorithms greedy math | Statement | D | Codeforces Round 555 (Div. 3) {1157} | PROGRAMMING | 66737 | 2100 | |
| 2949 | Maximum Balanced Circle | constructive algorithms dp greedy two pointers | Statement | F | Codeforces Round 555 (Div. 3) {1157} | PROGRAMMING | 66737 | 2300 | |
| 1132 | Inverse of Rows and Columns | brute force constructive algorithms | Statement | G | Codeforces Round 555 (Div. 3) {1157} | PROGRAMMING | 66737 | 2800 | |
| 8587 | The Party and Sweets | binary search constructive algorithms greedy implementation math sortings two pointers | Statement | A | Codeforces Round 559 (Div. 1) {1158} | PROGRAMMING | 66993 | 1500 | |
| 2408 | The minimal unique substring | constructive algorithms math strings | Statement | B | Codeforces Round 559 (Div. 1) {1158} | PROGRAMMING | 66993 | 2200 | |
| 2326 | Permutation recovery | constructive algorithms data structures dfs and similar graphs greedy math sortings | Statement | C | Codeforces Round 559 (Div. 1) {1158} | PROGRAMMING | 66993 | 2300 | |
| 1040 | Winding polygonal line | constructive algorithms geometry greedy math | Statement | D | Codeforces Round 559 (Div. 1) {1158} | PROGRAMMING | 66993 | 2800 | |
| 1056 | Magical Permutation | bitmasks brute force constructive algorithms data structures graphs math | Statement | E | Codeforces Round 558 (Div. 2) {1163} | PROGRAMMING | 66943 | 2800 | |
| 11992 | All the Vowels Please | constructive algorithms math number theory | Statement | B | Codeforces Round 561 (Div. 2) {1166} | PROGRAMMING | Codeforces Round #561 (Div. 2) Editorial | 1100 | |
| 3046 | The LCMs Must be Large | bitmasks brute force constructive algorithms math number theory | Statement | E | Codeforces Round 561 (Div. 2) {1166} | PROGRAMMING | Codeforces Round #561 (Div. 2) Editorial | 2000 | |
| 7410 | Bicolored RBS | constructive algorithms greedy | Statement | D | Educational Codeforces Round 65 (Rated for Div. 2) {1167} | PROGRAMMING | 67058 | 1500 | |
| 450 | Xor Permutations | constructive algorithms math | Statement | E | Codeforces Round 562 (Div. 1) {1168} | PROGRAMMING | Codeforces Round #562 — Editorial | 3100 | |
| 57 | Longest Saw | *special constructive algorithms | Statement | H | Kotlin Heroes: Episode 1 {1170} | PROGRAMMING | Kotlin Heroes Editorial | ||
| 750 | Nauuo and Portals | constructive algorithms | Statement | D | Codeforces Round 564 (Div. 1) {1172} | PROGRAMMING | Codeforces Round #564 Editorial | 2800 | |
| 9485 | Nauuo and Chess | constructive algorithms greedy | Statement | B | Codeforces Round 564 (Div. 2) {1173} | PROGRAMMING | Codeforces Round #564 Editorial | 1100 | |
| 19457 | Ehab Fails to Be Thanos | constructive algorithms greedy sortings | Statement | A | Codeforces Round 563 (Div. 2) {1174} | PROGRAMMING | Codeforces round #563 editorial | 1000 | |
| 12891 | Ehab and a Special Coloring Problem | constructive algorithms number theory | Statement | C | Codeforces Round 563 (Div. 2) {1174} | PROGRAMMING | Codeforces round #563 editorial | 1300 | |
| 5132 | Ehab and the Expected XOR Problem | bitmasks constructive algorithms | Statement | D | Codeforces Round 563 (Div. 2) {1174} | PROGRAMMING | Codeforces round #563 editorial | 1900 | |
| 2086 | Ehab and the Big Finale | constructive algorithms divide and conquer graphs implementation interactive trees | Statement | F | Codeforces Round 563 (Div. 2) {1174} | PROGRAMMING | Codeforces round #563 editorial | 2300 | |
| 7979 | Prime Graph | constructive algorithms greedy math number theory | Statement | D | Codeforces Global Round 4 {1178} | PROGRAMMING | E | 1600 | |
| 4636 | Archaeology | brute force constructive algorithms greedy strings | Statement | E | Codeforces Global Round 4 {1178} | PROGRAMMING | E | 1900 | |
| 4617 | Tolik and His Uncle | constructive algorithms | Statement | B | Codeforces Round 569 (Div. 1) {1179} | PROGRAMMING | Editorial of Round #569 | 1800 | |
| 1046 | Complete Mirror | constructive algorithms dfs and similar dp hashing implementation trees | Statement | D | Codeforces Round 566 (Div. 2) {1182} | PROGRAMMING | 67614 | 2500 | |
| 9400 | Vus the Cossack and Numbers | constructive algorithms greedy math | Statement | D | Codeforces Round 571 (Div. 2) {1186} | PROGRAMMING | E | 1600 | |
| 6830 | Vasya And Array | constructive algorithms greedy implementation | Statement | C | Educational Codeforces Round 67 (Rated for Div. 2) {1187} | PROGRAMMING | Разбор Educational Codeforces Round 67 | 1800 | |
| 1335 | Add on a Tree: Revolution | constructive algorithms dfs and similar implementation trees | Statement | A2 | Codeforces Round 572 (Div. 1) {1188} | PROGRAMMING | Editorial of Codeforces Round #572 | 2500 | |
| 48 | Scissors and Tape | *special constructive algorithms geometry | Statement | C | CEOI 2019 day 2 online mirror (unrated, IOI format) {1193} | PROGRAMMING | T | ||
| 17681 | Odd Sum Segments | constructive algorithms math | Statement | B | Codeforces Round 575 (Div. 3) {1196} | PROGRAMMING | Editorial | 1200 | |
| 3941 | Connected Component on a Chessboard | constructive algorithms implementation | Statement | E | Codeforces Round 575 (Div. 3) {1196} | PROGRAMMING | Editorial | 1900 | |
| 3366 | K-th Path | brute force constructive algorithms shortest paths sortings | Statement | F | Codeforces Round 575 (Div. 3) {1196} | PROGRAMMING | Editorial | 2500 | |
| 29344 | Three Piles of Candies | brute force constructive algorithms math | Statement | A | Codeforces Round 575 (Div. 3) {1196} | PROGRAMMING | Editorial | 700 | |
| 4248 | Matching vs Independent Set | constructive algorithms graphs greedy sortings | Statement | C | Codeforces Round 576 (Div. 1) {1198} | PROGRAMMING | E | 2200 | |
| 5522 | Print a 1337-string... | combinatorics constructive algorithms math strings | Statement | D | Educational Codeforces Round 70 (Rated for Div. 2) {1202} | PROGRAMMING | 68972 | 1900 | |
| 14807 | Almost Equal | constructive algorithms greedy math | Statement | A | Codeforces Round 580 (Div. 1) {1205} | PROGRAMMING | 69158 | 1300 | |
| 798 | Almost All | constructive algorithms trees | Statement | D | Codeforces Round 580 (Div. 1) {1205} | PROGRAMMING | 69158 | 2800 | |
| 191 | Beauty of a Permutation | constructive algorithms math | Statement | F | Codeforces Round 580 (Div. 1) {1205} | PROGRAMMING | 69158 | 3400 | |
| 13812 | Square Filling | constructive algorithms greedy implementation | Statement | B | Educational Codeforces Round 71 (Rated for Div. 2) {1207} | PROGRAMMING | Educational Codeforces Round 71 Editorial | 1200 | |
| 6449 | Magic Grid | constructive algorithms | Statement | C | Manthan, Codefest 19 (open for everyone, rated, Div. 1 + Div. 2) {1208} | PROGRAMMING | 69357 | 1800 | |
| 7912 | Paint the Digits | constructive algorithms greedy implementation | Statement | C | Codeforces Round 584 - Dasha Code Championship - Elimination Round (rated, open for everyone, Div. 1 + Div. 2) {1209} | PROGRAMMING | 69791 | 1600 | |
| 5523 | Two Small Strings | brute force constructive algorithms | Statement | E | Codeforces Round 582 (Div. 3) {1213} | PROGRAMMING | Codeforces Round #582 (Div. 3) Editorial | 2000 | |
| 2890 | Petya and Construction Set | constructive algorithms graphs math sortings trees | Statement | E | Codeforces Round 583 (Div. 1 + Div. 2, based on Olympiad of Metropolises) {1214} | PROGRAMMING | Tutorial | 2000 | |
| 532 | Tiles Placement | constructive algorithms dfs and similar trees | Statement | H | Codeforces Round 583 (Div. 1 + Div. 2, based on Olympiad of Metropolises) {1214} | PROGRAMMING | Tutorial | 2700 | |
| 12093 | Swap Letters | constructive algorithms greedy | Statement | C | Codeforces Round 585 (Div. 2) {1215} | PROGRAMMING | Codeforces Round #585 Editorial | 1500 | |
| 6109 | Coloring Edges | constructive algorithms dfs and similar graphs | Statement | D | Educational Codeforces Round 72 (Rated for Div. 2) {1217} | PROGRAMMING | Educational Codeforces Round 72 Editorial | 2000 | |
| 318 | Alpha planetary system | constructive algorithms graphs shortest paths | Statement | G | Bubble Cup 12 - Finals [Online Mirror, unrated, Div. 1] {1218} | PROGRAMMING | E | 3300 | |
| 12568 | Knights | constructive algorithms greedy | Statement | B | Educational Codeforces Round 73 (Rated for Div. 2) {1221} | PROGRAMMING | Разбор Educational Codeforces Round 73 | 1100 | |
| 1053 | Tree Factory | constructive algorithms greedy trees | Statement | F | Technocup 2020 - Elimination Round 2 {1225} | PROGRAMMING | 70898 | 2500 | |
| 680 | To Make 1 | bitmasks constructive algorithms dp greedy number theory | Statement | G | Technocup 2020 - Elimination Round 2 {1225} | PROGRAMMING | 70898 | 3000 | |
| 10558 | Box | constructive algorithms | Statement | B | Technocup 2020 - Elimination Round 3 {1227} | PROGRAMMING | Разбор задач №2 | 1200 | |
| 5827 | Messy | constructive algorithms | Statement | C | Technocup 2020 - Elimination Round 3 {1227} | PROGRAMMING | Разбор задач №2 | 1700 | |
| 1308 | Not Same | constructive algorithms | Statement | G | Technocup 2020 - Elimination Round 3 {1227} | PROGRAMMING | Разбор задач №2 | 2500 | |
| 5472 | Complete Tripartite | brute force constructive algorithms graphs hashing implementation | Statement | D | Codeforces Round 589 (Div. 2) {1228} | PROGRAMMING | 70162 | 1800 | |
| 623 | One Node is Gone | constructive algorithms implementation trees | Statement | F | Codeforces Round 589 (Div. 2) {1228} | PROGRAMMING | 70162 | 2700 | |
| 953 | Middle-Out | constructive algorithms greedy strings | Statement | E | Dasha Code Championship - Novosibirsk Finals Round (only for onsite-finalists) {1231} | PROGRAMMING | Dasha Code Championship Finals and Mirror Round 588 Editorial | 2000 | |
| 10596 | Labs | constructive algorithms greedy implementation | Statement | C | Codeforces Round 593 (Div. 2) {1236} | PROGRAMMING | 70654 | 1300 | |
| 6348 | Balanced Removals (Easier) | constructive algorithms geometry greedy | Statement | C1 | Codeforces Global Round 5 {1237} | PROGRAMMING | T | 1600 | |
| 4609 | Balanced Removals (Harder) | binary search constructive algorithms divide and conquer greedy implementation sortings | Statement | C2 | Codeforces Global Round 5 {1237} | PROGRAMMING | T | 1900 | |
| 691 | Balanced Reversals | constructive algorithms | Statement | H | Codeforces Global Round 5 {1237} | PROGRAMMING | T | 3200 | |
| 13344 | Tile Painting | constructive algorithms math number theory | Statement | A | Codeforces Round 599 (Div. 1) {1242} | PROGRAMMING | Codeforces Round #599 Editorial | 1500 | |
| 173 | Planar Perimeter | constructive algorithms graphs | Statement | E | Codeforces Round 599 (Div. 1) {1242} | PROGRAMMING | Codeforces Round #599 Editorial | 3200 | |
| 8427 | Paint the Tree | brute force constructive algorithms dp graphs implementation trees | Statement | D | Codeforces Round 592 (Div. 2) {1244} | PROGRAMMING | Codeforces Round #592 (Div. 2) Tutorial | 1700 | |
| 6945 | Minimizing Difference | binary search constructive algorithms greedy sortings ternary search two pointers | Statement | E | Codeforces Round 592 (Div. 2) {1244} | PROGRAMMING | Codeforces Round #592 (Div. 2) Tutorial | 2000 | |
| 1666 | Chips | constructive algorithms implementation | Statement | F | Codeforces Round 592 (Div. 2) {1244} | PROGRAMMING | Codeforces Round #592 (Div. 2) Tutorial | 2300 | |
| 1581 | Running in Pairs | constructive algorithms greedy math | Statement | G | Codeforces Round 592 (Div. 2) {1244} | PROGRAMMING | Codeforces Round #592 (Div. 2) Tutorial | 2500 | |
| 14615 | Restricted RPS | constructive algorithms dp greedy | Statement | B | Codeforces Round 597 (Div. 2) {1245} | PROGRAMMING | Codeforces Round #597 (Div. 2) Editorial | 1200 | |
| 2832 | The Feast and the Bus | brute force constructive algorithms greedy math | Statement | B | 2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1250} | PROGRAMMING | 1900 | ||
| 402 | SmartGarden | constructive algorithms divide and conquer | Statement | M | 2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1250} | PROGRAMMING | 2700 | ||
| 10656 | Harmonious Graph | constructive algorithms dfs and similar dsu graphs greedy sortings | Statement | D | Codeforces Round 600 (Div. 2) {1253} | PROGRAMMING | Editorial | 1700 | |
| 5784 | Feeding Chicken | constructive algorithms greedy implementation | Statement | A | Codeforces Round 601 (Div. 1) {1254} | PROGRAMMING | Codeforces Round #601 Editorial | 1900 | |
| 5099 | Send Boxes to Alice (Easy Version) | constructive algorithms greedy math number theory ternary search two pointers | Statement | B1 | Codeforces Round 601 (Div. 1) {1254} | PROGRAMMING | Codeforces Round #601 Editorial | 2000 | |
| 3574 | Send Boxes to Alice (Hard Version) | constructive algorithms greedy math number theory ternary search two pointers | Statement | B2 | Codeforces Round 601 (Div. 1) {1254} | PROGRAMMING | Codeforces Round #601 Editorial | 2100 | |
| 1832 | Point Ordering | constructive algorithms geometry interactive math | Statement | C | Codeforces Round 601 (Div. 1) {1254} | PROGRAMMING | Codeforces Round #601 Editorial | 2300 | |
| 7310 | League of Leesins | constructive algorithms implementation | Statement | C | Codeforces Round 601 (Div. 2) {1255} | PROGRAMMING | Codeforces Round #601 Editorial | 1600 | |
| 3702 | Equalizing Two Strings | constructive algorithms sortings strings | Statement | F | Codeforces Round 598 (Div. 3) {1256} | PROGRAMMING | Codeforces Round #598 (Div. 3) Editorial | 2200 | |
| 6083 | Beautiful Sequence | brute force constructive algorithms greedy | Statement | B | Codeforces Round 604 (Div. 1) {1264} | PROGRAMMING | 71995 | 1900 | |
| 1002 | Beautiful League | constructive algorithms flows graph matchings | Statement | E | Codeforces Round 604 (Div. 1) {1264} | PROGRAMMING | 71995 | 2700 | |
| 1179 | Beautiful Fibonacci Problem | constructive algorithms number theory | Statement | F | Codeforces Round 604 (Div. 1) {1264} | PROGRAMMING | 71995 | 3600 | |
| 16049 | Beautiful String | constructive algorithms greedy | Statement | A | Codeforces Round 604 (Div. 2) {1265} | PROGRAMMING | Codeforces Round #604 Editorial | 1000 | |
| 16763 | Dice Tower | constructive algorithms math | Statement | B | Codeforces Global Round 6 {1266} | PROGRAMMING | Codeforces Global Round 6 Editorial | 1000 | |
| 10122 | Diverse Matrix | constructive algorithms greedy math number theory | Statement | C | Codeforces Global Round 6 {1266} | PROGRAMMING | Codeforces Global Round 6 Editorial | 1400 | |
| 3965 | Decreasing Debts | constructive algorithms data structures graphs greedy implementation math two pointers | Statement | D | Codeforces Global Round 6 {1266} | PROGRAMMING | Codeforces Global Round 6 Editorial | 2000 | |
| 3394 | Lexicography | constructive algorithms strings | Statement | L | 2019-2020 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1267} | PROGRAMMING | nerc-2019-tutorial.pdf | 1800 | |
| 1078 | Intriguing Selection | brute force constructive algorithms implementation interactive sortings | Statement | I | 2019-2020 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1267} | PROGRAMMING | nerc-2019-tutorial.pdf | 2700 | |
| 305 | DevOps Best Practices | constructive algorithms | Statement | D | 2019-2020 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1267} | PROGRAMMING | nerc-2019-tutorial.pdf | 3200 | |
| 393 | Cactus Revenge | constructive algorithms | Statement | C | 2019-2020 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1267} | PROGRAMMING | 3400 | ||
| 239 | Help BerLine | constructive algorithms | Statement | H | 2019-2020 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1267} | PROGRAMMING | nerc-2019-tutorial.pdf | 3500 | |
| 9199 | Long Beautiful Integer | constructive algorithms greedy implementation strings | Statement | A | Codeforces Round 609 (Div. 1) {1268} | PROGRAMMING | Codeforces Round #609 — Editorial | 1700 | |
| 17585 | Interesting Subarray | constructive algorithms greedy math | Statement | B | Good Bye 2019 {1270} | PROGRAMMING | Разбор Goodbye 2019 | 1300 | |
| 15223 | Make Good | bitmasks constructive algorithms math | Statement | C | Good Bye 2019 {1270} | PROGRAMMING | Разбор Goodbye 2019 | 1500 | |
| 5011 | Strange Device | constructive algorithms interactive math sortings | Statement | D | Good Bye 2019 {1270} | PROGRAMMING | Разбор Goodbye 2019 | 1900 | |
| 2786 | Divide Points | constructive algorithms geometry math | Statement | E | Good Bye 2019 {1270} | PROGRAMMING | Разбор Goodbye 2019 | 2300 | |
| 3222 | Subset with Zero Sum | constructive algorithms dfs and similar graphs math | Statement | G | Good Bye 2019 {1270} | PROGRAMMING | Разбор Goodbye 2019 | 2700 | |
| 417 | Xor on Figures | constructive algorithms fft math | Statement | I | Good Bye 2019 {1270} | PROGRAMMING | Разбор Goodbye 2019 | 3400 | |
| 14785 | Snow Walking Robot | constructive algorithms greedy implementation | Statement | B | Codeforces Round 605 (Div. 3) {1272} | PROGRAMMING | Codeforces Round #605 (Div. 3) Editorial | 1200 | |
| 1804 | Beautiful Rectangle | brute force combinatorics constructive algorithms data structures greedy math | Statement | C | Codeforces Round 606 (Div. 1, based on Technocup 2020 Elimination Round 4) {1276} | PROGRAMMING | Technocup 2020 — Elimination Round 4 + Codeforces Round 606: Editorial | 2300 | |
| 127 | Four Stones | constructive algorithms | Statement | E | Codeforces Round 606 (Div. 1, based on Technocup 2020 Elimination Round 4) {1276} | PROGRAMMING | Technocup 2020 — Elimination Round 4 + Codeforces Round 606: Editorial | 3400 | |
| 2087 | Tests for problem D | constructive algorithms dfs and similar divide and conquer trees | Statement | E | Educational Codeforces Round 78 (Rated for Div. 2) {1278} | PROGRAMMING | Educational Codeforces Round 78 Editorial | 2200 | |
| 115 | Intergalactic Sliding Puzzle | combinatorics constructive algorithms math | Statement | F | Codeforces Round 607 (Div. 1) {1280} | PROGRAMMING | Codeforces Round #607 Editorial | 3400 | |
| 2485 | Enchanted Artifact | constructive algorithms interactive strings | Statement | D | Codeforces Round 610 (Div. 2) {1282} | PROGRAMMING | 72461 | 2300 | |
| 1252 | The Cake Is a Lie | constructive algorithms data structures dfs and similar graphs | Statement | E | Codeforces Round 610 (Div. 2) {1282} | PROGRAMMING | 72461 | 2400 | |
| 14293 | Friends and Gifts | constructive algorithms data structures math | Statement | C | Codeforces Round 611 (Div. 3) {1283} | PROGRAMMING | Codeforces Round #611 (Div. 3) Editorial | 1500 | |
| 2166 | DIY Garland | constructive algorithms greedy trees | Statement | F | Codeforces Round 611 (Div. 3) {1283} | PROGRAMMING | Codeforces Round #611 (Div. 3) Editorial | 2400 | |
| 2038 | Delete a Segment | brute force constructive algorithms data structures dp graphs sortings trees two pointers | Statement | E | Codeforces Round 613 (Div. 2) {1285} | PROGRAMMING | Codeforces Round #613 (Div. 2) Editorial | 2300 | |
| 5751 | Numbers on Tree | constructive algorithms data structures dfs and similar graphs greedy trees | Statement | B | Codeforces Round 612 (Div. 1) {1286} | PROGRAMMING | Codeforces Round #612 - Editorial | 2000 | |
| 1629 | Madhouse (Easy version) | brute force constructive algorithms interactive math | Statement | C1 | Codeforces Round 612 (Div. 1) {1286} | PROGRAMMING | Codeforces Round #612 - Editorial | 2400 | |
| 776 | Madhouse (Hard version) | brute force constructive algorithms hashing interactive math | Statement | C2 | Codeforces Round 612 (Div. 1) {1286} | PROGRAMMING | Codeforces Round #612 - Editorial | 2900 | |
| 541 | Harry The Potter | brute force constructive algorithms dp fft implementation math | Statement | F | Codeforces Round 612 (Div. 1) {1286} | PROGRAMMING | Codeforces Round #612 - Editorial | 3200 | |
| 764 | Red-Blue Graph | constructive algorithms flows | Statement | F | Educational Codeforces Round 80 (Rated for Div. 2) {1288} | PROGRAMMING | Educational Codeforces Round 80 Editorial | 2900 | |
| 7461 | Irreducible Anagrams | binary search constructive algorithms data structures strings two pointers | Statement | B | Codeforces Round 616 (Div. 1) {1290} | PROGRAMMING | 1000.0 | Codeforces Round #616 Editorial | 1900 |
| 1023 | Coffee Varieties (hard version) | constructive algorithms graphs interactive | Statement | D | Codeforces Round 616 (Div. 1) {1290} | PROGRAMMING | 2500.0 | Codeforces Round #616 Editorial | 2900 |
| 6842 | Aroma's Search | brute force constructive algorithms geometry greedy implementation | Statement | B | Codeforces Round 614 (Div. 1) {1292} | PROGRAMMING | 750.0 | Codeforces Round #614 Editorial | 1800 |
| 480 | Rin and The Unknown Flower | constructive algorithms greedy interactive math | Statement | E | Codeforces Round 614 (Div. 1) {1292} | PROGRAMMING | 2250.0 | Codeforces Round #614 Editorial | 3500 |
| 8324 | String Coloring (easy version) | constructive algorithms dp graphs greedy sortings | Statement | E1 | Codeforces Round 617 (Div. 3) {1296} | PROGRAMMING | Codeforces Round #617 (Div. 3) Editorial | 1800 | |
| 3168 | Berland Beauty | constructive algorithms dfs and similar greedy sortings trees | Statement | F | Codeforces Round 617 (Div. 3) {1296} | PROGRAMMING | Codeforces Round #617 (Div. 3) Editorial | 2400 | |
| 4275 | Time to Run | constructive algorithms graphs implementation | Statement | D | Codeforces Round 619 (Div. 2) {1301} | PROGRAMMING | 1750.0 | Codeforces Round #619 (Div. 2) Editorial | 1900 |
| 156 | DAG | constructive algorithms | Statement | B | AIM Tech Poorly Prepared Contest (unrated, funny, Div. 1 preferred) {1302} | PROGRAMMING | 73599 | ||
| 18971 | 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 |
| 6822 | 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 |
| 12588 | 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 |
| 5433 | 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 |
| 3305 | 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 |
| 14758 | 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 |
| 2963 | Construct the Binary Tree | brute force constructive algorithms dfs and similar trees | Statement | E | Codeforces Round 624 (Div. 3) {1311} | PROGRAMMING | 74224 | 2400 | |
| 41905 | Bogosort | constructive algorithms sortings | Statement | B | Educational Codeforces Round 83 (Rated for Div. 2) {1312} | PROGRAMMING | 74640 | ||
| 7074 | Different Rules | binary search constructive algorithms greedy implementation math | Statement | B | Codeforces Round 622 (Div. 2) {1313} | PROGRAMMING | 1000.0 | Editorial | 1700 |
| 11865 | 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 |
| 7630 | Primitive Primes | constructive algorithms math ternary search | Statement | C | CodeCraft-20 (Div. 2) {1316} | PROGRAMMING | 1500.0 | Codecraft-20 (Div.2) Editorial | 1700 |
| 3670 | 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 |
| 4733 | 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 | |
| 18112 | 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 |
| 13904 | Ehab the Xorcist | bitmasks constructive algorithms greedy number theory | Statement | D | Codeforces Round 628 (Div. 2) {1325} | PROGRAMMING | 1750.0 | 74235 | 1700 |
| 2475 | Ehab's Last Theorem | constructive algorithms dfs and similar graphs greedy | Statement | F | Codeforces Round 628 (Div. 2) {1325} | PROGRAMMING | 2750.0 | 74235 | 2600 |
| 47380 | EhAb AnD gCd | constructive algorithms greedy number theory | Statement | A | Codeforces Round 628 (Div. 2) {1325} | PROGRAMMING | 500.0 | 74235 | 800 |
| 33065 | Bad Ugly Numbers | constructive algorithms number theory | Statement | A | Codeforces Global Round 7 {1326} | PROGRAMMING | 500.0 | 74961 | 1000 |
| 14160 | Game with Chips | constructive algorithms | Statement | C | Educational Codeforces Round 84 (Rated for Div. 2) {1327} | PROGRAMMING | Educational Codeforces Round 84 Editorial | 1600 | |
| 9813 | Dreamoon Likes Coloring | constructive algorithms greedy implementation math | Statement | A | Codeforces Round 631 (Div. 1) - Thanks, Denis aramis Shitov! {1329} | PROGRAMMING | 500.0 | Codeforces Round #631 Editorial | 1800 |
| 1839 | Drazil Likes Heap | constructive algorithms data structures greedy implementation sortings | Statement | C | Codeforces Round 631 (Div. 1) - Thanks, Denis aramis Shitov! {1329} | PROGRAMMING | 1500.0 | Codeforces Round #631 Editorial | 2400 |
| 568 | Dreamoon Likes Strings | constructive algorithms data structures | Statement | D | Codeforces Round 631 (Div. 1) - Thanks, Denis aramis Shitov! {1329} | PROGRAMMING | 2000.0 | Codeforces Round #631 Editorial | 3000 |
| 19374 | Composite Coloring | brute force constructive algorithms greedy math number theory | Statement | B | Codeforces Round 630 (Div. 2) {1332} | PROGRAMMING | 1000.0 | Codeforces Round #630 Editorial | 1500 |
| 8519 | Walk on Matrix | bitmasks constructive algorithms math | Statement | D | Codeforces Round 630 (Div. 2) {1332} | PROGRAMMING | 1250.0 | Codeforces Round #630 Editorial | 1700 |
| 4413 | Height All the Same | combinatorics constructive algorithms math matrices | Statement | E | Codeforces Round 630 (Div. 2) {1332} | PROGRAMMING | 1750.0 | Codeforces Round #630 Editorial | 2100 |
| 1846 | Road to 1600 | brute force constructive algorithms | Statement | E | Codeforces Round 632 (Div. 2) {1333} | PROGRAMMING | 2000.0 | Codeforces Round #632 (Div. 2) editorial |