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 ... 17 18 19 20 21 ... 43 44 45 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 1489 | Network Safety | dfs and similar dsu graphs math sortings | Statement | C | Codeforces Round 507 (Div. 1, based on Olympiad of Metropolises) {1039} | PROGRAMMING | 61668 | 2300 | |
| 851 | Timetable | constructive algorithms data structures greedy math | Statement | A | Codeforces Round 507 (Div. 1, based on Olympiad of Metropolises) {1039} | PROGRAMMING | 61668 | 2400 | |
| 2303 | You Are Given a Tree | data structures dp trees | Statement | D | Codeforces Round 507 (Div. 1, based on Olympiad of Metropolises) {1039} | PROGRAMMING | 61668 | 2700 | |
| 318 | Summer Oenothera Exhibition | data structures | Statement | E | Codeforces Round 507 (Div. 1, based on Olympiad of Metropolises) {1039} | PROGRAMMING | 61668 | 3400 | |
| 10190 | 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 | |
| 7474 | 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 | |
| 15016 | Buying a TV Set | math | Statement | B | Codeforces Round 509 (Div. 2) {1041} | PROGRAMMING | Codeforces Round #509 (Div. 2) Editorial | 1100 | |
| 10225 | 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 | |
| 6415 | Glider | binary search data structures two pointers | Statement | D | Codeforces Round 509 (Div. 2) {1041} | PROGRAMMING | Codeforces Round #509 (Div. 2) Editorial | 1700 | |
| 3850 | Tree Reconstruction | constructive algorithms data structures graphs greedy | Statement | E | Codeforces Round 509 (Div. 2) {1041} | PROGRAMMING | Codeforces Round #509 (Div. 2) Editorial | 1900 | |
| 1614 | Ray in the tube | data structures divide and conquer dp math | Statement | F | Codeforces Round 509 (Div. 2) {1041} | PROGRAMMING | Codeforces Round #509 (Div. 2) Editorial | 2400 | |
| 26830 | Heist | greedy implementation sortings | Statement | A | Codeforces Round 509 (Div. 2) {1041} | PROGRAMMING | Codeforces Round #509 (Div. 2) Editorial | 800 | |
| 19124 | Vitamins | bitmasks brute force dp implementation | Statement | B | Codeforces Round 510 (Div. 2) {1042} | PROGRAMMING | Tutorial | 1200 | |
| 14066 | Benches | binary search implementation | Statement | A | Codeforces Round 510 (Div. 2) {1042} | PROGRAMMING | Tutorial | 1200 | |
| 4967 | Array Product | constructive algorithms greedy math | Statement | C | Codeforces Round 510 (Div. 2) {1042} | PROGRAMMING | Tutorial | 1700 | |
| 7354 | Petya and Array | data structures divide and conquer two pointers | Statement | D | Codeforces Round 510 (Div. 2) {1042} | PROGRAMMING | Tutorial | 1800 | |
| 2077 | Vasya and Magic Matrix | dp math probabilities | Statement | E | Codeforces Round 510 (Div. 2) {1042} | PROGRAMMING | Tutorial | 2300 | |
| 1483 | Leaf Sets | data structures dfs and similar dsu graphs greedy sortings trees | Statement | F | Codeforces Round 510 (Div. 2) {1042} | PROGRAMMING | Tutorial | 2400 | |
| 6548 | Lost Array | implementation | Statement | B | Codeforces Round 519 by Botan Investments {1043} | PROGRAMMING | Codeforces Round #519 Editorial | 1300 | |
| 7220 | Smallest Word | constructive algorithms greedy implementation | Statement | C | Codeforces Round 519 by Botan Investments {1043} | PROGRAMMING | Codeforces Round #519 Editorial | 1500 | |
| 4760 | Mysterious Crime | brute force combinatorics math meet-in-the-middle two pointers | Statement | D | Codeforces Round 519 by Botan Investments {1043} | PROGRAMMING | Codeforces Round #519 Editorial | 1700 | |
| 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 | |
| 2984 | Make It One | bitmasks combinatorics dp math number theory shortest paths | Statement | F | Codeforces Round 519 by Botan Investments {1043} | PROGRAMMING | Codeforces Round #519 Editorial | 2500 | |
| 321 | Speckled Band | data structures divide and conquer hashing string suffix structures strings | Statement | G | Codeforces Round 519 by Botan Investments {1043} | PROGRAMMING | Codeforces Round #519 Editorial | 3500 | |
| 11275 | Elections | implementation math | Statement | A | Codeforces Round 519 by Botan Investments {1043} | PROGRAMMING | Codeforces Round #519 Editorial | 800 | |
| 3075 | The Tower is Going Home | binary search two pointers | Statement | A | Lyft Level 5 Challenge 2018 - Final Round {1044} | PROGRAMMING | Lyft Level 5 Challenge 2018 — Final Round — Editorial | 1700 | |
| 1706 | Intersecting Subtrees | dfs and similar interactive trees | Statement | B | Lyft Level 5 Challenge 2018 - Final Round {1044} | PROGRAMMING | Lyft Level 5 Challenge 2018 — Final Round — Editorial | 1900 | |
| 1409 | Optimal Polygon Perimeter | dp geometry | Statement | C | Lyft Level 5 Challenge 2018 - Final Round {1044} | PROGRAMMING | Lyft Level 5 Challenge 2018 — Final Round — Editorial | 2200 | |
| 682 | DFS | data structures | Statement | F | Lyft Level 5 Challenge 2018 - Final Round {1044} | PROGRAMMING | Lyft Level 5 Challenge 2018 — Final Round — Editorial | 2600 | |
| 1183 | Deduction Queries | data structures dsu | Statement | D | Lyft Level 5 Challenge 2018 - Final Round {1044} | PROGRAMMING | Lyft Level 5 Challenge 2018 — Final Round — Editorial | 2600 | |
| 129 | Grid Sort | implementation | Statement | E | Lyft Level 5 Challenge 2018 - Final Round {1044} | PROGRAMMING | Lyft Level 5 Challenge 2018 — Final Round — Editorial | 3100 | |
| 5453 | Palindrome Pairs | hashing strings | Statement | I | Bubble Cup 11 - Finals [Online Mirror, Div. 1] {1045} | PROGRAMMING | E | 1700 | |
| 1982 | AI robots | data structures | Statement | G | Bubble Cup 11 - Finals [Online Mirror, Div. 1] {1045} | PROGRAMMING | E | 2200 | |
| 595 | Space Isaac | hashing number theory | Statement | B | Bubble Cup 11 - Finals [Online Mirror, Div. 1] {1045} | PROGRAMMING | E | 2500 | |
| 827 | Hyperspace Highways | dfs and similar graphs trees | Statement | C | Bubble Cup 11 - Finals [Online Mirror, Div. 1] {1045} | PROGRAMMING | Tutorial (PDF) | 2500 | |
| 856 | Interstellar battle | math probabilities trees | Statement | D | Bubble Cup 11 - Finals [Online Mirror, Div. 1] {1045} | PROGRAMMING | Tutorial (PDF) | 2600 | |
| 439 | Self-exploration | math | Statement | H | Bubble Cup 11 - Finals [Online Mirror, Div. 1] {1045} | PROGRAMMING | E | 2700 | |
| 574 | Last chance | data structures flows graph matchings trees | Statement | A | Bubble Cup 11 - Finals [Online Mirror, Div. 1] {1045} | PROGRAMMING | E | 2800 | |
| 250 | Ancient civilizations | constructive algorithms geometry | Statement | E | Bubble Cup 11 - Finals [Online Mirror, Div. 1] {1045} | PROGRAMMING | E | 2800 | |
| 210 | Moonwalk challenge | data structures strings trees | Statement | J | Bubble Cup 11 - Finals [Online Mirror, Div. 1] {1045} | PROGRAMMING | E | 3000 | |
| 113 | Shady Lady | geometry math | Statement | F | Bubble Cup 11 - Finals [Online Mirror, Div. 1] {1045} | PROGRAMMING | E | 3500 | |
| 3117 | Splitting money | implementation | Statement | F | Bubble Cup 11 - Finals [Online Mirror, Div. 2] {1046} | PROGRAMMING | E | 1500 | |
| 3354 | Space Formula | greedy | Statement | C | Bubble Cup 11 - Finals [Online Mirror, Div. 2] {1046} | PROGRAMMING | E | 1500 | |
| 573 | Say Hello | geometry | Statement | I | Bubble Cup 11 - Finals [Online Mirror, Div. 2] {1046} | PROGRAMMING | E | 2300 | |
| 21261 | Little C Loves 3 I | math | Statement | A | Codeforces Round 511 (Div. 2) {1047} | PROGRAMMING | Codeforces Round #511 Editorial | 800 | |
| 18766 | Cover Points | geometry math | Statement | B | Codeforces Round 511 (Div. 2) {1047} | PROGRAMMING | Codeforces Round #511 Editorial | 900 | |
| 18784 | 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 | |
| 9871 | 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 | |
| 8150 | Bicolorings | bitmasks dp | Statement | D | Educational Codeforces Round 51 (Rated for Div. 2) {1051} | PROGRAMMING | Educational Codeforces Round 51 Editorial | 1700 | |
| 3728 | The Shortest Statement | graphs shortest paths trees | Statement | F | Educational Codeforces Round 51 (Rated for Div. 2) {1051} | PROGRAMMING | Educational Codeforces Round 51 Editorial | 2300 | |
| 1208 | Vasya and Big Integers | binary search data structures dp hashing strings | Statement | E | Educational Codeforces Round 51 (Rated for Div. 2) {1051} | PROGRAMMING | Educational Codeforces Round 51 Editorial | 2500 | |
| 480 | Distinctification | data structures dsu greedy | Statement | G | Educational Codeforces Round 51 (Rated for Div. 2) {1051} | PROGRAMMING | Educational Codeforces Round 51 Editorial | 2700 | |
| 238 | Euler tour | constructive algorithms trees | Statement | E | Codeforces Round 512 (Div. 1, based on Technocup 2019 Elimination Round 1) {1053} | PROGRAMMING | Сodeforces Round 512 (and Technocup — Elimination Round 1) Editorial | 3500 | |
| 7062 | Appending Mex | implementation | Statement | B | Mail.Ru Cup 2018 Round 1 {1054} | PROGRAMMING | Editorial | 1100 | |
| 4482 | Candies Distribution | constructive algorithms implementation | Statement | C | Mail.Ru Cup 2018 Round 1 {1054} | PROGRAMMING | Editorial | 1400 | |
| 2414 | Changing Array | greedy implementation | Statement | D | Mail.Ru Cup 2018 Round 1 {1054} | PROGRAMMING | Editorial | 1900 | |
| 514 | Chips Puzzle | constructive algorithms implementation math | Statement | E | Mail.Ru Cup 2018 Round 1 {1054} | PROGRAMMING | Editorial | 2400 | |
| 386 | Electric Scheme | flows graph matchings | Statement | F | Mail.Ru Cup 2018 Round 1 {1054} | PROGRAMMING | Editorial | 2600 | |
| 449 | New Road Network | constructive algorithms greedy math | Statement | G | Mail.Ru Cup 2018 Round 1 {1054} | PROGRAMMING | Editorial | 2900 | |
| 211 | Epic Convolution | chinese remainder theorem fft math number theory | Statement | H | Mail.Ru Cup 2018 Round 1 {1054} | PROGRAMMING | Editorial | 3400 | |
| 9586 | Elevator or Stairs? | implementation | Statement | A | Mail.Ru Cup 2018 Round 1 {1054} | PROGRAMMING | Editorial | 800 | |
| 13421 | Metro | graphs | Statement | A | Mail.Ru Cup 2018 Round 2 {1055} | PROGRAMMING | Mail.Ru Cup 2018 Round 2 — analysis | 1000 | |
| 5536 | Alice and Hairdresser | dsu implementation | Statement | B | Mail.Ru Cup 2018 Round 2 {1055} | PROGRAMMING | Mail.Ru Cup 2018 Round 2 — analysis | 1300 | |
| 2055 | Lucky Days | math number theory | Statement | C | Mail.Ru Cup 2018 Round 2 {1055} | PROGRAMMING | Mail.Ru Cup 2018 Round 2 — analysis | 1900 | |
| 648 | Refactoring | greedy implementation strings | Statement | D | Mail.Ru Cup 2018 Round 2 {1055} | PROGRAMMING | Mail.Ru Cup 2018 Round 2 — analysis | 2300 | |
| 889 | Segments on the Line | binary search dp | Statement | E | Mail.Ru Cup 2018 Round 2 {1055} | PROGRAMMING | Mail.Ru Cup 2018 Round 2 — analysis | 2400 | |
| 604 | Tree and XOR | strings trees | Statement | F | Mail.Ru Cup 2018 Round 2 {1055} | PROGRAMMING | Mail.Ru Cup 2018 Round 2 — analysis | 2800 | |
| 103 | Jellyfish Nightmare | Statement | G | Mail.Ru Cup 2018 Round 2 {1055} | PROGRAMMING | Mail.Ru Cup 2018 Round 2 — analysis | 3100 | ||
| 7302 | Determine Line | implementation | Statement | A | Mail.Ru Cup 2018 Round 3 {1056} | PROGRAMMING | Mail.Ru Cup 2018 Round 3 Editorial | 1000 | |
| 4544 | Divide Candies | math number theory | Statement | B | Mail.Ru Cup 2018 Round 3 {1056} | PROGRAMMING | Mail.Ru Cup 2018 Round 3 Editorial | 1600 | |
| 6715 | 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 | |
| 2573 | Pick Heroes | greedy implementation interactive sortings | Statement | C | Mail.Ru Cup 2018 Round 3 {1056} | PROGRAMMING | Mail.Ru Cup 2018 Round 3 Editorial | 1700 | |
| 2795 | Check Transcription | brute force data structures hashing strings | Statement | E | Mail.Ru Cup 2018 Round 3 {1056} | PROGRAMMING | Mail.Ru Cup 2018 Round 3 Editorial | 2100 | |
| 703 | Write The Contest | binary search dp math | Statement | F | Mail.Ru Cup 2018 Round 3 {1056} | PROGRAMMING | Mail.Ru Cup 2018 Round 3 Editorial | 2400 | |
| 300 | Take Metro | brute force data structures graphs | Statement | G | Mail.Ru Cup 2018 Round 3 {1056} | PROGRAMMING | Mail.Ru Cup 2018 Round 3 Editorial | 2800 | |
| 253 | Detect Robots | data structures strings | Statement | H | Mail.Ru Cup 2018 Round 3 {1056} | PROGRAMMING | Mail.Ru Cup 2018 Round 3 Editorial | 3100 | |
| 7448 | Bmail Computer Network | *special dfs and similar trees | Statement | A | Mail.Ru Cup 2018 - Practice Round {1057} | PROGRAMMING | 1700 | ||
| 1970 | DDoS | *special brute force | Statement | B | Mail.Ru Cup 2018 - Practice Round {1057} | PROGRAMMING | 1800 | ||
| 1169 | Tanya and Colored Candies | *special dp | Statement | C | Mail.Ru Cup 2018 - Practice Round {1057} | PROGRAMMING | 2300 | ||
| 13798 | Cashier | implementation | Statement | A | Codeforces Round 514 (Div. 2) {1059} | PROGRAMMING | Codeforces Round #514 (Div. 2) Editorial | 1000 | |
| 7580 | Forgery | implementation | Statement | B | Codeforces Round 514 (Div. 2) {1059} | PROGRAMMING | Codeforces Round #514 (Div. 2) Editorial | 1300 | |
| 7531 | Sequence Transformation | constructive algorithms math | Statement | C | Codeforces Round 514 (Div. 2) {1059} | PROGRAMMING | Codeforces Round #514 (Div. 2) Editorial | 1500 | |
| 2992 | Nature Reserve | binary search geometry ternary search | Statement | D | Codeforces Round 514 (Div. 2) {1059} | PROGRAMMING | Codeforces Round #514 (Div. 2) Editorial | 2200 | |
| 1620 | 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 | |
| 9492 | 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 | |
| 5205 | Maximum Subrectangle | binary search implementation two pointers | Statement | C | 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) | 1600 | |
| 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 | |
| 3493 | Sergey and Subway | dfs and similar dp trees | Statement | E | 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) | 2000 | |
| 787 | Shrinking Tree | combinatorics dp | Statement | F | 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) | 2800 | |
| 245 | Sophisticated Device | constructive algorithms | Statement | H | Codeforces Round 513 by Barcelona Bootcamp (rated, Div. 1 + Div. 2) {1060} | PROGRAMMING | User editorial for Codeforces Round 513 by Barcelona Bootcamp (rated, Div. 1 + Div. 2) | 2900 | |
| 259 | Balls and Pockets | data structures | Statement | G | 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) | 3300 | |
| 15703 | Phone Numbers | brute force | Statement | A | 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) | 800 | |
| 7639 | Views Matter | greedy implementation sortings | Statement | B | Codeforces Round 523 (Div. 2) {1061} | PROGRAMMING | Tutorial (en) | 1500 | |
| 10697 | Multiplicity | data structures dp implementation math number theory | Statement | C | Codeforces Round 523 (Div. 2) {1061} | PROGRAMMING | Tutorial (en) | 1700 | |
| 2559 | TV Shows | data structures greedy implementation sortings | Statement | D | Codeforces Round 523 (Div. 2) {1061} | PROGRAMMING | Tutorial (en) | 2000 | |
| 885 | Lost Root | interactive probabilities | Statement | F | Codeforces Round 523 (Div. 2) {1061} | PROGRAMMING | Tutorial (en) | 2400 | |
| 601 | Politics | flows graphs | Statement | E | Codeforces Round 523 (Div. 2) {1061} | PROGRAMMING | Tutorial (en) | 2800 | |
| 24066 | Coins | greedy implementation math | Statement | A | Codeforces Round 523 (Div. 2) {1061} | PROGRAMMING | Tutorial (en) | 800 | |
| 9304 | A Prank | greedy implementation | Statement | A | Codeforces Round 520 (Div. 2) {1062} | PROGRAMMING | Tutorial | 1400 | |
| 9877 | Math | greedy math number theory | Statement | B | Codeforces Round 520 (Div. 2) {1062} | PROGRAMMING | Tutorial | 1600 | |
| 5946 | Banh-mi | greedy implementation math | Statement | C | Codeforces Round 520 (Div. 2) {1062} | PROGRAMMING | Tutorial | 1600 | |
| 4167 | Fun with Integers | dfs and similar graphs implementation math | Statement | D | Codeforces Round 520 (Div. 2) {1062} | PROGRAMMING | Tutorial | 1800 | |
| 2051 | Company | binary search data structures dfs and similar greedy trees | Statement | E | Codeforces Round 520 (Div. 2) {1062} | PROGRAMMING | Tutorial | 2300 | |
| 981 | Upgrading Cities | dfs and similar graphs | Statement | F | Codeforces Round 520 (Div. 2) {1062} | PROGRAMMING | Tutorial | 3000 | |
| 11052 | Oh Those Palindromes | constructive algorithms strings | Statement | A | Codeforces Round 516 (Div. 1, by Moscow Team Olympiad) {1063} | PROGRAMMING | Editorial | 1400 | |
| 9199 | Labyrinth | graphs shortest paths | Statement | B | Codeforces Round 516 (Div. 1, by Moscow Team Olympiad) {1063} | PROGRAMMING | 1800 | ||
| 3275 | Dwarves, Hats and Extrasensory Abilities | binary search constructive algorithms geometry interactive | Statement | C | Codeforces Round 516 (Div. 1, by Moscow Team Olympiad) {1063} | PROGRAMMING | 1900 | ||
| 472 | Candies for Children | brute force math | Statement | D | Codeforces Round 516 (Div. 1, by Moscow Team Olympiad) {1063} | PROGRAMMING | Editorial | 2800 | |
| 1009 | String Journey | data structures dp string suffix structures | Statement | F | Codeforces Round 516 (Div. 1, by Moscow Team Olympiad) {1063} | PROGRAMMING | Editorial | 3000 | |
| 401 | Lasers and Mirrors | constructive algorithms math | Statement | E | Codeforces Round 516 (Div. 1, by Moscow Team Olympiad) {1063} | PROGRAMMING | Editorial | 3000 | |
| 7935 | Equations of Mathematical Magic | math | Statement | B | Codeforces Round 516 (Div. 2, by Moscow Team Olympiad) {1064} | PROGRAMMING | Codeforces Round #516 (by Moscow Team Olympiad) — Editorial | 1200 | |
| 25101 | Make a triangle! | brute force geometry math | Statement | A | Codeforces Round 516 (Div. 2, by Moscow Team Olympiad) {1064} | PROGRAMMING | Codeforces Round #516 (by Moscow Team Olympiad) — Editorial | 700 | |
| 11594 | Vasya and Isolated Vertices | constructive algorithms graphs | Statement | B | Educational Codeforces Round 52 (Rated for Div. 2) {1065} | PROGRAMMING | Educational Codeforces Round 52 Editorial | 1300 | |
| 8286 | Make It Equal | greedy | Statement | C | Educational Codeforces Round 52 (Rated for Div. 2) {1065} | PROGRAMMING | Educational Codeforces Round 52 Editorial | 1500 | |
| 1445 | Three Pieces | dfs and similar dp shortest paths | Statement | D | Educational Codeforces Round 52 (Rated for Div. 2) {1065} | PROGRAMMING | Educational Codeforces Round 52 Editorial | 2200 | |
| 1279 | Side Transmutations | combinatorics strings | Statement | E | Educational Codeforces Round 52 (Rated for Div. 2) {1065} | PROGRAMMING | Educational Codeforces Round 52 Editorial | 2200 | |
| 1324 | Up and Down the Tree | dfs and similar dp trees | Statement | F | Educational Codeforces Round 52 (Rated for Div. 2) {1065} | PROGRAMMING | Educational Codeforces Round 52 Editorial | 2500 | |
| 312 | Fibonacci Suffix | strings | Statement | G | Educational Codeforces Round 52 (Rated for Div. 2) {1065} | PROGRAMMING | Educational Codeforces Round 52 Editorial | 2800 | |
| 15260 | Vasya and Chocolate | implementation math | Statement | A | Educational Codeforces Round 52 (Rated for Div. 2) {1065} | PROGRAMMING | Educational Codeforces Round 52 Editorial | 800 | |
| 15416 | Vova and Train | math | Statement | A | Codeforces Round 515 (Div. 3) {1066} | PROGRAMMING | 62419 | 1100 | |
| 10351 | Books Queries | implementation | Statement | C | Codeforces Round 515 (Div. 3) {1066} | PROGRAMMING | 62419 | 1400 | |
| 9374 | Heaters | greedy two pointers | Statement | B | Codeforces Round 515 (Div. 3) {1066} | PROGRAMMING | 62419 | 1500 | |
| 5938 | Boxes Packing | binary search implementation | Statement | D | Codeforces Round 515 (Div. 3) {1066} | PROGRAMMING | 62419 | 1700 | |
| 6564 | Binary Numbers AND Sum | data structures implementation math | Statement | E | Codeforces Round 515 (Div. 3) {1066} | PROGRAMMING | 62419 | 1700 | |
| 2264 | Yet another 2D Walking | dp | Statement | F | Codeforces Round 515 (Div. 3) {1066} | PROGRAMMING | 62419 | 2300 | |
| 2859 | Multihedgehog | dfs and similar graphs shortest paths | Statement | B | Codeforces Round 518 (Div. 1) [Thanks, Mail.Ru!] {1067} | PROGRAMMING | Tutorial | 2000 | |
| 3129 | Array Without Local Maximums | dp | Statement | A | Codeforces Round 518 (Div. 1) [Thanks, Mail.Ru!] {1067} | PROGRAMMING | Tutorial | 2000 | |
| 552 | Random Forest Rank | dp graph matchings math trees | Statement | E | Codeforces Round 518 (Div. 1) [Thanks, Mail.Ru!] {1067} | PROGRAMMING | Tutorial | 2800 | |
| 713 | Knights | constructive algorithms | Statement | C | Codeforces Round 518 (Div. 1) [Thanks, Mail.Ru!] {1067} | PROGRAMMING | Tutorial | 2800 | |
| 490 | Computer Game | dp greedy math probabilities | Statement | D | Codeforces Round 518 (Div. 1) [Thanks, Mail.Ru!] {1067} | PROGRAMMING | Tutorial | 2800 | |
| 12980 | LCM | math number theory | Statement | B | Codeforces Round 518 (Div. 2) [Thanks, Mail.Ru!] {1068} | PROGRAMMING | E | 1200 | |
| 7257 | Birthday | math | Statement | A | Codeforces Round 518 (Div. 2) [Thanks, Mail.Ru!] {1068} | PROGRAMMING | E | 1300 | |
| 3347 | Colored Rooks | constructive algorithms graphs | Statement | C | Codeforces Round 518 (Div. 2) [Thanks, Mail.Ru!] {1068} | PROGRAMMING | E | 1700 | |
| 5371 | Video Posts | implementation | Statement | K | 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 | 1200 | |
| 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 | |
| 3851 | BerOS File Suggestion | brute force implementation | Statement | H | 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 | |
| 2282 | 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 | |
| 2609 | Find a Number | dp graphs number theory shortest paths | Statement | A | 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 | 2200 | |
| 1456 | Getting Deals Done | binary search data structures | Statement | E | 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 | 2300 | |
| 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 | |
| 785 | Streets and Avenues in Berhattan | dp | Statement | J | 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 | 2600 | |
| 778 | Privatization of Roads in Berland | flows graphs | Statement | I | 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 | 2600 | |
| 380 | Odd Federalization | constructive algorithms | Statement | L | 2018-2019 ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {1070} | PROGRAMMING | Solution to problem M. Algoland and Berland of 2018-2019 ICPC, NEERC | 2800 | |
| 89 | Algoland and Berland | constructive algorithms divide and conquer geometry | Statement | M | 2018-2019 ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {1070} | PROGRAMMING | Solution to problem M. Algoland and Berland of 2018-2019 ICPC, NEERC | 3100 | |
| 159 | Rain Protection | binary search geometry | Statement | E | Codeforces Round 517 (Div. 1, based on Technocup 2019 Elimination Round 2) {1071} | PROGRAMMING | Разбор задач Отборочного Раунда 2 Технокубка 2019 и Codeforces Round #517 | 3500 | |
| 17029 | Diverse Substring | implementation strings | Statement | A | Educational Codeforces Round 53 (Rated for Div. 2) {1073} | PROGRAMMING | 62742 | 1000 | |
| 11215 | Vasya and Books | implementation math | Statement | B | Educational Codeforces Round 53 (Rated for Div. 2) {1073} | PROGRAMMING | 62742 | 1100 | |
| 6717 | Berland Fair | binary search brute force data structures greedy | Statement | D | Educational Codeforces Round 53 (Rated for Div. 2) {1073} | PROGRAMMING | 62742 | 1700 | |
| 5422 | Vasya and Robot | binary search two pointers | Statement | C | Educational Codeforces Round 53 (Rated for Div. 2) {1073} | PROGRAMMING | 62742 | 1800 | |
| 3551 | Segment Sum | bitmasks combinatorics dp math | Statement | E | Educational Codeforces Round 53 (Rated for Div. 2) {1073} | PROGRAMMING | 62742 | 2300 | |
| 1109 | Yet Another LCP Problem | data structures string suffix structures | Statement | G | Educational Codeforces Round 53 (Rated for Div. 2) {1073} | PROGRAMMING | 62742 | 2700 | |
| 592 | Choosing Two Paths | dfs and similar dp greedy trees | Statement | F | Educational Codeforces Round 53 (Rated for Div. 2) {1073} | PROGRAMMING | 62742 | 2800 | |
| 4523 | Taxi drivers and Lyft | implementation sortings | Statement | B | Lyft Level 5 Challenge 2018 - Final Round (Open Div. 2) {1075} | PROGRAMMING | E | 1200 | |
| 9129 | The King's Race | implementation math | Statement | A | Lyft Level 5 Challenge 2018 - Final Round (Open Div. 2) {1075} | PROGRAMMING | E | 900 | |
| 14086 | Minimizing the String | greedy strings | Statement | A | Educational Codeforces Round 54 (Rated for Div. 2) {1076} | PROGRAMMING | E | 1200 | |
| 14561 | Divisor Subtraction | implementation math number theory | Statement | B | Educational Codeforces Round 54 (Rated for Div. 2) {1076} | PROGRAMMING | E | 1200 | |
| 13404 | Meme Problem | binary search math | Statement | C | Educational Codeforces Round 54 (Rated for Div. 2) {1076} | PROGRAMMING | E | 1300 | |
| 5891 | Edge Deletion | graphs greedy shortest paths | Statement | D | Educational Codeforces Round 54 (Rated for Div. 2) {1076} | PROGRAMMING | E | 1800 | |
| 4141 | Vasya and a Tree | data structures trees | Statement | E | Educational Codeforces Round 54 (Rated for Div. 2) {1076} | PROGRAMMING | E | 1900 | |
| 726 | Summer Practice Report | dp greedy | Statement | F | Educational Codeforces Round 54 (Rated for Div. 2) {1076} | PROGRAMMING | E | 2500 | |
| 720 | Array Game | data structures games | Statement | G | Educational Codeforces Round 54 (Rated for Div. 2) {1076} | PROGRAMMING | E | 2700 | |
| 20375 | Disturbed People | greedy | Statement | B | Codeforces Round 521 (Div. 3) {1077} | PROGRAMMING | Codeforces Round #521 (Div. 3) Editorial | 1000 | |
| 25483 | Good Array | Statement | C | Codeforces Round 521 (Div. 3) {1077} | PROGRAMMING | Codeforces Round #521 (Div. 3) Editorial | 1400 | ||
| 10451 | Cutting Out | binary search sortings | Statement | D | Codeforces Round 521 (Div. 3) {1077} | PROGRAMMING | Codeforces Round #521 (Div. 3) Editorial | 1600 | |
| 5085 | Thematic Contests | greedy sortings | Statement | E | Codeforces Round 521 (Div. 3) {1077} | PROGRAMMING | Codeforces Round #521 (Div. 3) Editorial | 1800 | |
| 5323 | Pictures with Kittens (easy version) | dp | Statement | F1 | Codeforces Round 521 (Div. 3) {1077} | PROGRAMMING | Codeforces Round #521 (Div. 3) Editorial | 2100 | |
| 4161 | Pictures with Kittens (hard version) | data structures dp | Statement | F2 | Codeforces Round 521 (Div. 3) {1077} | PROGRAMMING | Codeforces Round #521 (Div. 3) Editorial | 2300 | |
| 32215 | Frog Jumping | math | Statement | A | Codeforces Round 521 (Div. 3) {1077} | PROGRAMMING | Codeforces Round #521 (Div. 3) Editorial | 700 | |
| 103 | Negative Time Summation | constructive algorithms | Statement | E | Codeforces Round 522 (Div. 1, based on Technocup 2019 Elimination Round 3) {1078} | PROGRAMMING | Codeforces Round #522 and Technocup 2019 Elimination Round 3 Editorial | 3500 | |
| 4217 | Masha and two friends | implementation | Statement | C | Codeforces Round 524 (Div. 2) {1080} | PROGRAMMING | Codeforces Round #524 (Div. 2) Editorial | 1600 | |
| 1664 | Olya and magical square | constructive algorithms implementation math | Statement | D | Codeforces Round 524 (Div. 2) {1080} | PROGRAMMING | Codeforces Round #524 (Div. 2) Editorial | 2000 | |
| 1308 | Sonya and Matrix Beauty | strings | Statement | E | Codeforces Round 524 (Div. 2) {1080} | PROGRAMMING | Codeforces Round #524 (Div. 2) Editorial | 2400 | |
| 915 | Katya and Segments Sets | data structures interactive sortings | Statement | F | Codeforces Round 524 (Div. 2) {1080} | PROGRAMMING | Codeforces Round #524 (Div. 2) Editorial | 2700 | |
| 19165 | Petya and Origami | math | Statement | A | Codeforces Round 524 (Div. 2) {1080} | PROGRAMMING | Codeforces Round #524 (Div. 2) Editorial | 700 | |
| 12622 | Margarite and the best present | math | Statement | B | Codeforces Round 524 (Div. 2) {1080} | PROGRAMMING | Codeforces Round #524 (Div. 2) Editorial | 900 | |
| 4668 | Farewell Party | constructive algorithms implementation | Statement | B | Avito Cool Challenge 2018 {1081} | PROGRAMMING | 63888 | 1500 | |
| 8475 | Colorful Bricks | combinatorics dp math | Statement | C | Avito Cool Challenge 2018 {1081} | PROGRAMMING | 63888 | 1600 | |
| 4639 | Maximum Distance | dsu graphs shortest paths sortings | Statement | D | Avito Cool Challenge 2018 {1081} | PROGRAMMING | 63888 | 1800 | |
| 2818 | Missing Numbers | binary search constructive algorithms greedy math number theory | Statement | E | Avito Cool Challenge 2018 {1081} | PROGRAMMING | 63888 | 1900 | |
| 505 | Tricky Interactor | constructive algorithms implementation interactive | Statement | F | Avito Cool Challenge 2018 {1081} | PROGRAMMING | 63888 | 2500 | |
| 433 | Mergesort Strikes Back | math probabilities | Statement | G | Avito Cool Challenge 2018 {1081} | PROGRAMMING | 63888 | 3000 | |
| 130 | Palindromic Magic | data structures hashing strings | Statement | H | Avito Cool Challenge 2018 {1081} | PROGRAMMING | 63888 | 3500 | |
| 13271 | Definite Game | constructive algorithms math | Statement | A | Avito Cool Challenge 2018 {1081} | PROGRAMMING | 63888 | 800 | |
| 9268 | Vasya and Book | implementation math | Statement | A | Educational Codeforces Round 55 (Rated for Div. 2) {1082} | PROGRAMMING | 63544 | 1200 | |
| 8026 | 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 | |
| 4088 | Maximum Diameter Graph | constructive algorithms graphs implementation | Statement | D | Educational Codeforces Round 55 (Rated for Div. 2) {1082} | PROGRAMMING | 63544 | 1800 | |
| 6318 | Increasing Frequency | binary search dp greedy | Statement | E | Educational Codeforces Round 55 (Rated for Div. 2) {1082} | PROGRAMMING | 63544 | 2000 | |
| 2676 | Petya and Graph | flows graphs | Statement | G | Educational Codeforces Round 55 (Rated for Div. 2) {1082} | PROGRAMMING | 63544 | 2400 | |
| 532 | Speed Dial | dp strings trees | Statement | F | Educational Codeforces Round 55 (Rated for Div. 2) {1082} | PROGRAMMING | 63544 | 2900 | |
| 6259 | The Fair Nut and the Best Path | data structures dp trees | Statement | A | Codeforces Round 526 (Div. 1) {1083} | PROGRAMMING | 63753 | 1800 | |
| 2142 | The Fair Nut and Strings | greedy strings | Statement | B | Codeforces Round 526 (Div. 1) {1083} | PROGRAMMING | 63753 | 2100 | |
| 5584 | The Fair Nut and Rectangles | data structures dp geometry | Statement | E | Codeforces Round 526 (Div. 1) {1083} | PROGRAMMING | 63753 | 2400 | |
| 1110 | Max Mex | data structures trees | Statement | C | Codeforces Round 526 (Div. 1) {1083} | PROGRAMMING | 63753 | 2800 | |
| 315 | The Fair Nut and Amusing Xor | data structures | Statement | F | Codeforces Round 526 (Div. 1) {1083} | PROGRAMMING | 63753 | 3100 | |
| 355 | The Fair Nut's getting crazy | data structures implementation | Statement | D | Codeforces Round 526 (Div. 1) {1083} | PROGRAMMING | 63753 | 3400 | |
| 8222 | The Fair Nut and Elevator | brute force implementation | Statement | A | Codeforces Round 526 (Div. 2) {1084} | PROGRAMMING | 63753 | 1000 | |
| 8268 | Kvass and the Fair Nut | greedy implementation | Statement | B | Codeforces Round 526 (Div. 2) {1084} | PROGRAMMING | 63753 | 1200 | |
| 11601 | The Fair Nut and String | combinatorics dp implementation | Statement | C | Codeforces Round 526 (Div. 2) {1084} | PROGRAMMING | 63753 | 1500 | |
| 10077 | Div Times Mod | math | Statement | B | Technocup 2019 - Elimination Round 4 {1085} | PROGRAMMING | Technocup 2019 — Elimination Round 4 + Codeforces Round 528: editorial | 1200 | |
| 5643 | Connect Three | implementation math | Statement | C | Technocup 2019 - Elimination Round 4 {1085} | PROGRAMMING | Technocup 2019 — Elimination Round 4 + Codeforces Round 528: editorial | 1600 | |
| 5907 | Minimum Diameter Tree | constructive algorithms implementation trees | Statement | D | Technocup 2019 - Elimination Round 4 {1085} | PROGRAMMING | Technocup 2019 — Elimination Round 4 + Codeforces Round 528: editorial | 1700 | |
| 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 | |
| 708 | Beautiful Matrix | combinatorics data structures dp | Statement | G | Technocup 2019 - Elimination Round 4 {1085} | PROGRAMMING | Technocup 2019 — Elimination Round 4 + Codeforces Round 528: editorial | 2600 | |
| 710 | Rock-Paper-Scissors Champion | Statement | F | Technocup 2019 - Elimination Round 4 {1085} | PROGRAMMING | Technocup 2019 — Elimination Round 4 + Codeforces Round 528: editorial | 2700 | ||
| 12693 | Right-Left Cipher | implementation strings | Statement | A | Technocup 2019 - Elimination Round 4 {1085} | PROGRAMMING | Technocup 2019 — Elimination Round 4 + Codeforces Round 528: editorial | 900 | |
| 314 | Forest Fires | math | Statement | F | Codeforces Round 528 (Div. 1, based on Technocup 2019 Elimination Round 4) {1086} | PROGRAMMING | Technocup 2019 — Elimination Round 4 + Codeforces Round 528: editorial | 3400 | |
| 13579 | Ehab and subtraction | implementation sortings | Statement | B | Codeforces Round 525 (Div. 2) {1088} | PROGRAMMING | Codeforces round #525 editorial | 1000 | |
| 8517 | Ehab and a 2-operation task | constructive algorithms greedy math | Statement | C | Codeforces Round 525 (Div. 2) {1088} | PROGRAMMING | Codeforces round #525 editorial | 1400 | |
| 3162 | Ehab and another another xor problem | bitmasks constructive algorithms implementation interactive | Statement | D | Codeforces Round 525 (Div. 2) {1088} | PROGRAMMING | Codeforces round #525 editorial | 2000 | |
| 1616 | Ehab and a component choosing problem | dp greedy math trees | Statement | E | Codeforces Round 525 (Div. 2) {1088} | PROGRAMMING | Codeforces round #525 editorial | 2400 | |
| 597 | Ehab and a weird weight formula | data structures trees | Statement | F | Codeforces Round 525 (Div. 2) {1088} | PROGRAMMING | Codeforces round #525 editorial | 3000 | |
| 17631 | Ehab and another construction problem | brute force constructive algorithms | Statement | A | Codeforces Round 525 (Div. 2) {1088} | PROGRAMMING | Codeforces round #525 editorial | 800 | |
| 4713 | Lazyland | Statement | L | 2018-2019 ICPC, NEERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1089} | PROGRAMMING | T | 1200 | ||
| 3220 | Guest Student | math | Statement | G | 2018-2019 ICPC, NEERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1089} | PROGRAMMING | T | 1600 | |
| 2138 | Easy Chess | constructive algorithms | Statement | E | 2018-2019 ICPC, NEERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1089} | PROGRAMMING | 1800 | ||
| 2149 | Fractions | math | Statement | F | 2018-2019 ICPC, NEERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1089} | PROGRAMMING | T | 2000 | |
| 1273 | Alice the Fan | dp | Statement | A | 2018-2019 ICPC, NEERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1089} | PROGRAMMING | T | 2300 | |
| 1242 | King Kog's Reception | data structures | Statement | K | 2018-2019 ICPC, NEERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1089} | PROGRAMMING | T | 2400 | |
| 654 | Minegraphed | constructive algorithms graphs | Statement | M | 2018-2019 ICPC, NEERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1089} | PROGRAMMING | 2600 | ||
| 459 | Interval-Free Permutations | Statement | I | 2018-2019 ICPC, NEERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1089} | PROGRAMMING | T | 2800 | ||
| 458 | Cactus Search | interactive | Statement | C | 2018-2019 ICPC, NEERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1089} | PROGRAMMING | 2800 | ||
| 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 | |
| 111 | Distance Sum | graphs | Statement | D | 2018-2019 ICPC, NEERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1089} | PROGRAMMING | 3400 | ||
| 127 | Harder Satisfiability | 2-sat dfs and similar graphs | Statement | H | 2018-2019 ICPC, NEERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1089} | PROGRAMMING | 3500 | ||
| 249 | Bimatching | graphs | Statement | B | 2018-2019 ICPC, NEERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1089} | PROGRAMMING | 3500 | ||
| 7153 | The Pleasant Walk | implementation | Statement | M | 2018-2019 Russia Open High School Programming Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1090} | PROGRAMMING | ru-olymp-team-russia-2018-presentation.pdf | 1200 | |
| 4936 | 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 | |
| 2363 | Similar Arrays | constructive algorithms | Statement | D | 2018-2019 Russia Open High School Programming Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1090} | PROGRAMMING | ru-olymp-team-russia-2018-presentation.pdf | 1900 | |
| 1550 | LaTeX Expert | Statement | B | 2018-2019 Russia Open High School Programming Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1090} | PROGRAMMING | 2000 | |||
| 1197 | Right Expansion Of The Mind | math | Statement | K | 2018-2019 Russia Open High School Programming Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1090} | PROGRAMMING | 2100 | ||
| 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 | ||
| 1178 | Minimal Product | Statement | I | 2018-2019 Russia Open High School Programming Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1090} | PROGRAMMING | 2200 | |||
| 676 | Horseback Riding | Statement | E | 2018-2019 Russia Open High School Programming Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1090} | PROGRAMMING | 2400 | |||
| 569 | New Year Presents | Statement | C | 2018-2019 Russia Open High School Programming Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1090} | PROGRAMMING | ru-olymp-team-russia-2018-presentation.pdf | 2500 | ||
| 603 | Two Prefixes | strings | Statement | J | 2018-2019 Russia Open High School Programming Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1090} | PROGRAMMING | ru-olymp-team-russia-2018-presentation.pdf | 2700 | |
| 374 | How to Learn You Score | constructive algorithms | Statement | F | 2018-2019 Russia Open High School Programming Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1090} | PROGRAMMING | 2800 | ||
| 108 | Linearization | Statement | H | 2018-2019 Russia Open High School Programming Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1090} | PROGRAMMING | 3000 | |||
| 123 | Combostone | games implementation | Statement | G | 2018-2019 Russia Open High School Programming Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1090} | PROGRAMMING | 3000 | ||
| 11009 | New Year and the Treasure Geolocation | brute force constructive algorithms greedy implementation | Statement | B | Good Bye 2018 {1091} | PROGRAMMING | Editorial | 1200 | |
| 10551 | New Year and the Sphere Transmission | math number theory | Statement | C | Good Bye 2018 {1091} | PROGRAMMING | Editorial | 1400 | |
| 7466 | New Year and the Permutation Concatenation | combinatorics dp math | Statement | D | Good Bye 2018 {1091} | PROGRAMMING | Editorial | 1700 | |
| 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 | |
| 891 | New Year and the Mallard Expedition | constructive algorithms greedy | Statement | F | Good Bye 2018 {1091} | PROGRAMMING | Editorial | 2600 | |
| 495 | New Year and the Tricolore Recreation | games | Statement | H | Good Bye 2018 {1091} | PROGRAMMING | Editorial | 3100 | |
| 227 | New Year and the Factorisation Collaboration | interactive math number theory | Statement | G | Good Bye 2018 {1091} | PROGRAMMING | Editorial | 3100 | |
| 18558 | New Year and the Christmas Ornament | brute force implementation math | Statement | A | Good Bye 2018 {1091} | PROGRAMMING | Editorial | 900 |