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 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 1188 | Cutlet | data structures dp | Statement | F | Codeforces Round 464 (Div. 2) {939} | PROGRAMMING | Analysis of Codeforces Round #464 | 2700 | |
| 4380 | Cashback | data structures dp greedy math | Statement | E | Codeforces Round 466 (Div. 2) {940} | PROGRAMMING | [Editorial] Codeforces Round #466 (Div. 2) | 2000 | |
| 789 | Almost Increasing Array | data structures dp | Statement | G | Educational Codeforces Round 39 (Rated for Div. 2) {946} | PROGRAMMING | 58210 | 2600 | |
| 2394 | Castle Defense | binary search data structures greedy two pointers | Statement | G | Educational Codeforces Round 40 (Rated for Div. 2) {954} | PROGRAMMING | 58519 | 2100 | |
| 744 | Maximum Control (medium) | data structures dfs and similar graphs greedy trees | Statement | B2 | Helvetic Coding Contest 2018 online mirror (teams allowed, unrated) {958} | PROGRAMMING | helvetic-coding-contest-2018-editorial.pdf | 2400 | |
| 715 | Encryption (hard) | data structures dp | Statement | C3 | Helvetic Coding Contest 2018 online mirror (teams allowed, unrated) {958} | PROGRAMMING | helvetic-coding-contest-2018-editorial.pdf | 2600 | |
| 12283 | Minimize the error | data structures greedy sortings | Statement | B | Divide by Zero 2018 and Codeforces Round 474 (Div. 1 + Div. 2, combined) {960} | PROGRAMMING | Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined) Editorial | 1500 | |
| 3376 | Pathwalks | data structures dp graphs | Statement | F | Divide by Zero 2018 and Codeforces Round 474 (Div. 1 + Div. 2, combined) {960} | PROGRAMMING | Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined) Editorial | 2000 | |
| 347 | Santa's Gift | data structures trees | Statement | H | Divide by Zero 2018 and Codeforces Round 474 (Div. 1 + Div. 2, combined) {960} | PROGRAMMING | Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined) Editorial | 3000 | |
| 26206 | Lecture Sleep | data structures dp implementation two pointers | Statement | B | Educational Codeforces Round 41 (Rated for Div. 2) {961} | PROGRAMMING | Educational Codeforces Round 41 Editorial | 1300 | |
| 7353 | Merge Equals | data structures implementation | Statement | D | Educational Codeforces Round 42 (Rated for Div. 2) {962} | PROGRAMMING | Educational Codeforces Round 42 Editorial | 1600 | |
| 207 | Visible Black Areas | data structures dsu geometry trees | Statement | G | Educational Codeforces Round 42 (Rated for Div. 2) {962} | PROGRAMMING | Educational Codeforces Round 42 Editorial | 2900 | |
| 1872 | Short Code | data structures dp greedy strings trees | Statement | E | Codeforces Round 476 (Div. 2) [Thanks, Telegram!] {965} | PROGRAMMING | Analysis of Codeforces Round #476 (Div. 2) [Thanks, Telegram!] | 2500 | |
| 9198 | Mentors | binary search data structures implementation | Statement | F | Codeforces Round 481 (Div. 3) {978} | PROGRAMMING | T | 1500 | |
| 2171 | Kuro and GCD and XOR and SUM | binary search bitmasks brute force data structures dp dsu greedy math number theory strings trees | Statement | D | Codeforces Round 482 (Div. 2) {979} | PROGRAMMING | 1750.0 | Codeforces Round #482 (Div. 2) Editorial | 2200 |
| 2113 | The Number Games | data structures greedy trees | Statement | E | Codeforces Round 480 (Div. 2) {980} | PROGRAMMING | Tutorial | 2300 | |
| 2521 | Addition on Segments | bitmasks data structures divide and conquer dp | Statement | E | Avito Code Challenge 2018 {981} | PROGRAMMING | Avito Code Challenge 2018 — разбор | 2100 | |
| 288 | K Paths | combinatorics data structures dp fft math | Statement | H | Avito Code Challenge 2018 {981} | PROGRAMMING | Avito Code Challenge 2018 — разбор | 2900 | |
| 8936 | Bus of Characters | data structures greedy implementation | Statement | B | Codeforces Round 484 (Div. 2) {982} | PROGRAMMING | Editorial | 1300 | |
| 2510 | Shark | brute force data structures dsu trees | Statement | D | Codeforces Round 484 (Div. 2) {982} | PROGRAMMING | Editorial | 1900 | |
| 1188 | NN country | binary search data structures trees | Statement | E | Codeforces Round 483 (Div. 1) [Thanks, Botan Investments and Victor Shaburov!] {983} | PROGRAMMING | Codeforces Round #483 [Thanks, Botan Investments and Victor Shaburov!] Editoral | 2700 | |
| 4142 | Pencils and Boxes | binary search data structures dp greedy two pointers | Statement | E | Educational Codeforces Round 44 (Rated for Div. 2) {985} | PROGRAMMING | Educational Codeforces Round 44 Editorial | 2000 | |
| 893 | Prince's Problem | brute force data structures math number theory trees | Statement | E | Codeforces Round 485 (Div. 1) {986} | PROGRAMMING | Codeforces Round #485 Editorial | 2900 | |
| 2049 | Leaving the Bar | brute force data structures geometry greedy math sortings | Statement | C | Codeforces Round 492 (Div. 1) [Thanks, uDebug!] {995} | PROGRAMMING | Editorial for Codeforces Round #492 [Thanks u-Debug!] | 2200 | |
| 4879 | Equalize the Remainders | data structures greedy implementation | Statement | D | Codeforces Round 490 (Div. 3) {999} | PROGRAMMING | 60138 | 1900 | |
| 8355 | Covered Points Count | data structures implementation sortings | Statement | C | Educational Codeforces Round 46 (Rated for Div. 2) {1000} | PROGRAMMING | 60288 | 1700 | |
| 4813 | One Occurrence | data structures divide and conquer | Statement | F | Educational Codeforces Round 46 (Rated for Div. 2) {1000} | PROGRAMMING | 60288 | 2400 | |
| 711 | Two-Paths | data structures dp trees | Statement | G | Educational Codeforces Round 46 (Rated for Div. 2) {1000} | PROGRAMMING | 60288 | 2800 | |
| 1232 | Sonya and Ice Cream | binary search data structures dp greedy shortest paths trees | Statement | E | Codeforces Round 495 (Div. 2) {1004} | PROGRAMMING | 60443 | 2400 | |
| 927 | Sonya and Bitwise OR | bitmasks data structures divide and conquer | Statement | F | Codeforces Round 495 (Div. 2) {1004} | PROGRAMMING | 60443 | 2900 | |
| 25179 | Three Parts of the Array | binary search data structures two pointers | Statement | C | Codeforces Round 498 (Div. 3) {1006} | PROGRAMMING | 60672 | 1300 | |
| 13039 | 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 | |
| 321 | Ants | 2-sat data structures trees | Statement | D | Codeforces Round 497 (Div. 1) {1007} | PROGRAMMING | Editorial for Codeforces Round #497 by Skyglow | 3200 | |
| 7683 | Dominant Indices | data structures dsu trees | Statement | F | Educational Codeforces Round 47 (Rated for Div. 2) {1009} | PROGRAMMING | 60630 | 2300 | |
| 406 | Raining season | data structures divide and conquer trees | Statement | E | Codeforces Round 503 (by SIS, Div. 1) {1019} | PROGRAMMING | 61161 | 3200 | |
| 188 | Pisces | data structures flows trees | Statement | G | Codeforces Round 504 (rated, Div. 1 + Div. 2, based on VK Cup 2018 Final) {1023} | PROGRAMMING | Codeforces Round 504 Editorial | 3300 | |
| 1821 | Order book | combinatorics data structures greedy | Statement | D | AIM Tech Round 5 (rated, Div. 1 + Div. 2) {1028} | PROGRAMMING | 61493 | 2100 | |
| 585 | Intervals of Intervals | binary search data structures two pointers | Statement | D | Codeforces Round 511 (Div. 1) {1034} | PROGRAMMING | Codeforces Round #511 Editorial | 3500 | |
| 1268 | Maximum Reduction | combinatorics data structures math | Statement | F | Manthan, Codefest 18 (rated, Div. 1 + Div. 2) {1037} | PROGRAMMING | Tutorial | 2400 | |
| 1206 | Security | data structures string suffix structures | Statement | H | Manthan, Codefest 18 (rated, Div. 1 + Div. 2) {1037} | PROGRAMMING | Tutorial | 2900 | |
| 851 | Timetable | constructive algorithms data structures greedy math | Statement | A | Codeforces Round 507 (Div. 1, based on Olympiad of Metropolises) {1039} | PROGRAMMING | 61668 | 2400 | |
| 2296 | You Are Given a Tree | data structures dp trees | Statement | D | Codeforces Round 507 (Div. 1, based on Olympiad of Metropolises) {1039} | PROGRAMMING | 61668 | 2700 | |
| 10217 | Coffee Break | binary search data structures greedy two pointers | Statement | C | Codeforces Round 509 (Div. 2) {1041} | PROGRAMMING | Codeforces Round #509 (Div. 2) Editorial | 1500 | |
| 6413 | Glider | binary search data structures two pointers | Statement | D | Codeforces Round 509 (Div. 2) {1041} | PROGRAMMING | Codeforces Round #509 (Div. 2) Editorial | 1700 | |
| 3850 | Tree Reconstruction | constructive algorithms data structures graphs greedy | Statement | E | Codeforces Round 509 (Div. 2) {1041} | PROGRAMMING | Codeforces Round #509 (Div. 2) Editorial | 1900 | |
| 1614 | Ray in the tube | data structures divide and conquer dp math | Statement | F | Codeforces Round 509 (Div. 2) {1041} | PROGRAMMING | Codeforces Round #509 (Div. 2) Editorial | 2400 | |
| 7235 | Petya and Array | data structures divide and conquer two pointers | Statement | D | Codeforces Round 510 (Div. 2) {1042} | PROGRAMMING | Tutorial | 1800 | |
| 1466 | Leaf Sets | data structures dfs and similar dsu graphs greedy sortings trees | Statement | F | Codeforces Round 510 (Div. 2) {1042} | PROGRAMMING | Tutorial | 2400 | |
| 320 | Speckled Band | data structures divide and conquer hashing string suffix structures strings | Statement | G | Codeforces Round 519 by Botan Investments {1043} | PROGRAMMING | Codeforces Round #519 Editorial | 3500 | |
| 1183 | Deduction Queries | data structures dsu | Statement | D | Lyft Level 5 Challenge 2018 - Final Round {1044} | PROGRAMMING | Lyft Level 5 Challenge 2018 — Final Round — Editorial | 2600 | |
| 574 | Last chance | data structures flows graph matchings trees | Statement | A | Bubble Cup 11 - Finals [Online Mirror, Div. 1] {1045} | PROGRAMMING | E | 2800 | |
| 210 | Moonwalk challenge | data structures strings trees | Statement | J | Bubble Cup 11 - Finals [Online Mirror, Div. 1] {1045} | PROGRAMMING | E | 3000 | |
| 1205 | Vasya and Big Integers | binary search data structures dp hashing strings | Statement | E | Educational Codeforces Round 51 (Rated for Div. 2) {1051} | PROGRAMMING | Educational Codeforces Round 51 Editorial | 2500 | |
| 480 | Distinctification | data structures dsu greedy | Statement | G | Educational Codeforces Round 51 (Rated for Div. 2) {1051} | PROGRAMMING | Educational Codeforces Round 51 Editorial | 2700 | |
| 2791 | Check Transcription | brute force data structures hashing strings | Statement | E | Mail.Ru Cup 2018 Round 3 {1056} | PROGRAMMING | Mail.Ru Cup 2018 Round 3 Editorial | 2100 | |
| 299 | Take Metro | brute force data structures graphs | Statement | G | Mail.Ru Cup 2018 Round 3 {1056} | PROGRAMMING | Mail.Ru Cup 2018 Round 3 Editorial | 2800 | |
| 253 | Detect Robots | data structures strings | Statement | H | Mail.Ru Cup 2018 Round 3 {1056} | PROGRAMMING | Mail.Ru Cup 2018 Round 3 Editorial | 3100 | |
| 1619 | Split the Tree | binary search data structures dp greedy trees | Statement | E | Codeforces Round 514 (Div. 2) {1059} | PROGRAMMING | Codeforces Round #514 (Div. 2) Editorial | 2400 | |
| 10690 | Multiplicity | data structures dp implementation math number theory | Statement | C | Codeforces Round 523 (Div. 2) {1061} | PROGRAMMING | Tutorial (en) | 1700 | |
| 2558 | TV Shows | data structures greedy implementation sortings | Statement | D | Codeforces Round 523 (Div. 2) {1061} | PROGRAMMING | Tutorial (en) | 2000 | |
| 2049 | Company | binary search data structures dfs and similar greedy trees | Statement | E | Codeforces Round 520 (Div. 2) {1062} | PROGRAMMING | Tutorial | 2300 | |
| 1009 | String Journey | data structures dp string suffix structures | Statement | F | Codeforces Round 516 (Div. 1, by Moscow Team Olympiad) {1063} | PROGRAMMING | Editorial | 3000 | |
| 6556 | Binary Numbers AND Sum | data structures implementation math | Statement | E | Codeforces Round 515 (Div. 3) {1066} | PROGRAMMING | 62419 | 1700 | |
| 2281 | Cloud Computing | data structures greedy | Statement | C | 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 | 2000 | |
| 678 | Berkomnadzor | data structures greedy | Statement | B | 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 | 2500 | |
| 6715 | Berland Fair | binary search brute force data structures greedy | Statement | D | Educational Codeforces Round 53 (Rated for Div. 2) {1073} | PROGRAMMING | 62742 | 1700 | |
| 1108 | Yet Another LCP Problem | data structures string suffix structures | Statement | G | Educational Codeforces Round 53 (Rated for Div. 2) {1073} | PROGRAMMING | 62742 | 2700 | |
| 4138 | Vasya and a Tree | data structures trees | Statement | E | Educational Codeforces Round 54 (Rated for Div. 2) {1076} | PROGRAMMING | E | 1900 | |
| 720 | Array Game | data structures games | Statement | G | Educational Codeforces Round 54 (Rated for Div. 2) {1076} | PROGRAMMING | E | 2700 | |
| 4148 | Pictures with Kittens (hard version) | data structures dp | Statement | F2 | Codeforces Round 521 (Div. 3) {1077} | PROGRAMMING | Codeforces Round #521 (Div. 3) Editorial | 2300 | |
| 913 | Katya and Segments Sets | data structures interactive sortings | Statement | F | Codeforces Round 524 (Div. 2) {1080} | PROGRAMMING | Codeforces Round #524 (Div. 2) Editorial | 2700 | |
| 130 | Palindromic Magic | data structures hashing strings | Statement | H | Avito Cool Challenge 2018 {1081} | PROGRAMMING | 63888 | 3500 | |
| 6239 | The Fair Nut and the Best Path | data structures dp trees | Statement | A | Codeforces Round 526 (Div. 1) {1083} | PROGRAMMING | 63753 | 1800 | |
| 5572 | The Fair Nut and Rectangles | data structures dp geometry | Statement | E | Codeforces Round 526 (Div. 1) {1083} | PROGRAMMING | 63753 | 2400 | |
| 1110 | Max Mex | data structures trees | Statement | C | Codeforces Round 526 (Div. 1) {1083} | PROGRAMMING | 63753 | 2800 | |
| 355 | The Fair Nut's getting crazy | data structures implementation | Statement | D | Codeforces Round 526 (Div. 1) {1083} | PROGRAMMING | 63753 | 3400 | |
| 708 | Beautiful Matrix | combinatorics data structures dp | Statement | G | Technocup 2019 - Elimination Round 4 {1085} | PROGRAMMING | Technocup 2019 — Elimination Round 4 + Codeforces Round 528: editorial | 2600 | |
| 592 | Ehab and a weird weight formula | data structures trees | Statement | F | Codeforces Round 525 (Div. 2) {1088} | PROGRAMMING | Codeforces round #525 editorial | 3000 | |
| 1086 | New Year and the Acquaintance Estimation | binary search data structures graphs greedy implementation math sortings | Statement | E | Good Bye 2018 {1091} | PROGRAMMING | Editorial | 2400 | |
| 3368 | Great Vova Wall (Version 2) | data structures implementation | Statement | D2 | Codeforces Round 527 (Div. 3) {1092} | PROGRAMMING | Codeforces Round #527 (Div. 3) Editorial | 2200 | |
| 1033 | Cookies | binary search data structures dfs and similar dp games trees | Statement | F | Codeforces Round 530 (Div. 2) {1099} | PROGRAMMING | E | 2300 | |
| 11740 | Build a Contest | data structures implementation | Statement | B | Codeforces Round 532 (Div. 2) {1100} | PROGRAMMING | Unofficial Tutorial | 1300 | |
| 3657 | Ivan and Burgers | data structures divide and conquer greedy math | Statement | F | Codeforces Round 532 (Div. 2) {1100} | PROGRAMMING | Unofficial Tutorial | 2600 | |
| 5406 | GCD Counting | data structures dfs and similar dp number theory trees | Statement | D | Educational Codeforces Round 58 (Rated for Div. 2) {1101} | PROGRAMMING | 64483 | 2000 | |
| 16768 | Game with string | data structures implementation math | Statement | B | Codeforces Round 534 (Div. 2) {1104} | PROGRAMMING | Codeforces Round #534 — Editorial | 1300 | |
| 19527 | Lunar New Year and a Wander | data structures dfs and similar graphs greedy shortest paths | Statement | D | Codeforces Round 536 (Div. 2) {1106} | PROGRAMMING | Tutorial | 1500 | |
| 6992 | Lunar New Year and Food Ordering | data structures implementation | Statement | B | Codeforces Round 536 (Div. 2) {1106} | PROGRAMMING | Tutorial | 1500 | |
| 2813 | Lunar New Year and Red Envelopes | data structures dp | Statement | E | Codeforces Round 536 (Div. 2) {1106} | PROGRAMMING | Tutorial | 2100 | |
| 1240 | 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 | |
| 2509 | Array and Segments (Hard version) | data structures implementation | Statement | E2 | Codeforces Round 535 (Div. 3) {1108} | PROGRAMMING | 64751 | 2300 | |
| 598 | Sasha and a Very Easy Test | data structures number theory | Statement | E | Codeforces Round 539 (Div. 1) {1109} | PROGRAMMING | Codeforces Round #539 Editorial | 2700 | |
| 287 | Sasha and a Patient Friend | binary search data structures implementation | Statement | C | Codeforces Round 539 (Div. 1) {1109} | PROGRAMMING | Codeforces Round #539 Editorial | 2800 | |
| 364 | Sasha and Algorithm of Silence's Sounds | data structures trees | Statement | F | Codeforces Round 539 (Div. 1) {1109} | PROGRAMMING | Codeforces Round #539 Editorial | 3200 | |
| 2038 | Nearest Leaf | data structures trees | Statement | F | Codeforces Global Round 1 {1110} | PROGRAMMING | The Editorial of the First Codeforces Global Round | 2600 | |
| 1091 | Tree | data structures dfs and similar dp graphs trees | Statement | E | CodeCraft-19 and Codeforces Round 537 (Div. 2) {1111} | PROGRAMMING | CodeCraft-19 and Codeforces Round #537 (Div. 2) Editorial | 2800 | |
| 2419 | Please, another Queries on Array? | bitmasks data structures divide and conquer math number theory | Statement | F | Codeforces Round 538 (Div. 2) {1114} | PROGRAMMING | Codeforces Round #538 (Div. 2) Editorial | 2500 | |
| 875 | Niyaz and Small Degrees | data structures dp trees | Statement | F | Codeforces Global Round 2 {1119} | PROGRAMMING | Codeforces Global Round 2 Editorial | 2900 | |
| 328 | 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 | |
| 1000 | 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 | |
| 1301 | Isolation | data structures dp | Statement | D | Codeforces Round 542 [Alex Lopashev Thanks-Round] (Div. 1) {1129} | PROGRAMMING | 65520 | 2800 | |
| 539 | Most Dangerous Shark | data structures dp two pointers | Statement | G | Codeforces Round 541 (Div. 2) {1131} | PROGRAMMING | Codeforces Round #541 Editorial | 2900 | |
| 1226 | Greedy Subsequences | data structures dp trees | Statement | G | Educational Codeforces Round 61 (Rated for Div. 2) {1132} | PROGRAMMING | T | 2600 | |
| 598 | Train Car Selection | data structures greedy | Statement | E | Codeforces Round 545 (Div. 1) {1137} | PROGRAMMING | Codeforces Round #545 – Editorial | 2800 | |
| 523 | Matches Are Not a Child's Play | data structures trees | Statement | F | Codeforces Round 545 (Div. 1) {1137} | PROGRAMMING | Codeforces Round #545 – Editorial | 3300 | |
| 509 | Dish Shopping | data structures divide and conquer | Statement | F | Codeforces Round 548 (Div. 2) {1139} | PROGRAMMING | Codeforces Round #548 Editorial | 2800 | |
| 10383 | Playlist | brute force data structures sortings | Statement | C | Educational Codeforces Round 62 (Rated for Div. 2) {1140} | PROGRAMMING | Educational Codeforces Round 62 Editorial | 1600 | |
| 1545 | Extending Set of Points | data structures divide and conquer dsu | Statement | F | Educational Codeforces Round 62 (Rated for Div. 2) {1140} | PROGRAMMING | Educational Codeforces Round 62 Editorial | 2700 | |
| 610 | 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 | |
| 4570 | Same Sum Blocks (Hard) | data structures greedy | Statement | F2 | Codeforces Round 547 (Div. 3) {1141} | PROGRAMMING | 66062 | 2200 | |
| 3718 | Lynyrd Skynyrd | data structures dfs and similar dp math trees | Statement | B | Codeforces Round 549 (Div. 1) {1142} | PROGRAMMING | Codeforces Round #549 Editorial | 2300 | |
| 1015 | Hot is Cold | bitmasks data structures divide and conquer implementation | Statement | E | Forethought Future Cup - Elimination Round {1146} | PROGRAMMING | 66639 | 2400 | |
| 1667 | Tree Generator™ | data structures implementation trees | Statement | C | Codeforces Round 556 (Div. 1) {1149} | PROGRAMMING | 66783 | 2900 | |
| 3762 | Number of Components | combinatorics data structures dp math | Statement | E | Codeforces Round 553 (Div. 2) {1151} | PROGRAMMING | Codeforces Round #553 (Div. 2) Editorial | 2100 | |
| 6932 | Two Teams | data structures implementation sortings | Statement | E | Codeforces Round 552 (Div. 3) {1154} | PROGRAMMING | Codeforces Round #552 (Div. 3) Editorial | 1800 | |
| 7702 | Beautiful Array | brute force data structures divide and conquer dp greedy | Statement | D | Educational Codeforces Round 63 (Rated for Div. 2) {1155} | PROGRAMMING | 66687 | 1900 | |
| 4003 | Special Segments of Permutation | data structures divide and conquer dsu two pointers | Statement | E | Educational Codeforces Round 64 (Rated for Div. 2) {1156} | PROGRAMMING | 66827 | 2400 | |
| 9173 | Minimum Array | binary search data structures greedy | Statement | E | Codeforces Round 555 (Div. 3) {1157} | PROGRAMMING | 66737 | 1700 | |
| 2114 | Permutation recovery | constructive algorithms data structures dfs and similar graphs greedy math sortings | Statement | C | Codeforces Round 559 (Div. 1) {1158} | PROGRAMMING | 66993 | 2300 | |
| 7323 | Cat Party (Easy Edition) | data structures implementation | Statement | B1 | Codeforces Round 558 (Div. 2) {1163} | PROGRAMMING | 66943 | 1500 | |
| 7639 | Cat Party (Hard Edition) | data structures implementation | Statement | B2 | Codeforces Round 558 (Div. 2) {1163} | PROGRAMMING | 66943 | 1700 | |
| 3947 | Power Transmission (Hard Edition) | data structures geometry implementation math | Statement | C2 | Codeforces Round 558 (Div. 2) {1163} | PROGRAMMING | 66943 | 2000 | |
| 1008 | Magical Permutation | bitmasks brute force constructive algorithms data structures graphs math | Statement | E | Codeforces Round 558 (Div. 2) {1163} | PROGRAMMING | 66943 | 2800 | |
| 1276 | Indecisive Taxi Fee | data structures graphs shortest paths | Statement | F | Codeforces Round 558 (Div. 2) {1163} | PROGRAMMING | 66943 | 2900 | |
| 24125 | Polycarp Training | data structures greedy sortings | Statement | B | Codeforces Round 560 (Div. 3) {1165} | PROGRAMMING | Codeforces Round #560 (Div. 3) Editorial | 1000 | |
| 811 | Vicky's Delivery Service | data structures dsu graphs hashing | Statement | F | Codeforces Round 561 (Div. 2) {1166} | PROGRAMMING | Codeforces Round #561 (Div. 2) Editorial | 2800 | |
| 2923 | Range Deleting | binary search combinatorics data structures two pointers | Statement | E | Educational Codeforces Round 65 (Rated for Div. 2) {1167} | PROGRAMMING | 67058 | 2100 | |
| 1886 | Scalar Queries | combinatorics data structures math sortings | Statement | F | Educational Codeforces Round 65 (Rated for Div. 2) {1167} | PROGRAMMING | 67058 | 2300 | |
| 531 | Decoding of Integer Sequences | *special data structures implementation | Statement | D | Kotlin Heroes: Episode 1 {1170} | PROGRAMMING | Kotlin Heroes Editorial | ||
| 12399 | Catch Overflow! | data structures expression parsing implementation | Statement | B | Educational Codeforces Round 66 (Rated for Div. 2) {1175} | PROGRAMMING | Editorial | 1600 | |
| 4517 | Minimal Segment Cover | data structures dfs and similar divide and conquer dp greedy implementation trees | Statement | E | Educational Codeforces Round 66 (Rated for Div. 2) {1175} | PROGRAMMING | Editorial | 2200 | |
| 2643 | The Number of Subpermutations | brute force data structures divide and conquer hashing math | Statement | F | Educational Codeforces Round 66 (Rated for Div. 2) {1175} | PROGRAMMING | Editorial | 2600 | |
| 698 | Yet Another Partiton Problem | data structures divide and conquer dp geometry two pointers | Statement | G | Educational Codeforces Round 66 (Rated for Div. 2) {1175} | PROGRAMMING | Editorial | 2700 | |
| 600 | The Awesomest Vertex | data structures dfs and similar | Statement | G | Codeforces Global Round 4 {1178} | PROGRAMMING | E | 2900 | |
| 11768 | Valeriy and Deque | data structures implementation | Statement | A | Codeforces Round 569 (Div. 1) {1179} | PROGRAMMING | Editorial of Round #569 | 1500 | |
| 2444 | Serge and Dining Room | binary search data structures graph matchings greedy implementation math trees | Statement | C | Codeforces Round 569 (Div. 1) {1179} | PROGRAMMING | Editorial of Round #569 | 2400 | |
| 1035 | Fedor Runs for President | data structures dp trees | Statement | D | Codeforces Round 569 (Div. 1) {1179} | PROGRAMMING | Editorial of Round #569 | 2600 | |
| 2791 | Irrigation | binary search data structures implementation sortings trees two pointers | Statement | D | Codeforces Round 567 (Div. 2) {1181} | PROGRAMMING | Editorial of Codeforces Round #567 (based on All-Russian olympiad in the name of Keldysh) | 2100 | |
| 4588 | Beautiful Lyrics | data structures greedy strings | Statement | C | Codeforces Round 566 (Div. 2) {1182} | PROGRAMMING | 67614 | 1700 | |
| 398 | Maximum Sine | binary search data structures number theory | Statement | F | Codeforces Round 566 (Div. 2) {1182} | PROGRAMMING | 67614 | 2900 | |
| 664 | Daleks' Invasion (hard) | data structures dsu graphs trees | Statement | E3 | Helvetic Coding Contest 2019 online mirror (teams allowed, unrated) {1184} | PROGRAMMING | helvetic-coding-contest-2019-editorial.pdf | 2500 | |
| 7808 | Exam in BerSU (hard version) | brute force data structures greedy math | Statement | C2 | Codeforces Round 568 (Div. 2) {1185} | PROGRAMMING | Editorial for Codeforces Round #568 (Div. 2) | 1700 | |
| 2992 | Subarray Sorting | data structures sortings | Statement | D | Educational Codeforces Round 67 (Rated for Div. 2) {1187} | PROGRAMMING | Разбор Educational Codeforces Round 67 | 2200 | |
| 11057 | Candies! | data structures dp implementation math | Statement | C | Codeforces Round 572 (Div. 2) {1189} | PROGRAMMING | Editorial of Codeforces Round #572 | 1400 | |
| 2683 | Tokitsukaze and Strange Rectangle | data structures divide and conquer sortings two pointers | Statement | D | Codeforces Round 573 (Div. 1) {1190} | PROGRAMMING | E | 2200 | |
| 1539 | Dynamic Diameter | *special data structures dfs and similar divide and conquer trees | Statement | B | CEOI 2019 day 1 online mirror (unrated, IOI format) {1192} | PROGRAMMING | E | ||
| 507 | Magic Tree | *special data structures dp trees | Statement | B | CEOI 2019 day 2 online mirror (unrated, IOI format) {1193} | PROGRAMMING | T | ||
| 2041 | Count The Rectangles | bitmasks brute force data structures geometry sortings | Statement | E | Educational Codeforces Round 68 (Rated for Div. 2) {1194} | PROGRAMMING | Разбор Educational Codeforces Round 68 | 2200 | |
| 3540 | OpenStreetMap | data structures two pointers | Statement | E | Codeforces Round 574 (Div. 2) {1195} | PROGRAMMING | Разбор Codeforces Round #574 (Div. 2) | 2100 | |
| 1035 | Geometers Anonymous Club | data structures geometry math sortings | Statement | F | Codeforces Round 574 (Div. 2) {1195} | PROGRAMMING | Разбор Codeforces Round #574 (Div. 2) | 2700 | |
| 10425 | RGB Substring (hard version) | data structures dp implementation two pointers | Statement | D2 | Codeforces Round 575 (Div. 3) {1196} | PROGRAMMING | Editorial | 1600 | |
| 1848 | Culture Code | binary search combinatorics data structures dp shortest paths sortings | Statement | E | Educational Codeforces Round 69 (Rated for Div. 2) {1197} | PROGRAMMING | E | 2300 | |
| 9952 | Welfare State | binary search brute force data structures sortings | Statement | B | Codeforces Round 576 (Div. 1) {1198} | PROGRAMMING | E | 1600 | |
| 21793 | Hotelier | brute force data structures implementation | Statement | A | Codeforces Round 578 (Div. 2) {1200} | PROGRAMMING | Codeforces Round #578 (Div. 2) Editorial | 1000 | |
| 4396 | White Lines | brute force data structures dp implementation two pointers | Statement | D | Codeforces Round 578 (Div. 2) {1200} | PROGRAMMING | Codeforces Round #578 (Div. 2) Editorial | 1900 | |
| 1162 | Graph Traveler | brute force data structures dfs and similar dp graphs implementation math number theory | Statement | F | Codeforces Round 578 (Div. 2) {1200} | PROGRAMMING | Codeforces Round #578 (Div. 2) Editorial | 2500 | |
| 2763 | You Are Given a WASD-string... | brute force data structures dp greedy implementation math strings | Statement | C | Educational Codeforces Round 70 (Rated for Div. 2) {1202} | PROGRAMMING | 68972 | 2100 | |
| 3390 | Kirk and a Binary String (hard version) | data structures greedy math strings | Statement | D2 | Codeforces Round 581 (Div. 2) {1204} | PROGRAMMING | 69244 | 2100 | |
| 6714 | Remainder Problem | brute force data structures implementation | Statement | F | Educational Codeforces Round 71 (Rated for Div. 2) {1207} | PROGRAMMING | Educational Codeforces Round 71 Editorial | 2100 | |
| 1216 | Indie Album | data structures dfs and similar hashing string suffix structures strings trees | Statement | G | Educational Codeforces Round 71 (Rated for Div. 2) {1207} | PROGRAMMING | Educational Codeforces Round 71 Editorial | 2600 | |
| 5439 | Restore Permutation | binary search data structures greedy implementation | Statement | D | Manthan, Codefest 19 (open for everyone, rated, Div. 1 + Div. 2) {1208} | PROGRAMMING | 69357 | 1900 | |
| 2181 | Let Them Slide | data structures implementation | Statement | E | Manthan, Codefest 19 (open for everyone, rated, Div. 1 + Div. 2) {1208} | PROGRAMMING | 69357 | 2200 | |
| 188 | Red Blue Tree | data structures implementation trees | Statement | H | Manthan, Codefest 19 (open for everyone, rated, Div. 1 + Div. 2) {1208} | PROGRAMMING | 69357 | 3500 | |
| 3934 | Into Blocks (easy version) | data structures dsu greedy implementation two pointers | Statement | G1 | Codeforces Round 584 - Dasha Code Championship - Elimination Round (rated, open for everyone, Div. 1 + Div. 2) {1209} | PROGRAMMING | 69791 | 2000 | |
| 1362 | Koala and Notebook | data structures dfs and similar graphs shortest paths strings trees | Statement | F | Codeforces Round 584 - Dasha Code Championship - Elimination Round (rated, open for everyone, Div. 1 + Div. 2) {1209} | PROGRAMMING | 69791 | 2600 | |
| 228 | Moving Walkways | data structures greedy math | Statement | H | Codeforces Round 584 - Dasha Code Championship - Elimination Round (rated, open for everyone, Div. 1 + Div. 2) {1209} | PROGRAMMING | 69791 | 3300 | |
| 31416 | Bad Prices | data structures implementation | Statement | B | Codeforces Round 582 (Div. 3) {1213} | PROGRAMMING | Codeforces Round #582 (Div. 3) Editorial | 1100 | |
| 3013 | Unstable String Sort | data structures dfs and similar dsu graphs greedy implementation strings | Statement | F | Codeforces Round 582 (Div. 3) {1213} | PROGRAMMING | Codeforces Round #582 (Div. 3) Editorial | 2400 | |
| 14177 | Bad Sequence | data structures greedy | Statement | C | Codeforces Round 583 (Div. 1 + Div. 2, based on Olympiad of Metropolises) {1214} | PROGRAMMING | Tutorial | 1200 | |
| 3092 | Wi-Fi | data structures dp greedy | Statement | F | Codeforces Round 587 (Div. 3) {1216} | PROGRAMMING | Codeforces Round #587 (Div. 3) Editorial | 2300 | |
| 2061 | Sum Queries? | data structures greedy implementation math | Statement | E | Educational Codeforces Round 72 (Rated for Div. 2) {1217} | PROGRAMMING | Educational Codeforces Round 72 Editorial | 2300 | |
| 716 | Forced Online Queries Problem | data structures divide and conquer dsu graphs trees | Statement | F | Educational Codeforces Round 72 (Rated for Div. 2) {1217} | PROGRAMMING | Educational Codeforces Round 72 Editorial | 2800 | |
| 3185 | Workout plan | data structures greedy | Statement | F | Bubble Cup 12 - Finals [Online Mirror, unrated, Div. 1] {1218} | PROGRAMMING | E | 1500 | |
| 95 | Guarding warehouses | data structures geometry | Statement | B | Bubble Cup 12 - Finals [Online Mirror, unrated, Div. 1] {1218} | PROGRAMMING | E | 2700 | |
| 1235 | Choose a Square | binary search data structures sortings | Statement | F | Educational Codeforces Round 73 (Rated for Div. 2) {1221} | PROGRAMMING | Разбор Educational Codeforces Round 73 | 2500 | |
| 2265 | Stack Exterminable Arrays | data structures divide and conquer dp hashing | Statement | F | Technocup 2020 - Elimination Round 1 {1223} | PROGRAMMING | Сodeforces Round 591 (and Technocup 2020 — Elimination Round 1) Editorial | 2600 | |
| 6823 | Optimal Subsequences (Easy Version) | data structures greedy | Statement | D1 | Technocup 2020 - Elimination Round 3 {1227} | PROGRAMMING | Разбор задач №2 | 1600 | |
| 4720 | Optimal Subsequences (Hard Version) | data structures greedy | Statement | D2 | Technocup 2020 - Elimination Round 3 {1227} | PROGRAMMING | Разбор задач №2 | 1800 | |
| 18395 | Social Network (hard version) | data structures implementation | Statement | B2 | Codeforces Round 590 (Div. 3) {1234} | PROGRAMMING | Codeforces Round #590 (Div. 3) Editorial | 1200 | |
| 1736 | Alice and the Doll | brute force data structures greedy implementation | Statement | D | Codeforces Round 593 (Div. 2) {1236} | PROGRAMMING | 70654 | 2100 | |
| 730 | Alice and the Unfair Game | binary search data structures dp dsu | Statement | E | Codeforces Round 593 (Div. 2) {1236} | PROGRAMMING | 70654 | 2600 | |
| 22610 | Balanced Tunnel | data structures sortings two pointers | Statement | B | Codeforces Global Round 5 {1237} | PROGRAMMING | T | 1300 | |
| 4771 | Balanced Playlist | binary search data structures implementation | Statement | D | Codeforces Global Round 5 {1237} | PROGRAMMING | T | 1900 | |
| 165 | Balanced Distribution | data structures dp greedy | Statement | G | Codeforces Global Round 5 {1237} | PROGRAMMING | T | 3600 | |
| 493 | Adilbek and the Watering System | data structures greedy sortings | Statement | G | Educational Codeforces Round 74 (Rated for Div. 2) {1238} | PROGRAMMING | Educational Codeforces Round 74 Editorial | 2700 | |
| 1810 | Queue in the Train | data structures greedy implementation | Statement | C | Codeforces Round 594 (Div. 1) {1239} | PROGRAMMING | Editorial of Codeforces Round #594 (on the problems of Moscow Team Olympiad) | 2300 | |
| 5760 | Too Many Segments (hard version) | data structures greedy sortings | Statement | D2 | Codeforces Round 595 (Div. 3) {1249} | PROGRAMMING | Codeforces Round #595 (Div. 3) Editorial | 2000 | |
| 2585 | Voting (Easy Version) | data structures dp greedy | Statement | E1 | Educational Codeforces Round 75 (Rated for Div. 2) {1251} | PROGRAMMING | 70860 | 2200 | |
| 2947 | Voting (Hard Version) | binary search data structures greedy | Statement | E2 | Educational Codeforces Round 75 (Rated for Div. 2) {1251} | PROGRAMMING | 70860 | 2300 | |
| 3981 | Even Path | data structures implementation | Statement | C | 2019-2020 ICPC, Asia Jakarta Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1252} | PROGRAMMING | T | 1600 | |
| 2061 | Addition Robot | data structures math matrices | Statement | K | 2019-2020 ICPC, Asia Jakarta Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1252} | PROGRAMMING | T | 2200 | |
| 410 | Find String in a Grid | data structures dp strings trees | Statement | D | 2019-2020 ICPC, Asia Jakarta Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1252} | PROGRAMMING | T | 2900 | |
| 3057 | Antenna Coverage | data structures dp greedy sortings | Statement | E | Codeforces Round 600 (Div. 2) {1253} | PROGRAMMING | Editorial | 2200 | |
| 1524 | Tree Queries | data structures probabilities trees | Statement | D | Codeforces Round 601 (Div. 1) {1254} | PROGRAMMING | Codeforces Round #601 Editorial | 2600 | |
| 8144 | Yet Another Monster Killing Problem | binary search data structures dp greedy sortings two pointers | Statement | D | Educational Codeforces Round 76 (Rated for Div. 2) {1257} | PROGRAMMING | Educational Codeforces Round 76 Editorial | 1700 | |
| 4525 | The Contest | data structures dp greedy | Statement | E | Educational Codeforces Round 76 (Rated for Div. 2) {1257} | PROGRAMMING | Educational Codeforces Round 76 Editorial | 2000 | |
| 631 | Colored Tree | data structures trees | Statement | F | Educational Codeforces Round 77 (Rated for Div. 2) {1260} | PROGRAMMING | Educational Codeforces Round 77 Editorial | 2700 | |
| 2968 | Editor | data structures implementation | Statement | E | Codeforces Round 603 (Div. 2) {1263} | PROGRAMMING | Разбор Codeforces Round #603 (Div. 2) | 2000 | |
| 949 | Economic Difficulties | data structures dfs and similar dp flows graphs trees | Statement | F | Codeforces Round 603 (Div. 2) {1263} | PROGRAMMING | Разбор Codeforces Round #603 (Div. 2) | 2500 | |
| 1318 | Beautiful Mirrors with queries | data structures probabilities | Statement | C | Codeforces Round 604 (Div. 1) {1264} | PROGRAMMING | 71995 | 2400 | |
| 13513 | Beautiful Numbers | data structures implementation math two pointers | Statement | B | Codeforces Round 604 (Div. 2) {1265} | PROGRAMMING | Codeforces Round #604 Editorial | 1300 | |
| 4492 | Beautiful Mirrors | data structures dp math probabilities | Statement | E | Codeforces Round 604 (Div. 2) {1265} | PROGRAMMING | Codeforces Round #604 Editorial | 2100 | |
| 3868 | 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 | |
| 2348 | Spaceship Solitaire | data structures greedy implementation | Statement | E | Codeforces Global Round 6 {1266} | PROGRAMMING | Codeforces Global Round 6 Editorial | 2100 | |
| 3395 | Portals | data structures dp greedy implementation sortings | Statement | D | Codeforces Round 608 (Div. 2) {1271} | PROGRAMMING | 72247 | 2100 | |
| 1776 | 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 | |
| 3274 | Let's Play the Words? | data structures hashing implementation math | Statement | D | Codeforces Round 606 (Div. 2, based on Technocup 2020 Elimination Round 4) {1277} | PROGRAMMING | Technocup 2020 — Elimination Round 4 + Codeforces Round 606: Editorial | 1800 | |
| 8575 | Berry Jam | data structures dp greedy implementation | Statement | C | Educational Codeforces Round 78 (Rated for Div. 2) {1278} | PROGRAMMING | Educational Codeforces Round 78 Editorial | 1600 | |
| 4320 | Segment Tree | data structures dsu graphs trees | Statement | D | Educational Codeforces Round 78 (Rated for Div. 2) {1278} | PROGRAMMING | Educational Codeforces Round 78 Editorial | 2100 | |
| 12422 | Stack of Presents | data structures implementation | Statement | C | Educational Codeforces Round 79 (Rated for Div. 2) {1279} | PROGRAMMING | Educational Codeforces Round 79 Editorial | 1400 | |
| 1220 | The Cake Is a Lie | constructive algorithms data structures dfs and similar graphs | Statement | E | Codeforces Round 610 (Div. 2) {1282} | PROGRAMMING | 72461 | 2400 | |
| 14137 | Friends and Gifts | constructive algorithms data structures math | Statement | C | Codeforces Round 611 (Div. 3) {1283} | PROGRAMMING | Codeforces Round #611 (Div. 3) Editorial | 1500 | |
| 11446 | New Year and Ascent Sequence | binary search combinatorics data structures dp implementation sortings | Statement | B | Hello 2020 {1284} | PROGRAMMING | Hello 2020 Editorial | 1500 | |
| 3390 | New Year and Conference | binary search data structures hashing sortings | Statement | D | Hello 2020 {1284} | PROGRAMMING | Hello 2020 Editorial | 2100 | |
| 412 | New Year and Social Network | data structures graph matchings graphs math trees | Statement | F | Hello 2020 {1284} | PROGRAMMING | Hello 2020 Editorial | 3100 | |
| 2000 | 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 | |
| 5454 | 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 | |
| 727 | LCC | data structures math matrices probabilities | Statement | D | Codeforces Round 612 (Div. 1) {1286} | PROGRAMMING | Codeforces Round #612 - Editorial | 2900 | |
| 657 | Fedya the Potter Strikes Back | data structures strings | Statement | E | Codeforces Round 612 (Div. 1) {1286} | PROGRAMMING | Codeforces Round #612 - Editorial | 3200 | |
| 9780 | Hyperset | brute force data structures implementation | Statement | B | Codeforces Round 612 (Div. 2) {1287} | PROGRAMMING | Codeforces Round #612 - Editorial | 1500 | |
| 4006 | Messenger Simulator | data structures two pointers | Statement | E | Educational Codeforces Round 80 (Rated for Div. 2) {1288} | PROGRAMMING | Educational Codeforces Round 80 Editorial | 2100 | |
| 8890 | Mind Control | brute force data structures implementation | Statement | A | Codeforces Round 616 (Div. 1) {1290} | PROGRAMMING | 500.0 | Codeforces Round #616 Editorial | 1700 |
| 7075 | 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 |
| 13846 | NEKO's Maze Game | data structures dsu implementation | Statement | A | Codeforces Round 614 (Div. 1) {1292} | PROGRAMMING | 500.0 | Codeforces Round #614 Editorial | 1400 |
| 12646 | MEX maximizing | data structures greedy implementation math | Statement | D | Codeforces Round 615 (Div. 3) {1294} | PROGRAMMING | Codeforces Round #615 (Div. 3) Editorial | 1600 | |
| 2769 | Permutation Separation | data structures divide and conquer | Statement | E | Educational Codeforces Round 81 (Rated for Div. 2) {1295} | PROGRAMMING | Educational Codeforces Round 81 Editorial | 2200 | |
| 15707 | Yet Another Walking Robot | data structures implementation | Statement | C | Codeforces Round 617 (Div. 3) {1296} | PROGRAMMING | Codeforces Round #617 (Div. 3) Editorial | 1500 | |
| 5438 | String Coloring (hard version) | data structures dp | Statement | E2 | Codeforces Round 617 (Div. 3) {1296} | PROGRAMMING | Codeforces Round #617 (Div. 3) Editorial | 2100 | |
| 127 | Movie Fan | *special data structures greedy implementation sortings | Statement | F | Kotlin Heroes: Episode 3 {1297} | PROGRAMMING | Kotlin Heroes: Episode 3 Editorial | ||
| 4326 | Water Balance | data structures geometry greedy | Statement | C | Codeforces Round 618 (Div. 1) {1299} | PROGRAMMING | 1250.0 | Codeforces Round #618 Editorial | 2100 |
| 1612 | Nanosoft | binary search data structures dp implementation | Statement | E | Codeforces Round 619 (Div. 2) {1301} | PROGRAMMING | 2500.0 | Codeforces Round #619 (Div. 2) Editorial | 2500 |
| 1005 | 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 | |
| 5864 | 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 |
| 1995 | 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 |
| 1807 | 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 |
| 7159 | 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 |
| 5577 | 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 |
| 4810 | Moving Points | data structures divide and conquer implementation sortings | Statement | F | Codeforces Round 624 (Div. 3) {1311} | PROGRAMMING | 74224 | 2100 | |
| 1080 | Autocompletion | data structures dfs and similar dp | Statement | G | Educational Codeforces Round 83 (Rated for Div. 2) {1312} | PROGRAMMING | 74640 | ||
| 11042 | Skyscrapers (easy version) | brute force data structures dp greedy | Statement | C1 | Codeforces Round 622 (Div. 2) {1313} | PROGRAMMING | 1000.0 | Editorial | 1500 |
| 7246 | Skyscrapers (hard version) | data structures dp greedy | Statement | C2 | Codeforces Round 622 (Div. 2) {1313} | PROGRAMMING | 1000.0 | Editorial | 1900 |
| 719 | Concatenation with intersection | data structures hashing strings two pointers | Statement | E | Codeforces Round 622 (Div. 2) {1313} | PROGRAMMING | 2500.0 | Editorial | 2800 |
| 893 | Battalion Strength | data structures divide and conquer probabilities | Statement | F | CodeCraft-20 (Div. 2) {1316} | PROGRAMMING | 2500.0 | Codecraft-20 (Div.2) Editorial | 2800 |
| 1685 | 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 | |
| 21554 | 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 | |
| 3424 | 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 | |
| 4622 | 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 | |
| 30424 | Frog Jumps | binary search data structures greedy implementation | Statement | C | Codeforces Round 627 (Div. 3) {1324} | PROGRAMMING | Codeforces Round #627 (Div. 3) Editorial | ||
| 33919 | 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 | ||
| 2414 | Bombs | data structures two pointers | Statement | E | Codeforces Global Round 7 {1326} | PROGRAMMING | 2500.0 | 74961 | 2400 |
| 2021 | AND Segments | bitmasks combinatorics data structures dp two pointers | Statement | F | Educational Codeforces Round 84 (Rated for Div. 2) {1327} | PROGRAMMING | Educational Codeforces Round 84 Editorial | 2500 |