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 ... 14 15 16 17 18 ... 44 45 46 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 1966 | Forbidden Indices | dsu string suffix structures strings | Statement | F | Educational Codeforces Round 30 {873} | PROGRAMMING | 55171 | 2300 | |
| 825 | Awards For Contestants | brute force data structures dp | Statement | E | Educational Codeforces Round 30 {873} | PROGRAMMING | 55171 | 2500 | |
| 10757 | Chores | implementation | Statement | A | Educational Codeforces Round 30 {873} | PROGRAMMING | 55171 | 900 | |
| 10358 | Classroom Watch | brute force math | Statement | A | Codeforces Round 441 (Div. 1, by Moscow Team Olympiad) {875} | PROGRAMMING | Codeforces Round #441. Editorial. | 1200 | |
| 5410 | Sorting the Coins | dsu implementation sortings two pointers | Statement | B | Codeforces Round 441 (Div. 1, by Moscow Team Olympiad) {875} | PROGRAMMING | Codeforces Round #441. Editorial. | 1500 | |
| 2431 | National Property | 2-sat dfs and similar graphs implementation | Statement | C | Codeforces Round 441 (Div. 1, by Moscow Team Olympiad) {875} | PROGRAMMING | Codeforces Round #441. Editorial. | 2100 | |
| 2596 | High Cry | binary search bitmasks combinatorics data structures divide and conquer | Statement | D | Codeforces Round 441 (Div. 1, by Moscow Team Olympiad) {875} | PROGRAMMING | Codeforces Round #441. Editorial. | 2200 | |
| 1672 | Royal Questions | dsu graphs greedy | Statement | F | Codeforces Round 441 (Div. 1, by Moscow Team Olympiad) {875} | PROGRAMMING | Codeforces Round #441. Editorial. | 2500 | |
| 1050 | Delivery Club | binary search data structures dp | Statement | E | Codeforces Round 441 (Div. 1, by Moscow Team Olympiad) {875} | PROGRAMMING | Codeforces Round #441. Editorial. | 2600 | |
| 10163 | Trip For Meal | math | Statement | A | Codeforces Round 441 (Div. 2, by Moscow Team Olympiad) {876} | PROGRAMMING | Codeforces Round #441. Editorial. | 1000 | |
| 10511 | Divisiblity of Differences | implementation math number theory | Statement | B | Codeforces Round 441 (Div. 2, by Moscow Team Olympiad) {876} | PROGRAMMING | Codeforces Round #441. Editorial. | 1300 | |
| 11630 | Alex and broken contest | implementation strings | Statement | A | Codeforces Round 442 (Div. 2) {877} | PROGRAMMING | 55362 | 1200 | |
| 12209 | Nikita and string | brute force dp | Statement | B | Codeforces Round 442 (Div. 2) {877} | PROGRAMMING | 55362 | 1500 | |
| 6092 | Slava and tanks | constructive algorithms | Statement | C | Codeforces Round 442 (Div. 2) {877} | PROGRAMMING | 55362 | 1600 | |
| 5313 | Olya and Energy Drinks | data structures dfs and similar graphs shortest paths | Statement | D | Codeforces Round 442 (Div. 2) {877} | PROGRAMMING | 55362 | 1900 | |
| 5891 | Danil and a Part-time Job | bitmasks data structures trees | Statement | E | Codeforces Round 442 (Div. 2) {877} | PROGRAMMING | 55362 | 2000 | |
| 2483 | Ann and Books | data structures flows hashing | Statement | F | Codeforces Round 442 (Div. 2) {877} | PROGRAMMING | 55362 | 2500 | |
| 6068 | Short Program | bitmasks constructive algorithms | Statement | A | Codeforces Round 443 (Div. 1) {878} | PROGRAMMING | Editorial | 1600 | |
| 1138 | Teams Formation | data structures implementation | Statement | B | Codeforces Round 443 (Div. 1) {878} | PROGRAMMING | Editorial | 2400 | |
| 1075 | Tournament | data structures graphs | Statement | C | Codeforces Round 443 (Div. 1) {878} | PROGRAMMING | Editorial | 2800 | |
| 1000 | Magic Breeding | bitmasks | Statement | D | Codeforces Round 443 (Div. 1) {878} | PROGRAMMING | Editorial | 2900 | |
| 780 | Numbers on the blackboard | combinatorics dp | Statement | E | Codeforces Round 443 (Div. 1) {878} | PROGRAMMING | Editorial | 3200 | |
| 9673 | Borya's Diagnosis | implementation | Statement | A | Codeforces Round 443 (Div. 2) {879} | PROGRAMMING | Codeforces Round #443. Editorial | 1000 | |
| 14897 | Table Tennis | data structures implementation | Statement | B | Codeforces Round 443 (Div. 2) {879} | PROGRAMMING | Codeforces Round #443. Editorial | 1300 | |
| 3922 | Quadcopter Competition | greedy math | Statement | M | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {883} | PROGRAMMING | 1100 | ||
| 2427 | Lost in Transliteration | implementation | Statement | F | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {883} | PROGRAMMING | 1300 | ||
| 2075 | Field of Wonders | implementation strings | Statement | E | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {883} | PROGRAMMING | 1600 | ||
| 1809 | Palindromic Cut | brute force implementation strings | Statement | H | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {883} | PROGRAMMING | 1800 | ||
| 2438 | Photo Processing | binary search dp | Statement | I | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {883} | PROGRAMMING | 2000 | ||
| 1562 | Orientation of Edges | dfs and similar graphs | Statement | G | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {883} | PROGRAMMING | 2000 | ||
| 1255 | Road Widening | constructive algorithms greedy implementation | Statement | K | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {883} | PROGRAMMING | 2100 | ||
| 707 | Automatic Door | implementation | Statement | A | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {883} | PROGRAMMING | 2300 | ||
| 895 | Downloading B++ | binary search | Statement | C | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {883} | PROGRAMMING | 2400 | ||
| 661 | Renovation | greedy sortings | Statement | J | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {883} | PROGRAMMING | 2600 | ||
| 511 | Packmen Strike Back | binary search dp | Statement | D | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {883} | PROGRAMMING | 2800 | ||
| 313 | Berland.Taxi | data structures | Statement | L | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {883} | PROGRAMMING | 2800 | ||
| 485 | Berland Army | constructive algorithms graphs greedy | Statement | B | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {883} | PROGRAMMING | 2800 | ||
| 7745 | Japanese Crosswords Strike Back | implementation | Statement | B | Educational Codeforces Round 31 {884} | PROGRAMMING | 55470 | 1100 | |
| 5241 | Bertown Subway | dfs and similar greedy math | Statement | C | Educational Codeforces Round 31 {884} | PROGRAMMING | 55470 | 1500 | |
| 2279 | Boxes And Balls | data structures greedy | Statement | D | Educational Codeforces Round 31 {884} | PROGRAMMING | 55470 | 2300 | |
| 836 | Binary Matrix | dsu | Statement | E | Educational Codeforces Round 31 {884} | PROGRAMMING | 55470 | 2500 | |
| 1341 | Anti-Palindromize | flows graphs greedy | Statement | F | Educational Codeforces Round 31 {884} | PROGRAMMING | 55470 | 2500 | |
| 11460 | Book Reading | implementation | Statement | A | Educational Codeforces Round 31 {884} | PROGRAMMING | 55470 | 900 | |
| 8471 | Vlad and Cafes | Statement | B | Технокубок 2018 - Отборочный Раунд 3 {886} | PROGRAMMING | Editorial Codeforces Round 445 (and Technocup 2018 — Elimination Round 3) | 1000 | ||
| 11337 | ACM ICPC | brute force | Statement | A | Технокубок 2018 - Отборочный Раунд 3 {886} | PROGRAMMING | Editorial Codeforces Round 445 (and Technocup 2018 — Elimination Round 3) | 1100 | |
| 5701 | Petya and Catacombs | dsu greedy implementation trees | Statement | C | Технокубок 2018 - Отборочный Раунд 3 {886} | PROGRAMMING | Editorial Codeforces Round 445 (and Technocup 2018 — Elimination Round 3) | 1300 | |
| 2048 | Restoration of string | constructive algorithms graphs implementation | Statement | D | Технокубок 2018 - Отборочный Раунд 3 {886} | PROGRAMMING | Editorial Codeforces Round 445 (and Technocup 2018 — Elimination Round 3) | 2000 | |
| 1258 | Maximum Element | combinatorics dp math | Statement | E | Технокубок 2018 - Отборочный Раунд 3 {886} | PROGRAMMING | Editorial Codeforces Round 445 (and Technocup 2018 — Elimination Round 3) | 2500 | |
| 311 | Symmetric Projections | geometry | Statement | F | Технокубок 2018 - Отборочный Раунд 3 {886} | PROGRAMMING | Editorial Codeforces Round 445 (and Technocup 2018 — Elimination Round 3) | 2700 | |
| 12044 | Div. 64 | implementation | Statement | A | Codeforces Round 444 (Div. 2) {887} | PROGRAMMING | Codeforces Round #444 (Div. 2) Editorial | 1100 | |
| 6209 | Cubes for Masha | brute force implementation | Statement | B | Codeforces Round 444 (Div. 2) {887} | PROGRAMMING | Codeforces Round #444 (Div. 2) Editorial | 1300 | |
| 2999 | Solution for Cube | brute force implementation | Statement | C | Codeforces Round 444 (Div. 2) {887} | PROGRAMMING | Codeforces Round #444 (Div. 2) Editorial | 1500 | |
| 576 | Ratings and Reality Shows | data structures two pointers | Statement | D | Codeforces Round 444 (Div. 2) {887} | PROGRAMMING | Codeforces Round #444 (Div. 2) Editorial | 2500 | |
| 222 | Little Brother | binary search geometry sortings | Statement | E | Codeforces Round 444 (Div. 2) {887} | PROGRAMMING | Codeforces Round #444 (Div. 2) Editorial | 2700 | |
| 214 | Row of Models | greedy sortings | Statement | F | Codeforces Round 444 (Div. 2) {887} | PROGRAMMING | Codeforces Round #444 (Div. 2) Editorial | 2800 | |
| 10878 | Buggy Robot | greedy | Statement | B | Educational Codeforces Round 32 {888} | PROGRAMMING | Educational Codeforces Round 32 - Editorial | 1000 | |
| 9134 | K-Dominant Character | binary search implementation two pointers | Statement | C | Educational Codeforces Round 32 {888} | PROGRAMMING | Educational Codeforces Round 32 - Editorial | 1400 | |
| 12173 | Local Extrema | brute force implementation | Statement | A | Educational Codeforces Round 32 {888} | PROGRAMMING | Educational Codeforces Round 32 - Editorial | 1600 | |
| 10984 | Almost Identity Permutations | combinatorics dp math | Statement | D | Educational Codeforces Round 32 {888} | PROGRAMMING | Educational Codeforces Round 32 - Editorial | 1600 | |
| 9920 | Maximum Subsequence | bitmasks divide and conquer meet-in-the-middle | Statement | E | Educational Codeforces Round 32 {888} | PROGRAMMING | Educational Codeforces Round 32 - Editorial | 1800 | |
| 6209 | Xor-MST | bitmasks constructive algorithms data structures | Statement | G | Educational Codeforces Round 32 {888} | PROGRAMMING | Educational Codeforces Round 32 - Editorial | 2300 | |
| 1201 | Connecting Vertices | dp graphs | Statement | F | Educational Codeforces Round 32 {888} | PROGRAMMING | Educational Codeforces Round 32 - Editorial | 2500 | |
| 819 | Mod Mod Mod | binary search dp math | Statement | E | Codeforces Round 445 (Div. 1, based on Technocup 2018 Elimination Round 3) {889} | PROGRAMMING | Editorial Codeforces Round 445 (and Technocup 2018 — Elimination Round 3) | 3100 | |
| 15236 | Pride | brute force dp greedy math number theory | Statement | A | Codeforces Round 446 (Div. 1) {891} | PROGRAMMING | Codeforces Round #446 Editorial | 1600 | |
| 3290 | Gluttony | constructive algorithms greedy | Statement | B | Codeforces Round 446 (Div. 1) {891} | PROGRAMMING | Codeforces Round #446 Editorial | 2000 | |
| 3224 | Envy | data structures dsu graphs | Statement | C | Codeforces Round 446 (Div. 1) {891} | PROGRAMMING | Codeforces Round #446 Editorial | 2500 | |
| 1284 | Lust | combinatorics math matrices | Statement | E | Codeforces Round 446 (Div. 1) {891} | PROGRAMMING | Codeforces Round #446 Editorial | 2800 | |
| 488 | Sloth | dfs and similar dp graph matchings trees | Statement | D | Codeforces Round 446 (Div. 1) {891} | PROGRAMMING | Codeforces Round #446 Editorial | 3000 | |
| 10284 | Wrath | greedy implementation two pointers | Statement | B | Codeforces Round 446 (Div. 2) {892} | PROGRAMMING | Codeforces Round #446 Editorial | 1200 | |
| 15207 | Greed | greedy implementation | Statement | A | Codeforces Round 446 (Div. 2) {892} | PROGRAMMING | Codeforces Round #446 Editorial | 900 | |
| 12869 | Beautiful Divisors | brute force implementation | Statement | B | Educational Codeforces Round 33 (Rated for Div. 2) {893} | PROGRAMMING | 55989 | 1000 | |
| 29462 | Rumor | dfs and similar graphs greedy | Statement | C | Educational Codeforces Round 33 (Rated for Div. 2) {893} | PROGRAMMING | 55989 | 1300 | |
| 3368 | Credit Card | data structures dp greedy implementation | Statement | D | Educational Codeforces Round 33 (Rated for Div. 2) {893} | PROGRAMMING | 55989 | 1800 | |
| 4358 | Counting Arrays | combinatorics dp math number theory | Statement | E | Educational Codeforces Round 33 (Rated for Div. 2) {893} | PROGRAMMING | 55989 | 2000 | |
| 2622 | Subtree Minimum Query | data structures trees | Statement | F | Educational Codeforces Round 33 (Rated for Div. 2) {893} | PROGRAMMING | 55989 | 2300 | |
| 11165 | Chess For Three | implementation | Statement | A | Educational Codeforces Round 33 (Rated for Div. 2) {893} | PROGRAMMING | 55989 | 900 | |
| 4731 | Ralph And His Magic Field | combinatorics constructive algorithms math number theory | Statement | B | Codeforces Round 447 (Div. 2) {894} | PROGRAMMING | Codeforces Round #447 (Div.2 Only) Editorial | 1800 | |
| 4666 | Marco and GCD Sequence | constructive algorithms math | Statement | C | Codeforces Round 447 (Div. 2) {894} | PROGRAMMING | Codeforces Round #447 (Div.2 Only) Editorial | 1800 | |
| 1235 | Ralph And His Tour in Binary Country | brute force data structures trees | Statement | D | Codeforces Round 447 (Div. 2) {894} | PROGRAMMING | Codeforces Round #447 (Div.2 Only) Editorial | 2300 | |
| 3502 | Ralph and Mushrooms | dp graphs | Statement | E | Codeforces Round 447 (Div. 2) {894} | PROGRAMMING | Codeforces Round #447 (Div.2 Only) Editorial | 2400 | |
| 40102 | QAQ | brute force dp | Statement | A | Codeforces Round 447 (Div. 2) {894} | PROGRAMMING | Codeforces Round #447 (Div.2 Only) Editorial | 800 | |
| 6970 | Pizza Separation | brute force implementation | Statement | A | Codeforces Round 448 (Div. 2) {895} | PROGRAMMING | Codeforces Round #448(Div.2) Editorial | 1200 | |
| 3845 | XK Segments | binary search math sortings two pointers | Statement | B | Codeforces Round 448 (Div. 2) {895} | PROGRAMMING | Codeforces Round #448(Div.2) Editorial | 1700 | |
| 7841 | Square Subsets | bitmasks combinatorics dp math | Statement | C | Codeforces Round 448 (Div. 2) {895} | PROGRAMMING | Codeforces Round #448(Div.2) Editorial | 2000 | |
| 1287 | String Mark | combinatorics math strings | Statement | D | Codeforces Round 448 (Div. 2) {895} | PROGRAMMING | Codeforces Round #448(Div.2) Editorial | 2300 | |
| 1320 | Eyes Closed | data structures probabilities | Statement | E | Codeforces Round 448 (Div. 2) {895} | PROGRAMMING | Codeforces Round #448(Div.2) Editorial | 2500 | |
| 3912 | Nephren gives a riddle | binary search dfs and similar | Statement | A | Codeforces Round 449 (Div. 1) {896} | PROGRAMMING | Codeforces Round #449 Editorial | 1700 | |
| 2349 | 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 | |
| 4672 | Willem, Chtholly and Seniorious | data structures probabilities | Statement | C | Codeforces Round 449 (Div. 1) {896} | PROGRAMMING | Codeforces Round #449 Editorial | 2700 | |
| 770 | Nephren Runs a Cinema | chinese remainder theorem combinatorics math number theory | Statement | D | Codeforces Round 449 (Div. 1) {896} | PROGRAMMING | Codeforces Round #449 Editorial | 2800 | |
| 2557 | Welcome home, Chtholly | data structures dsu | Statement | E | Codeforces Round 449 (Div. 1) {896} | PROGRAMMING | Codeforces Round #449 Editorial | 3100 | |
| 7616 | Chtholly's request | brute force | Statement | B | Codeforces Round 449 (Div. 2) {897} | PROGRAMMING | Codeforces Round #449 Editorial | 1300 | |
| 15224 | Scarborough Fair | implementation | Statement | A | Codeforces Round 449 (Div. 2) {897} | PROGRAMMING | Codeforces Round #449 Editorial | 700 | |
| 10856 | Proper Nutrition | brute force implementation number theory | Statement | B | Codeforces Round 451 (Div. 2) {898} | PROGRAMMING | Codeforces Round #451 (Div.2) Editorial | 1300 | |
| 5893 | Phone Numbers | implementation strings | Statement | C | Codeforces Round 451 (Div. 2) {898} | PROGRAMMING | Codeforces Round #451 (Div.2) Editorial | 1400 | |
| 4903 | Squares and not squares | constructive algorithms greedy | Statement | E | Codeforces Round 451 (Div. 2) {898} | PROGRAMMING | Codeforces Round #451 (Div.2) Editorial | 1600 | |
| 4637 | Alarm Clock | greedy | Statement | D | Codeforces Round 451 (Div. 2) {898} | PROGRAMMING | Codeforces Round #451 (Div.2) Editorial | 1700 | |
| 1502 | Restoring the Expression | brute force hashing math | Statement | F | Codeforces Round 451 (Div. 2) {898} | PROGRAMMING | Codeforces Round #451 (Div.2) Editorial | 2300 | |
| 17732 | Rounding | implementation math | Statement | A | Codeforces Round 451 (Div. 2) {898} | PROGRAMMING | Codeforces Round #451 (Div.2) Editorial | 800 | |
| 6489 | Months and Years | implementation | Statement | B | Codeforces Round 452 (Div. 2) {899} | PROGRAMMING | Codeforces Round #452 (Div.2) Editorial | 1300 | |
| 9114 | Dividing the numbers | constructive algorithms graphs math | Statement | C | Codeforces Round 452 (Div. 2) {899} | PROGRAMMING | Codeforces Round #452 (Div.2) Editorial | 1300 | |
| 3284 | Shovel Sale | constructive algorithms math | Statement | D | Codeforces Round 452 (Div. 2) {899} | PROGRAMMING | Codeforces Round #452 (Div.2) Editorial | 1800 | |
| 3685 | Segments Removal | data structures dsu flows implementation two pointers | Statement | E | Codeforces Round 452 (Div. 2) {899} | PROGRAMMING | Codeforces Round #452 (Div.2) Editorial | 2100 | |
| 2096 | Letters Removing | data structures strings | Statement | F | Codeforces Round 452 (Div. 2) {899} | PROGRAMMING | Codeforces Round #452 (Div.2) Editorial | 2200 | |
| 11171 | Splitting in Teams | constructive algorithms greedy math | Statement | A | Codeforces Round 452 (Div. 2) {899} | PROGRAMMING | Codeforces Round #452 (Div.2) Editorial | 900 | |
| 8480 | Position in Fraction | math number theory | Statement | B | Codeforces Round 450 (Div. 2) {900} | PROGRAMMING | Codeforces Round #450(Div. 2). Editorial. | 1300 | |
| 5089 | Remove Extra One | brute force data structures math | Statement | C | Codeforces Round 450 (Div. 2) {900} | PROGRAMMING | Codeforces Round #450(Div. 2). Editorial. | 1700 | |
| 3983 | Unusual Sequences | bitmasks combinatorics dp math number theory | Statement | D | Codeforces Round 450 (Div. 2) {900} | PROGRAMMING | Codeforces Round #450(Div. 2). Editorial. | 2100 | |
| 1452 | Maximum Questions | data structures dp strings | Statement | E | Codeforces Round 450 (Div. 2) {900} | PROGRAMMING | Codeforces Round #450(Div. 2). Editorial. | 2300 | |
| 15157 | Find Extra One | geometry implementation | Statement | A | Codeforces Round 450 (Div. 2) {900} | PROGRAMMING | Codeforces Round #450(Div. 2). Editorial. | 900 | |
| 5414 | Hashing Trees | constructive algorithms trees | Statement | A | Codeforces Round 453 (Div. 1) {901} | PROGRAMMING | Codeforces Round #453 (Div. 1 & Div. 2) Editorial | 1500 | |
| 1654 | GCD of Polynomials | constructive algorithms math | Statement | B | Codeforces Round 453 (Div. 1) {901} | PROGRAMMING | Codeforces Round #453 (Div. 1 & Div. 2) Editorial | 2100 | |
| 1345 | Bipartite Segments | binary search data structures dfs and similar dsu graphs two pointers | Statement | C | Codeforces Round 453 (Div. 1) {901} | PROGRAMMING | Codeforces Round #453 (Div. 1 & Div. 2) Editorial | 2500 | |
| 679 | Weighting a Tree | constructive algorithms dfs and similar graphs | Statement | D | Codeforces Round 453 (Div. 1) {901} | PROGRAMMING | Codeforces Round #453 (Div. 1 & Div. 2) Editorial | 2700 | |
| 107 | Cyclic Cipher | fft math | Statement | E | Codeforces Round 453 (Div. 1) {901} | PROGRAMMING | Codeforces Round #453 (Div. 1 & Div. 2) Editorial | 3300 | |
| 10345 | Visiting a Friend | greedy implementation | Statement | A | Codeforces Round 453 (Div. 2) {902} | PROGRAMMING | Codeforces Round #453 (Div. 1 & Div. 2) Editorial | 1200 | |
| 12103 | 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 | |
| 8166 | The Modcrab | greedy implementation | Statement | B | Educational Codeforces Round 34 (Rated for Div. 2) {903} | PROGRAMMING | Educational Codeforces Round 34 Editorial | 1200 | |
| 23508 | Boxes Packing | greedy | Statement | C | Educational Codeforces Round 34 (Rated for Div. 2) {903} | PROGRAMMING | Educational Codeforces Round 34 Editorial | 1200 | |
| 1631 | Swapping Characters | brute force hashing implementation strings | Statement | E | Educational Codeforces Round 34 (Rated for Div. 2) {903} | PROGRAMMING | Educational Codeforces Round 34 Editorial | 2200 | |
| 5163 | Almost Difference | data structures math | Statement | D | Educational Codeforces Round 34 (Rated for Div. 2) {903} | PROGRAMMING | Educational Codeforces Round 34 Editorial | 2200 | |
| 818 | Clear The Matrix | bitmasks dp | Statement | F | Educational Codeforces Round 34 (Rated for Div. 2) {903} | PROGRAMMING | Educational Codeforces Round 34 Editorial | 2400 | |
| 770 | Yet Another Maxflow Problem | data structures flows graphs | Statement | G | Educational Codeforces Round 34 (Rated for Div. 2) {903} | PROGRAMMING | Educational Codeforces Round 34 Editorial | 2700 | |
| 15654 | Hungry Student Problem | greedy implementation | Statement | A | Educational Codeforces Round 34 (Rated for Div. 2) {903} | PROGRAMMING | Educational Codeforces Round 34 Editorial | 900 | |
| 4482 | Shockers | implementation strings | Statement | A | Codeforces Round 454 (Div. 1, based on Technocup 2018 Elimination Round 4) {906} | PROGRAMMING | Editorial Codeforces Round 454 (and Technocup 2018 — Elimination Round 4) | 1600 | |
| 1364 | Seating of Students | brute force constructive algorithms math | Statement | B | Codeforces Round 454 (Div. 1, based on Technocup 2018 Elimination Round 4) {906} | PROGRAMMING | Editorial Codeforces Round 454 (and Technocup 2018 — Elimination Round 4) | 2300 | |
| 1584 | Party | bitmasks brute force dp graphs | Statement | C | Codeforces Round 454 (Div. 1, based on Technocup 2018 Elimination Round 4) {906} | PROGRAMMING | Editorial Codeforces Round 454 (and Technocup 2018 — Elimination Round 4) | 2300 | |
| 2860 | Power Tower | chinese remainder theorem math number theory | Statement | D | Codeforces Round 454 (Div. 1, based on Technocup 2018 Elimination Round 4) {906} | PROGRAMMING | Editorial Codeforces Round 454 (and Technocup 2018 — Elimination Round 4) | 2600 | |
| 596 | Reverses | dp string suffix structures strings | Statement | E | Codeforces Round 454 (Div. 1, based on Technocup 2018 Elimination Round 4) {906} | PROGRAMMING | Editorial Codeforces Round 454 (and Technocup 2018 — Elimination Round 4) | 3200 | |
| 4411 | Tic-Tac-Toe | implementation | Statement | B | Codeforces Round 454 (Div. 2, based on Technocup 2018 Elimination Round 4) {907} | PROGRAMMING | Editorial Codeforces Round 454 (and Technocup 2018 — Elimination Round 4) | 1400 | |
| 6045 | Masha and Bears | brute force implementation | Statement | A | Codeforces Round 454 (Div. 2, based on Technocup 2018 Elimination Round 4) {907} | PROGRAMMING | Editorial Codeforces Round 454 (and Technocup 2018 — Elimination Round 4) | 1400 | |
| 8097 | New Year and Buggy Bot | brute force implementation | Statement | B | Good Bye 2017 {908} | PROGRAMMING | 1300 | ||
| 7266 | New Year and Curling | brute force geometry implementation math | Statement | C | Good Bye 2017 {908} | PROGRAMMING | Good Bye 2017 Editorial | 1500 | |
| 2774 | New Year and Arbitrary Arrangement | dp math probabilities | Statement | D | Good Bye 2017 {908} | PROGRAMMING | Good Bye 2017 Editorial | 2200 | |
| 1657 | New Year and Rainbow Roads | graphs greedy implementation | Statement | F | Good Bye 2017 {908} | PROGRAMMING | Good Bye 2017 Editorial | 2400 | |
| 878 | New Year and Entity Enumeration | bitmasks combinatorics dp math | Statement | E | Good Bye 2017 {908} | PROGRAMMING | Good Bye 2017 Editorial | 2400 | |
| 1766 | New Year and Original Order | dp math | Statement | G | Good Bye 2017 {908} | PROGRAMMING | Good Bye 2017 Editorial | 2700 | |
| 669 | New Year and Boolean Bridges | Statement | H | Good Bye 2017 {908} | PROGRAMMING | Good Bye 2017 Editorial | 3000 | ||
| 15982 | New Year and Counting Cards | brute force implementation | Statement | A | Good Bye 2017 {908} | PROGRAMMING | Good Bye 2017 Editorial | 800 | |
| 10450 | Generate Login | brute force greedy sortings | Statement | A | Codeforces Round 455 (Div. 2) {909} | PROGRAMMING | Codeforces Round #455 (Div. 2) Editorial | 1100 | |
| 6828 | Segments | constructive algorithms math | Statement | B | Codeforces Round 455 (Div. 2) {909} | PROGRAMMING | Codeforces Round #455 (Div. 2) Editorial | 1300 | |
| 5556 | Python Indentation | dp | Statement | C | Codeforces Round 455 (Div. 2) {909} | PROGRAMMING | Codeforces Round #455 (Div. 2) Editorial | 1800 | |
| 2582 | Coprocessor | dfs and similar dp graphs greedy | Statement | E | Codeforces Round 455 (Div. 2) {909} | PROGRAMMING | Codeforces Round #455 (Div. 2) Editorial | 2100 | |
| 2214 | Colorful Points | data structures greedy implementation | Statement | D | Codeforces Round 455 (Div. 2) {909} | PROGRAMMING | Codeforces Round #455 (Div. 2) Editorial | 2100 | |
| 687 | AND-permutations | constructive algorithms | Statement | F | Codeforces Round 455 (Div. 2) {909} | PROGRAMMING | Codeforces Round #455 (Div. 2) Editorial | 2600 | |
| 14332 | The Way to Home | dfs and similar dp greedy implementation | Statement | A | Testing Round 14 (Unrated) {910} | PROGRAMMING | 1100 | ||
| 1898 | Door Frames | greedy implementation | Statement | B | Testing Round 14 (Unrated) {910} | PROGRAMMING | 1600 | ||
| 2193 | Minimum Sum | constructive algorithms greedy math | Statement | C | Testing Round 14 (Unrated) {910} | PROGRAMMING | 1700 | ||
| 12421 | Nearest Minimums | implementation | Statement | A | Educational Codeforces Round 35 (Rated for Div. 2) {911} | PROGRAMMING | T | 1100 | |
| 12927 | Two Cakes | binary search brute force implementation | Statement | B | Educational Codeforces Round 35 (Rated for Div. 2) {911} | PROGRAMMING | T | 1200 | |
| 7375 | Three Garlands | brute force constructive algorithms | Statement | C | Educational Codeforces Round 35 (Rated for Div. 2) {911} | PROGRAMMING | 1400 | ||
| 5189 | Inversion Counting | brute force math | Statement | D | Educational Codeforces Round 35 (Rated for Div. 2) {911} | PROGRAMMING | T | 1700 | |
| 3009 | Stack Sorting | constructive algorithms data structures greedy implementation | Statement | E | Educational Codeforces Round 35 (Rated for Div. 2) {911} | PROGRAMMING | 2000 | ||
| 2412 | Tree Destruction | constructive algorithms dfs and similar graphs greedy trees | Statement | F | Educational Codeforces Round 35 (Rated for Div. 2) {911} | PROGRAMMING | T | 2500 | |
| 4040 | Mass Change Queries | data structures | Statement | G | Educational Codeforces Round 35 (Rated for Div. 2) {911} | PROGRAMMING | T | 2600 | |
| 14306 | New Year's Eve | bitmasks constructive algorithms number theory | Statement | B | Codeforces Round 456 (Div. 2) {912} | PROGRAMMING | Codeforces Round #456 (Div. 2) Editorial | 1400 | |
| 2198 | Fishes | data structures graphs greedy probabilities shortest paths | Statement | D | Codeforces Round 456 (Div. 2) {912} | PROGRAMMING | Codeforces Round #456 (Div. 2) Editorial | 2100 | |
| 624 | Perun, Ult! | brute force greedy sortings | Statement | C | Codeforces Round 456 (Div. 2) {912} | PROGRAMMING | Codeforces Round #456 (Div. 2) Editorial | 2500 | |
| 2260 | Prime Gift | binary search dfs and similar math meet-in-the-middle number theory two pointers | Statement | E | Codeforces Round 456 (Div. 2) {912} | PROGRAMMING | Codeforces Round #456 (Div. 2) Editorial | 2600 | |
| 14529 | Tricky Alchemy | implementation | Statement | A | Codeforces Round 456 (Div. 2) {912} | PROGRAMMING | Codeforces Round #456 (Div. 2) Editorial | 900 | |
| 24619 | Modular Exponentiation | implementation math | Statement | A | Hello 2018 {913} | PROGRAMMING | Tutorial | 1000 | |
| 20037 | Christmas Spruce | implementation trees | Statement | B | Hello 2018 {913} | PROGRAMMING | Tutorial | 1200 | |
| 8569 | Party Lemonade | bitmasks dp greedy | Statement | C | Hello 2018 {913} | PROGRAMMING | Tutorial | 1600 | |
| 5188 | Too Easy Problems | binary search brute force data structures greedy sortings | Statement | D | Hello 2018 {913} | PROGRAMMING | Tutorial | 1800 | |
| 918 | Logical Expression | bitmasks dp shortest paths | Statement | E | Hello 2018 {913} | PROGRAMMING | Tutorial | 2400 | |
| 847 | Strongly Connected Tournament | dp graphs math probabilities | Statement | F | Hello 2018 {913} | PROGRAMMING | Tutorial | 2700 | |
| 299 | Power Substring | math number theory | Statement | G | Hello 2018 {913} | PROGRAMMING | Tutorial | 3100 | |
| 306 | Don't Exceed | math probabilities | Statement | H | Hello 2018 {913} | PROGRAMMING | Tutorial | 3400 | |
| 15915 | Perfect Squares | brute force implementation math | Statement | A | Codecraft-18 and Codeforces Round 458 (Div. 1 + Div. 2, combined) {914} | PROGRAMMING | Tutorial | 1100 | |
| 9133 | 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 | |
| 4441 | Travelling Salesman and Special Numbers | brute force combinatorics dp | Statement | C | Codecraft-18 and Codeforces Round 458 (Div. 1 + Div. 2, combined) {914} | PROGRAMMING | Tutorial | 1800 | |
| 6716 | Bash and a Tough Math Puzzle | data structures number theory | Statement | D | Codecraft-18 and Codeforces Round 458 (Div. 1 + Div. 2, combined) {914} | PROGRAMMING | Tutorial | 1900 | |
| 2043 | Palindromes in a Tree | bitmasks data structures divide and conquer trees | Statement | E | Codecraft-18 and Codeforces Round 458 (Div. 1 + Div. 2, combined) {914} | PROGRAMMING | Tutorial | 2400 | |
| 1275 | Sum the Fibonacci | bitmasks divide and conquer dp fft math | Statement | G | Codecraft-18 and Codeforces Round 458 (Div. 1 + Div. 2, combined) {914} | PROGRAMMING | Tutorial | 2500 | |
| 2635 | Substrings in a String | bitmasks brute force data structures string suffix structures strings | Statement | F | Codecraft-18 and Codeforces Round 458 (Div. 1 + Div. 2, combined) {914} | PROGRAMMING | Tutorial | 2900 | |
| 351 | Ember and Storm's Tree Game | combinatorics dp games trees | Statement | H | Codecraft-18 and Codeforces Round 458 (Div. 1 + Div. 2, combined) {914} | PROGRAMMING | Tutorial | 2900 | |
| 8440 | Browser | implementation | Statement | B | Educational Codeforces Round 36 (Rated for Div. 2) {915} | PROGRAMMING | 57123 | 1300 | |
| 7626 | Permute Digits | dp greedy | Statement | C | Educational Codeforces Round 36 (Rated for Div. 2) {915} | PROGRAMMING | 57123 | 1700 | |
| 4211 | Almost Acyclic Graph | dfs and similar graphs | Statement | D | Educational Codeforces Round 36 (Rated for Div. 2) {915} | PROGRAMMING | 57123 | 2200 | |
| 5938 | Physical Education Lessons | data structures implementation sortings | Statement | E | Educational Codeforces Round 36 (Rated for Div. 2) {915} | PROGRAMMING | 57123 | 2300 | |
| 3304 | Imbalance Value of a Tree | data structures dsu graphs trees | Statement | F | Educational Codeforces Round 36 (Rated for Div. 2) {915} | PROGRAMMING | 57123 | 2500 | |
| 1545 | Coprime Arrays | math number theory | Statement | G | Educational Codeforces Round 36 (Rated for Div. 2) {915} | PROGRAMMING | 57123 | 2500 | |
| 16200 | Garden | implementation | Statement | A | Educational Codeforces Round 36 (Rated for Div. 2) {915} | PROGRAMMING | 57123 | 900 | |
| 9714 | Jamie and Alarm Snooze | brute force implementation math | Statement | A | Codeforces Round 457 (Div. 2) {916} | PROGRAMMING | Codeforces Round #457 (Div. 2) Editorial | 1200 | |
| 5615 | Jamie and Interesting Graph | constructive algorithms graphs shortest paths | Statement | C | Codeforces Round 457 (Div. 2) {916} | PROGRAMMING | Codeforces Round #457 (Div. 2) Editorial | 1600 | |
| 2055 | 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 | |
| 2254 | Jamie and Tree | data structures trees | Statement | E | Codeforces Round 457 (Div. 2) {916} | PROGRAMMING | Codeforces Round #457 (Div. 2) Editorial | 2600 | |
| 603 | Jamie and To-do List | data structures interactive trees | Statement | D | Codeforces Round 457 (Div. 2) {916} | PROGRAMMING | Codeforces Round #457 (Div. 2) Editorial | 2600 | |
| 4058 | MADMAX | dfs and similar dp games graphs | Statement | B | Codeforces Round 459 (Div. 1) {917} | PROGRAMMING | Codeforces Round #459 Editorial | 1800 | |
| 3692 | The Monster | dp greedy implementation math | Statement | A | Codeforces Round 459 (Div. 1) {917} | PROGRAMMING | Codeforces Round #459 Editorial | 1900 | |
| 1534 | Stranger Trees | dp math matrices trees | Statement | D | Codeforces Round 459 (Div. 1) {917} | PROGRAMMING | Codeforces Round #459 Editorial | 2600 | |
| 488 | Pollywog | combinatorics dp matrices | Statement | C | Codeforces Round 459 (Div. 1) {917} | PROGRAMMING | Codeforces Round #459 Editorial | 2800 | |
| 197 | Upside Down | data structures string suffix structures strings trees | Statement | E | Codeforces Round 459 (Div. 1) {917} | PROGRAMMING | Codeforces Round #459 Editorial | 3000 | |
| 18461 | Eleven | brute force implementation | Statement | A | Codeforces Round 459 (Div. 2) {918} | PROGRAMMING | E | 800 | |
| 20546 | Radio Station | implementation strings | Statement | B | Codeforces Round 459 (Div. 2) {918} | PROGRAMMING | 900 | ||
| 32137 | Perfect Number | binary search brute force dp implementation number theory | Statement | B | Codeforces Round 460 (Div. 2) {919} | PROGRAMMING | Codeforces Round #460 (Div. 2) Editorial | 1100 | |
| 9495 | Seat Arrangements | brute force implementation | Statement | C | Codeforces Round 460 (Div. 2) {919} | PROGRAMMING | Codeforces Round #460 (Div. 2) Editorial | 1300 | |
| 13078 | Substring | dfs and similar dp graphs | Statement | D | Codeforces Round 460 (Div. 2) {919} | PROGRAMMING | Codeforces Round #460 (Div. 2) Editorial | 1700 | |
| 2576 | Congruence Equation | chinese remainder theorem math number theory | Statement | E | Codeforces Round 460 (Div. 2) {919} | PROGRAMMING | Codeforces Round #460 (Div. 2) Editorial | 2100 | |
| 441 | A Game With Numbers | games graphs shortest paths | Statement | F | Codeforces Round 460 (Div. 2) {919} | PROGRAMMING | Codeforces Round #460 (Div. 2) Editorial | 2800 | |
| 17049 | Supermarket | brute force greedy implementation | Statement | A | Codeforces Round 460 (Div. 2) {919} | PROGRAMMING | Codeforces Round #460 (Div. 2) Editorial | 900 | |
| 8261 | Water The Garden | implementation | Statement | A | Educational Codeforces Round 37 (Rated for Div. 2) {920} | PROGRAMMING | 1100 | ||
| 8404 | Tea Queue | implementation | Statement | B | Educational Codeforces Round 37 (Rated for Div. 2) {920} | PROGRAMMING | 1300 | ||
| 10107 | 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 | |
| 9154 | SUM and REPLACE | brute force data structures dsu number theory | Statement | F | Educational Codeforces Round 37 (Rated for Div. 2) {920} | PROGRAMMING | T | 2000 | |
| 8085 | Connected Components? | data structures dfs and similar dsu graphs | Statement | E | Educational Codeforces Round 37 (Rated for Div. 2) {920} | PROGRAMMING | T | 2100 | |
| 2075 | List Of Integers | binary search bitmasks brute force combinatorics math number theory | Statement | G | Educational Codeforces Round 37 (Rated for Div. 2) {920} | PROGRAMMING | T | 2300 | |
| 838 | Tanks | dp greedy implementation | Statement | D | Educational Codeforces Round 37 (Rated for Div. 2) {920} | PROGRAMMING | 2600 | ||
| 0 | Labyrinth-9 | Statement | 09 | AIM Tech Mini Marathon 1 {921} | PROGRAMMING | 3200 | |||
| 0 | Labyrinth-8 | Statement | 08 | AIM Tech Mini Marathon 1 {921} | PROGRAMMING | 3200 | |||
| 0 | Labyrinth-7 | Statement | 07 | AIM Tech Mini Marathon 1 {921} | PROGRAMMING | 3200 | |||
| 0 | Labyrinth-6 | Statement | 06 | AIM Tech Mini Marathon 1 {921} | PROGRAMMING | 3200 | |||
| 0 | Labyrinth-5 | Statement | 05 | AIM Tech Mini Marathon 1 {921} | PROGRAMMING | 3200 | |||
| 0 | Labyrinth-4 | Statement | 04 | AIM Tech Mini Marathon 1 {921} | PROGRAMMING | 3200 | |||
| 0 | Labyrinth-3 | Statement | 03 | AIM Tech Mini Marathon 1 {921} | PROGRAMMING | 3200 | |||
| 0 | Labyrinth-2 | Statement | 02 | AIM Tech Mini Marathon 1 {921} | PROGRAMMING | 3200 | |||
| 0 | Labyrinth-14 | Statement | 14 | AIM Tech Mini Marathon 1 {921} | PROGRAMMING | 3200 | |||
| 0 | Labyrinth-13 | Statement | 13 | AIM Tech Mini Marathon 1 {921} | PROGRAMMING | 3200 | |||
| 0 | Labyrinth-12 | Statement | 12 | AIM Tech Mini Marathon 1 {921} | PROGRAMMING | 3200 | |||
| 0 | Labyrinth-11 | Statement | 11 | AIM Tech Mini Marathon 1 {921} | PROGRAMMING | 3200 | |||
| 0 | Labyrinth-10 | Statement | 10 | AIM Tech Mini Marathon 1 {921} | PROGRAMMING | 3200 | |||
| 0 | Labyrinth-1 | Statement | 01 | AIM Tech Mini Marathon 1 {921} | PROGRAMMING | 3200 | |||
| 9659 | Magic Forest | brute force | Statement | B | Codeforces Round 461 (Div. 2) {922} | PROGRAMMING | 57605 | 1300 | |
| 12724 | Cloning Toys | implementation | Statement | A | Codeforces Round 461 (Div. 2) {922} | PROGRAMMING | 57605 | 1400 | |
| 7774 | Cave Painting | brute force number theory | Statement | C | Codeforces Round 461 (Div. 2) {922} | PROGRAMMING | 57605 | 1600 | |
| 4932 | Robot Vacuum Cleaner | greedy sortings | Statement | D | Codeforces Round 461 (Div. 2) {922} | PROGRAMMING | 57605 | 1800 | |
| 2564 | Birds | dp | Statement | E | Codeforces Round 461 (Div. 2) {922} | PROGRAMMING | 57605 | 2300 | |
| 770 | Divisibility | constructive algorithms dp greedy number theory | Statement | F | Codeforces Round 461 (Div. 2) {922} | PROGRAMMING | 57605 | 2500 | |
| 7836 | Producing Snow | binary search data structures | Statement | B | VK Cup 2018 - Round 1 {923} | PROGRAMMING | VK Cup 2018 Round 1 and CF Round #470 (div. 1 & 2) editorial | 1600 | |
| 5483 | Primal Sport | math number theory | Statement | A | VK Cup 2018 - Round 1 {923} | PROGRAMMING | VK Cup 2018 Round 1 and CF Round #470 (div. 1 & 2) editorial | 1700 | |
| 4864 | 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 | |
| 1467 | Picking Strings | constructive algorithms implementation strings | Statement | D | VK Cup 2018 - Round 1 {923} | PROGRAMMING | VK Cup 2018 Round 1 and CF Round #470 (div. 1 & 2) editorial | 2500 | |
| 155 | Public Service | constructive algorithms graphs trees | Statement | F | VK Cup 2018 - Round 1 {923} | PROGRAMMING | VK Cup 2018 Round 1 and CF Round #470 (div. 1 & 2) editorial | 2900 | |
| 646 | Perpetual Subtraction | fft math matrices | Statement | E | VK Cup 2018 - Round 1 {923} | PROGRAMMING | VK Cup 2018 Round 1 and CF Round #470 (div. 1 & 2) editorial | 3100 | |
| 5251 | Mystical Mosaic | greedy implementation | Statement | A | VK Cup 2018 - Round 2 {924} | PROGRAMMING | VK Cup 2018 Round 2 and Codeforces Round #472 Editorial | 1400 | |
| 5652 | 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 | |
| 4358 | 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 | |
| 1009 | Contact ATC | Statement | D | VK Cup 2018 - Round 2 {924} | PROGRAMMING | VK Cup 2018 Round 2 and Codeforces Round #472 Editorial | 2500 | ||
| 595 | Wardrobe | Statement | E | VK Cup 2018 - Round 2 {924} | PROGRAMMING | VK Cup 2018 Round 2 and Codeforces Round #472 Editorial | 2600 | ||
| 453 | Minimal Subset Difference | dp | Statement | F | VK Cup 2018 - Round 2 {924} | PROGRAMMING | VK Cup 2018 Round 2 and Codeforces Round #472 Editorial | 3400 | |
| 3944 | Stairs and Elevators | binary search | Statement | A | VK Cup 2018 - Round 3 {925} | PROGRAMMING | Разбор VK 2018 Round 3 + Codeforces Round #477 | 1700 | |
| 2360 | Resource Distribution | binary search implementation sortings | Statement | B | VK Cup 2018 - Round 3 {925} | PROGRAMMING | Разбор VK 2018 Round 3 + Codeforces Round #477 | 1800 | |
| 1453 | Big Secret | constructive algorithms math | Statement | C | VK Cup 2018 - Round 3 {925} | PROGRAMMING | Разбор VK 2018 Round 3 + Codeforces Round #477 | 2200 | |
| 579 | Aztec Catacombs | constructive algorithms | Statement | D | VK Cup 2018 - Round 3 {925} | PROGRAMMING | Разбор VK 2018 Round 3 + Codeforces Round #477 | 2700 | |
| 594 | May Holidays | data structures trees | Statement | E | VK Cup 2018 - Round 3 {925} | PROGRAMMING | Разбор VK 2018 Round 3 + Codeforces Round #477 | 2900 | |
| 324 | Parametric Circulation | binary search flows | Statement | F | VK Cup 2018 - Round 3 {925} | PROGRAMMING | Разбор VK 2018 Round 3 + Codeforces Round #477 | 3300 | |
| 4215 | 2-3-numbers | implementation math | Statement | A | VK Cup 2018 - Wild-card Round 1 {926} | PROGRAMMING | Разбор VK Cup 2018 — Уайлд-кард Раунд 1 | 1300 | |
| 2112 | Is This a Zebra? | Statement | C | VK Cup 2018 - Wild-card Round 1 {926} | PROGRAMMING | Разбор VK Cup 2018 — Уайлд-кард Раунд 1 | 1600 | ||
| 1755 | Large Bouquets | Statement | G | VK Cup 2018 - Wild-card Round 1 {926} | PROGRAMMING | Разбор VK Cup 2018 — Уайлд-кард Раунд 1 | 1700 | ||
| 1041 | Choose Place | Statement | D | VK Cup 2018 - Wild-card Round 1 {926} | PROGRAMMING | Разбор VK Cup 2018 — Уайлд-кард Раунд 1 | 1800 |