Review the problem statement from Codeforces (link will open a new tab). When you've matched your problem, go to the solutions.
Get exact match for tags using this format, eg: [u'brute force', 'dp']
< 1 2 3 ... 45 46 47 48 49 ... 100 101 102 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 1105 | Side Transmutations | combinatorics strings | Statement | E | Educational Codeforces Round 52 (Rated for Div. 2) {1065} | PROGRAMMING | Educational Codeforces Round 52 Editorial | 2200 | |
| 1212 | 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 | |
| 258 | Fibonacci Suffix | strings | Statement | G | Educational Codeforces Round 52 (Rated for Div. 2) {1065} | PROGRAMMING | Educational Codeforces Round 52 Editorial | 2800 | |
| 14761 | Vasya and Chocolate | implementation math | Statement | A | Educational Codeforces Round 52 (Rated for Div. 2) {1065} | PROGRAMMING | Educational Codeforces Round 52 Editorial | 800 | |
| 14753 | Vova and Train | math | Statement | A | Codeforces Round 515 (Div. 3) {1066} | PROGRAMMING | 62419 | 1100 | |
| 9770 | Books Queries | implementation | Statement | C | Codeforces Round 515 (Div. 3) {1066} | PROGRAMMING | 62419 | 1400 | |
| 8456 | Heaters | greedy two pointers | Statement | B | Codeforces Round 515 (Div. 3) {1066} | PROGRAMMING | 62419 | 1500 | |
| 5577 | Boxes Packing | binary search implementation | Statement | D | Codeforces Round 515 (Div. 3) {1066} | PROGRAMMING | 62419 | 1700 | |
| 6220 | Binary Numbers AND Sum | data structures implementation math | Statement | E | Codeforces Round 515 (Div. 3) {1066} | PROGRAMMING | 62419 | 1700 | |
| 2093 | Yet another 2D Walking | dp | Statement | F | Codeforces Round 515 (Div. 3) {1066} | PROGRAMMING | 62419 | 2300 | |
| 2732 | Multihedgehog | dfs and similar graphs shortest paths | Statement | B | Codeforces Round 518 (Div. 1) [Thanks, Mail.Ru!] {1067} | PROGRAMMING | Tutorial | 2000 | |
| 2936 | Array Without Local Maximums | dp | Statement | A | Codeforces Round 518 (Div. 1) [Thanks, Mail.Ru!] {1067} | PROGRAMMING | Tutorial | 2000 | |
| 467 | Random Forest Rank | dp graph matchings math trees | Statement | E | Codeforces Round 518 (Div. 1) [Thanks, Mail.Ru!] {1067} | PROGRAMMING | Tutorial | 2800 | |
| 664 | Knights | constructive algorithms | Statement | C | Codeforces Round 518 (Div. 1) [Thanks, Mail.Ru!] {1067} | PROGRAMMING | Tutorial | 2800 | |
| 416 | Computer Game | dp greedy math probabilities | Statement | D | Codeforces Round 518 (Div. 1) [Thanks, Mail.Ru!] {1067} | PROGRAMMING | Tutorial | 2800 | |
| 11825 | LCM | math number theory | Statement | B | Codeforces Round 518 (Div. 2) [Thanks, Mail.Ru!] {1068} | PROGRAMMING | E | 1200 | |
| 6885 | Birthday | math | Statement | A | Codeforces Round 518 (Div. 2) [Thanks, Mail.Ru!] {1068} | PROGRAMMING | E | 1300 | |
| 3210 | Colored Rooks | constructive algorithms graphs | Statement | C | Codeforces Round 518 (Div. 2) [Thanks, Mail.Ru!] {1068} | PROGRAMMING | E | 1700 | |
| 4982 | 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 | |
| 4959 | 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 | |
| 3691 | 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 | |
| 3684 | 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 | |
| 2090 | 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 | |
| 2396 | 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 | |
| 1401 | 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 | |
| 853 | 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 | |
| 657 | 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 | |
| 707 | 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 | |
| 729 | 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 | |
| 305 | 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 | |
| 70 | 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 | |
| 147 | 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 | |
| 15804 | Diverse Substring | implementation strings | Statement | A | Educational Codeforces Round 53 (Rated for Div. 2) {1073} | PROGRAMMING | 62742 | 1000 | |
| 10665 | Vasya and Books | implementation math | Statement | B | Educational Codeforces Round 53 (Rated for Div. 2) {1073} | PROGRAMMING | 62742 | 1100 | |
| 6479 | Berland Fair | binary search brute force data structures greedy | Statement | D | Educational Codeforces Round 53 (Rated for Div. 2) {1073} | PROGRAMMING | 62742 | 1700 | |
| 4888 | Vasya and Robot | binary search two pointers | Statement | C | Educational Codeforces Round 53 (Rated for Div. 2) {1073} | PROGRAMMING | 62742 | 1800 | |
| 2698 | Segment Sum | bitmasks combinatorics dp math | Statement | E | Educational Codeforces Round 53 (Rated for Div. 2) {1073} | PROGRAMMING | 62742 | 2300 | |
| 936 | Yet Another LCP Problem | data structures string suffix structures | Statement | G | Educational Codeforces Round 53 (Rated for Div. 2) {1073} | PROGRAMMING | 62742 | 2700 | |
| 556 | Choosing Two Paths | dfs and similar dp greedy trees | Statement | F | Educational Codeforces Round 53 (Rated for Div. 2) {1073} | PROGRAMMING | 62742 | 2800 | |
| 4315 | Taxi drivers and Lyft | implementation sortings | Statement | B | Lyft Level 5 Challenge 2018 - Final Round (Open Div. 2) {1075} | PROGRAMMING | E | 1200 | |
| 8625 | The King's Race | implementation math | Statement | A | Lyft Level 5 Challenge 2018 - Final Round (Open Div. 2) {1075} | PROGRAMMING | E | 900 | |
| 13302 | Minimizing the String | greedy strings | Statement | A | Educational Codeforces Round 54 (Rated for Div. 2) {1076} | PROGRAMMING | E | 1200 | |
| 13287 | Divisor Subtraction | implementation math number theory | Statement | B | Educational Codeforces Round 54 (Rated for Div. 2) {1076} | PROGRAMMING | E | 1200 | |
| 12626 | Meme Problem | binary search math | Statement | C | Educational Codeforces Round 54 (Rated for Div. 2) {1076} | PROGRAMMING | E | 1300 | |
| 5349 | Edge Deletion | graphs greedy shortest paths | Statement | D | Educational Codeforces Round 54 (Rated for Div. 2) {1076} | PROGRAMMING | E | 1800 | |
| 3823 | Vasya and a Tree | data structures trees | Statement | E | Educational Codeforces Round 54 (Rated for Div. 2) {1076} | PROGRAMMING | E | 1900 | |
| 658 | Summer Practice Report | dp greedy | Statement | F | Educational Codeforces Round 54 (Rated for Div. 2) {1076} | PROGRAMMING | E | 2500 | |
| 628 | Array Game | data structures games | Statement | G | Educational Codeforces Round 54 (Rated for Div. 2) {1076} | PROGRAMMING | E | 2700 | |
| 19262 | Disturbed People | greedy | Statement | B | Codeforces Round 521 (Div. 3) {1077} | PROGRAMMING | Codeforces Round #521 (Div. 3) Editorial | 1000 | |
| 18365 | Good Array | Statement | C | Codeforces Round 521 (Div. 3) {1077} | PROGRAMMING | Codeforces Round #521 (Div. 3) Editorial | 1400 | ||
| 9189 | Cutting Out | binary search sortings | Statement | D | Codeforces Round 521 (Div. 3) {1077} | PROGRAMMING | Codeforces Round #521 (Div. 3) Editorial | 1600 | |
| 4775 | Thematic Contests | greedy sortings | Statement | E | Codeforces Round 521 (Div. 3) {1077} | PROGRAMMING | Codeforces Round #521 (Div. 3) Editorial | 1800 | |
| 4569 | Pictures with Kittens (easy version) | dp | Statement | F1 | Codeforces Round 521 (Div. 3) {1077} | PROGRAMMING | Codeforces Round #521 (Div. 3) Editorial | 2100 | |
| 3425 | Pictures with Kittens (hard version) | data structures dp | Statement | F2 | Codeforces Round 521 (Div. 3) {1077} | PROGRAMMING | Codeforces Round #521 (Div. 3) Editorial | 2300 | |
| 30481 | Frog Jumping | math | Statement | A | Codeforces Round 521 (Div. 3) {1077} | PROGRAMMING | Codeforces Round #521 (Div. 3) Editorial | 700 | |
| 88 | 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 | |
| 4079 | Masha and two friends | implementation | Statement | C | Codeforces Round 524 (Div. 2) {1080} | PROGRAMMING | Codeforces Round #524 (Div. 2) Editorial | 1600 | |
| 1571 | Olya and magical square | constructive algorithms implementation math | Statement | D | Codeforces Round 524 (Div. 2) {1080} | PROGRAMMING | Codeforces Round #524 (Div. 2) Editorial | 2000 | |
| 1140 | Sonya and Matrix Beauty | strings | Statement | E | Codeforces Round 524 (Div. 2) {1080} | PROGRAMMING | Codeforces Round #524 (Div. 2) Editorial | 2400 | |
| 729 | Katya and Segments Sets | data structures interactive sortings | Statement | F | Codeforces Round 524 (Div. 2) {1080} | PROGRAMMING | Codeforces Round #524 (Div. 2) Editorial | 2700 | |
| 18350 | Petya and Origami | math | Statement | A | Codeforces Round 524 (Div. 2) {1080} | PROGRAMMING | Codeforces Round #524 (Div. 2) Editorial | 700 | |
| 11954 | Margarite and the best present | math | Statement | B | Codeforces Round 524 (Div. 2) {1080} | PROGRAMMING | Codeforces Round #524 (Div. 2) Editorial | 900 | |
| 4498 | Farewell Party | constructive algorithms implementation | Statement | B | Avito Cool Challenge 2018 {1081} | PROGRAMMING | 63888 | 1500 | |
| 7416 | Colorful Bricks | combinatorics dp math | Statement | C | Avito Cool Challenge 2018 {1081} | PROGRAMMING | 63888 | 1600 | |
| 4208 | Maximum Distance | ds graphs shortest paths sortings | Statement | D | Avito Cool Challenge 2018 {1081} | PROGRAMMING | 63888 | 1800 | |
| 2634 | Missing Numbers | binary search constructive algorithms greedy math number theory | Statement | E | Avito Cool Challenge 2018 {1081} | PROGRAMMING | 63888 | 1900 | |
| 477 | Tricky Interactor | constructive algorithms implementation interactive | Statement | F | Avito Cool Challenge 2018 {1081} | PROGRAMMING | 63888 | 2500 | |
| 406 | Mergesort Strikes Back | math probabilities | Statement | G | Avito Cool Challenge 2018 {1081} | PROGRAMMING | 63888 | 3000 | |
| 113 | Palindromic Magic | data structures hashing strings | Statement | H | Avito Cool Challenge 2018 {1081} | PROGRAMMING | 63888 | 3500 | |
| 12191 | Definite Game | constructive algorithms math | Statement | A | Avito Cool Challenge 2018 {1081} | PROGRAMMING | 63888 | 800 | |
| 8678 | Vasya and Book | implementation math | Statement | A | Educational Codeforces Round 55 (Rated for Div. 2) {1082} | PROGRAMMING | 63544 | 1200 | |
| 7641 | Vova and Trophies | greedy | Statement | B | Educational Codeforces Round 55 (Rated for Div. 2) {1082} | PROGRAMMING | 63544 | 1600 | |
| 5830 | Multi-Subject Competition | greedy sortings | Statement | C | Educational Codeforces Round 55 (Rated for Div. 2) {1082} | PROGRAMMING | 63544 | 1600 | |
| 3841 | Maximum Diameter Graph | constructive algorithms graphs implementation | Statement | D | Educational Codeforces Round 55 (Rated for Div. 2) {1082} | PROGRAMMING | 63544 | 1800 | |
| 4822 | Increasing Frequency | binary search dp greedy | Statement | E | Educational Codeforces Round 55 (Rated for Div. 2) {1082} | PROGRAMMING | 63544 | 2000 | |
| 2215 | Petya and Graph | flows graphs | Statement | G | Educational Codeforces Round 55 (Rated for Div. 2) {1082} | PROGRAMMING | 63544 | 2400 | |
| 425 | Speed Dial | dp strings trees | Statement | F | Educational Codeforces Round 55 (Rated for Div. 2) {1082} | PROGRAMMING | 63544 | 2900 | |
| 5559 | The Fair Nut and the Best Path | data structures dp trees | Statement | A | Codeforces Round 526 (Div. 1) {1083} | PROGRAMMING | 63753 | 1800 | |
| 1986 | The Fair Nut and Strings | greedy strings | Statement | B | Codeforces Round 526 (Div. 1) {1083} | PROGRAMMING | 63753 | 2100 | |
| 4447 | The Fair Nut and Rectangles | data structures dp geometry | Statement | E | Codeforces Round 526 (Div. 1) {1083} | PROGRAMMING | 63753 | 2400 | |
| 954 | Max Mex | data structures trees | Statement | C | Codeforces Round 526 (Div. 1) {1083} | PROGRAMMING | 63753 | 2800 | |
| 285 | The Fair Nut and Amusing Xor | data structures | Statement | F | Codeforces Round 526 (Div. 1) {1083} | PROGRAMMING | 63753 | 3100 | |
| 247 | The Fair Nut's getting crazy | data structures implementation | Statement | D | Codeforces Round 526 (Div. 1) {1083} | PROGRAMMING | 63753 | 3400 | |
| 7979 | The Fair Nut and Elevator | brute force implementation | Statement | A | Codeforces Round 526 (Div. 2) {1084} | PROGRAMMING | 63753 | 1000 | |
| 7869 | Kvass and the Fair Nut | greedy implementation | Statement | B | Codeforces Round 526 (Div. 2) {1084} | PROGRAMMING | 63753 | 1200 | |
| 8475 | The Fair Nut and String | combinatorics dp implementation | Statement | C | Codeforces Round 526 (Div. 2) {1084} | PROGRAMMING | 63753 | 1500 | |
| 9522 | Div Times Mod | math | Statement | B | Technocup 2019 - Elimination Round 4 {1085} | PROGRAMMING | Technocup 2019 — Elimination Round 4 + Codeforces Round 528: editorial | 1200 | |
| 5478 | Connect Three | implementation math | Statement | C | Technocup 2019 - Elimination Round 4 {1085} | PROGRAMMING | Technocup 2019 — Elimination Round 4 + Codeforces Round 528: editorial | 1600 | |
| 5571 | 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 | |
| 1075 | 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 | |
| 534 | 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 | |
| 624 | Rock-Paper-Scissors Champion | Statement | F | Technocup 2019 - Elimination Round 4 {1085} | PROGRAMMING | Technocup 2019 — Elimination Round 4 + Codeforces Round 528: editorial | 2700 | ||
| 12267 | Right-Left Cipher | implementation strings | Statement | A | Technocup 2019 - Elimination Round 4 {1085} | PROGRAMMING | Technocup 2019 — Elimination Round 4 + Codeforces Round 528: editorial | 900 | |
| 268 | 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 | |
| 12730 | Ehab and subtraction | implementation sortings | Statement | B | Codeforces Round 525 (Div. 2) {1088} | PROGRAMMING | Codeforces round #525 editorial | 1000 | |
| 8174 | Ehab and a 2-operation task | constructive algorithms greedy math | Statement | C | Codeforces Round 525 (Div. 2) {1088} | PROGRAMMING | Codeforces round #525 editorial | 1400 | |
| 2916 | 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 | |
| 1521 | Ehab and a component choosing problem | dp greedy math trees | Statement | E | Codeforces Round 525 (Div. 2) {1088} | PROGRAMMING | Codeforces round #525 editorial | 2400 | |
| 530 | Ehab and a weird weight formula | data structures trees | Statement | F | Codeforces Round 525 (Div. 2) {1088} | PROGRAMMING | Codeforces round #525 editorial | 3000 | |
| 16987 | Ehab and another construction problem | brute force constructive algorithms | Statement | A | Codeforces Round 525 (Div. 2) {1088} | PROGRAMMING | Codeforces round #525 editorial | 800 |