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 ... 11 12 13 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 14886 | Greed | greedy implementation | Statement | A | Codeforces Round 446 (Div. 2) {892} | PROGRAMMING | Codeforces Round #446 Editorial | 900 | |
| 28055 | Rumor | dfs and similar graphs greedy | Statement | C | Educational Codeforces Round 33 (Rated for Div. 2) {893} | PROGRAMMING | 55989 | 1300 | |
| 3326 | Credit Card | data structures dp greedy implementation | Statement | D | Educational Codeforces Round 33 (Rated for Div. 2) {893} | PROGRAMMING | 55989 | 1800 | |
| 2294 | Ithea Plays With Chtholly | binary search constructive algorithms games greedy interactive | Statement | B | Codeforces Round 449 (Div. 1) {896} | PROGRAMMING | Codeforces Round #449 Editorial | 2000 | |
| 4860 | Squares and not squares | constructive algorithms greedy | Statement | E | Codeforces Round 451 (Div. 2) {898} | PROGRAMMING | Codeforces Round #451 (Div.2) Editorial | 1600 | |
| 4525 | Alarm Clock | greedy | Statement | D | Codeforces Round 451 (Div. 2) {898} | PROGRAMMING | Codeforces Round #451 (Div.2) Editorial | 1700 | |
| 11091 | Splitting in Teams | constructive algorithms greedy math | Statement | A | Codeforces Round 452 (Div. 2) {899} | PROGRAMMING | Codeforces Round #452 (Div.2) Editorial | 900 | |
| 10268 | Visiting a Friend | greedy implementation | Statement | A | Codeforces Round 453 (Div. 2) {902} | PROGRAMMING | Codeforces Round #453 (Div. 1 & Div. 2) Editorial | 1200 | |
| 11923 | Coloring a Tree | dfs and similar dsu greedy | Statement | B | Codeforces Round 453 (Div. 2) {902} | PROGRAMMING | Codeforces Round #453 (Div. 1 & Div. 2) Editorial | 1300 | |
| 22444 | Boxes Packing | greedy | Statement | C | Educational Codeforces Round 34 (Rated for Div. 2) {903} | PROGRAMMING | Educational Codeforces Round 34 Editorial | 1200 | |
| 8117 | The Modcrab | greedy implementation | Statement | B | Educational Codeforces Round 34 (Rated for Div. 2) {903} | PROGRAMMING | Educational Codeforces Round 34 Editorial | 1200 | |
| 15495 | Hungry Student Problem | greedy implementation | Statement | A | Educational Codeforces Round 34 (Rated for Div. 2) {903} | PROGRAMMING | Educational Codeforces Round 34 Editorial | 900 | |
| 1605 | New Year and Rainbow Roads | graphs greedy implementation | Statement | F | Good Bye 2017 {908} | PROGRAMMING | Good Bye 2017 Editorial | 2400 | |
| 10343 | Generate Login | brute force greedy sortings | Statement | A | Codeforces Round 455 (Div. 2) {909} | PROGRAMMING | Codeforces Round #455 (Div. 2) Editorial | 1100 | |
| 2099 | Colorful Points | data structures greedy implementation | Statement | D | Codeforces Round 455 (Div. 2) {909} | PROGRAMMING | Codeforces Round #455 (Div. 2) Editorial | 2100 | |
| 2446 | Coprocessor | dfs and similar dp graphs greedy | Statement | E | Codeforces Round 455 (Div. 2) {909} | PROGRAMMING | Codeforces Round #455 (Div. 2) Editorial | 2100 | |
| 13949 | The Way to Home | dfs and similar dp greedy implementation | Statement | A | Testing Round 14 (Unrated) {910} | PROGRAMMING | 1100 | ||
| 1858 | Door Frames | greedy implementation | Statement | B | Testing Round 14 (Unrated) {910} | PROGRAMMING | 1600 | ||
| 2158 | Minimum Sum | constructive algorithms greedy math | Statement | C | Testing Round 14 (Unrated) {910} | PROGRAMMING | 1700 | ||
| 2847 | Stack Sorting | constructive algorithms data structures greedy implementation | Statement | E | Educational Codeforces Round 35 (Rated for Div. 2) {911} | PROGRAMMING | 2000 | ||
| 2261 | Tree Destruction | constructive algorithms dfs and similar graphs greedy trees | Statement | F | Educational Codeforces Round 35 (Rated for Div. 2) {911} | PROGRAMMING | T | 2500 | |
| 2138 | Fishes | data structures graphs greedy probabilities shortest paths | Statement | D | Codeforces Round 456 (Div. 2) {912} | PROGRAMMING | Codeforces Round #456 (Div. 2) Editorial | 2100 | |
| 539 | Perun, Ult! | brute force greedy sortings | Statement | C | Codeforces Round 456 (Div. 2) {912} | PROGRAMMING | Codeforces Round #456 (Div. 2) Editorial | 2500 | |
| 8454 | Party Lemonade | bitmasks dp greedy | Statement | C | Hello 2018 {913} | PROGRAMMING | Tutorial | 1600 | |
| 5125 | Too Easy Problems | binary search brute force data structures greedy sortings | Statement | D | Hello 2018 {913} | PROGRAMMING | Tutorial | 1800 | |
| 9027 | Conan and Agasa play a Card Game | games greedy implementation | Statement | B | Codecraft-18 and Codeforces Round 458 (Div. 1 + Div. 2, combined) {914} | PROGRAMMING | Tutorial | 1300 | |
| 7545 | Permute Digits | dp greedy | Statement | C | Educational Codeforces Round 36 (Rated for Div. 2) {915} | PROGRAMMING | 57123 | 1700 | |
| 2006 | Jamie and Binary Sequence (changed after round) | bitmasks greedy math | Statement | B | Codeforces Round 457 (Div. 2) {916} | PROGRAMMING | Codeforces Round #457 (Div. 2) Editorial | 1700 | |
| 3670 | The Monster | dp greedy implementation math | Statement | A | Codeforces Round 459 (Div. 1) {917} | PROGRAMMING | Codeforces Round #459 Editorial | 1900 | |
| 16938 | Supermarket | brute force greedy implementation | Statement | A | Codeforces Round 460 (Div. 2) {919} | PROGRAMMING | Codeforces Round #460 (Div. 2) Editorial | 900 | |
| 9955 | Swap Adjacent Elements | dfs and similar greedy math sortings two pointers | Statement | C | Educational Codeforces Round 37 (Rated for Div. 2) {920} | PROGRAMMING | T | 1500 | |
| 808 | Tanks | dp greedy implementation | Statement | D | Educational Codeforces Round 37 (Rated for Div. 2) {920} | PROGRAMMING | 2600 | ||
| 4797 | Robot Vacuum Cleaner | greedy sortings | Statement | D | Codeforces Round 461 (Div. 2) {922} | PROGRAMMING | 57605 | 1800 | |
| 742 | Divisibility | constructive algorithms dp greedy number theory | Statement | F | Codeforces Round 461 (Div. 2) {922} | PROGRAMMING | 57605 | 2500 | |
| 4709 | Perfect Security | data structures greedy strings trees | Statement | C | VK Cup 2018 - Round 1 {923} | PROGRAMMING | VK Cup 2018 Round 1 and CF Round #470 (div. 1 & 2) editorial | 1900 | |
| 5212 | Mystical Mosaic | greedy implementation | Statement | A | VK Cup 2018 - Round 2 {924} | PROGRAMMING | VK Cup 2018 Round 2 and Codeforces Round #472 Editorial | 1400 | |
| 5613 | Three-level Laser | binary search greedy two pointers | Statement | B | VK Cup 2018 - Round 2 {924} | PROGRAMMING | VK Cup 2018 Round 2 and Codeforces Round #472 Editorial | 1600 | |
| 4215 | Riverside Curio | data structures dp greedy | Statement | C | VK Cup 2018 - Round 2 {924} | PROGRAMMING | VK Cup 2018 Round 2 and Codeforces Round #472 Editorial | 1800 | |
| 2557 | Прокат велосипедов | *special greedy implementation | Statement | A | VK Cup 2018 - Квалификация 2 {929} | PROGRAMMING | Разбор VK Cup 2018 — Квалификация 2 | 1600 | |
| 13071 | Friends Meeting | brute force greedy implementation math | Statement | A | Codeforces Round 468 (Div. 2, based on Technocup 2018 Final Round) {931} | PROGRAMMING | Codeforces Round #468 and Technocup 2018 Final Round Analysis | 800 | |
| 431 | Fafa and Array | data structures greedy | Statement | F | Codeforces Round 465 (Div. 2) {935} | PROGRAMMING | editorial | 2800 | |
| 396 | World of Tank | dp greedy | Statement | D | Codeforces Round 467 (Div. 1) {936} | PROGRAMMING | Codeforces Round #467, Editorial | 3000 | |
| 9298 | Run For Your Prize | brute force greedy | Statement | B | Educational Codeforces Round 38 (Rated for Div. 2) {938} | PROGRAMMING | Educational Codeforces Round 38 — Editorial | 1100 | |
| 612 | Erasing Substrings | bitmasks dp greedy | Statement | F | Educational Codeforces Round 38 (Rated for Div. 2) {938} | PROGRAMMING | Educational Codeforces Round 38 — Editorial | 2600 | |
| 8099 | Love Rescue | dfs and similar dsu graphs greedy strings | Statement | D | Codeforces Round 464 (Div. 2) {939} | PROGRAMMING | Analysis of Codeforces Round #464 | 1600 | |
| 3536 | Maximize! | binary search greedy ternary search two pointers | Statement | E | Codeforces Round 464 (Div. 2) {939} | PROGRAMMING | Analysis of Codeforces Round #464 | 1900 | |
| 8807 | Points on the line | brute force greedy sortings | Statement | A | Codeforces Round 466 (Div. 2) {940} | PROGRAMMING | [Editorial] Codeforces Round #466 (Div. 2) | 1300 | |
| 9500 | Our Tanya is Crying Out Loud | dp greedy | Statement | B | Codeforces Round 466 (Div. 2) {940} | PROGRAMMING | [Editorial] Codeforces Round #466 (Div. 2) | 1400 | |
| 4380 | Cashback | data structures dp greedy math | Statement | E | Codeforces Round 466 (Div. 2) {940} | PROGRAMMING | [Editorial] Codeforces Round #466 (Div. 2) | 2000 | |
| 9372 | String Transformation | greedy strings | Statement | C | Educational Codeforces Round 39 (Rated for Div. 2) {946} | PROGRAMMING | 58210 | 1300 | |
| 1241 | Largest Beautiful Number | greedy implementation | Statement | E | Educational Codeforces Round 39 (Rated for Div. 2) {946} | PROGRAMMING | 58210 | 2200 | |
| 18126 | Partition | greedy | Statement | A | Educational Codeforces Round 39 (Rated for Div. 2) {946} | PROGRAMMING | 58210 | 800 | |
| 5651 | Zebras | greedy | Statement | A | Codeforces Round 469 (Div. 1) {949} | PROGRAMMING | 58291 | 1600 | |
| 881 | Curfew | binary search brute force greedy sortings | Statement | D | Codeforces Round 469 (Div. 1) {949} | PROGRAMMING | 58291 | 2400 | |
| 7992 | Intercepted Message | greedy implementation | Statement | B | Codeforces Round 469 (Div. 2) {950} | PROGRAMMING | 58291 | 1100 | |
| 2088 | Water Taps | binary search greedy sortings | Statement | E | Educational Codeforces Round 40 (Rated for Div. 2) {954} | PROGRAMMING | 58519 | 2000 | |
| 2394 | Castle Defense | binary search data structures greedy two pointers | Statement | G | Educational Codeforces Round 40 (Rated for Div. 2) {954} | PROGRAMMING | 58519 | 2100 | |
| 6998 | Feed the cat | greedy math | Statement | A | Codeforces Round 471 (Div. 2) {955} | PROGRAMMING | Editorial | 1100 | |
| 1776 | Guard Duty (easy) | brute force geometry greedy math | Statement | E1 | Helvetic Coding Contest 2018 online mirror (teams allowed, unrated) {958} | PROGRAMMING | helvetic-coding-contest-2018-editorial.pdf | 1800 | |
| 1149 | Guard Duty (medium) | binary search dp greedy sortings | Statement | E2 | Helvetic Coding Contest 2018 online mirror (teams allowed, unrated) {958} | PROGRAMMING | helvetic-coding-contest-2018-editorial.pdf | 2300 | |
| 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 | |
| 10526 | Mahmoud and Ehab and the message | dsu greedy implementation | Statement | B | Codeforces Round 473 (Div. 2) {959} | PROGRAMMING | Codeforces round #473 editorial | 1300 | |
| 3262 | Mahmoud and Ehab and another array construction task | constructive algorithms greedy math number theory | Statement | D | Codeforces Round 473 (Div. 2) {959} | PROGRAMMING | Codeforces round #473 editorial | 2000 | |
| 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 | |
| 4098 | Subsequence Counting | bitmasks constructive algorithms greedy implementation | Statement | C | 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 | 1700 | |
| 8026 | Students in Railway Carriage | constructive algorithms greedy implementation | Statement | B | Educational Codeforces Round 42 (Rated for Div. 2) {962} | PROGRAMMING | Educational Codeforces Round 42 Editorial | 1300 | |
| 1140 | Byteland, Berland and Disputed Cities | constructive algorithms greedy | Statement | E | Educational Codeforces Round 42 (Rated for Div. 2) {962} | PROGRAMMING | Educational Codeforces Round 42 Editorial | 2200 | |
| 2994 | Destruction of a Tree | constructive algorithms dfs and similar dp greedy trees | Statement | B | Tinkoff Internship Warmup Round 2018 and Codeforces Round 475 (Div. 1) {963} | PROGRAMMING | Editorial Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 1 + Div. 2) | 2100 | |
| 3343 | Single-use Stones | binary search flows greedy two pointers | Statement | D | Codeforces Round 476 (Div. 2) [Thanks, Telegram!] {965} | PROGRAMMING | Analysis of Codeforces Round #476 (Div. 2) [Thanks, Telegram!] | 1900 | |
| 2213 | Greedy Arkady | math | Statement | C | Codeforces Round 476 (Div. 2) [Thanks, Telegram!] {965} | PROGRAMMING | Analysis of Codeforces Round #476 (Div. 2) [Thanks, Telegram!] | 1900 | |
| 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 | |
| 10532 | Nested Segments | greedy implementation sortings | Statement | C | Educational Codeforces Round 43 (Rated for Div. 2) {976} | PROGRAMMING | 59195 | 1500 | |
| 2549 | Well played! | greedy sortings | Statement | E | Educational Codeforces Round 43 (Rated for Div. 2) {976} | PROGRAMMING | 59195 | 2100 | |
| 4871 | Petya's Exams | greedy implementation sortings | Statement | G | Codeforces Round 481 (Div. 3) {978} | PROGRAMMING | T | 1800 | |
| 40812 | File Name | greedy strings | Statement | B | Codeforces Round 481 (Div. 3) {978} | PROGRAMMING | T | 700 | |
| 4775 | Treasure Hunt | greedy | Statement | B | Codeforces Round 482 (Div. 2) {979} | PROGRAMMING | Codeforces Round #482 (Div. 2) Editorial | 1800 | |
| 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 |
| 3940 | Posterized | games greedy | Statement | C | Codeforces Round 480 (Div. 2) {980} | PROGRAMMING | Tutorial | 1700 | |
| 2113 | The Number Games | data structures greedy trees | Statement | E | Codeforces Round 480 (Div. 2) {980} | PROGRAMMING | Tutorial | 2300 | |
| 3544 | Bookshelves | bitmasks dp greedy | Statement | D | Avito Code Challenge 2018 {981} | PROGRAMMING | Avito Code Challenge 2018 — разбор | 1800 | |
| 900 | Round Marriage | binary search graph matchings greedy | Statement | F | Avito Code Challenge 2018 {981} | PROGRAMMING | Avito Code Challenge 2018 — разбор | 2500 | |
| 8936 | Bus of Characters | data structures greedy implementation | Statement | B | Codeforces Round 484 (Div. 2) {982} | PROGRAMMING | Editorial | 1300 | |
| 15741 | Cut 'em all! | dfs and similar dp graphs greedy trees | Statement | C | Codeforces Round 484 (Div. 2) {982} | PROGRAMMING | Editorial | 1500 | |
| 5972 | Liebig's Barrels | greedy | Statement | C | Educational Codeforces Round 44 (Rated for Div. 2) {985} | PROGRAMMING | Educational Codeforces Round 44 Editorial | 1500 | |
| 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 | |
| 8291 | Fair | graphs greedy number theory shortest paths | Statement | A | Codeforces Round 485 (Div. 1) {986} | PROGRAMMING | Codeforces Round #485 Editorial | 1600 | |
| 4417 | Divisibility by 25 | brute force greedy | Statement | E | Codeforces Round 486 (Div. 3) {988} | PROGRAMMING | 59810 | 2100 | |
| 8602 | Micro-World | greedy sortings | Statement | B | Educational Codeforces Round 45 (Rated for Div. 2) {990} | PROGRAMMING | Educational Codeforces Round 45 Editorial | 1200 | |
| 2162 | Post Lamps | brute force greedy | Statement | E | Educational Codeforces Round 45 (Rated for Div. 2) {990} | PROGRAMMING | Educational Codeforces Round 45 Editorial | 2000 | |
| 1055 | Flow Control | dfs and similar dp greedy trees | Statement | F | Educational Codeforces Round 45 (Rated for Div. 2) {990} | PROGRAMMING | Educational Codeforces Round 45 Editorial | 2500 | |
| 13718 | Getting an A | greedy sortings | Statement | B | Codeforces Round 491 (Div. 2) {991} | PROGRAMMING | 60181 | 1100 | |
| 7720 | Bishwock | dp greedy | Statement | D | Codeforces Round 491 (Div. 2) {991} | PROGRAMMING | 60181 | 1500 | |
| 340 | Concise and clear | brute force greedy implementation math | Statement | F | Codeforces Round 491 (Div. 2) {991} | PROGRAMMING | 60181 | 2800 | |
| 832 | Compute Power | binary search dp greedy | Statement | D | Codeforces Round 488 by NEAR (Div. 1) {993} | PROGRAMMING | Codeforces Round #488 editorial | 2400 | |
| 6042 | Knights of a Polygonal Table | greedy implementation sortings | Statement | B | Codeforces Round 488 by NEAR (Div. 2) {994} | PROGRAMMING | Codeforces Round #488 editorial | 1400 | |
| 7436 | Suit and Tie | greedy implementation math | Statement | B | Codeforces Round 492 (Div. 1) [Thanks, uDebug!] {995} | PROGRAMMING | Editorial for Codeforces Round #492 [Thanks u-Debug!] | 1500 | |
| 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 | |
| 117668 | Hit the Lottery | dp greedy | Statement | A | Codeforces Round 492 (Div. 2) [Thanks, uDebug!] {996} | PROGRAMMING | Editorial for Codeforces Round #492 [Thanks u-Debug!] | 600 | |
| 8653 | Convert to Ones | brute force greedy implementation math | Statement | A | Codeforces Round 493 (Div. 1) {997} | PROGRAMMING | 60357 | 1500 | |
| 3135 | Roman Digits | brute force combinatorics dp greedy math | Statement | B | Codeforces Round 493 (Div. 1) {997} | PROGRAMMING | 60357 | 2000 | |
| 14382 | Cutting | dp greedy sortings | Statement | B | Codeforces Round 493 (Div. 2) {998} | PROGRAMMING | Codeforces Round #493 — Editorial | 1200 | |
| 4879 | Equalize the Remainders | data structures greedy implementation | Statement | D | Codeforces Round 490 (Div. 3) {999} | PROGRAMMING | 60138 | 1900 | |
| 7804 | Reachability from the Capital | dfs and similar graphs greedy | Statement | E | Codeforces Round 490 (Div. 3) {999} | PROGRAMMING | 60138 | 1900 | |
| 9360 | Codehorses T-shirts | greedy implementation | Statement | A | Educational Codeforces Round 46 (Rated for Div. 2) {1000} | PROGRAMMING | 60288 | 1200 | |
| 6156 | Light It Up | greedy | Statement | B | Educational Codeforces Round 46 (Rated for Div. 2) {1000} | PROGRAMMING | 60288 | 1600 | |
| 8535 | Coins and Queries | greedy | Statement | D | Codeforces Round 494 (Div. 3) {1003} | PROGRAMMING | 60417 | 1600 | |
| 9929 | Sonya and Exhibition | constructive algorithms greedy implementation math | Statement | B | Codeforces Round 495 (Div. 2) {1004} | PROGRAMMING | 60443 | 1400 | |
| 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 | |
| 12999 | Summarize to the Power of Two | brute force greedy implementation | Statement | C | Codeforces Round 496 (Div. 3) {1005} | PROGRAMMING | Codeforces Round 496 (Div. 3): Problem Tutorials | 1400 | |
| 11259 | Polycarp and Div 3 | dp greedy number theory | Statement | D | Codeforces Round 496 (Div. 3) {1005} | PROGRAMMING | Codeforces Round 496 (Div. 3): Problem Tutorials | 1500 | |
| 14618 | Polycarp's Practice | greedy implementation sortings | Statement | B | Codeforces Round 498 (Div. 3) {1006} | PROGRAMMING | 60672 | 1200 | |
| 12547 | Turn the Rectangles | greedy sortings | Statement | B | Codeforces Round 497 (Div. 2) {1008} | PROGRAMMING | Editorial for Codeforces Round #497 by Skyglow | 1100 | |
| 10694 | Minimum Ternary String | greedy implementation | Statement | B | Educational Codeforces Round 47 (Rated for Div. 2) {1009} | PROGRAMMING | 60630 | 1500 | |
| 6625 | Relatively Prime Graph | brute force constructive algorithms graphs greedy math | Statement | D | Educational Codeforces Round 47 (Rated for Div. 2) {1009} | PROGRAMMING | 60630 | 1700 | |
| 5537 | Annoying Present | greedy math | Statement | C | Educational Codeforces Round 47 (Rated for Div. 2) {1009} | PROGRAMMING | 60630 | 1700 | |
| 1049 | Allowed Letters | bitmasks flows graph matchings graphs greedy | Statement | G | Educational Codeforces Round 47 (Rated for Div. 2) {1009} | PROGRAMMING | 60630 | 2500 | |
| 13238 | Stages | greedy implementation sortings | Statement | A | Codeforces Round 499 (Div. 2) {1011} | PROGRAMMING | 60851 | 1000 | |
| 8286 | And | greedy | Statement | B | Codeforces Round 500 (Div. 2) [based on EJOI] {1013} | PROGRAMMING | Codeforces Round #500 (based on EJOI 2018) — Editorial | 1200 | |
| 8929 | Walking Between Houses | constructive algorithms greedy | Statement | D | Codeforces Round 501 (Div. 3) {1015} | PROGRAMMING | 60949 | 1600 | |
| 6780 | Stars Drawing (Easy Edition) | brute force dp greedy | Statement | E1 | Codeforces Round 501 (Div. 3) {1015} | PROGRAMMING | 60949 | 1700 | |
| 4029 | Stars Drawing (Hard Edition) | binary search dp greedy | Statement | E2 | Codeforces Round 501 (Div. 3) {1015} | PROGRAMMING | 60949 | 2000 | |
| 15671 | Death Note | greedy implementation math | Statement | A | Educational Codeforces Round 48 (Rated for Div. 2) {1016} | PROGRAMMING | Разбор Educational Codeforces Round 48 | 900 | |
| 6452 | The Phone Number | constructive algorithms greedy | Statement | C | Codeforces Round 502 (in memory of Leopoldo Taravilse, Div. 1 + Div. 2) {1017} | PROGRAMMING | Разбор (англ.) | 1600 | |
| 4845 | Elections | brute force greedy | Statement | A | Codeforces Round 503 (by SIS, Div. 1) {1019} | PROGRAMMING | 61161 | 1800 | |
| 10735 | Bracket Subsequence | greedy | Statement | C | Codeforces Round 504 (rated, Div. 1 + Div. 2, based on VK Cup 2018 Final) {1023} | PROGRAMMING | Codeforces Round 504 Editorial | 1200 | |
| 8497 | Weakened Common Divisor | brute force greedy number theory | Statement | B | Codeforces Round 505 (rated, Div. 1 + Div. 2, based on VK Cup 2018 Final) {1025} | PROGRAMMING | Codeforces Round #505 Editorial | 1600 | |
| 7144 | Minimum Value Rectangle | greedy | Statement | C | Educational Codeforces Round 49 (Rated for Div. 2) {1027} | PROGRAMMING | Educational Codeforces Round 49 Editorial | 1600 | |
| 1821 | Order book | combinatorics data structures greedy | Statement | D | AIM Tech Round 5 (rated, Div. 1 + Div. 2) {1028} | PROGRAMMING | 61493 | 2100 | |
| 18407 | Creating the Contest | dp greedy math | Statement | B | Codeforces Round 506 (Div. 3) {1029} | PROGRAMMING | Codeforces Round #506 (Div. 3) Editorial | 1200 | |
| 8238 | Maximal Intersection | greedy math sortings | Statement | C | Codeforces Round 506 (Div. 3) {1029} | PROGRAMMING | Codeforces Round #506 (Div. 3) Editorial | 1600 | |
| 3397 | Tree with Small Distances | dp graphs greedy | Statement | E | Codeforces Round 506 (Div. 3) {1029} | PROGRAMMING | Codeforces Round #506 (Div. 3) Editorial | 2200 | |
| 5604 | Cram Time | greedy | Statement | C | Technocup 2019 - Elimination Round 2 {1031} | PROGRAMMING | Codeforces Round #517 and Technocup 2019 Elimination Round 2 Editorial | 1700 | |
| 2980 | Minimum path | greedy | Statement | D | Technocup 2019 - Elimination Round 2 {1031} | PROGRAMMING | Codeforces Round #517 and Technocup 2019 Elimination Round 2 Editorial | 2000 | |
| 10604 | Vasya and Arrays | greedy two pointers | Statement | D | Educational Codeforces Round 50 (Rated for Div. 2) {1036} | PROGRAMMING | 61727 | 1600 | |
| 11815 | Packets | constructive algorithms greedy math | Statement | A | Manthan, Codefest 18 (rated, Div. 1 + Div. 2) {1037} | PROGRAMMING | Tutorial | 1300 | |
| 20086 | Equalize | dp greedy strings | Statement | C | Manthan, Codefest 18 (rated, Div. 1 + Div. 2) {1037} | PROGRAMMING | Tutorial | 1300 | |
| 10870 | Reach Median | greedy | Statement | B | Manthan, Codefest 18 (rated, Div. 1 + Div. 2) {1037} | PROGRAMMING | Tutorial | 1300 | |
| 9800 | Gambling | greedy sortings | Statement | C | Codeforces Round 508 (Div. 2) {1038} | PROGRAMMING | Tutorial | 1300 | |
| 8852 | Slime | dp greedy implementation | Statement | D | Codeforces Round 508 (Div. 2) {1038} | PROGRAMMING | Tutorial | 1700 | |
| 851 | Timetable | constructive algorithms data structures greedy math | Statement | A | Codeforces Round 507 (Div. 1, based on Olympiad of Metropolises) {1039} | PROGRAMMING | 61668 | 2400 | |
| 10187 | Palindrome Dance | greedy | Statement | A | Codeforces Round 507 (Div. 2, based on Olympiad of Metropolises) {1040} | PROGRAMMING | Codeforces Round #507 (based on Olympiad of Metropolises) — Editorial | 1000 | |
| 7473 | Shashlik Cooking | dp greedy math | Statement | B | Codeforces Round 507 (Div. 2, based on Olympiad of Metropolises) {1040} | PROGRAMMING | Codeforces Round #507 (based on Olympiad of Metropolises) — Editorial | 1300 | |
| 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 | |
| 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 | |
| 26820 | Heist | greedy implementation sortings | Statement | A | Codeforces Round 509 (Div. 2) {1041} | PROGRAMMING | Codeforces Round #509 (Div. 2) Editorial | 800 | |
| 4966 | Array Product | constructive algorithms greedy math | Statement | C | Codeforces Round 510 (Div. 2) {1042} | PROGRAMMING | Tutorial | 1700 | |
| 1466 | Leaf Sets | data structures dfs and similar dsu graphs greedy sortings trees | Statement | F | Codeforces Round 510 (Div. 2) {1042} | PROGRAMMING | Tutorial | 2400 | |
| 7216 | Smallest Word | constructive algorithms greedy implementation | Statement | C | Codeforces Round 519 by Botan Investments {1043} | PROGRAMMING | Codeforces Round #519 Editorial | 1500 | |
| 3458 | Train Hard, Win Easy | constructive algorithms greedy math sortings | Statement | E | Codeforces Round 519 by Botan Investments {1043} | PROGRAMMING | Codeforces Round #519 Editorial | 1900 | |
| 3352 | Space Formula | greedy | Statement | C | Bubble Cup 11 - Finals [Online Mirror, Div. 2] {1046} | PROGRAMMING | E | 1500 | |
| 18779 | Relatively Prime Pairs | greedy math number theory | Statement | B | Educational Codeforces Round 51 (Rated for Div. 2) {1051} | PROGRAMMING | Educational Codeforces Round 51 Editorial | 1000 | |
| 8871 | Vasya And Password | greedy implementation strings | Statement | A | Educational Codeforces Round 51 (Rated for Div. 2) {1051} | PROGRAMMING | Educational Codeforces Round 51 Editorial | 1200 | |
| 9868 | Vasya and Multisets | brute force dp greedy implementation math | Statement | C | Educational Codeforces Round 51 (Rated for Div. 2) {1051} | PROGRAMMING | Educational Codeforces Round 51 Editorial | 1400 | |
| 480 | Distinctification | data structures dsu greedy | Statement | G | Educational Codeforces Round 51 (Rated for Div. 2) {1051} | PROGRAMMING | Educational Codeforces Round 51 Editorial | 2700 | |
| 2414 | Changing Array | greedy implementation | Statement | D | Mail.Ru Cup 2018 Round 1 {1054} | PROGRAMMING | Editorial | 1900 | |
| 449 | New Road Network | constructive algorithms greedy math | Statement | G | Mail.Ru Cup 2018 Round 1 {1054} | PROGRAMMING | Editorial | 2900 | |
| 648 | Refactoring | greedy implementation strings | Statement | D | Mail.Ru Cup 2018 Round 2 {1055} | PROGRAMMING | Mail.Ru Cup 2018 Round 2 — analysis | 2300 | |
| 6713 | 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 | |
| 2571 | Pick Heroes | greedy implementation interactive sortings | Statement | C | Mail.Ru Cup 2018 Round 3 {1056} | PROGRAMMING | Mail.Ru Cup 2018 Round 3 Editorial | 1700 | |
| 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 | |
| 9489 | Maximum Sum of Digits | greedy | Statement | B | 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) | 1100 | |
| 3874 | Social Circles | greedy math | Statement | D | 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) | 1900 | |
| 7633 | Views Matter | greedy implementation sortings | Statement | B | Codeforces Round 523 (Div. 2) {1061} | PROGRAMMING | Tutorial (en) | 1500 | |
| 2558 | TV Shows | data structures greedy implementation sortings | Statement | D | Codeforces Round 523 (Div. 2) {1061} | PROGRAMMING | Tutorial (en) | 2000 | |
| 23998 | Coins | greedy implementation math | Statement | A | Codeforces Round 523 (Div. 2) {1061} | PROGRAMMING | Tutorial (en) | 800 | |
| 9303 | A Prank | greedy implementation | Statement | A | Codeforces Round 520 (Div. 2) {1062} | PROGRAMMING | Tutorial | 1400 | |
| 5946 | Banh-mi | greedy implementation math | Statement | C | Codeforces Round 520 (Div. 2) {1062} | PROGRAMMING | Tutorial | 1600 | |
| 9823 | Math | greedy math number theory | Statement | B | Codeforces Round 520 (Div. 2) {1062} | PROGRAMMING | Tutorial | 1600 | |
| 2049 | Company | binary search data structures dfs and similar greedy trees | Statement | E | Codeforces Round 520 (Div. 2) {1062} | PROGRAMMING | Tutorial | 2300 | |
| 472 | Candies for Children | brute force math | Statement | D | Codeforces Round 516 (Div. 1, by Moscow Team Olympiad) {1063} | PROGRAMMING | Editorial | 2800 | |
| 8280 | Make It Equal | greedy | Statement | C | Educational Codeforces Round 52 (Rated for Div. 2) {1065} | PROGRAMMING | Educational Codeforces Round 52 Editorial | 1500 | |
| 9368 | Heaters | greedy two pointers | Statement | B | Codeforces Round 515 (Div. 3) {1066} | PROGRAMMING | 62419 | 1500 | |
| 490 | Computer Game | dp greedy math probabilities | Statement | D | Codeforces Round 518 (Div. 1) [Thanks, Mail.Ru!] {1067} | PROGRAMMING | Tutorial | 2800 | |
| 5233 | Garbage Disposal | greedy | Statement | D | 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 | 1400 | |
| 3850 | Debate | greedy | Statement | F | 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 | 1600 | |
| 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 | |
| 930 | Monsters and Potions | brute force dp greedy implementation | Statement | G | 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 | |
| 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 | |
| 592 | Choosing Two Paths | dfs and similar dp greedy trees | Statement | F | Educational Codeforces Round 53 (Rated for Div. 2) {1073} | PROGRAMMING | 62742 | 2800 | |
| 14082 | Minimizing the String | greedy strings | Statement | A | Educational Codeforces Round 54 (Rated for Div. 2) {1076} | PROGRAMMING | E | 1200 | |
| 5875 | Edge Deletion | graphs greedy shortest paths | Statement | D | Educational Codeforces Round 54 (Rated for Div. 2) {1076} | PROGRAMMING | E | 1800 | |
| 726 | Summer Practice Report | dp greedy | Statement | F | Educational Codeforces Round 54 (Rated for Div. 2) {1076} | PROGRAMMING | E | 2500 | |
| 20369 | Disturbed People | greedy | Statement | B | Codeforces Round 521 (Div. 3) {1077} | PROGRAMMING | Codeforces Round #521 (Div. 3) Editorial | 1000 | |
| 5077 | Thematic Contests | greedy sortings | Statement | E | Codeforces Round 521 (Div. 3) {1077} | PROGRAMMING | Codeforces Round #521 (Div. 3) Editorial | 1800 | |
| 2814 | Missing Numbers | binary search constructive algorithms greedy math number theory | Statement | E | Avito Cool Challenge 2018 {1081} | PROGRAMMING | 63888 | 1900 | |
| 8025 | Vova and Trophies | greedy | Statement | B | Educational Codeforces Round 55 (Rated for Div. 2) {1082} | PROGRAMMING | 63544 | 1600 | |
| 6130 | Multi-Subject Competition | greedy sortings | Statement | C | Educational Codeforces Round 55 (Rated for Div. 2) {1082} | PROGRAMMING | 63544 | 1600 | |
| 6293 | Increasing Frequency | binary search dp greedy | Statement | E | Educational Codeforces Round 55 (Rated for Div. 2) {1082} | PROGRAMMING | 63544 | 2000 | |
| 2140 | The Fair Nut and Strings | greedy strings | Statement | B | Codeforces Round 526 (Div. 1) {1083} | PROGRAMMING | 63753 | 2100 | |
| 8253 | Kvass and the Fair Nut | greedy implementation | Statement | B | Codeforces Round 526 (Div. 2) {1084} | PROGRAMMING | 63753 | 1200 | |
| 1122 | Vasya and Templates | greedy implementation strings | Statement | E | Technocup 2019 - Elimination Round 4 {1085} | PROGRAMMING | Technocup 2019 — Elimination Round 4 + Codeforces Round 528: editorial | 2500 | |
| 8512 | Ehab and a 2-operation task | constructive algorithms greedy math | Statement | C | Codeforces Round 525 (Div. 2) {1088} | PROGRAMMING | Codeforces round #525 editorial | 1400 | |
| 1614 | Ehab and a component choosing problem | dp greedy math trees | Statement | E | Codeforces Round 525 (Div. 2) {1088} | PROGRAMMING | Codeforces round #525 editorial | 2400 | |
| 147 | JS Minification | greedy implementation | Statement | J | 2018-2019 ICPC, NEERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1089} | PROGRAMMING | T | 3300 | |
| 4935 | Company Merging | greedy | Statement | A | 2018-2019 Russia Open High School Programming Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1090} | PROGRAMMING | ru-olymp-team-russia-2018-presentation.pdf | 1300 | |
| 1419 | Berland University | greedy math | Statement | L | 2018-2019 Russia Open High School Programming Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1090} | PROGRAMMING | 2100 | ||
| 11005 | New Year and the Treasure Geolocation | brute force constructive algorithms greedy implementation | Statement | B | Good Bye 2018 {1091} | PROGRAMMING | Editorial | 1200 | |
| 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 | |
| 890 | New Year and the Mallard Expedition | constructive algorithms greedy | Statement | F | Good Bye 2018 {1091} | PROGRAMMING | Editorial | 2600 | |
| 5641 | Great Vova Wall (Version 1) | greedy implementation math | Statement | D1 | Codeforces Round 527 (Div. 3) {1092} | PROGRAMMING | Codeforces Round #527 (Div. 3) Editorial | 2100 | |
| 1978 | 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 | |
| 9707 | Mishka and the Last Exam | greedy | Statement | C | Educational Codeforces Round 56 (Rated for Div. 2) {1093} | PROGRAMMING | 63877 | 1200 | |
| 17672 | Letters Rearranging | constructive algorithms greedy sortings strings | Statement | B | Educational Codeforces Round 56 (Rated for Div. 2) {1093} | PROGRAMMING | 63877 | 900 | |
| 19536 | Powers Of Two | bitmasks greedy | Statement | C | Codeforces Round 529 (Div. 3) {1095} | PROGRAMMING | Codeforces Round #529 (Div. 3) Editorial | 1400 | |
| 7435 | Make It Connected | dsu graphs greedy | Statement | F | Codeforces Round 529 (Div. 3) {1095} | PROGRAMMING | Codeforces Round #529 (Div. 3) Editorial | 2000 | |
| 19600 | Find Divisible | greedy implementation math | Statement | A | Educational Codeforces Round 57 (Rated for Div. 2) {1096} | PROGRAMMING | Разбор Educational Codeforces Round 57 | 800 | |
| 8746 | Yuhao and a Parenthesis | greedy implementation | Statement | C | Hello 2019 {1097} | PROGRAMMING | 64310 | 1400 | |
| 533 | Egor and an RPG game | constructive algorithms greedy | Statement | E | Hello 2019 {1097} | PROGRAMMING | 64310 | 3100 | |
| 9534 | Sum in the tree | constructive algorithms dfs and similar greedy trees | Statement | A | Codeforces Round 530 (Div. 1) {1098} | PROGRAMMING | 64331 | 1600 | |
| 1161 | Construct a tree | binary search constructive algorithms dfs and similar graphs greedy trees | Statement | C | Codeforces Round 530 (Div. 1) {1098} | PROGRAMMING | 64331 | 2300 | |
| 1796 | Nice table | brute force constructive algorithms greedy math | Statement | B | Codeforces Round 530 (Div. 1) {1098} | PROGRAMMING | 64331 | 2300 | |
| 3657 | Ivan and Burgers | data structures divide and conquer greedy math | Statement | F | Codeforces Round 532 (Div. 2) {1100} | PROGRAMMING | Unofficial Tutorial | 2600 | |
| 11108 | Accordion | greedy implementation | Statement | B | Educational Codeforces Round 58 (Rated for Div. 2) {1101} | PROGRAMMING | 64483 | 1300 | |
| 11055 | Array K-Coloring | greedy sortings | Statement | B | Codeforces Round 531 (Div. 3) {1102} | PROGRAMMING | 64439 | 1400 | |
| 8552 | Balanced Ternary String | greedy strings | Statement | D | Codeforces Round 531 (Div. 3) {1102} | PROGRAMMING | 64439 | 1600 | |
| 15738 | Lunar New Year and Number Division | greedy implementation math sortings | Statement | C | Codeforces Round 536 (Div. 2) {1106} | PROGRAMMING | Tutorial | 1000 | |
| 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 | |
| 2813 | Lunar New Year and Red Envelopes | data structures dp | Statement | E | Codeforces Round 536 (Div. 2) {1106} | PROGRAMMING | Tutorial | 2100 | |
| 12759 | Digits Sequence Dividing | greedy strings | Statement | A | Educational Codeforces Round 59 (Rated for Div. 2) {1107} | PROGRAMMING | Educational Codeforces Round 59 Editorial | 1000 | |
| 11005 | Brutality | greedy sortings two pointers | Statement | C | Educational Codeforces Round 59 (Rated for Div. 2) {1107} | PROGRAMMING | Educational Codeforces Round 59 Editorial | 1300 | |
| 25136 | Divisors of Two Integers | brute force greedy math number theory | Statement | B | Codeforces Round 535 (Div. 3) {1108} | PROGRAMMING | 64751 | 1100 | |
| 12640 | Nice Garland | brute force greedy math | Statement | C | Codeforces Round 535 (Div. 3) {1108} | PROGRAMMING | 64751 | 1300 | |
| 16443 | Diverse Garland | constructive algorithms dp greedy | Statement | D | Codeforces Round 535 (Div. 3) {1108} | PROGRAMMING | 64751 | 1400 | |
| 4880 | Array and Segments (Easy version) | brute force greedy implementation | Statement | E1 | Codeforces Round 535 (Div. 3) {1108} | PROGRAMMING | 64751 | 1800 | |
| 3541 | MST Unification | binary search dsu graphs greedy | Statement | F | Codeforces Round 535 (Div. 3) {1108} | PROGRAMMING | 64751 | 2300 | |
| 16462 | Tape | greedy sortings | Statement | B | Codeforces Global Round 1 {1110} | PROGRAMMING | The Editorial of the First Codeforces Global Round | 1400 | |
| 8148 | Sasha and Magnetic Machines | greedy number theory | Statement | B | Codeforces Round 539 (Div. 2) {1113} | PROGRAMMING | Codeforces Round #539 Editorial | 1300 | |
| 18297 | Sasha and His Trip | dp greedy math | Statement | A | Codeforces Round 539 (Div. 2) {1113} | PROGRAMMING | Codeforces Round #539 Editorial | 900 | |
| 9389 | 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 | |
| 19740 | Got Any Grapes? | brute force greedy implementation | Statement | A | Codeforces Round 538 (Div. 2) {1114} | PROGRAMMING | Codeforces Round #538 (Div. 2) Editorial | 800 | |
| 15715 | Emotes | greedy math sortings | Statement | B | Educational Codeforces Round 60 (Rated for Div. 2) {1117} | PROGRAMMING | 65365 | 1000 | |
| 6062 | Coffee and Coursework (Easy version) | brute force greedy | Statement | D1 | Codeforces Round 540 (Div. 3) {1118} | PROGRAMMING | 65396 | 1800 | |
| 6774 | Coffee and Coursework (Hard Version) | binary search greedy | Statement | D2 | Codeforces Round 540 (Div. 3) {1118} | PROGRAMMING | 65396 | 1900 | |
| 11489 | Ilya and a Colorful Walk | greedy implementation | Statement | A | Codeforces Global Round 2 {1119} | PROGRAMMING | Codeforces Global Round 2 Editorial | 1100 | |
| 16252 | Alyona and a Narrow Fridge | binary search flows greedy sortings | Statement | B | Codeforces Global Round 2 {1119} | PROGRAMMING | Codeforces Global Round 2 Editorial | 1300 | |
| 7174 | Ramesses and Corner Inversion | constructive algorithms greedy implementation math | Statement | C | Codeforces Global Round 2 {1119} | PROGRAMMING | Codeforces Global Round 2 Editorial | 1500 | |
| 5549 | Pavel and Triangles | brute force dp fft greedy ternary search | Statement | E | Codeforces Global Round 2 {1119} | PROGRAMMING | Codeforces Global Round 2 Editorial | 1900 | |
| 1735 | Diana and Liana | greedy implementation two pointers | Statement | A | Codeforces Round 543 (Div. 1, based on Technocup 2019 Final Round) {1120} | PROGRAMMING | Разбор задач финала Технокубка 2019 и Codeforces Round #543 | 2200 | |
| 1767 | Power Tree | dfs and similar dp dsu graphs greedy trees | Statement | D | Codeforces Round 543 (Div. 1, based on Technocup 2019 Final Round) {1120} | PROGRAMMING | Разбор задач финала Технокубка 2019 и Codeforces Round #543 | 2400 | |
| 480 | 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 | |
| 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 | |
| 3942 | Toy Train (Simplified) | brute force greedy | Statement | A1 | Codeforces Round 542 [Alex Lopashev Thanks-Round] (Div. 1) {1129} | PROGRAMMING | 65520 | 1700 | |
| 4240 | Toy Train | brute force greedy | Statement | A2 | Codeforces Round 542 [Alex Lopashev Thanks-Round] (Div. 1) {1129} | PROGRAMMING | 65520 | 1800 | |
| 2327 | Wrong Answer | constructive algorithms | Statement | B | Codeforces Round 542 [Alex Lopashev Thanks-Round] (Div. 1) {1129} | PROGRAMMING | 65520 | 2200 | |
| 8334 | Two Cakes | greedy | Statement | B | Codeforces Round 542 [Alex Lopashev Thanks-Round] (Div. 2) {1130} | PROGRAMMING | 65520 | 1200 | |
| 15631 | Birthday | binary search greedy sortings | Statement | C | Codeforces Round 541 (Div. 2) {1131} | PROGRAMMING | Codeforces Round #541 Editorial | 1200 | |
| 10383 | Draw! | greedy implementation | Statement | B | Codeforces Round 541 (Div. 2) {1131} | PROGRAMMING | Codeforces Round #541 Editorial | 1300 | |
| 3617 | Gourmet choice | dfs and similar dp dsu graphs greedy | Statement | D | Codeforces Round 541 (Div. 2) {1131} | PROGRAMMING | Codeforces Round #541 Editorial | 2000 | |
| 1256 | String Multiplication | dp greedy strings | Statement | E | Codeforces Round 541 (Div. 2) {1131} | PROGRAMMING | Codeforces Round #541 Editorial | 2200 |