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 ... 13 14 15 16 17 ... 43 44 45 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 5888 | Karen and Game | brute force greedy implementation | Statement | A | Codeforces Round 419 (Div. 1) {815} | PROGRAMMING | Codeforces Round #419 Editorial | 1700 | |
| 1601 | Karen and Test | brute force combinatorics constructive algorithms math | Statement | B | Codeforces Round 419 (Div. 1) {815} | PROGRAMMING | Codeforces Round #419 Editorial | 2200 | |
| 3299 | Karen and Supermarket | brute force dp trees | Statement | C | Codeforces Round 419 (Div. 1) {815} | PROGRAMMING | Codeforces Round #419 Editorial | 2500 | |
| 751 | Karen and Cards | binary search combinatorics data structures geometry | Statement | D | Codeforces Round 419 (Div. 1) {815} | PROGRAMMING | Codeforces Round #419 Editorial | 2700 | |
| 244 | Karen and Neighborhood | binary search constructive algorithms implementation | Statement | E | Codeforces Round 419 (Div. 1) {815} | PROGRAMMING | Codeforces Round #419 Editorial | 2900 | |
| 9699 | Karen and Morning | brute force implementation | Statement | A | Codeforces Round 419 (Div. 2) {816} | PROGRAMMING | Codeforces Round #419 Editorial | 1100 | |
| 27161 | Karen and Coffee | binary search data structures implementation | Statement | B | Codeforces Round 419 (Div. 2) {816} | PROGRAMMING | Codeforces Round #419 Editorial | 1400 | |
| 6815 | Treasure Hunt | implementation math number theory | Statement | A | Educational Codeforces Round 23 {817} | PROGRAMMING | 52638 | 1200 | |
| 6423 | Makes And The Product | combinatorics implementation math sortings | Statement | B | Educational Codeforces Round 23 {817} | PROGRAMMING | 52638 | 1500 | |
| 8456 | Really Big Numbers | binary search brute force dp math | Statement | C | Educational Codeforces Round 23 {817} | PROGRAMMING | 52638 | 1600 | |
| 6238 | Imbalanced Array | data structures divide and conquer dsu sortings | Statement | D | Educational Codeforces Round 23 {817} | PROGRAMMING | 52638 | 2000 | |
| 3708 | Choosing The Commander | bitmasks data structures trees | Statement | E | Educational Codeforces Round 23 {817} | PROGRAMMING | 52638 | 2100 | |
| 3347 | MEX Queries | binary search data structures trees | Statement | F | Educational Codeforces Round 23 {817} | PROGRAMMING | 52638 | 2400 | |
| 7778 | Diplomas and Certificates | implementation math | Statement | A | Educational Codeforces Round 24 {818} | PROGRAMMING | 52991 | 1000 | |
| 3224 | Permutation Game | implementation | Statement | B | Educational Codeforces Round 24 {818} | PROGRAMMING | 52991 | 1600 | |
| 3780 | Multicolored Cars | data structures implementation | Statement | D | Educational Codeforces Round 24 {818} | PROGRAMMING | 52991 | 1700 | |
| 1371 | Sofa Thief | brute force implementation | Statement | C | Educational Codeforces Round 24 {818} | PROGRAMMING | 52991 | 2000 | |
| 2676 | Card Game Again | binary search data structures number theory two pointers | Statement | E | Educational Codeforces Round 24 {818} | PROGRAMMING | 52991 | 2000 | |
| 1927 | Level Generation | binary search math ternary search | Statement | F | Educational Codeforces Round 24 {818} | PROGRAMMING | 52991 | 2200 | |
| 1014 | Four Melodies | flows graphs | Statement | G | Educational Codeforces Round 24 {818} | PROGRAMMING | 52991 | 2700 | |
| 1793 | Mister B and PR Shifts | data structures implementation math | Statement | B | Codeforces Round 421 (Div. 1) {819} | PROGRAMMING | Codeforces Round #421 Editorial | 2100 | |
| 519 | Mister B and Boring Game | games greedy | Statement | A | Codeforces Round 421 (Div. 1) {819} | PROGRAMMING | Codeforces Round #421 Editorial | 2100 | |
| 608 | Mister B and Flight to the Moon | constructive algorithms graphs | Statement | E | Codeforces Round 421 (Div. 1) {819} | PROGRAMMING | Codeforces Round #421 Editorial | 2800 | |
| 309 | Mister B and Astronomers | number theory | Statement | D | Codeforces Round 421 (Div. 1) {819} | PROGRAMMING | Codeforces Round #421 Editorial | 2900 | |
| 232 | Mister B and Beacons on Field | number theory | Statement | C | Codeforces Round 421 (Div. 1) {819} | PROGRAMMING | Codeforces Round #421 Editorial | 3000 | |
| 8563 | Mister B and Book Reading | implementation | Statement | A | Codeforces Round 421 (Div. 2) {820} | PROGRAMMING | Codeforces Round #421 Editorial | 1000 | |
| 5498 | Mister B and Angle in Polygon | constructive algorithms geometry math | Statement | B | Codeforces Round 421 (Div. 2) {820} | PROGRAMMING | Codeforces Round #421 Editorial | 1300 | |
| 527 | Mister B and Boring Game | games greedy | Statement | C | Codeforces Round 421 (Div. 2) {820} | PROGRAMMING | 1500.0 | Codeforces Round #421 Editorial | 2200 |
| 6049 | Okabe and Banana Trees | brute force math | Statement | B | Codeforces Round 420 (Div. 2) {821} | PROGRAMMING | Tutorial | 1300 | |
| 7911 | Okabe and Boxes | data structures greedy trees | Statement | C | Codeforces Round 420 (Div. 2) {821} | PROGRAMMING | Tutorial | 1600 | |
| 1663 | Okabe and El Psy Kongroo | dp matrices | Statement | E | Codeforces Round 420 (Div. 2) {821} | PROGRAMMING | Tutorial | 2200 | |
| 1640 | Okabe and City | dfs and similar graphs shortest paths | Statement | D | Codeforces Round 420 (Div. 2) {821} | PROGRAMMING | Tutorial | 2200 | |
| 8987 | Okabe and Future Gadget Laboratory | implementation | Statement | A | Codeforces Round 420 (Div. 2) {821} | PROGRAMMING | Tutorial | 900 | |
| 10192 | Crossword solving | brute force implementation strings | Statement | B | Codeforces Round 422 (Div. 2) {822} | PROGRAMMING | Codeforces Round #422 (Div. 2) Editorial | 1100 | |
| 4931 | Hacker, pack your bags! | binary search greedy implementation sortings | Statement | C | Codeforces Round 422 (Div. 2) {822} | PROGRAMMING | Codeforces Round #422 (Div. 2) Editorial | 1600 | |
| 3283 | My pretty girl Noora | brute force dp greedy math number theory | Statement | D | Codeforces Round 422 (Div. 2) {822} | PROGRAMMING | Codeforces Round #422 (Div. 2) Editorial | 1800 | |
| 1076 | Liar | binary search dp hashing string suffix structures | Statement | E | Codeforces Round 422 (Div. 2) {822} | PROGRAMMING | Codeforces Round #422 (Div. 2) Editorial | 2500 | |
| 373 | Madness | constructive algorithms dfs and similar trees | Statement | F | Codeforces Round 422 (Div. 2) {822} | PROGRAMMING | Codeforces Round #422 (Div. 2) Editorial | 2700 | |
| 36707 | I'm bored with life | implementation math number theory | Statement | A | Codeforces Round 422 (Div. 2) {822} | PROGRAMMING | Codeforces Round #422 (Div. 2) Editorial | 800 | |
| 8194 | Binary Protocol | implementation | Statement | A | Educational Codeforces Round 25 {825} | PROGRAMMING | Educational Codeforces Round 25 - Editorial | 1200 | |
| 3721 | Suitable Replacement | binary search greedy implementation | Statement | D | Educational Codeforces Round 25 {825} | PROGRAMMING | Educational Codeforces Round 25 - Editorial | 1600 | |
| 4883 | Multi-judge Solving | greedy implementation | Statement | C | Educational Codeforces Round 25 {825} | PROGRAMMING | Educational Codeforces Round 25 - Editorial | 1600 | |
| 4783 | Five-In-a-Row | brute force implementation | Statement | B | Educational Codeforces Round 25 {825} | PROGRAMMING | Educational Codeforces Round 25 - Editorial | 1600 | |
| 1947 | String Compression | dp hashing string suffix structures strings | Statement | F | Educational Codeforces Round 25 {825} | PROGRAMMING | Educational Codeforces Round 25 - Editorial | 2400 | |
| 4300 | Minimal Labels | data structures dfs and similar graphs greedy | Statement | E | Educational Codeforces Round 25 {825} | PROGRAMMING | Educational Codeforces Round 25 - Editorial | 2400 | |
| 1467 | Tree Queries | dfs and similar graphs trees | Statement | G | Educational Codeforces Round 25 {825} | PROGRAMMING | Educational Codeforces Round 25 - Editorial | 2600 | |
| 4326 | String Reconstruction | data structures greedy sortings strings | Statement | A | Codeforces Round 423 (Div. 1, rated, based on VK Cup Finals) {827} | PROGRAMMING | Codeforces Round #423 Analysis | 1700 | |
| 3690 | High Load | constructive algorithms greedy implementation trees | Statement | B | Codeforces Round 423 (Div. 1, rated, based on VK Cup Finals) {827} | PROGRAMMING | Codeforces Round #423 Analysis | 1800 | |
| 1788 | DNA Evolution | data structures strings | Statement | C | Codeforces Round 423 (Div. 1, rated, based on VK Cup Finals) {827} | PROGRAMMING | Codeforces Round #423 Analysis | 2200 | |
| 1215 | Rusty String | fft math strings | Statement | E | Codeforces Round 423 (Div. 1, rated, based on VK Cup Finals) {827} | PROGRAMMING | Codeforces Round #423 Analysis | 2700 | |
| 1370 | Best Edge Weight | data structures dfs and similar graphs trees | Statement | D | Codeforces Round 423 (Div. 1, rated, based on VK Cup Finals) {827} | PROGRAMMING | Codeforces Round #423 Analysis | 2700 | |
| 565 | Dirty Arkady's Kitchen | data structures dp graphs shortest paths | Statement | F | Codeforces Round 423 (Div. 1, rated, based on VK Cup Finals) {827} | PROGRAMMING | Codeforces Round #423 Analysis | 3100 | |
| 8390 | Restaurant Tables | implementation | Statement | A | Codeforces Round 423 (Div. 2, rated, based on VK Cup Finals) {828} | PROGRAMMING | Codeforces Round #423 Analysis | 1200 | |
| 6117 | Black Square | implementation | Statement | B | Codeforces Round 423 (Div. 2, rated, based on VK Cup Finals) {828} | PROGRAMMING | Codeforces Round #423 Analysis | 1300 | |
| 3052 | Cards Sorting | data structures implementation sortings | Statement | B | Codeforces Round 424 (Div. 1, rated, based on VK Cup Finals) {830} | PROGRAMMING | Codeforces Round #424 Editorial | 1800 | |
| 8218 | Office Keys | binary search brute force dp greedy sortings | Statement | A | Codeforces Round 424 (Div. 1, rated, based on VK Cup Finals) {830} | PROGRAMMING | Codeforces Round #424 Editorial | 1900 | |
| 1308 | Bamboo Partition | brute force data structures implementation math number theory sortings two pointers | Statement | C | Codeforces Round 424 (Div. 1, rated, based on VK Cup Finals) {830} | PROGRAMMING | Codeforces Round #424 Editorial | 2500 | |
| 978 | Singer House | combinatorics dp graphs trees | Statement | D | Codeforces Round 424 (Div. 1, rated, based on VK Cup Finals) {830} | PROGRAMMING | Codeforces Round #424 Editorial | 2800 | |
| 338 | Perpetual Motion Machine | constructive algorithms dp graphs implementation math trees | Statement | E | Codeforces Round 424 (Div. 1, rated, based on VK Cup Finals) {830} | PROGRAMMING | Codeforces Round #424 Editorial | 3100 | |
| 11011 | Unimodal Array | implementation | Statement | A | Codeforces Round 424 (Div. 2, rated, based on VK Cup Finals) {831} | PROGRAMMING | Codeforces Round #424 Editorial | 1100 | |
| 5492 | Jury Marks | brute force constructive algorithms | Statement | C | Codeforces Round 424 (Div. 2, rated, based on VK Cup Finals) {831} | PROGRAMMING | Codeforces Round #424 Editorial | 1600 | |
| 15620 | Keyboard Layouts | implementation strings | Statement | B | Codeforces Round 424 (Div. 2, rated, based on VK Cup Finals) {831} | PROGRAMMING | Codeforces Round #424 Editorial | 800 | |
| 4681 | Petya and Exam | implementation strings | Statement | B | Codeforces Round 425 (Div. 2) {832} | PROGRAMMING | Codeforces Round #425 (Div.2) Editorial | 1600 | |
| 4446 | Misha, Grisha and Underground | dfs and similar graphs trees | Statement | D | Codeforces Round 425 (Div. 2) {832} | PROGRAMMING | Codeforces Round #425 (Div.2) Editorial | 1900 | |
| 480 | Strange Radiation | binary search implementation math | Statement | C | Codeforces Round 425 (Div. 2) {832} | PROGRAMMING | Codeforces Round #425 (Div.2) Editorial | 2500 | |
| 374 | Vasya and Shifts | matrices | Statement | E | Codeforces Round 425 (Div. 2) {832} | PROGRAMMING | Codeforces Round #425 (Div.2) Editorial | 2700 | |
| 22137 | Sasha and Sticks | games math | Statement | A | Codeforces Round 425 (Div. 2) {832} | PROGRAMMING | Codeforces Round #425 (Div.2) Editorial | 800 | |
| 6557 | The Meaningless Game | math number theory | Statement | A | Codeforces Round 426 (Div. 1) {833} | PROGRAMMING | Codeforces Round #426 Editorial | 1700 | |
| 6475 | The Bakery | binary search data structures divide and conquer dp two pointers | Statement | B | Codeforces Round 426 (Div. 1) {833} | PROGRAMMING | Codeforces Round #426 Editorial | 2200 | |
| 507 | Ever-Hungry Krakozyabra | brute force combinatorics greedy math | Statement | C | Codeforces Round 426 (Div. 1) {833} | PROGRAMMING | Codeforces Round #426 Editorial | 2600 | |
| 484 | Red-Black Cobweb | data structures divide and conquer implementation trees | Statement | D | Codeforces Round 426 (Div. 1) {833} | PROGRAMMING | Codeforces Round #426 Editorial | 2800 | |
| 275 | Caramel Clouds | data structures dp sortings | Statement | E | Codeforces Round 426 (Div. 1) {833} | PROGRAMMING | Codeforces Round #426 Editorial | 3100 | |
| 9078 | The Useless Toy | implementation | Statement | A | Codeforces Round 426 (Div. 2) {834} | PROGRAMMING | Codeforces Round #426 Editorial | 1000 | |
| 9367 | The Festive Evening | data structures implementation | Statement | B | Codeforces Round 426 (Div. 2) {834} | PROGRAMMING | Codeforces Round #426 Editorial | 1100 | |
| 11417 | The number on the board | greedy | Statement | B | Codeforces Round 427 (Div. 2) {835} | PROGRAMMING | Editorial | 1100 | |
| 9359 | Star sky | dp implementation | Statement | C | Codeforces Round 427 (Div. 2) {835} | PROGRAMMING | 1600 | ||
| 4653 | Palindromic characteristics | brute force dp hashing strings | Statement | D | Codeforces Round 427 (Div. 2) {835} | PROGRAMMING | Editorial | 1900 | |
| 1348 | The penguin's game | binary search constructive algorithms interactive | Statement | E | Codeforces Round 427 (Div. 2) {835} | PROGRAMMING | 2400 | ||
| 1236 | Roads in the Kingdom | dfs and similar dp graphs trees | Statement | F | Codeforces Round 427 (Div. 2) {835} | PROGRAMMING | Editorial | 2400 | |
| 21701 | Key races | math | Statement | A | Codeforces Round 427 (Div. 2) {835} | PROGRAMMING | Editorial | 700 | |
| 10081 | Text Volume | implementation | Statement | A | Educational Codeforces Round 26 {837} | PROGRAMMING | 53662 | 1000 | |
| 4554 | Two Seals | brute force implementation | Statement | C | Educational Codeforces Round 26 {837} | PROGRAMMING | 53662 | 1500 | |
| 4365 | Flag of Berland | brute force implementation | Statement | B | Educational Codeforces Round 26 {837} | PROGRAMMING | 53662 | 1600 | |
| 7479 | Round Subset | dp math | Statement | D | Educational Codeforces Round 26 {837} | PROGRAMMING | 53662 | 2100 | |
| 2062 | Vasya's Function | binary search implementation math | Statement | E | Educational Codeforces Round 26 {837} | PROGRAMMING | 53662 | 2200 | |
| 1079 | Prefix Sums | binary search brute force combinatorics math matrices | Statement | F | Educational Codeforces Round 26 {837} | PROGRAMMING | 53662 | 2500 | |
| 897 | Functions On The Segments | data structures | Statement | G | Educational Codeforces Round 26 {837} | PROGRAMMING | 53662 | 2600 | |
| 1055 | Binary Blocks | brute force | Statement | A | IndiaHacks 2nd Elimination 2017 (unofficial, unrated mirror, ICPC rules) {838} | PROGRAMMING | 53736 | 1400 | |
| 1069 | Diverging Directions | data structures dfs and similar trees | Statement | B | IndiaHacks 2nd Elimination 2017 (unofficial, unrated mirror, ICPC rules) {838} | PROGRAMMING | 53736 | 2100 | |
| 411 | Convex Countour | dp | Statement | E | IndiaHacks 2nd Elimination 2017 (unofficial, unrated mirror, ICPC rules) {838} | PROGRAMMING | 53736 | 2300 | |
| 1138 | Airplane Arrangements | math number theory | Statement | D | IndiaHacks 2nd Elimination 2017 (unofficial, unrated mirror, ICPC rules) {838} | PROGRAMMING | 53736 | 2700 | |
| 404 | Future Failure | dp games | Statement | C | IndiaHacks 2nd Elimination 2017 (unofficial, unrated mirror, ICPC rules) {838} | PROGRAMMING | 53736 | 2800 | |
| 112 | Expected Earnings | Statement | F | IndiaHacks 2nd Elimination 2017 (unofficial, unrated mirror, ICPC rules) {838} | PROGRAMMING | 53736 | 2800 | ||
| 14920 | Arya and Bran | implementation | Statement | A | Codeforces Round 428 (Div. 2) {839} | PROGRAMMING | Codeforces Round #428 editorial | 1000 | |
| 20022 | Journey | dfs and similar dp graphs probabilities trees | Statement | C | Codeforces Round 428 (Div. 2) {839} | PROGRAMMING | Codeforces Round #428 editorial | 1500 | |
| 3437 | Game of the Rows | brute force greedy implementation | Statement | B | Codeforces Round 428 (Div. 2) {839} | PROGRAMMING | Codeforces Round #428 editorial | 1700 | |
| 3549 | Winter is here | combinatorics dp math number theory | Statement | D | Codeforces Round 428 (Div. 2) {839} | PROGRAMMING | Codeforces Round #428 editorial | 2200 | |
| 1010 | Mother of Dragons | brute force graphs math meet-in-the-middle | Statement | E | Codeforces Round 428 (Div. 2) {839} | PROGRAMMING | Codeforces Round #428 editorial | 2600 | |
| 7450 | Leha and Function | combinatorics greedy math number theory sortings | Statement | A | Codeforces Round 429 (Div. 1) {840} | PROGRAMMING | Editorial | 1300 | |
| 2807 | Leha and another game about graph | constructive algorithms data structures dfs and similar dp graphs | Statement | B | Codeforces Round 429 (Div. 1) {840} | PROGRAMMING | Editorial | 2100 | |
| 3946 | Destiny | data structures probabilities | Statement | D | Codeforces Round 429 (Div. 1) {840} | PROGRAMMING | Editorial | 2400 | |
| 2067 | On the Bench | combinatorics dp | Statement | C | Codeforces Round 429 (Div. 1) {840} | PROGRAMMING | Editorial | 2600 | |
| 574 | In a Trap | trees | Statement | E | Codeforces Round 429 (Div. 1) {840} | PROGRAMMING | Editorial | 3200 | |
| 13179 | Godsend | games math | Statement | B | Codeforces Round 429 (Div. 2) {841} | PROGRAMMING | T | 1200 | |
| 14043 | Generous Kefa | brute force implementation | Statement | A | Codeforces Round 429 (Div. 2) {841} | PROGRAMMING | T | 900 | |
| 10939 | Gleb And Pizza | geometry | Statement | B | Codeforces Round 430 (Div. 2) {842} | PROGRAMMING | Tutorial Codeforces Round #430 (Div. 2) | 1100 | |
| 11225 | Kirill And The Game | brute force two pointers | Statement | A | Codeforces Round 430 (Div. 2) {842} | PROGRAMMING | Tutorial Codeforces Round #430 (Div. 2) | 1300 | |
| 3756 | Ilya And The Tree | dfs and similar graphs math number theory trees | Statement | C | Codeforces Round 430 (Div. 2) {842} | PROGRAMMING | Tutorial Codeforces Round #430 (Div. 2) | 2000 | |
| 4463 | Vitya and Strange Lesson | binary search data structures | Statement | D | Codeforces Round 430 (Div. 2) {842} | PROGRAMMING | Tutorial Codeforces Round #430 (Div. 2) | 2100 | |
| 501 | Nikita and game | binary search dfs and similar divide and conquer graphs trees | Statement | E | Codeforces Round 430 (Div. 2) {842} | PROGRAMMING | Tutorial Codeforces Round #430 (Div. 2) | 3000 | |
| 5951 | Sorting by Subsequences | dfs and similar dsu implementation math sortings | Statement | A | AIM Tech Round 4 (Div. 1) {843} | PROGRAMMING | AIM Tech Round 4 -- Editorial | 1400 | |
| 2573 | Interactive LowerBound | brute force interactive probabilities | Statement | B | AIM Tech Round 4 (Div. 1) {843} | PROGRAMMING | AIM Tech Round 4 -- Editorial | 2000 | |
| 1115 | Dynamic Shortest Path | graphs shortest paths | Statement | D | AIM Tech Round 4 (Div. 1) {843} | PROGRAMMING | AIM Tech Round 4 -- Editorial | 2700 | |
| 407 | Upgrading Tree | constructive algorithms dfs and similar graphs math trees | Statement | C | AIM Tech Round 4 (Div. 1) {843} | PROGRAMMING | AIM Tech Round 4 -- Editorial | 2900 | |
| 473 | Maximum Flow | flows graphs | Statement | E | AIM Tech Round 4 (Div. 1) {843} | PROGRAMMING | AIM Tech Round 4 -- Editorial | 2900 | |
| 11914 | Diversity | greedy implementation strings | Statement | A | AIM Tech Round 4 (Div. 2) {844} | PROGRAMMING | AIM Tech Round 4 -- Editorial | 1000 | |
| 9037 | Rectangles | combinatorics math | Statement | B | AIM Tech Round 4 (Div. 2) {844} | PROGRAMMING | AIM Tech Round 4 -- Editorial | 1300 | |
| 8477 | Chess Tourney | implementation sortings | Statement | A | Educational Codeforces Round 27 {845} | PROGRAMMING | 53986 | 1100 | |
| 13675 | Two TVs | data structures greedy sortings | Statement | C | Educational Codeforces Round 27 {845} | PROGRAMMING | 53986 | 1500 | |
| 5536 | Luba And The Ticket | brute force greedy implementation | Statement | B | Educational Codeforces Round 27 {845} | PROGRAMMING | 53986 | 1600 | |
| 2576 | Driving Test | data structures dp greedy | Statement | D | Educational Codeforces Round 27 {845} | PROGRAMMING | 53986 | 1800 | |
| 2141 | Shortest Path Problem? | dfs and similar graphs math | Statement | G | Educational Codeforces Round 27 {845} | PROGRAMMING | 53986 | 2400 | |
| 693 | Fire in the City | binary search data structures | Statement | E | Educational Codeforces Round 27 {845} | PROGRAMMING | 53986 | 2500 | |
| 628 | Guards In The Storehouse | bitmasks dp | Statement | F | Educational Codeforces Round 27 {845} | PROGRAMMING | 53986 | 2600 | |
| 4684 | Curriculum Vitae | brute force implementation | Statement | A | Educational Codeforces Round 28 {846} | PROGRAMMING | 54357 | 1500 | |
| 2838 | Math Show | brute force greedy | Statement | B | Educational Codeforces Round 28 {846} | PROGRAMMING | 54357 | 1800 | |
| 2837 | Monitor | binary search data structures | Statement | D | Educational Codeforces Round 28 {846} | PROGRAMMING | 54357 | 1900 | |
| 2967 | Four Segments | brute force data structures dp | Statement | C | Educational Codeforces Round 28 {846} | PROGRAMMING | 54357 | 1900 | |
| 2643 | Random Query | data structures math probabilities two pointers | Statement | F | Educational Codeforces Round 28 {846} | PROGRAMMING | 54357 | 2000 | |
| 1026 | Chemistry in Berland | dfs and similar greedy trees | Statement | E | Educational Codeforces Round 28 {846} | PROGRAMMING | 54357 | 2400 | |
| 6789 | Weather Tomorrow | implementation | Statement | M | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred) {847} | PROGRAMMING | 1000 | ||
| 7626 | University Classes | implementation | Statement | G | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred) {847} | PROGRAMMING | 1000 | ||
| 3865 | Union of Doubly Linked Lists | implementation | Statement | A | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred) {847} | PROGRAMMING | 1500 | ||
| 6267 | Preparing for Merge Sort | binary search data structures | Statement | B | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred) {847} | PROGRAMMING | 1700 | ||
| 2603 | Load Testing | Statement | H | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred) {847} | PROGRAMMING | 1700 | |||
| 2585 | Sum of Nestings | constructive algorithms | Statement | C | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred) {847} | PROGRAMMING | 1900 | ||
| 3656 | Packmen | binary search dp | Statement | E | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred) {847} | PROGRAMMING | 2000 | ||
| 1650 | Noise Level | dfs and similar | Statement | I | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred) {847} | PROGRAMMING | 2000 | ||
| 1920 | Travel Cards | sortings | Statement | K | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred) {847} | PROGRAMMING | 2100 | ||
| 1003 | Berland Elections | greedy | Statement | F | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred) {847} | PROGRAMMING | 2200 | ||
| 1385 | Dog Show | data structures greedy | Statement | D | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred) {847} | PROGRAMMING | 2300 | ||
| 777 | Students Initiation | binary search flows | Statement | J | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred) {847} | PROGRAMMING | 2400 | ||
| 347 | Berland SU Computer Network | dfs and similar hashing trees | Statement | L | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred) {847} | PROGRAMMING | 2500 | ||
| 5343 | From Y to Y | constructive algorithms | Statement | A | Codeforces Round 431 (Div. 1) {848} | PROGRAMMING | Codeforces Round #431 Editorial | 1600 | |
| 2002 | Rooter's Song | constructive algorithms data structures geometry implementation sortings two pointers | Statement | B | Codeforces Round 431 (Div. 1) {848} | PROGRAMMING | Codeforces Round #431 Editorial | 2100 | |
| 1576 | Goodbye Souvenir | data structures divide and conquer | Statement | C | Codeforces Round 431 (Div. 1) {848} | PROGRAMMING | Codeforces Round #431 Editorial | 2800 | |
| 456 | Shake It! | combinatorics dp flows graphs | Statement | D | Codeforces Round 431 (Div. 1) {848} | PROGRAMMING | Codeforces Round #431 Editorial | 2900 | |
| 242 | Days of Floral Colours | combinatorics divide and conquer dp fft math | Statement | E | Codeforces Round 431 (Div. 1) {848} | PROGRAMMING | Codeforces Round #431 Editorial | 3400 | |
| 9763 | Odds and Ends | implementation | Statement | A | Codeforces Round 431 (Div. 2) {849} | PROGRAMMING | Codeforces Round #431 Editorial | 1100 | |
| 3991 | Tell Your World | brute force geometry | Statement | B | Codeforces Round 431 (Div. 2) {849} | PROGRAMMING | Codeforces Round #431 Editorial | 1600 | |
| 3377 | Five Dimensional Points | brute force geometry math | Statement | A | Codeforces Round 432 (Div. 1, based on IndiaHacks Final Round 2017) {850} | PROGRAMMING | Codeforces Round #432 editorial | 1700 | |
| 2129 | Arpa and a list of numbers | implementation number theory | Statement | B | Codeforces Round 432 (Div. 1, based on IndiaHacks Final Round 2017) {850} | PROGRAMMING | Codeforces Round #432 editorial | 2000 | |
| 1860 | Arpa and a game with Mojtaba | bitmasks dp games | Statement | C | Codeforces Round 432 (Div. 1, based on IndiaHacks Final Round 2017) {850} | PROGRAMMING | Codeforces Round #432 editorial | 2400 | |
| 462 | Tournament Construction | constructive algorithms dp graphs greedy math | Statement | D | Codeforces Round 432 (Div. 1, based on IndiaHacks Final Round 2017) {850} | PROGRAMMING | Codeforces Round #432 editorial | 2700 | |
| 533 | Random Elections | bitmasks brute force divide and conquer fft math | Statement | E | Codeforces Round 432 (Div. 1, based on IndiaHacks Final Round 2017) {850} | PROGRAMMING | Codeforces Round #432 editorial | 2800 | |
| 761 | Rainbow Balls | math | Statement | F | Codeforces Round 432 (Div. 1, based on IndiaHacks Final Round 2017) {850} | PROGRAMMING | Codeforces Round #432 editorial | 2800 | |
| 5887 | Arpa and an exam about geometry | geometry math | Statement | B | Codeforces Round 432 (Div. 2, based on IndiaHacks Final Round 2017) {851} | PROGRAMMING | Codeforces Round #432 editorial | 1400 | |
| 10305 | Arpa and a research in Mexican wave | implementation math | Statement | A | Codeforces Round 432 (Div. 2, based on IndiaHacks Final Round 2017) {851} | PROGRAMMING | Codeforces Round #432 editorial | 800 | |
| 1447 | Bathroom terminal | implementation | Statement | G | Bubble Cup X - Finals [Online Mirror] {852} | PROGRAMMING | Tutorial | 1700 | |
| 1710 | Neural Network country | dp matrices | Statement | B | Bubble Cup X - Finals [Online Mirror] {852} | PROGRAMMING | Tutorial | 2000 | |
| 1201 | Casinos and travel | dp | Statement | E | Bubble Cup X - Finals [Online Mirror] {852} | PROGRAMMING | Tutorial | 2200 | |
| 653 | Product transformation | combinatorics math number theory | Statement | F | Bubble Cup X - Finals [Online Mirror] {852} | PROGRAMMING | Tutorial | 2300 | |
| 1235 | Exploration plan | binary search flows graph matchings shortest paths | Statement | D | Bubble Cup X - Finals [Online Mirror] {852} | PROGRAMMING | Tutorial | 2400 | |
| 661 | Property | greedy sortings | Statement | C | Bubble Cup X - Finals [Online Mirror] {852} | PROGRAMMING | Tutorial | 2500 | |
| 735 | Dating | brute force dfs and similar graphs trees | Statement | I | Bubble Cup X - Finals [Online Mirror] {852} | PROGRAMMING | Tutorial | 2500 | |
| 427 | Digits | brute force implementation math | Statement | A | Bubble Cup X - Finals [Online Mirror] {852} | PROGRAMMING | Tutorial | 2700 | |
| 173 | Bob and stages | dp geometry | Statement | H | Bubble Cup X - Finals [Online Mirror] {852} | PROGRAMMING | Tutorial | 3100 | |
| 6186 | Planning | greedy | Statement | A | Codeforces Round 433 (Div. 1, based on Olympiad of Metropolises) {853} | PROGRAMMING | Codeforces Round #433 Editorial | 1500 | |
| 2755 | Jury Meeting | greedy sortings two pointers | Statement | B | Codeforces Round 433 (Div. 1, based on Olympiad of Metropolises) {853} | PROGRAMMING | Codeforces Round #433 Editorial | 1900 | |
| 1584 | Boredom | data structures | Statement | C | Codeforces Round 433 (Div. 1, based on Olympiad of Metropolises) {853} | PROGRAMMING | Codeforces Round #433 Editorial | 2200 | |
| 714 | Michael and Charging Stations | binary search dp greedy | Statement | D | Codeforces Round 433 (Div. 1, based on Olympiad of Metropolises) {853} | PROGRAMMING | Codeforces Round #433 Editorial | 2400 | |
| 81 | Lada Malina | data structures geometry | Statement | E | Codeforces Round 433 (Div. 1, based on Olympiad of Metropolises) {853} | PROGRAMMING | Codeforces Round #433 Editorial | 3400 | |
| 8580 | Maxim Buys an Apartment | constructive algorithms math | Statement | B | Codeforces Round 433 (Div. 2, based on Olympiad of Metropolises) {854} | PROGRAMMING | 1200 | ||
| 14520 | Fraction | brute force constructive algorithms math | Statement | A | Codeforces Round 433 (Div. 2, based on Olympiad of Metropolises) {854} | PROGRAMMING | 900 | ||
| 9934 | Marvolo Gaunt's Ring | brute force data structures dp | Statement | B | Manthan, Codefest 17 {855} | PROGRAMMING | 54750 | 1500 | |
| 2400 | Helga Hufflepuff's Cup | dp trees | Statement | C | Manthan, Codefest 17 {855} | PROGRAMMING | 54750 | 2000 | |
| 2129 | Salazar Slytherin's Locket | bitmasks dp | Statement | E | Manthan, Codefest 17 {855} | PROGRAMMING | 54750 | 2200 | |
| 582 | Rowena Ravenclaw's Diadem | trees | Statement | D | Manthan, Codefest 17 {855} | PROGRAMMING | 54750 | 2400 | |
| 578 | Nagini | binary search data structures | Statement | F | Manthan, Codefest 17 {855} | PROGRAMMING | 54750 | 3000 | |
| 282 | Harry Vs Voldemort | dfs and similar dp graphs trees | Statement | G | Manthan, Codefest 17 {855} | PROGRAMMING | 54750 | 3000 | |
| 27143 | Tom Riddle's Diary | brute force implementation strings | Statement | A | Manthan, Codefest 17 {855} | PROGRAMMING | 54750 | 700 | |
| 1617 | Set Theory | brute force constructive algorithms | Statement | A | Russian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed] {856} | PROGRAMMING | Tutorial | 1600 | |
| 613 | Similar Words | dp strings | Statement | B | Russian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed] {856} | PROGRAMMING | Tutorial | 2300 | |
| 726 | Eleventh Birthday | combinatorics dp math | Statement | C | Russian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed] {856} | PROGRAMMING | Tutorial | 2400 | |
| 589 | Masha and Cactus | Statement | D | Russian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed] {856} | PROGRAMMING | Tutorial | 2500 | ||
| 122 | To Play or not to Play | greedy | Statement | F | Russian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed] {856} | PROGRAMMING | Tutorial | 3100 | |
| 82 | Satellites | Statement | E | Russian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed] {856} | PROGRAMMING | Tutorial | 3100 | ||
| 8991 | k-rounding | brute force math number theory | Statement | A | Технокубок 2018 - Отборочный Раунд 1 {858} | PROGRAMMING | Codeforces Round 434 Div.1+Div.2 (and Technocup 2018 — Elimination Round 1) Editorial | 1200 | |
| 4104 | Which floor? | brute force implementation | Statement | B | Технокубок 2018 - Отборочный Раунд 1 {858} | PROGRAMMING | Codeforces Round 434 Div.1+Div.2 (and Technocup 2018 — Elimination Round 1) Editorial | 1500 | |
| 5853 | Did you mean... | dp greedy implementation | Statement | C | Технокубок 2018 - Отборочный Раунд 1 {858} | PROGRAMMING | Codeforces Round 434 Div.1+Div.2 (and Technocup 2018 — Elimination Round 1) Editorial | 1500 | |
| 4176 | Polycarp's phone book | data structures implementation sortings | Statement | D | Технокубок 2018 - Отборочный Раунд 1 {858} | PROGRAMMING | Codeforces Round 434 Div.1+Div.2 (and Technocup 2018 — Elimination Round 1) Editorial | 1700 | |
| 533 | Tests Renumeration | greedy implementation | Statement | E | Технокубок 2018 - Отборочный Раунд 1 {858} | PROGRAMMING | Codeforces Round 434 Div.1+Div.2 (and Technocup 2018 — Elimination Round 1) Editorial | 2300 | |
| 2018 | Wizard's Tour | constructive algorithms dfs and similar graphs | Statement | F | Технокубок 2018 - Отборочный Раунд 1 {858} | PROGRAMMING | Codeforces Round 434 Div.1+Div.2 (and Technocup 2018 — Elimination Round 1) Editorial | 2400 | |
| 7900 | Lazy Security Guard | brute force geometry math | Statement | B | MemSQL Start[c]UP 3.0 - Round 1 {859} | PROGRAMMING | Tutorial | 1000 | |
| 6071 | Pie Rules | dp games | Statement | C | MemSQL Start[c]UP 3.0 - Round 1 {859} | PROGRAMMING | Tutorial | 1500 | |
| 1123 | Third Month Insanity | dp probabilities trees | Statement | D | MemSQL Start[c]UP 3.0 - Round 1 {859} | PROGRAMMING | Tutorial | 2100 | |
| 2113 | Desk Disorder | combinatorics dfs and similar dsu graphs trees | Statement | E | MemSQL Start[c]UP 3.0 - Round 1 {859} | PROGRAMMING | Tutorial | 2100 | |
| 228 | Ordering T-Shirts | greedy | Statement | F | MemSQL Start[c]UP 3.0 - Round 1 {859} | PROGRAMMING | Tutorial | 2700 | |
| 189 | Circle of Numbers | math | Statement | G | MemSQL Start[c]UP 3.0 - Round 1 {859} | PROGRAMMING | Tutorial | 2900 | |
| 8608 | Declined Finalists | greedy implementation | Statement | A | MemSQL Start[c]UP 3.0 - Round 1 {859} | PROGRAMMING | Tutorial | 800 | |
| 506 | Arkady and a Nobody-men | data structures dfs and similar trees | Statement | E | Codeforces Round 434 (Div. 1, based on Technocup 2018 Elimination Round 1) {860} | PROGRAMMING | Codeforces Round 434 Div.1+Div.2 (and Technocup 2018 — Elimination Round 1) Editorial | 2600 | |
| 10682 | Mahmoud and Ehab and the MEX | greedy implementation | Statement | A | Codeforces Round 435 (Div. 2) {862} | PROGRAMMING | Codeforces round #435 editorial | 1000 | |
| 25520 | Mahmoud and Ehab and the bipartiteness | dfs and similar graphs trees | Statement | B | Codeforces Round 435 (Div. 2) {862} | PROGRAMMING | Codeforces round #435 editorial | 1400 | |
| 4502 | Mahmoud and Ehab and the xor | constructive algorithms | Statement | C | Codeforces Round 435 (Div. 2) {862} | PROGRAMMING | Codeforces round #435 editorial | 1800 | |
| 2036 | Mahmoud and Ehab and the binary string | binary search divide and conquer interactive | Statement | D | Codeforces Round 435 (Div. 2) {862} | PROGRAMMING | Codeforces round #435 editorial | 2000 | |
| 2168 | Mahmoud and Ehab and the function | binary search data structures sortings | Statement | E | Codeforces Round 435 (Div. 2) {862} | PROGRAMMING | Codeforces round #435 editorial | 2200 | |
| 250 | Mahmoud and Ehab and the final stage | data structures strings | Statement | F | Codeforces Round 435 (Div. 2) {862} | PROGRAMMING | Codeforces round #435 editorial | 2800 | |
| 10863 | Kayaking | brute force greedy sortings | Statement | B | Educational Codeforces Round 29 {863} | PROGRAMMING | Editorial | 1500 | |
| 3802 | Yet Another Array Queries Problem | data structures implementation | Statement | D | Educational Codeforces Round 29 {863} | PROGRAMMING | Editorial | 1800 | |
| 2715 | 1-2-3 | graphs implementation | Statement | C | Educational Codeforces Round 29 {863} | PROGRAMMING | 1800 | ||
| 4053 | Turn Off The TV | data structures sortings | Statement | E | Educational Codeforces Round 29 {863} | PROGRAMMING | Editorial | 2000 | |
| 1522 | Almost Permutation | flows | Statement | F | Educational Codeforces Round 29 {863} | PROGRAMMING | Editorial | 2300 | |
| 64 | Graphic Settings | Statement | G | Educational Codeforces Round 29 {863} | PROGRAMMING | 3100 | |||
| 10921 | Quasi-palindrome | brute force implementation | Statement | A | Educational Codeforces Round 29 {863} | PROGRAMMING | Editorial | 900 | |
| 12290 | Fair Game | implementation sortings | Statement | A | Codeforces Round 436 (Div. 2) {864} | PROGRAMMING | Codeforces Round #436 (Div.2) Разбор | 1000 | |
| 9975 | Polycarp and Letters | brute force implementation strings | Statement | B | Codeforces Round 436 (Div. 2) {864} | PROGRAMMING | Codeforces Round #436 (Div.2) Разбор | 1100 | |
| 6369 | Make a Permutation! | greedy implementation math | Statement | D | Codeforces Round 436 (Div. 2) {864} | PROGRAMMING | 1500 | ||
| 6232 | Bus | greedy implementation math | Statement | C | Codeforces Round 436 (Div. 2) {864} | PROGRAMMING | 1500 | ||
| 4680 | Fire | dp sortings | Statement | E | Codeforces Round 436 (Div. 2) {864} | PROGRAMMING | Codeforces Round #436 (Div.2) Разбор | 2000 | |
| 675 | Cities Excursions | dfs and similar graphs trees | Statement | F | Codeforces Round 436 (Div. 2) {864} | PROGRAMMING | Codeforces Round #436 (Div.2) Разбор | 2700 | |
| 4428 | Save the problem! | constructive algorithms | Statement | A | MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists) {865} | PROGRAMMING | MemSQL Start[c]UP 3.0 Round 2 Editorial | 1400 | |
| 1934 | Ordering Pizza | binary search sortings ternary search | Statement | B | MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists) {865} | PROGRAMMING | MemSQL Start[c]UP 3.0 Round 2 Editorial | 1900 | |
| 7959 | Buy Low Sell High | constructive algorithms data structures greedy | Statement | D | MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists) {865} | PROGRAMMING | MemSQL Start[c]UP 3.0 Round 2 Editorial | 2300 | |
| 938 | Gotta Go Fast | binary search dp | Statement | C | MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists) {865} | PROGRAMMING | MemSQL Start[c]UP 3.0 Round 2 Editorial | 2500 | |
| 157 | Hex Dyslexia | bitmasks brute force dp graphs | Statement | E | MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists) {865} | PROGRAMMING | MemSQL Start[c]UP 3.0 Round 2 Editorial | 2700 | |
| 164 | Flowers and Chocolate | combinatorics math matrices | Statement | G | MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists) {865} | PROGRAMMING | MemSQL Start[c]UP 3.0 Round 2 Editorial | 3200 | |
| 81 | Egg Roulette | bitmasks brute force divide and conquer math meet-in-the-middle | Statement | F | MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists) {865} | PROGRAMMING | MemSQL Start[c]UP 3.0 Round 2 Editorial | 3300 | |
| 20610 | Between the Offices | implementation | Statement | A | Codeforces Round 437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2) {867} | PROGRAMMING | MemSQL Start[c]UP 3.0 Round 2 Editorial | 600 | |
| 9941 | Bark to Unlock | brute force implementation strings | Statement | A | Codeforces Round 438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined) {868} | PROGRAMMING | 55046 | 1000 | |
| 3904 | Race Against Time | implementation | Statement | B | Codeforces Round 438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined) {868} | PROGRAMMING | 55046 | 1400 | |
| 5019 | Qualification Rounds | bitmasks brute force constructive algorithms dp | Statement | C | Codeforces Round 438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined) {868} | PROGRAMMING | 55046 | 1500 | |
| 1005 | Huge Strings | bitmasks brute force dp implementation strings | Statement | D | Codeforces Round 438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined) {868} | PROGRAMMING | 55046 | 2100 | |
| 5073 | Yet Another Minimization Problem | divide and conquer dp | Statement | F | Codeforces Round 438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined) {868} | PROGRAMMING | 55046 | 2500 | |
| 564 | Policeman and a Tree | dp graphs trees | Statement | E | Codeforces Round 438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined) {868} | PROGRAMMING | 55046 | 2600 | |
| 171 | El Toll Caves | math | Statement | G | Codeforces Round 438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined) {868} | PROGRAMMING | 55046 | 3300 | |
| 15544 | The Eternal Immortality | math | Statement | B | Codeforces Round 439 (Div. 2) {869} | PROGRAMMING | Tutorial | 1100 | |
| 9791 | The Artful Expedient | brute force implementation | Statement | A | Codeforces Round 439 (Div. 2) {869} | PROGRAMMING | Tutorial | 1200 | |
| 5199 | The Intriguing Obsession | combinatorics dp math | Statement | C | Codeforces Round 439 (Div. 2) {869} | PROGRAMMING | Tutorial | 1800 | |
| 2055 | The Untended Antiquity | data structures hashing | Statement | E | Codeforces Round 439 (Div. 2) {869} | PROGRAMMING | Tutorial | 2300 | |
| 279 | The Overdosing Ubiquity | brute force dfs and similar graphs | Statement | D | Codeforces Round 439 (Div. 2) {869} | PROGRAMMING | Tutorial | 2800 | |
| 10622 | Maximum of Maximums of Minimums | greedy | Statement | B | Technocup 2018 - Elimination Round 2 {870} | PROGRAMMING | Editorial Codeforces Round 440 Div.1+Div.2 (and Technocup 2018 — Elimination Round 2) | 1200 | |
| 9765 | Maximum splitting | dp greedy math number theory | Statement | C | Technocup 2018 - Elimination Round 2 {870} | PROGRAMMING | Editorial Codeforces Round 440 Div.1+Div.2 (and Technocup 2018 — Elimination Round 2) | 1300 | |
| 1294 | Something with XOR Queries | brute force interactive probabilities | Statement | D | Technocup 2018 - Elimination Round 2 {870} | PROGRAMMING | Editorial Codeforces Round 440 Div.1+Div.2 (and Technocup 2018 — Elimination Round 2) | 2100 | |
| 1316 | Points, Lines and Ready-made Titles | dfs and similar dsu graphs trees | Statement | E | Technocup 2018 - Elimination Round 2 {870} | PROGRAMMING | Editorial Codeforces Round 440 Div.1+Div.2 (and Technocup 2018 — Elimination Round 2) | 2400 | |
| 681 | Paths | data structures number theory | Statement | F | Technocup 2018 - Elimination Round 2 {870} | PROGRAMMING | Editorial Codeforces Round 440 Div.1+Div.2 (and Technocup 2018 — Elimination Round 2) | 2600 | |
| 10782 | Search for Pretty Integers | brute force implementation | Statement | A | Technocup 2018 - Elimination Round 2 {870} | PROGRAMMING | Editorial Codeforces Round 440 Div.1+Div.2 (and Technocup 2018 — Elimination Round 2) | 900 | |
| 173 | Restore the Tree | graphs greedy trees | Statement | E | Codeforces Round 440 (Div. 1, based on Technocup 2018 Elimination Round 2) {871} | PROGRAMMING | Editorial Codeforces Round 440 Div.1+Div.2 (and Technocup 2018 — Elimination Round 2) | 2800 | |
| 9102 | Balanced Substring | dp implementation | Statement | B | Educational Codeforces Round 30 {873} | PROGRAMMING | 55171 | 1500 | |
| 3609 | Strange Game On Matrix | greedy two pointers | Statement | C | Educational Codeforces Round 30 {873} | PROGRAMMING | 55171 | 1600 | |
| 4021 | Merge Sort | constructive algorithms divide and conquer | Statement | D | Educational Codeforces Round 30 {873} | PROGRAMMING | 55171 | 1800 |