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 ... 36 37 38 39 40 ... 100 101 102 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 6038 | Make a Permutation! | greedy implementation math | Statement | D | Codeforces Round 436 (Div. 2) {864} | PROGRAMMING | 1500 | ||
| 5890 | Bus | greedy implementation math | Statement | C | Codeforces Round 436 (Div. 2) {864} | PROGRAMMING | 1500 | ||
| 4316 | Fire | dp sortings | Statement | E | Codeforces Round 436 (Div. 2) {864} | PROGRAMMING | 2000 | ||
| 637 | Cities Excursions | dfs and similar graphs trees | Statement | F | Codeforces Round 436 (Div. 2) {864} | PROGRAMMING | 2700 | ||
| 4359 | Save the problem! | constructive algorithms | Statement | A | MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists) {865} | PROGRAMMING | 1400 | ||
| 1879 | Ordering Pizza | binary search sortings ternary search | Statement | B | MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists) {865} | PROGRAMMING | MemSQL Start[c]UP 3.0 Round 2 Editorial | 1900 | |
| 5968 | Buy Low Sell High | constructive algorithms data structures greedy | Statement | D | MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists) {865} | PROGRAMMING | MemSQL Start[c]UP 3.0 Round 2 Editorial | 2300 | |
| 857 | Gotta Go Fast | binary search dp | Statement | C | MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists) {865} | PROGRAMMING | 2500 | ||
| 144 | Hex Dyslexia | bitmasks brute force dp graphs | Statement | E | MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists) {865} | PROGRAMMING | 2700 | ||
| 143 | Flowers and Chocolate | combinatorics math matrices | Statement | G | MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists) {865} | PROGRAMMING | 3200 | ||
| 72 | Egg Roulette | bitmasks brute force divide and conquer math meet-in-the-middle | Statement | F | MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists) {865} | PROGRAMMING | 3300 | ||
| 19546 | Between the Offices | implementation | Statement | A | Codeforces Round 437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2) {867} | PROGRAMMING | MemSQL Start[c]UP 3.0 Round 2 Editorial | 600 | |
| 8881 | Bark to Unlock | brute force implementation strings | Statement | A | Codeforces Round 438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined) {868} | PROGRAMMING | 55046 | 1000 | |
| 3697 | Race Against Time | implementation | Statement | B | Codeforces Round 438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined) {868} | PROGRAMMING | 1400 | ||
| 4665 | Qualification Rounds | bitmasks brute force constructive algorithms dp | Statement | C | Codeforces Round 438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined) {868} | PROGRAMMING | 55046 | 1500 | |
| 929 | Huge Strings | bitmasks brute force dp implementation strings | Statement | D | Codeforces Round 438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined) {868} | PROGRAMMING | 2100 | ||
| 3971 | Yet Another Minimization Problem | divide and conquer dp | Statement | F | Codeforces Round 438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined) {868} | PROGRAMMING | 55046 | 2500 | |
| 532 | Policeman and a Tree | dp graphs trees | Statement | E | Codeforces Round 438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined) {868} | PROGRAMMING | 2600 | ||
| 138 | El Toll Caves | math | Statement | G | Codeforces Round 438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined) {868} | PROGRAMMING | 3300 | ||
| 13996 | The Eternal Immortality | math | Statement | B | Codeforces Round 439 (Div. 2) {869} | PROGRAMMING | Tutorial | 1100 | |
| 9499 | The Artful Expedient | brute force implementation | Statement | A | Codeforces Round 439 (Div. 2) {869} | PROGRAMMING | 1200 | ||
| 4767 | The Intriguing Obsession | combinatorics dp math | Statement | C | Codeforces Round 439 (Div. 2) {869} | PROGRAMMING | 1800 | ||
| 1855 | The Untended Antiquity | data structures hashing | Statement | E | Codeforces Round 439 (Div. 2) {869} | PROGRAMMING | 2300 | ||
| 253 | The Overdosing Ubiquity | brute force dfs and similar graphs | Statement | D | Codeforces Round 439 (Div. 2) {869} | PROGRAMMING | 2800 | ||
| 9721 | Maximum of Maximums of Minimums | greedy | Statement | B | Technocup 2018 - Elimination Round 2 {870} | PROGRAMMING | 1200 | ||
| 9283 | Maximum splitting | dp greedy math number theory | Statement | C | Technocup 2018 - Elimination Round 2 {870} | PROGRAMMING | Editorial Codeforces Round 440 Div.1+Div.2 (and Technocup 2018 — Elimination Round 2) | 1300 | |
| 1235 | Something with XOR Queries | brute force interactive probabilities | Statement | D | Technocup 2018 - Elimination Round 2 {870} | PROGRAMMING | 2100 | ||
| 1245 | Points, Lines and Ready-made Titles | dfs and similar ds graphs trees | Statement | E | Technocup 2018 - Elimination Round 2 {870} | PROGRAMMING | Editorial Codeforces Round 440 Div.1+Div.2 (and Technocup 2018 — Elimination Round 2) | 2400 | |
| 625 | Paths | data structures number theory | Statement | F | Technocup 2018 - Elimination Round 2 {870} | PROGRAMMING | Editorial Codeforces Round 440 Div.1+Div.2 (and Technocup 2018 — Elimination Round 2) | 2600 | |
| 10253 | Search for Pretty Integers | brute force implementation | Statement | A | Technocup 2018 - Elimination Round 2 {870} | PROGRAMMING | Editorial Codeforces Round 440 Div.1+Div.2 (and Technocup 2018 — Elimination Round 2) | 900 | |
| 156 | Restore the Tree | graphs greedy trees | Statement | E | Codeforces Round 440 (Div. 1, based on Technocup 2018 Elimination Round 2) {871} | PROGRAMMING | Editorial Codeforces Round 440 Div.1+Div.2 (and Technocup 2018 — Elimination Round 2) | 2800 | |
| 7981 | Balanced Substring | dp implementation | Statement | B | Educational Codeforces Round 30 {873} | PROGRAMMING | 55171 | 1500 | |
| 3338 | Strange Game On Matrix | greedy two pointers | Statement | C | Educational Codeforces Round 30 {873} | PROGRAMMING | 55171 | 1600 | |
| 3261 | Merge Sort | constructive algorithms divide and conquer | Statement | D | Educational Codeforces Round 30 {873} | PROGRAMMING | 1800 | ||
| 1439 | Forbidden Indices | ds string suffix structures strings | Statement | F | Educational Codeforces Round 30 {873} | PROGRAMMING | 55171 | 2300 | |
| 712 | Awards For Contestants | brute force data structures dp | Statement | E | Educational Codeforces Round 30 {873} | PROGRAMMING | 55171 | 2500 | |
| 8404 | Chores | implementation | Statement | A | Educational Codeforces Round 30 {873} | PROGRAMMING | 55171 | 900 | |
| 9754 | Classroom Watch | brute force math | Statement | A | Codeforces Round 441 (Div. 1, by Moscow Team Olympiad) {875} | PROGRAMMING | Codeforces Round #441. Editorial. | 1200 | |
| 5244 | Sorting the Coins | ds implementation sortings two pointers | Statement | B | Codeforces Round 441 (Div. 1, by Moscow Team Olympiad) {875} | PROGRAMMING | 1500 | ||
| 2144 | National Property | 2-sat dfs and similar graphs implementation | Statement | C | Codeforces Round 441 (Div. 1, by Moscow Team Olympiad) {875} | PROGRAMMING | 2100 | ||
| 2304 | High Cry | binary search bitmasks combinatorics data structures divide and conquer | Statement | D | Codeforces Round 441 (Div. 1, by Moscow Team Olympiad) {875} | PROGRAMMING | 2200 | ||
| 1388 | Royal Questions | ds graphs greedy | Statement | F | Codeforces Round 441 (Div. 1, by Moscow Team Olympiad) {875} | PROGRAMMING | 2500 | ||
| 947 | Delivery Club | binary search data structures dp | Statement | E | Codeforces Round 441 (Div. 1, by Moscow Team Olympiad) {875} | PROGRAMMING | 2600 | ||
| 9472 | Trip For Meal | math | Statement | A | Codeforces Round 441 (Div. 2, by Moscow Team Olympiad) {876} | PROGRAMMING | 1000 | ||
| 9456 | Divisiblity of Differences | implementation math number theory | Statement | B | Codeforces Round 441 (Div. 2, by Moscow Team Olympiad) {876} | PROGRAMMING | Codeforces Round #441. Editorial. | 1300 | |
| 10952 | Alex and broken contest | implementation strings | Statement | A | Codeforces Round 442 (Div. 2) {877} | PROGRAMMING | 55362 | 1200 | |
| 10698 | Nikita and string | brute force dp | Statement | B | Codeforces Round 442 (Div. 2) {877} | PROGRAMMING | 55362 | 1500 | |
| 5767 | Slava and tanks | constructive algorithms | Statement | C | Codeforces Round 442 (Div. 2) {877} | PROGRAMMING | 55362 | 1600 | |
| 4488 | Olya and Energy Drinks | data structures dfs and similar graphs shortest paths | Statement | D | Codeforces Round 442 (Div. 2) {877} | PROGRAMMING | 1900 | ||
| 4706 | Danil and a Part-time Job | bitmasks data structures trees | Statement | E | Codeforces Round 442 (Div. 2) {877} | PROGRAMMING | 2000 | ||
| 1870 | Ann and Books | data structures flows hashing | Statement | F | Codeforces Round 442 (Div. 2) {877} | PROGRAMMING | 2500 | ||
| 5609 | Short Program | bitmasks constructive algorithms | Statement | A | Codeforces Round 443 (Div. 1) {878} | PROGRAMMING | Editorial | 1600 | |
| 1076 | Teams Formation | data structures implementation | Statement | B | Codeforces Round 443 (Div. 1) {878} | PROGRAMMING | Editorial | 2400 | |
| 941 | Tournament | data structures graphs | Statement | C | Codeforces Round 443 (Div. 1) {878} | PROGRAMMING | 2800 | ||
| 717 | Magic Breeding | bitmasks | Statement | D | Codeforces Round 443 (Div. 1) {878} | PROGRAMMING | 2900 | ||
| 585 | Numbers on the blackboard | combinatorics dp | Statement | E | Codeforces Round 443 (Div. 1) {878} | PROGRAMMING | Editorial | 3200 | |
| 9118 | Borya's Diagnosis | implementation | Statement | A | Codeforces Round 443 (Div. 2) {879} | PROGRAMMING | Codeforces Round #443. Editorial | 1000 | |
| 12850 | Table Tennis | data structures implementation | Statement | B | Codeforces Round 443 (Div. 2) {879} | PROGRAMMING | Codeforces Round #443. Editorial | 1300 | |
| 3626 | Quadcopter Competition | greedy math | Statement | M | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {883} | PROGRAMMING | 1100 | ||
| 2297 | Lost in Transliteration | implementation | Statement | F | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {883} | PROGRAMMING | 1300 | ||
| 1921 | Field of Wonders | implementation strings | Statement | E | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {883} | PROGRAMMING | 1600 | ||
| 1658 | Palindromic Cut | brute force implementation strings | Statement | H | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {883} | PROGRAMMING | 1800 | ||
| 2066 | Photo Processing | binary search dp | Statement | I | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {883} | PROGRAMMING | 2000 | ||
| 1426 | Orientation of Edges | dfs and similar graphs | Statement | G | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {883} | PROGRAMMING | 2000 | ||
| 1109 | Road Widening | constructive algorithms greedy implementation | Statement | K | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {883} | PROGRAMMING | 2100 | ||
| 605 | Automatic Door | implementation | Statement | A | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {883} | PROGRAMMING | 2300 | ||
| 630 | Downloading B++ | binary search | Statement | C | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {883} | PROGRAMMING | 2400 | ||
| 583 | Renovation | greedy sortings | Statement | J | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {883} | PROGRAMMING | 2600 | ||
| 447 | Packmen Strike Back | binary search dp | Statement | D | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {883} | PROGRAMMING | 2800 | ||
| 239 | Berland.Taxi | data structures | Statement | L | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {883} | PROGRAMMING | 2800 | ||
| 383 | Berland Army | constructive algorithms graphs greedy | Statement | B | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {883} | PROGRAMMING | 2800 | ||
| 6943 | Japanese Crosswords Strike Back | implementation | Statement | B | Educational Codeforces Round 31 {884} | PROGRAMMING | 55470 | 1100 | |
| 4825 | Bertown Subway | dfs and similar greedy math | Statement | C | Educational Codeforces Round 31 {884} | PROGRAMMING | 55470 | 1500 | |
| 2066 | Boxes And Balls | data structures greedy | Statement | D | Educational Codeforces Round 31 {884} | PROGRAMMING | 55470 | 2300 | |
| 702 | Binary Matrix | ds | Statement | E | Educational Codeforces Round 31 {884} | PROGRAMMING | 55470 | 2500 | |
| 1105 | Anti-Palindromize | flows graphs greedy | Statement | F | Educational Codeforces Round 31 {884} | PROGRAMMING | 55470 | 2500 | |
| 10564 | Book Reading | implementation | Statement | A | Educational Codeforces Round 31 {884} | PROGRAMMING | 55470 | 900 | |
| 7979 | Vlad and Cafes | Statement | B | Технокубок 2018 - Отборочный Раунд 3 {886} | PROGRAMMING | Editorial Codeforces Round 445 (and Technocup 2018 — Elimination Round 3) | 1000 | ||
| 10416 | ACM ICPC | brute force | Statement | A | Технокубок 2018 - Отборочный Раунд 3 {886} | PROGRAMMING | Editorial Codeforces Round 445 (and Technocup 2018 — Elimination Round 3) | 1100 | |
| 5494 | Petya and Catacombs | ds greedy implementation trees | Statement | C | Технокубок 2018 - Отборочный Раунд 3 {886} | PROGRAMMING | Editorial Codeforces Round 445 (and Technocup 2018 — Elimination Round 3) | 1300 | |
| 1811 | Restoration of string | constructive algorithms graphs implementation | Statement | D | Технокубок 2018 - Отборочный Раунд 3 {886} | PROGRAMMING | Editorial Codeforces Round 445 (and Technocup 2018 — Elimination Round 3) | 2000 | |
| 1062 | Maximum Element | combinatorics dp math | Statement | E | Технокубок 2018 - Отборочный Раунд 3 {886} | PROGRAMMING | Editorial Codeforces Round 445 (and Technocup 2018 — Elimination Round 3) | 2500 | |
| 271 | Symmetric Projections | geometry | Statement | F | Технокубок 2018 - Отборочный Раунд 3 {886} | PROGRAMMING | Editorial Codeforces Round 445 (and Technocup 2018 — Elimination Round 3) | 2700 | |
| 11385 | Div. 64 | implementation | Statement | A | Codeforces Round 444 (Div. 2) {887} | PROGRAMMING | Codeforces Round #444 (Div. 2) Editorial | 1100 | |
| 5692 | Cubes for Masha | brute force implementation | Statement | B | Codeforces Round 444 (Div. 2) {887} | PROGRAMMING | Codeforces Round #444 (Div. 2) Editorial | 1300 | |
| 2916 | Solution for Cube | brute force implementation | Statement | C | Codeforces Round 444 (Div. 2) {887} | PROGRAMMING | Codeforces Round #444 (Div. 2) Editorial | 1500 | |
| 485 | Ratings and Reality Shows | data structures two pointers | Statement | D | Codeforces Round 444 (Div. 2) {887} | PROGRAMMING | 2500 | ||
| 165 | Little Brother | binary search geometry sortings | Statement | E | Codeforces Round 444 (Div. 2) {887} | PROGRAMMING | 2700 | ||
| 170 | Row of Models | greedy sortings | Statement | F | Codeforces Round 444 (Div. 2) {887} | PROGRAMMING | Codeforces Round #444 (Div. 2) Editorial | 2800 | |
| 9954 | Buggy Robot | greedy | Statement | B | Educational Codeforces Round 32 {888} | PROGRAMMING | Educational Codeforces Round 32 - Editorial | 1000 | |
| 8347 | K-Dominant Character | binary search implementation two pointers | Statement | C | Educational Codeforces Round 32 {888} | PROGRAMMING | Educational Codeforces Round 32 - Editorial | 1400 | |
| 11159 | Local Extrema | brute force implementation | Statement | A | Educational Codeforces Round 32 {888} | PROGRAMMING | Educational Codeforces Round 32 - Editorial | 1600 | |
| 8692 | Almost Identity Permutations | combinatorics dp math | Statement | D | Educational Codeforces Round 32 {888} | PROGRAMMING | Educational Codeforces Round 32 - Editorial | 1600 | |
| 7566 | Maximum Subsequence | bitmasks divide and conquer meet-in-the-middle | Statement | E | Educational Codeforces Round 32 {888} | PROGRAMMING | Educational Codeforces Round 32 - Editorial | 1800 | |
| 4748 | Xor-MST | bitmasks constructive algorithms data structures | Statement | G | Educational Codeforces Round 32 {888} | PROGRAMMING | Educational Codeforces Round 32 - Editorial | 2300 | |
| 880 | Connecting Vertices | dp graphs | Statement | F | Educational Codeforces Round 32 {888} | PROGRAMMING | Educational Codeforces Round 32 - Editorial | 2500 | |
| 576 | Mod Mod Mod | binary search dp math | Statement | E | Codeforces Round 445 (Div. 1, based on Technocup 2018 Elimination Round 3) {889} | PROGRAMMING | Editorial Codeforces Round 445 (and Technocup 2018 — Elimination Round 3) | 3100 | |
| 10561 | Pride | brute force dp greedy math number theory | Statement | A | Codeforces Round 446 (Div. 1) {891} | PROGRAMMING | Codeforces Round #446 Editorial | 1600 | |
| 3040 | Gluttony | constructive algorithms greedy | Statement | B | Codeforces Round 446 (Div. 1) {891} | PROGRAMMING | Codeforces Round #446 Editorial | 2000 | |
| 2462 | Envy | data structures ds graphs | Statement | C | Codeforces Round 446 (Div. 1) {891} | PROGRAMMING | 2500 |