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 ... 22 23 24 25 26 ... 44 45 46 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 19487 | Deadline | binary search brute force math ternary search | Statement | A | Educational Codeforces Round 80 (Rated for Div. 2) {1288} | PROGRAMMING | Educational Codeforces Round 80 Editorial | 1100 | |
| 15934 | Two Arrays | combinatorics dp | Statement | C | Educational Codeforces Round 80 (Rated for Div. 2) {1288} | PROGRAMMING | Educational Codeforces Round 80 Editorial | 1600 | |
| 8727 | Minimax Problem | binary search bitmasks | Statement | D | Educational Codeforces Round 80 (Rated for Div. 2) {1288} | PROGRAMMING | Educational Codeforces Round 80 Editorial | 2000 | |
| 4249 | Messenger Simulator | data structures two pointers | Statement | E | Educational Codeforces Round 80 (Rated for Div. 2) {1288} | PROGRAMMING | Educational Codeforces Round 80 Editorial | 2100 | |
| 764 | Red-Blue Graph | constructive algorithms flows | Statement | F | Educational Codeforces Round 80 (Rated for Div. 2) {1288} | PROGRAMMING | Educational Codeforces Round 80 Editorial | 2900 | |
| 9045 | Mind Control | brute force data structures implementation | Statement | A | Codeforces Round 616 (Div. 1) {1290} | PROGRAMMING | 500.0 | Codeforces Round #616 Editorial | 1700 |
| 7464 | Irreducible Anagrams | binary search constructive algorithms data structures strings two pointers | Statement | B | Codeforces Round 616 (Div. 1) {1290} | PROGRAMMING | 1000.0 | Codeforces Round #616 Editorial | 1900 |
| 2118 | Prefix Enlightenment | dfs and similar dsu graphs | Statement | C | Codeforces Round 616 (Div. 1) {1290} | PROGRAMMING | 1750.0 | Codeforces Round #616 Editorial | 2400 |
| 1023 | Coffee Varieties (hard version) | constructive algorithms graphs interactive | Statement | D | Codeforces Round 616 (Div. 1) {1290} | PROGRAMMING | 2500.0 | Codeforces Round #616 Editorial | 2900 |
| 699 | Cartesian Tree | data structures | Statement | E | Codeforces Round 616 (Div. 1) {1290} | PROGRAMMING | 3000.0 | Codeforces Round #616 Editorial | 3200 |
| 613 | Making Shapes | dp | Statement | F | Codeforces Round 616 (Div. 1) {1290} | PROGRAMMING | 3250.0 | Codeforces Round #616 Editorial | 3500 |
| 20943 | Even But Not Even | greedy math strings | Statement | A | Codeforces Round 616 (Div. 2) {1291} | PROGRAMMING | 500.0 | Codeforces Round #616 Editorial | 1000 |
| 15565 | Array Sharpening | greedy implementation | Statement | B | Codeforces Round 616 (Div. 2) {1291} | PROGRAMMING | 1000.0 | Codeforces Round #616 Editorial | 1300 |
| 818 | Coffee Varieties (easy version) | graphs interactive | Statement | F | Codeforces Round 616 (Div. 2) {1291} | PROGRAMMING | 3000.0 | Codeforces Round #616 Editorial | 2700 |
| 14017 | NEKO's Maze Game | data structures dsu implementation | Statement | A | Codeforces Round 614 (Div. 1) {1292} | PROGRAMMING | 500.0 | Codeforces Round #614 Editorial | 1400 |
| 6843 | Aroma's Search | brute force constructive algorithms geometry greedy implementation | Statement | B | Codeforces Round 614 (Div. 1) {1292} | PROGRAMMING | 750.0 | Codeforces Round #614 Editorial | 1800 |
| 2412 | Xenon's Attack on the Gangs | combinatorics dfs and similar dp greedy trees | Statement | C | Codeforces Round 614 (Div. 1) {1292} | PROGRAMMING | 1250.0 | Codeforces Round #614 Editorial | 2300 |
| 1069 | Chaotic V. | dp graphs greedy math number theory trees | Statement | D | Codeforces Round 614 (Div. 1) {1292} | PROGRAMMING | 1750.0 | Codeforces Round #614 Editorial | 2700 |
| 448 | Nora's Toy Boxes | bitmasks combinatorics dp | Statement | F | Codeforces Round 614 (Div. 1) {1292} | PROGRAMMING | 2750.0 | Codeforces Round #614 Editorial | 3400 |
| 480 | Rin and The Unknown Flower | constructive algorithms greedy interactive math | Statement | E | Codeforces Round 614 (Div. 1) {1292} | PROGRAMMING | 2250.0 | Codeforces Round #614 Editorial | 3500 |
| 22481 | JOE is on TV! | combinatorics greedy math | Statement | B | Codeforces Round 614 (Div. 2) {1293} | PROGRAMMING | 750.0 | Codeforces Round #614 Editorial | 1000 |
| 16265 | ConneR and the A.R.C. Markland-N | binary search brute force implementation | Statement | A | Codeforces Round 614 (Div. 2) {1293} | PROGRAMMING | 500.0 | Codeforces Round #614 Editorial | 1100 |
| 23145 | Collecting Packages | implementation sortings | Statement | B | Codeforces Round 615 (Div. 3) {1294} | PROGRAMMING | Codeforces Round #615 (Div. 3) Editorial | 1200 | |
| 49325 | Product of Three Numbers | greedy math number theory | Statement | C | Codeforces Round 615 (Div. 3) {1294} | PROGRAMMING | Codeforces Round #615 (Div. 3) Editorial | 1300 | |
| 12846 | MEX maximizing | data structures greedy implementation math | Statement | D | Codeforces Round 615 (Div. 3) {1294} | PROGRAMMING | Codeforces Round #615 (Div. 3) Editorial | 1600 | |
| 5278 | Obtain a Permutation | greedy implementation math | Statement | E | Codeforces Round 615 (Div. 3) {1294} | PROGRAMMING | Codeforces Round #615 (Div. 3) Editorial | 2000 | |
| 7280 | Three Paths on a Tree | dfs and similar dp greedy trees | Statement | F | Codeforces Round 615 (Div. 3) {1294} | PROGRAMMING | Codeforces Round #615 (Div. 3) Editorial | 2100 | |
| 54784 | Collecting Coins | math | Statement | A | Codeforces Round 615 (Div. 3) {1294} | PROGRAMMING | Codeforces Round #615 (Div. 3) Editorial | 900 | |
| 14037 | Obtain The String | dp greedy strings | Statement | C | Educational Codeforces Round 81 (Rated for Div. 2) {1295} | PROGRAMMING | Educational Codeforces Round 81 Editorial | 1600 | |
| 10011 | Infinite Prefixes | math strings | Statement | B | Educational Codeforces Round 81 (Rated for Div. 2) {1295} | PROGRAMMING | Educational Codeforces Round 81 Editorial | 1700 | |
| 10608 | Same GCDs | math number theory | Statement | D | Educational Codeforces Round 81 (Rated for Div. 2) {1295} | PROGRAMMING | Educational Codeforces Round 81 Editorial | 1800 | |
| 2911 | Permutation Separation | data structures divide and conquer | Statement | E | Educational Codeforces Round 81 (Rated for Div. 2) {1295} | PROGRAMMING | Educational Codeforces Round 81 Editorial | 2200 | |
| 1585 | Good Contest | combinatorics dp probabilities | Statement | F | Educational Codeforces Round 81 (Rated for Div. 2) {1295} | PROGRAMMING | Educational Codeforces Round 81 Editorial | 2600 | |
| 24492 | Display The Number | greedy | Statement | A | Educational Codeforces Round 81 (Rated for Div. 2) {1295} | PROGRAMMING | Educational Codeforces Round 81 Editorial | 900 | |
| 33063 | Food Buying | math | Statement | B | Codeforces Round 617 (Div. 3) {1296} | PROGRAMMING | Codeforces Round #617 (Div. 3) Editorial | 1000 | |
| 15856 | Yet Another Walking Robot | data structures implementation | Statement | C | Codeforces Round 617 (Div. 3) {1296} | PROGRAMMING | Codeforces Round #617 (Div. 3) Editorial | 1500 | |
| 15224 | Fight with Monsters | greedy sortings | Statement | D | Codeforces Round 617 (Div. 3) {1296} | PROGRAMMING | Codeforces Round #617 (Div. 3) Editorial | 1500 | |
| 8324 | String Coloring (easy version) | constructive algorithms dp graphs greedy sortings | Statement | E1 | Codeforces Round 617 (Div. 3) {1296} | PROGRAMMING | Codeforces Round #617 (Div. 3) Editorial | 1800 | |
| 5566 | String Coloring (hard version) | data structures dp | Statement | E2 | Codeforces Round 617 (Div. 3) {1296} | PROGRAMMING | Codeforces Round #617 (Div. 3) Editorial | 2100 | |
| 3168 | Berland Beauty | constructive algorithms dfs and similar greedy sortings trees | Statement | F | Codeforces Round 617 (Div. 3) {1296} | PROGRAMMING | Codeforces Round #617 (Div. 3) Editorial | 2400 | |
| 49532 | Array with Odd Sum | math | Statement | A | Codeforces Round 617 (Div. 3) {1296} | PROGRAMMING | Codeforces Round #617 (Div. 3) Editorial | 800 | |
| 53 | Paint the String | *special dp strings | Statement | H | Kotlin Heroes: Episode 3 {1297} | PROGRAMMING | Kotlin Heroes: Episode 3 Editorial | ||
| 127 | Movie Fan | *special data structures greedy implementation sortings | Statement | F | Kotlin Heroes: Episode 3 {1297} | PROGRAMMING | Kotlin Heroes: Episode 3 Editorial | ||
| 219 | Modernization of Treeland | *special dfs and similar trees | Statement | E | Kotlin Heroes: Episode 3 {1297} | PROGRAMMING | Kotlin Heroes: Episode 3 Editorial | ||
| 78 | M-numbers | *special dp math | Statement | G | Kotlin Heroes: Episode 3 {1297} | PROGRAMMING | Kotlin Heroes: Episode 3 Editorial | ||
| 958 | Likes Display | *special implementation | Statement | A | Kotlin Heroes: Episode 3 {1297} | PROGRAMMING | Kotlin Heroes: Episode 3 Editorial | ||
| 38 | Falling Blocks | *special data structures | Statement | I | Kotlin Heroes: Episode 3 {1297} | PROGRAMMING | Kotlin Heroes: Episode 3 Editorial | ||
| 414 | Dream Team | *special greedy | Statement | C | Kotlin Heroes: Episode 3 {1297} | PROGRAMMING | Kotlin Heroes: Episode 3 Editorial | ||
| 433 | Cartoons | *special implementation sortings | Statement | B | Kotlin Heroes: Episode 3 {1297} | PROGRAMMING | Kotlin Heroes: Episode 3 Editorial | ||
| 274 | Bonus Distribution | *special binary search greedy sortings | Statement | D | Kotlin Heroes: Episode 3 {1297} | PROGRAMMING | Kotlin Heroes: Episode 3 Editorial | ||
| 12699 | Anu Has a Function | brute force greedy math | Statement | A | Codeforces Round 618 (Div. 1) {1299} | PROGRAMMING | 500.0 | Codeforces Round #618 Editorial | 1500 |
| 5667 | Aerodynamic | geometry | Statement | B | Codeforces Round 618 (Div. 1) {1299} | PROGRAMMING | 1000.0 | Codeforces Round #618 Editorial | 1800 |
| 4466 | Water Balance | data structures geometry greedy | Statement | C | Codeforces Round 618 (Div. 1) {1299} | PROGRAMMING | 1250.0 | Codeforces Round #618 Editorial | 2100 |
| 723 | Around the World | bitmasks combinatorics dfs and similar dp graphs graphs math trees | Statement | D | Codeforces Round 618 (Div. 1) {1299} | PROGRAMMING | 1750.0 | Codeforces Round #618 Editorial | 2900 |
| 272 | So Mean | interactive math | Statement | E | Codeforces Round 618 (Div. 1) {1299} | PROGRAMMING | 2250.0 | Codeforces Round #618 Editorial | 3400 |
| 26418 | Assigning to Classes | greedy implementation sortings | Statement | B | Codeforces Round 618 (Div. 2) {1300} | PROGRAMMING | 750.0 | Codeforces Round #618 Editorial | 1000 |
| 21791 | Non-zero | implementation math | Statement | A | Codeforces Round 618 (Div. 2) {1300} | PROGRAMMING | 500.0 | Codeforces Round #618 Editorial | 700 |
| 15194 | Motarack's Birthday | binary search greedy ternary search | Statement | B | Codeforces Round 619 (Div. 2) {1301} | PROGRAMMING | 1000.0 | Codeforces Round #619 (Div. 2) Editorial | 1500 |
| 9984 | Ayoub's function | binary search combinatorics greedy math strings | Statement | C | Codeforces Round 619 (Div. 2) {1301} | PROGRAMMING | 1250.0 | Codeforces Round #619 (Div. 2) Editorial | 1700 |
| 4275 | Time to Run | constructive algorithms graphs implementation | Statement | D | Codeforces Round 619 (Div. 2) {1301} | PROGRAMMING | 1750.0 | Codeforces Round #619 (Div. 2) Editorial | 1900 |
| 1680 | Nanosoft | binary search data structures dp implementation | Statement | E | Codeforces Round 619 (Div. 2) {1301} | PROGRAMMING | 2500.0 | Codeforces Round #619 (Div. 2) Editorial | 2500 |
| 1474 | Super Jaber | dfs and similar graphs implementation shortest paths | Statement | F | Codeforces Round 619 (Div. 2) {1301} | PROGRAMMING | 2500.0 | Codeforces Round #619 (Div. 2) Editorial | 2700 |
| 20236 | Three Strings | implementation strings | Statement | A | Codeforces Round 619 (Div. 2) {1301} | PROGRAMMING | 500.0 | Codeforces Round #619 (Div. 2) Editorial | 800 |
| 12 | Who needs suffix structures? | Statement | H | AIM Tech Poorly Prepared Contest (unrated, funny, Div. 1 preferred) {1302} | PROGRAMMING | 73599 | |||
| 391 | Segment tree or Fenwick? | data structures | Statement | C | AIM Tech Poorly Prepared Contest (unrated, funny, Div. 1 preferred) {1302} | PROGRAMMING | 73599 | ||
| 299 | Nash equilibrium | Statement | A | AIM Tech Poorly Prepared Contest (unrated, funny, Div. 1 preferred) {1302} | PROGRAMMING | 73599 | |||
| 24 | Keep talking and nobody explodes -- medium | Statement | G | AIM Tech Poorly Prepared Contest (unrated, funny, Div. 1 preferred) {1302} | PROGRAMMING | 73599 | |||
| 12 | Keep talking and nobody explodes -- hard | Statement | J | AIM Tech Poorly Prepared Contest (unrated, funny, Div. 1 preferred) {1302} | PROGRAMMING | 73599 | |||
| 80 | Keep talking and nobody explodes -- easy | bitmasks brute force expression parsing | Statement | F | AIM Tech Poorly Prepared Contest (unrated, funny, Div. 1 preferred) {1302} | PROGRAMMING | 73599 | ||
| 98 | Dijkstra | Statement | D | AIM Tech Poorly Prepared Contest (unrated, funny, Div. 1 preferred) {1302} | PROGRAMMING | 73599 | |||
| 11 | Deja vu | Statement | I | AIM Tech Poorly Prepared Contest (unrated, funny, Div. 1 preferred) {1302} | PROGRAMMING | 73599 | |||
| 156 | DAG | constructive algorithms | Statement | B | AIM Tech Poorly Prepared Contest (unrated, funny, Div. 1 preferred) {1302} | PROGRAMMING | 73599 | ||
| 51 | Amazing bitset | Statement | E | AIM Tech Poorly Prepared Contest (unrated, funny, Div. 1 preferred) {1302} | PROGRAMMING | 73599 | |||
| 17064 | National Project | math | Statement | B | Educational Codeforces Round 82 (Rated for Div. 2) {1303} | PROGRAMMING | Educational Codeforces Round 82 | 1300 | |
| 13081 | Perfect Keyboard | dfs and similar greedy implementation | Statement | C | Educational Codeforces Round 82 (Rated for Div. 2) {1303} | PROGRAMMING | Educational Codeforces Round 82 | 1500 | |
| 7960 | Fill The Bag | bitmasks greedy | Statement | D | Educational Codeforces Round 82 (Rated for Div. 2) {1303} | PROGRAMMING | Educational Codeforces Round 82 | 1800 | |
| 3374 | Erase Subsequences | brute force dp greedy strings | Statement | E | Educational Codeforces Round 82 (Rated for Div. 2) {1303} | PROGRAMMING | Educational Codeforces Round 82 | 2200 | |
| 1147 | Sum of Prefix Sums | data structures divide and conquer geometry trees | Statement | G | Educational Codeforces Round 82 (Rated for Div. 2) {1303} | PROGRAMMING | Educational Codeforces Round 82 | 2700 | |
| 683 | Number of Components | dsu implementation | Statement | F | Educational Codeforces Round 82 (Rated for Div. 2) {1303} | PROGRAMMING | Educational Codeforces Round 82 | 2800 | |
| 37464 | Erasing Zeroes | implementation strings | Statement | A | Educational Codeforces Round 82 (Rated for Div. 2) {1303} | PROGRAMMING | Educational Codeforces Round 82 | 700 | |
| 18971 | Longest Palindrome | brute force constructive algorithms greedy implementation strings | Statement | B | Codeforces Round 620 (Div. 2) {1304} | PROGRAMMING | 1000.0 | Codeforces Round #620 (Div. 2) Editorial | 1100 |
| 18070 | Air Conditioner | dp greedy implementation sortings two pointers | Statement | C | Codeforces Round 620 (Div. 2) {1304} | PROGRAMMING | 1500.0 | Codeforces Round #620 (Div. 2) Editorial | 1500 |
| 6822 | Shortest and Longest LIS | constructive algorithms graphs greedy two pointers | Statement | D | Codeforces Round 620 (Div. 2) {1304} | PROGRAMMING | 1750.0 | Codeforces Round #620 (Div. 2) Editorial | 1800 |
| 6201 | 1-Trees and Queries | data structures dfs and similar shortest paths trees | Statement | E | Codeforces Round 620 (Div. 2) {1304} | PROGRAMMING | 2000.0 | Codeforces Round #620 (Div. 2) Editorial | 2000 |
| 2050 | Animal Observation (easy version) | data structures dp | Statement | F1 | Codeforces Round 620 (Div. 2) {1304} | PROGRAMMING | 2000.0 | Codeforces Round #620 (Div. 2) Editorial | 2400 |
| 1868 | Animal Observation (hard version) | data structures dp greedy | Statement | F2 | Codeforces Round 620 (Div. 2) {1304} | PROGRAMMING | 1000.0 | Codeforces Round #620 (Div. 2) Editorial | 2600 |
| 26934 | Two Rabbits | math | Statement | A | Codeforces Round 620 (Div. 2) {1304} | PROGRAMMING | 500.0 | Codeforces Round #620 (Div. 2) Editorial | 800 |
| 12588 | Kuroni and Simple Strings | constructive algorithms greedy strings two pointers | Statement | B | Ozon Tech Challenge 2020 (Div.1 + Div.2, Rated, T-shirts + prizes!) {1305} | PROGRAMMING | 1000.0 | Ozon Tech Challenge 2020 Editorial | 1300 |
| 20021 | Kuroni and Impossible Calculation | brute force combinatorics math number theory | Statement | C | Ozon Tech Challenge 2020 (Div.1 + Div.2, Rated, T-shirts + prizes!) {1305} | PROGRAMMING | 1250.0 | Ozon Tech Challenge 2020 Editorial | 1600 |
| 5433 | Kuroni and the Celebration | constructive algorithms dfs and similar graphs interactive trees | Statement | D | Ozon Tech Challenge 2020 (Div.1 + Div.2, Rated, T-shirts + prizes!) {1305} | PROGRAMMING | 1750.0 | Ozon Tech Challenge 2020 Editorial | 1900 |
| 3305 | Kuroni and the Score Distribution | constructive algorithms greedy implementation math | Statement | E | Ozon Tech Challenge 2020 (Div.1 + Div.2, Rated, T-shirts + prizes!) {1305} | PROGRAMMING | 2000.0 | Ozon Tech Challenge 2020 Editorial | 2100 |
| 3391 | Kuroni and the Punishment | math number theory probabilities | Statement | F | Ozon Tech Challenge 2020 (Div.1 + Div.2, Rated, T-shirts + prizes!) {1305} | PROGRAMMING | 2500.0 | Ozon Tech Challenge 2020 Editorial | 2500 |
| 1516 | Kuroni and Antihype | bitmasks dp dsu graphs | Statement | G | Ozon Tech Challenge 2020 (Div.1 + Div.2, Rated, T-shirts + prizes!) {1305} | PROGRAMMING | 3250.0 | Ozon Tech Challenge 2020 Editorial | 3300 |
| 223 | Kuroni the Private Tutor | binary search greedy | Statement | H | Ozon Tech Challenge 2020 (Div.1 + Div.2, Rated, T-shirts + prizes!) {1305} | PROGRAMMING | 4000.0 | Ozon Tech Challenge 2020 Editorial | 3600 |
| 14760 | Kuroni and the Gifts | brute force constructive algorithms greedy sortings | Statement | A | Ozon Tech Challenge 2020 (Div.1 + Div.2, Rated, T-shirts + prizes!) {1305} | PROGRAMMING | 500.0 | Ozon Tech Challenge 2020 Editorial | 800 |
| 13946 | Cow and Friend | geometry greedy math | Statement | B | Codeforces Round 621 (Div. 1 + Div. 2) {1307} | PROGRAMMING | 1000.0 | Codeforces Round #621 (Div. 1 + Div. 2) Editorial | 1300 |
| 12824 | Cow and Message | brute force dp math strings | Statement | C | Codeforces Round 621 (Div. 1 + Div. 2) {1307} | PROGRAMMING | 1500.0 | Codeforces Round #621 (Div. 1 + Div. 2) Editorial | 1500 |
| 7551 | Cow and Fields | binary search data structures dfs and similar graphs greedy shortest paths sortings | Statement | D | Codeforces Round 621 (Div. 1 + Div. 2) {1307} | PROGRAMMING | 2000.0 | Codeforces Round #621 (Div. 1 + Div. 2) Editorial | 1900 |
| 1475 | Cow and Treats | binary search combinatorics dp greedy implementation math | Statement | E | Codeforces Round 621 (Div. 1 + Div. 2) {1307} | PROGRAMMING | 2500.0 | Codeforces Round #621 (Div. 1 + Div. 2) Editorial | 2400 |
| 789 | Cow and Exercise | flows graphs shortest paths | Statement | G | Codeforces Round 621 (Div. 1 + Div. 2) {1307} | PROGRAMMING | 3500.0 | Codeforces Round #621 (Div. 1 + Div. 2) Editorial | 3000 |
| 717 | Cow and Vacation | dfs and similar dsu trees | Statement | F | Codeforces Round 621 (Div. 1 + Div. 2) {1307} | PROGRAMMING | 3000.0 | Codeforces Round #621 (Div. 1 + Div. 2) Editorial | 3200 |
| 15723 | Cow and Haybales | greedy implementation | Statement | A | Codeforces Round 621 (Div. 1 + Div. 2) {1307} | PROGRAMMING | 500.0 | Codeforces Round #621 (Div. 1 + Div. 2) Editorial | 800 |
| 5744 | Recommendations | data structures greedy sortings | Statement | A | VK Cup 2019-2020 - Elimination Round (Engine) {1310} | PROGRAMMING | 500.0 | VK Cup 2019-2020 - Elimination Round (Engine) and Codeforces Round #623 | 1700 |
| 2119 | Tourism | brute force dp graphs probabilities | Statement | D | VK Cup 2019-2020 - Elimination Round (Engine) {1310} | PROGRAMMING | 2250.0 | VK Cup 2019-2020 - Elimination Round (Engine) and Codeforces Round #623 | 2300 |
| 636 | Double Elimination | dp implementation | Statement | B | VK Cup 2019-2020 - Elimination Round (Engine) {1310} | PROGRAMMING | 1000.0 | VK Cup 2019-2020 - Elimination Round (Engine) and Codeforces Round #623 | 2500 |
| 793 | Au Pont Rouge | binary search dp strings | Statement | C | VK Cup 2019-2020 - Elimination Round (Engine) {1310} | PROGRAMMING | 1500.0 | VK Cup 2019-2020 - Elimination Round (Engine) and Codeforces Round #623 | 2800 |
| 573 | Strange Function | dp | Statement | E | VK Cup 2019-2020 - Elimination Round (Engine) {1310} | PROGRAMMING | 2250.0 | VK Cup 2019-2020 - Elimination Round (Engine) and Codeforces Round #623 | 2900 |
| 250 | Bad Cryptography | math number theory | Statement | F | VK Cup 2019-2020 - Elimination Round (Engine) {1310} | PROGRAMMING | 3500.0 | VK Cup 2019-2020 - Elimination Round (Engine) and Codeforces Round #623 | 3300 |
| 20191 | WeirdSort | dfs and similar sortings | Statement | B | Codeforces Round 624 (Div. 3) {1311} | PROGRAMMING | 74224 | 1200 | |
| 17059 | Perform the Combo | brute force | Statement | C | Codeforces Round 624 (Div. 3) {1311} | PROGRAMMING | 74224 | 1300 | |
| 10083 | Three Integers | brute force math | Statement | D | Codeforces Round 624 (Div. 3) {1311} | PROGRAMMING | 74224 | 1900 | |
| 4984 | Moving Points | data structures divide and conquer implementation sortings | Statement | F | Codeforces Round 624 (Div. 3) {1311} | PROGRAMMING | 74224 | 2100 | |
| 2963 | Construct the Binary Tree | brute force constructive algorithms dfs and similar trees | Statement | E | Codeforces Round 624 (Div. 3) {1311} | PROGRAMMING | 74224 | 2400 | |
| 46836 | Add Odd or Subtract Even | greedy implementation math | Statement | A | Codeforces Round 624 (Div. 3) {1311} | PROGRAMMING | 74224 | 700 | |
| 27765 | Two Regular Polygons | geometry math number theory | Statement | A | Educational Codeforces Round 83 (Rated for Div. 2) {1312} | PROGRAMMING | 74640 | ||
| 10851 | Count the Arrays | combinatorics math | Statement | D | Educational Codeforces Round 83 (Rated for Div. 2) {1312} | PROGRAMMING | 74640 | ||
| 41934 | Bogosort | constructive algorithms sortings | Statement | B | Educational Codeforces Round 83 (Rated for Div. 2) {1312} | PROGRAMMING | 74640 | ||
| 1177 | Autocompletion | data structures dfs and similar dp | Statement | G | Educational Codeforces Round 83 (Rated for Div. 2) {1312} | PROGRAMMING | 74640 | ||
| 1088 | Attack on Red Kingdom | games two pointers | Statement | F | Educational Codeforces Round 83 (Rated for Div. 2) {1312} | PROGRAMMING | 74640 | ||
| 8072 | Array Shrinking | dp | Statement | E | Educational Codeforces Round 83 (Rated for Div. 2) {1312} | PROGRAMMING | 74640 | ||
| 18640 | Adding Powers | bitmasks greedy implementation math number theory ternary search | Statement | C | Educational Codeforces Round 83 (Rated for Div. 2) {1312} | PROGRAMMING | 74640 | ||
| 11201 | Skyscrapers (easy version) | brute force data structures dp greedy | Statement | C1 | Codeforces Round 622 (Div. 2) {1313} | PROGRAMMING | 1000.0 | Editorial | 1500 |
| 7075 | Different Rules | binary search constructive algorithms greedy implementation math | Statement | B | Codeforces Round 622 (Div. 2) {1313} | PROGRAMMING | 1000.0 | Editorial | 1700 |
| 7586 | Skyscrapers (hard version) | data structures dp greedy | Statement | C2 | Codeforces Round 622 (Div. 2) {1313} | PROGRAMMING | 1000.0 | Editorial | 1900 |
| 1599 | Happy New Year | bitmasks dp implementation | Statement | D | Codeforces Round 622 (Div. 2) {1313} | PROGRAMMING | 2000.0 | Editorial | 2600 |
| 784 | Concatenation with intersection | data structures hashing strings two pointers | Statement | E | Codeforces Round 622 (Div. 2) {1313} | PROGRAMMING | 2500.0 | Editorial | 2800 |
| 16387 | Fast Food Restaurant | brute force greedy implementation | Statement | A | Codeforces Round 622 (Div. 2) {1313} | PROGRAMMING | 500.0 | Editorial | 900 |
| 10756 | Restoring Permutation | greedy | Statement | C | Codeforces Round 623 (Div. 2, based on VK Cup 2019-2020 - Elimination Round, Engine) {1315} | PROGRAMMING | 1500.0 | VK Cup 2019-2020 - Elimination Round (Engine) and Codeforces Round #623 | 1200 |
| 9717 | Homecoming | binary search dp greedy strings | Statement | B | Codeforces Round 623 (Div. 2, based on VK Cup 2019-2020 - Elimination Round, Engine) {1315} | PROGRAMMING | 1000.0 | VK Cup 2019-2020 - Elimination Round (Engine) and Codeforces Round #623 | 1300 |
| 13019 | Dead Pixel | implementation | Statement | A | Codeforces Round 623 (Div. 2, based on VK Cup 2019-2020 - Elimination Round, Engine) {1315} | PROGRAMMING | 500.0 | VK Cup 2019-2020 - Elimination Round (Engine) and Codeforces Round #623 | 700 |
| 11865 | String Modification | brute force constructive algorithms implementation sortings strings | Statement | B | CodeCraft-20 (Div. 2) {1316} | PROGRAMMING | 1000.0 | Codecraft-20 (Div.2) Editorial | 1400 |
| 7630 | Primitive Primes | constructive algorithms math ternary search | Statement | C | CodeCraft-20 (Div. 2) {1316} | PROGRAMMING | 1500.0 | Codecraft-20 (Div.2) Editorial | 1700 |
| 3670 | Nash Matrix | constructive algorithms dfs and similar graphs implementation | Statement | D | CodeCraft-20 (Div. 2) {1316} | PROGRAMMING | 1750.0 | Codecraft-20 (Div.2) Editorial | 2000 |
| 5891 | Team Building | bitmasks dp greedy sortings | Statement | E | CodeCraft-20 (Div. 2) {1316} | PROGRAMMING | 2250.0 | Codecraft-20 (Div.2) Editorial | 2300 |
| 964 | Battalion Strength | data structures divide and conquer probabilities | Statement | F | CodeCraft-20 (Div. 2) {1316} | PROGRAMMING | 2500.0 | Codecraft-20 (Div.2) Editorial | 2800 |
| 19913 | Grade Allocation | implementation | Statement | A | CodeCraft-20 (Div. 2) {1316} | PROGRAMMING | 500.0 | Codecraft-20 (Div.2) Editorial | 700 |
| 3455 | World of Darkraft: Battle for Azathoth | data structures sortings | Statement | C | Codeforces Round 625 (Div. 1, based on Technocup 2020 Final Round) {1320} | PROGRAMMING | 1500.0 | Codeforces Round #625 Editorial | |
| 1140 | Treeland and Viruses | shortest paths trees | Statement | E | Codeforces Round 625 (Div. 1, based on Technocup 2020 Final Round) {1320} | PROGRAMMING | 2500.0 | Codeforces Round #625 Editorial | |
| 1730 | Reachable Strings | data structures hashing string suffix structures strings strings | Statement | D | Codeforces Round 625 (Div. 1, based on Technocup 2020 Final Round) {1320} | PROGRAMMING | 2000.0 | Codeforces Round #625 Editorial | |
| 6542 | Navigation System | dfs and similar shortest paths | Statement | B | Codeforces Round 625 (Div. 1, based on Technocup 2020 Final Round) {1320} | PROGRAMMING | 1000.0 | Codeforces Round #625 Editorial | |
| 23098 | Journey Planning | data structures math sortings | Statement | A | Codeforces Round 625 (Div. 1, based on Technocup 2020 Final Round) {1320} | PROGRAMMING | 500.0 | Codeforces Round #625 Editorial | |
| 177 | Blocks and Sensors | Statement | F | Codeforces Round 625 (Div. 1, based on Technocup 2020 Final Round) {1320} | PROGRAMMING | 2500.0 | Codeforces Round #625 Editorial | ||
| 10640 | Remove Adjacent | brute force greedy | Statement | C | Codeforces Round 625 (Div. 2, based on Technocup 2020 Final Round) {1321} | PROGRAMMING | 1250.0 | Codeforces Round #625 Editorial | |
| 15089 | Contest for Robots | Statement | A | Codeforces Round 625 (Div. 2, based on Technocup 2020 Final Round) {1321} | PROGRAMMING | 500.0 | Codeforces Round #625 Editorial | ||
| 12958 | Unusual Competitions | greedy | Statement | A | Codeforces Round 626 (Div. 1, based on Moscow Open Olympiad in Informatics) {1322} | PROGRAMMING | 500.0 | Codeforces Round #626 Editorial | |
| 913 | Reality Show | bitmasks dp | Statement | D | Codeforces Round 626 (Div. 1, based on Moscow Open Olympiad in Informatics) {1322} | PROGRAMMING | 2000.0 | Codeforces Round #626 Editorial | |
| 4734 | Present | binary search bitmasks constructive algorithms data structures math sortings | Statement | B | Codeforces Round 626 (Div. 1, based on Moscow Open Olympiad in Informatics) {1322} | PROGRAMMING | 1000.0 | Codeforces Round #626 Editorial | |
| 415 | Median Mountain Range | data structures | Statement | E | Codeforces Round 626 (Div. 1, based on Moscow Open Olympiad in Informatics) {1322} | PROGRAMMING | 2500.0 | Codeforces Round #626 Editorial | |
| 2795 | Instant Noodles | graphs hashing math number theory | Statement | C | Codeforces Round 626 (Div. 1, based on Moscow Open Olympiad in Informatics) {1322} | PROGRAMMING | 1500.0 | Codeforces Round #626 Editorial | |
| 170 | Assigning Fares | dp dp dp trees | Statement | F | Codeforces Round 626 (Div. 1, based on Moscow Open Olympiad in Informatics) {1322} | PROGRAMMING | 3000.0 | Codeforces Round #626 Editorial | |
| 21053 | Even Subset Sum Problem | brute force dp greedy implementation | Statement | A | Codeforces Round 626 (Div. 2, based on Moscow Open Olympiad in Informatics) {1323} | PROGRAMMING | 500.0 | Codeforces Round #626 Editorial | |
| 12481 | Count Subrectangles | greedy implementation | Statement | B | Codeforces Round 626 (Div. 2, based on Moscow Open Olympiad in Informatics) {1323} | PROGRAMMING | 1000.0 | Codeforces Round #626 Editorial | |
| 27542 | Yet Another Tetris Problem | implementation number theory | Statement | A | Codeforces Round 627 (Div. 3) {1324} | PROGRAMMING | Codeforces Round #627 (Div. 3) Editorial | ||
| 31086 | Yet Another Palindrome Problem | strings | Statement | B | Codeforces Round 627 (Div. 3) {1324} | PROGRAMMING | Codeforces Round #627 (Div. 3) Editorial | ||
| 17853 | Sleeping Schedule | dp | Statement | E | Codeforces Round 627 (Div. 3) {1324} | PROGRAMMING | Codeforces Round #627 (Div. 3) Editorial | ||
| 35410 | Pair of Topics | binary search data structures sortings two pointers | Statement | D | Codeforces Round 627 (Div. 3) {1324} | PROGRAMMING | Codeforces Round #627 (Div. 3) Editorial | ||
| 13965 | Maximum White Subtree | dfs and similar dp graphs trees | Statement | F | Codeforces Round 627 (Div. 3) {1324} | PROGRAMMING | Codeforces Round #627 (Div. 3) Editorial | ||
| 30950 | Frog Jumps | binary search data structures greedy implementation | Statement | C | Codeforces Round 627 (Div. 3) {1324} | PROGRAMMING | Codeforces Round #627 (Div. 3) Editorial | ||
| 18121 | Ehab and Path-etic MEXs | constructive algorithms dfs and similar greedy trees | Statement | C | Codeforces Round 628 (Div. 2) {1325} | PROGRAMMING | 1250.0 | 74235 | 1500 |
| 13905 | Ehab the Xorcist | bitmasks constructive algorithms greedy number theory | Statement | D | Codeforces Round 628 (Div. 2) {1325} | PROGRAMMING | 1750.0 | 74235 | 1700 |
| 2475 | Ehab's Last Theorem | constructive algorithms dfs and similar graphs greedy | Statement | F | Codeforces Round 628 (Div. 2) {1325} | PROGRAMMING | 2750.0 | 74235 | 2600 |
| 2441 | Ehab's REAL Number Theory Problem | brute force dfs and similar graphs number theory shortest paths | Statement | E | Codeforces Round 628 (Div. 2) {1325} | PROGRAMMING | 2500.0 | 74235 | 2700 |
| 47389 | EhAb AnD gCd | constructive algorithms greedy number theory | Statement | A | Codeforces Round 628 (Div. 2) {1325} | PROGRAMMING | 500.0 | 74235 | 800 |
| 39211 | CopyCopyCopyCopyCopy | greedy implementation | Statement | B | Codeforces Round 628 (Div. 2) {1325} | PROGRAMMING | 750.0 | 74235 | 800 |
| 33078 | Bad Ugly Numbers | constructive algorithms number theory | Statement | A | Codeforces Global Round 7 {1326} | PROGRAMMING | 500.0 | 74961 | 1000 |
| 16585 | Permutation Partitions | combinatorics greedy math | Statement | C | Codeforces Global Round 7 {1326} | PROGRAMMING | 1000.0 | 74961 | 1300 |
| 13510 | Prefix-Suffix Palindrome (Easy version) | hashing string suffix structures strings | Statement | D1 | Codeforces Global Round 7 {1326} | PROGRAMMING | 1000.0 | 74961 | 1500 |
| 12258 | Prefix-Suffix Palindrome (Hard version) | greedy hashing string suffix structures strings | Statement | D2 | Codeforces Global Round 7 {1326} | PROGRAMMING | 1000.0 | 74961 | 1800 |
| 2599 | Bombs | data structures two pointers | Statement | E | Codeforces Global Round 7 {1326} | PROGRAMMING | 2500.0 | 74961 | 2400 |
| 1090 | Wise Men (Easy Version) | bitmasks brute force dp meet-in-the-middle | Statement | F1 | Codeforces Global Round 7 {1326} | PROGRAMMING | 2000.0 | 74961 | 2600 |
| 740 | Wise Men (Hard Version) | bitmasks dp math | Statement | F2 | Codeforces Global Round 7 {1326} | PROGRAMMING | 1500.0 | 74961 | 3200 |
| 113 | Spiderweb Trees | dp geometry trees | Statement | G | Codeforces Global Round 7 {1326} | PROGRAMMING | 4000.0 | 74961 | 3600 |
| 25484 | Maximums | implementation math | Statement | B | Codeforces Global Round 7 {1326} | PROGRAMMING | 1000.0 | 74961 | 900 |
| 47045 | Sum of Odd Integers | math | Statement | A | Educational Codeforces Round 84 (Rated for Div. 2) {1327} | PROGRAMMING | Educational Codeforces Round 84 Editorial | 1100 | |
| 19759 | Princesses and Princes | brute force graphs greedy | Statement | B | Educational Codeforces Round 84 (Rated for Div. 2) {1327} | PROGRAMMING | Educational Codeforces Round 84 Editorial | 1300 | |
| 14160 | Game with Chips | constructive algorithms | Statement | C | Educational Codeforces Round 84 (Rated for Div. 2) {1327} | PROGRAMMING | Educational Codeforces Round 84 Editorial | 1600 | |
| 9821 | Count The Blocks | combinatorics dp math | Statement | E | Educational Codeforces Round 84 (Rated for Div. 2) {1327} | PROGRAMMING | Educational Codeforces Round 84 Editorial | 1800 | |
| 3603 | Infinite Path | brute force dfs and similar graphs math number theory | Statement | D | Educational Codeforces Round 84 (Rated for Div. 2) {1327} | PROGRAMMING | Educational Codeforces Round 84 Editorial | 2200 | |
| 2160 | AND Segments | bitmasks combinatorics data structures dp two pointers | Statement | F | Educational Codeforces Round 84 (Rated for Div. 2) {1327} | PROGRAMMING | Educational Codeforces Round 84 Editorial | 2500 | |
| 625 | Letters and Question Marks | bitmasks dp string suffix structures | Statement | G | Educational Codeforces Round 84 (Rated for Div. 2) {1327} | PROGRAMMING | Educational Codeforces Round 84 Editorial | 2900 | |
| 33512 | Ternary XOR | greedy implementation | Statement | C | Codeforces Round 629 (Div. 3) {1328} | PROGRAMMING | 75246 | 1200 | |
| 32631 | K-th Beautiful String | combinatorics implementation math | Statement | B | Codeforces Round 629 (Div. 3) {1328} | PROGRAMMING | 75246 | 1300 | |
| 14750 | Carousel | greedy math | Statement | D | Codeforces Round 629 (Div. 3) {1328} | PROGRAMMING | 75246 | 1800 | |
| 12674 | Tree Queries | dfs and similar graphs trees | Statement | E | Codeforces Round 629 (Div. 3) {1328} | PROGRAMMING | 75246 | 2100 | |
| 3606 | Make k Equal | dp greedy | Statement | F | Codeforces Round 629 (Div. 3) {1328} | PROGRAMMING | 75246 | 2400 | |
| 137655 | Divisibility Problem | math | Statement | A | Codeforces Round 629 (Div. 3) {1328} | PROGRAMMING | 75246 | 800 | |
| 9814 | Dreamoon Likes Coloring | constructive algorithms greedy implementation math | Statement | A | Codeforces Round 631 (Div. 1) - Thanks, Denis aramis Shitov! {1329} | PROGRAMMING | 500.0 | Codeforces Round #631 Editorial | 1800 |
| 7199 | Dreamoon Likes Sequences | bitmasks combinatorics dp math | Statement | B | Codeforces Round 631 (Div. 1) - Thanks, Denis aramis Shitov! {1329} | PROGRAMMING | 750.0 | Codeforces Round #631 Editorial | 1900 |
| 1839 | Drazil Likes Heap | constructive algorithms data structures greedy implementation sortings | Statement | C | Codeforces Round 631 (Div. 1) - Thanks, Denis aramis Shitov! {1329} | PROGRAMMING | 1500.0 | Codeforces Round #631 Editorial | 2400 |
| 568 | Dreamoon Likes Strings | constructive algorithms data structures | Statement | D | Codeforces Round 631 (Div. 1) - Thanks, Denis aramis Shitov! {1329} | PROGRAMMING | 2000.0 | Codeforces Round #631 Editorial | 3000 |
| 353 | Dreamoon Loves AA | binary search greedy | Statement | E | Codeforces Round 631 (Div. 1) - Thanks, Denis aramis Shitov! {1329} | PROGRAMMING | 2500.0 | Codeforces Round #631 Editorial | 3300 |
| 19532 | Dreamoon and Ranking Collection | implementation | Statement | A | Codeforces Round 631 (Div. 2) - Thanks, Denis aramis Shitov! {1330} | PROGRAMMING | 500.0 | Codeforces Round #631 Editorial | 1000 |
| 14661 | Dreamoon Likes Permutations | implementation math | Statement | B | Codeforces Round 631 (Div. 2) - Thanks, Denis aramis Shitov! {1330} | PROGRAMMING | 1000.0 | Codeforces Round #631 Editorial | 1400 |
| 600 | Lingua Romana | Statement | G | April Fools Day Contest 2020 {1331} | PROGRAMMING | April Fools Day Contest 2020: editorial | |||
| 7173 | Limericks | math number theory | Statement | B | April Fools Day Contest 2020 {1331} | PROGRAMMING | April Fools Day Contest 2020: editorial | ||
| 1241 | Jordan Smiley | dfs and similar geometry implementation | Statement | E | April Fools Day Contest 2020 {1331} | PROGRAMMING | April Fools Day Contest 2020: editorial | ||
| 651 | It's showtime | Statement | H | April Fools Day Contest 2020 {1331} | PROGRAMMING | April Fools Day Contest 2020: editorial | |||
| 17552 | Is it rated? | Statement | A | April Fools Day Contest 2020 {1331} | PROGRAMMING | April Fools Day Contest 2020: editorial | |||
| 607 | Elementary! | brute force dp strings | Statement | F | April Fools Day Contest 2020 {1331} | PROGRAMMING | April Fools Day Contest 2020: editorial | ||
| 3219 | ...And after happily lived ever they | bitmasks | Statement | C | April Fools Day Contest 2020 {1331} | PROGRAMMING | April Fools Day Contest 2020: editorial | ||
| 12204 | Again? | implementation | Statement | D | April Fools Day Contest 2020 {1331} | PROGRAMMING | April Fools Day Contest 2020: editorial | ||
| 19921 | Exercising Walk | greedy implementation math | Statement | A | Codeforces Round 630 (Div. 2) {1332} | PROGRAMMING | 500.0 | Codeforces Round #630 Editorial | 1200 |
| 21963 | K-Complete Word | dfs and similar dsu greedy implementation strings | Statement | C | Codeforces Round 630 (Div. 2) {1332} | PROGRAMMING | 1250.0 | Codeforces Round #630 Editorial | 1500 |
| 19375 | Composite Coloring | brute force constructive algorithms greedy math number theory | Statement | B | Codeforces Round 630 (Div. 2) {1332} | PROGRAMMING | 1000.0 | Codeforces Round #630 Editorial | 1500 |
| 8519 | Walk on Matrix | bitmasks constructive algorithms math | Statement | D | Codeforces Round 630 (Div. 2) {1332} | PROGRAMMING | 1250.0 | Codeforces Round #630 Editorial | 1700 |
| 4415 | Height All the Same | combinatorics constructive algorithms math matrices | Statement | E | Codeforces Round 630 (Div. 2) {1332} | PROGRAMMING | 1750.0 | Codeforces Round #630 Editorial | 2100 |
| 1209 | Independent Set | dfs and similar dp trees | Statement | F | Codeforces Round 630 (Div. 2) {1332} | PROGRAMMING | 2250.0 | Codeforces Round #630 Editorial | 2500 |
| 424 | No Monotone Triples | data structures | Statement | G | Codeforces Round 630 (Div. 2) {1332} | PROGRAMMING | 3000.0 | Codeforces Round #630 Editorial | 3000 |
| 1847 | Road to 1600 | brute force constructive algorithms | Statement | E | Codeforces Round 632 (Div. 2) {1333} | PROGRAMMING | 2000.0 | Codeforces Round #632 (Div. 2) editorial | |
| 26040 | Little Artem | constructive algorithms | Statement | A | Codeforces Round 632 (Div. 2) {1333} | PROGRAMMING | 500.0 | Codeforces Round #632 (Div. 2) editorial | |
| 22314 | Kind Anton | greedy implementation | Statement | B | Codeforces Round 632 (Div. 2) {1333} | PROGRAMMING | 750.0 | Codeforces Round #632 (Div. 2) editorial | |
| 4658 | Kate and imperfection | greedy implementation math number theory sortings two pointers | Statement | F | Codeforces Round 632 (Div. 2) {1333} | PROGRAMMING | 2500.0 | Codeforces Round #632 (Div. 2) editorial | |
| 13695 | Eugene and an array | binary search data structures hashing implementation two pointers | Statement | C | Codeforces Round 632 (Div. 2) {1333} | PROGRAMMING | 1250.0 | Codeforces Round #632 (Div. 2) editorial | |
| 4187 | Challenges in school №41 | brute force constructive algorithms games graphs greedy implementation sortings | Statement | D | Codeforces Round 632 (Div. 2) {1333} | PROGRAMMING | 1750.0 | Codeforces Round #632 (Div. 2) editorial | |
| 494 | Substring Search | brute force fft | Statement | G | Educational Codeforces Round 85 (Rated for Div. 2) {1334} | PROGRAMMING | Educational Codeforces Round 85 Editorial | ||
| 1614 | Strange Function | data structures dp | Statement | F | Educational Codeforces Round 85 (Rated for Div. 2) {1334} | PROGRAMMING | Educational Codeforces Round 85 Editorial | ||
| 7801 | Minimum Euler Cycle | constructive algorithms graphs greedy implementation | Statement | D | Educational Codeforces Round 85 (Rated for Div. 2) {1334} | PROGRAMMING | Educational Codeforces Round 85 Editorial | ||
| 27897 | Middle Class | greedy sortings | Statement | B | Educational Codeforces Round 85 (Rated for Div. 2) {1334} | PROGRAMMING | Educational Codeforces Round 85 Editorial | ||
| 24552 | Level Statistics | implementation math | Statement | A | Educational Codeforces Round 85 (Rated for Div. 2) {1334} | PROGRAMMING | Educational Codeforces Round 85 Editorial | ||
| 3238 | Divisor Paths | combinatorics graphs greedy math number theory | Statement | E | Educational Codeforces Round 85 (Rated for Div. 2) {1334} | PROGRAMMING | Educational Codeforces Round 85 Editorial | ||
| 18252 | Circle of Monsters | brute force constructive algorithms greedy math | Statement | C | Educational Codeforces Round 85 (Rated for Div. 2) {1334} | PROGRAMMING | Educational Codeforces Round 85 Editorial | ||
| 43204 | Construct the String | constructive algorithms | Statement | B | Codeforces Round 634 (Div. 3) {1335} | PROGRAMMING | 75993 | 1000 | |
| 39938 | Two Teams Composing | binary search greedy implementation sortings | Statement | C | Codeforces Round 634 (Div. 3) {1335} | PROGRAMMING | 75993 | 1100 | |
| 29776 | Anti-Sudoku | constructive algorithms implementation | Statement | D | Codeforces Round 634 (Div. 3) {1335} | PROGRAMMING | 75993 | 1300 | |
| 11869 | Three Blocks Palindrome (easy version) | binary search brute force data structures dp two pointers | Statement | E1 | Codeforces Round 634 (Div. 3) {1335} | PROGRAMMING | 75993 | 1700 | |
| 9595 | Three Blocks Palindrome (hard version) | brute force data structures dp two pointers | Statement | E2 | Codeforces Round 634 (Div. 3) {1335} | PROGRAMMING | 75993 | 2000 | |
| 2465 | Robots on a Grid | data structures dfs and similar dsu graphs greedy matrices | Statement | F | Codeforces Round 634 (Div. 3) {1335} | PROGRAMMING | 75993 | 2600 | |
| 108613 | Candies and Two Sisters | math | Statement | A | Codeforces Round 634 (Div. 3) {1335} | PROGRAMMING | 75993 | 800 | |
| 25800 | Linova and Kingdom | dfs and similar dp greedy sortings trees | Statement | A | Codeforces Round 635 (Div. 1) {1336} | PROGRAMMING | 500.0 | Codeforces Round #635 Editorial | 1700 |
| 12353 | Xenia and Colorful Gems | binary search greedy math sortings two pointers | Statement | B | Codeforces Round 635 (Div. 1) {1336} | PROGRAMMING | 750.0 | Codeforces Round #635 Editorial | 1800 |
| 4211 | Kaavi and Magic Spell | dp strings | Statement | C | Codeforces Round 635 (Div. 1) {1336} | PROGRAMMING | 1500.0 | Codeforces Round #635 Editorial | 2200 |
| 915 | Chiori and Doll Picking (easy version) | bitmasks brute force combinatorics math | Statement | E1 | Codeforces Round 635 (Div. 1) {1336} | PROGRAMMING | 1750.0 | Codeforces Round #635 Editorial | 2600 |
| 642 | Yui and Mahjong Set | constructive algorithms interactive | Statement | D | Codeforces Round 635 (Div. 1) {1336} | PROGRAMMING | 2250.0 | Codeforces Round #635 Editorial | 3000 |
| 725 | Chiori and Doll Picking (hard version) | bitmasks brute force combinatorics math | Statement | E2 | Codeforces Round 635 (Div. 1) {1336} | PROGRAMMING | 1500.0 | Codeforces Round #635 Editorial | 3400 |
| 286 | Journey | data structures divide and conquer graphs trees | Statement | F | Codeforces Round 635 (Div. 1) {1336} | PROGRAMMING | 3250.0 | Codeforces Round #635 Editorial | 3600 |
| 37271 | Kana and Dragon Quest game | greedy implementation math | Statement | B | Codeforces Round 635 (Div. 2) {1337} | PROGRAMMING | 1000.0 | Codeforces Round #635 Editorial | 1000 |
| 43709 | Ichihime and Triangle | constructive algorithms math | Statement | A | Codeforces Round 635 (Div. 2) {1337} | PROGRAMMING | 500.0 | Codeforces Round #635 Editorial | 1000 |
| 32009 | Powered Addition | greedy math | Statement | A | Codeforces Round 633 (Div. 1) {1338} | PROGRAMMING | 500.0 | Editorial | |
| 3499 | Perfect Triples | bitmasks brute force constructive algorithms divide and conquer greedy implementation math | Statement | C | Codeforces Round 633 (Div. 1) {1338} | PROGRAMMING | 1500.0 | Editorial | |
| 1165 | Nested Rubber Bands | dfs and similar dp trees | Statement | D | Codeforces Round 633 (Div. 1) {1338} | PROGRAMMING | 2000.0 | Editorial | |
| 436 | JYPnation | graphs | Statement | E | Codeforces Round 633 (Div. 1) {1338} | PROGRAMMING | 2750.0 | Editorial | |
| 9754 | Edge Weight Assignment | bitmasks constructive algorithms greedy math trees | Statement | B | Codeforces Round 633 (Div. 1) {1338} | PROGRAMMING | 1000.0 | Editorial | |
| 28634 | Sorted Adjacent Differences | constructive algorithms sortings | Statement | B | Codeforces Round 633 (Div. 2) {1339} | PROGRAMMING | 750.0 | Codeforces Round #633 Editorial | |
| 34600 | Filling Diamonds | brute force dp | Statement | A | Codeforces Round 633 (Div. 2) {1339} | PROGRAMMING | 500.0 | Codeforces Round #633 Editorial | |
| 2488 | Nastya and Unexpected Guest | graphs shortest paths | Statement | C | Codeforces Round 637 (Div. 1) - Thanks, Ivan Belonogov! {1340} | PROGRAMMING | 1250.0 | Codeforces Round #637 Editorial | |
| 1100 | Nastya and Time Machine | constructive algorithms dfs and similar graphs trees | Statement | D | Codeforces Round 637 (Div. 1) - Thanks, Ivan Belonogov! {1340} | PROGRAMMING | 1750.0 | Codeforces Round #637 Editorial | |
| 13729 | Nastya and Strange Generator | brute force data structures greedy implementation | Statement | A | Codeforces Round 637 (Div. 1) - Thanks, Ivan Belonogov! {1340} | PROGRAMMING | 500.0 | Codeforces Round #637 Editorial | |
| 8364 | Nastya and Scoreboard | bitmasks dp greedy | Statement | B | Codeforces Round 637 (Div. 1) - Thanks, Ivan Belonogov! {1340} | PROGRAMMING | 750.0 | Codeforces Round #637 Editorial | |
| 839 | Nastya and CBS | brute force data structures hashing | Statement | F | Codeforces Round 637 (Div. 1) - Thanks, Ivan Belonogov! {1340} | PROGRAMMING | 3000.0 | Codeforces Round #637 Editorial | |
| 101 | Nastya and Bees | graphs interactive probabilities | Statement | E | Codeforces Round 637 (Div. 1) - Thanks, Ivan Belonogov! {1340} | PROGRAMMING | 2250.0 | Codeforces Round #637 Editorial |