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']
Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 839 | Greedy Change | constructive algorithms | Statement | E | Codeforces Beta Round 10 {10} | PROGRAMMING | 2600 | ||
| 1238 | Start of the session | constructive algorithms | Statement | E | Codeforces Beta Round 12 (Div 2 Only) {12} | PROGRAMMING | 2100 | ||
| 376 | Multithreading | constructive algorithms | Statement | E | Codeforces Beta Round 26 (Codeforces format) {26} | PROGRAMMING | 2700 | ||
| 946 | Planting Trees | constructive algorithms | Statement | J | School Team Contest 3 (Winter Computer School 2010/11) {45} | PROGRAMMING | 1900 | ||
| 152 | Black and White | constructive algorithms | Statement | H | School Personal Contest #3 (Winter Computer School 2010/11) - Codeforces Beta Round 45 (ACM-ICPC Rules) {48} | PROGRAMMING | 2600 | ||
| 6504 | Little Frog | constructive algorithms | Statement | C | Codeforces Beta Round 49 (Div. 2) {53} | PROGRAMMING | Разбор задач Codeforces Beta Round #49(Div. 2) | 1200 | |
| 1269 | Dividing Island | constructive algorithms | Statement | D | Codeforces Beta Round 59 (Div. 2) {63} | PROGRAMMING | 2000 | ||
| 155 | Shift It! | constructive algorithms | Statement | E | Codeforces Beta Round 68 {74} | PROGRAMMING | Solutions for Codeforces Beta Round #68 | 2700 | |
| 185 | Help Monks | constructive algorithms | Statement | D | Codeforces Beta Round 78 (Div. 1 Only) {98} | PROGRAMMING | 2400 | ||
| 2220 | Lucky Number 2 | constructive algorithms | Statement | B | Codeforces Round 104 (Div. 1) {145} | PROGRAMMING | Codeforces Round #104 - Editorial | 1800 | |
| 107 | Cube Snake | constructive algorithms | Statement | D | Codeforces Round 125 (Div. 1) {198} | PROGRAMMING | Solutions for Codeforces Round #125 | 2700 | |
| 1333 | Boring Partition | constructive algorithms | Statement | B | Codeforces Round 148 (Div. 1) {238} | PROGRAMMING | 2100 | ||
| 548 | Challenging Balloons | constructive algorithms | Statement | G | Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements) {241} | PROGRAMMING | 1900 | ||
| 3626 | Parity Game | constructive algorithms | Statement | A | Codeforces Round 180 (Div. 1) {297} | PROGRAMMING | Tutorial for E | 1700 | |
| 589 | Color the Carpet | constructive algorithms | Statement | D | Codeforces Round 180 (Div. 1) {297} | PROGRAMMING | 2400 | ||
| 962 | Splitting the Uniqueness | constructive algorithms | Statement | C | Codeforces Round 180 (Div. 1) {297} | PROGRAMMING | 2700 | ||
| 3088 | Yaroslav and Sequence | constructive algorithms | Statement | A | Codeforces Round 182 (Div. 1) {301} | PROGRAMMING | Codeforces Round #182 tutorial | 1800 | |
| 475 | Yaroslav and Algorithm | constructive algorithms | Statement | C | Codeforces Round 182 (Div. 1) {301} | PROGRAMMING | Codeforces Round #182 tutorial | 2700 | |
| 407 | The Evil Temple and the Moving Rocks | constructive algorithms | Statement | D | Codeforces Round 192 (Div. 1) {329} | PROGRAMMING | 2400 | ||
| 910 | Graph Reconstruction | constructive algorithms | Statement | C | Codeforces Round 192 (Div. 1) {329} | PROGRAMMING | Codeforces Round #192 Editorial | 2600 | |
| 516 | Inna and Sweet Matrix | constructive algorithms | Statement | D | Codeforces Round 229 (Div. 2) {390} | PROGRAMMING | 2000.0 | ||
| 214 | Tree and Array | constructive algorithms | Statement | C | Codeforces Round 233 (Div. 1) {398} | PROGRAMMING | 1500.0 | ||
| 2853 | Harmony Analysis | constructive algorithms | Statement | C | Codeforces Round 337 (Div. 2) {610} | PROGRAMMING | Codeforces Round #337 (Div.2) Editorial | 1800 | |
| 7994 | Guess the Permutation | constructive algorithms | Statement | B | Wunder Fund Round 2016 (Div. 1 + Div. 2 combined) {618} | PROGRAMMING | Wunder Fund Round 2016 Editorials | 1200 | |
| 3009 | Optimal Number Permutation | constructive algorithms | Statement | D | Educational Codeforces Round 7 {622} | PROGRAMMING | Editorial of Educational Codeforces Round 7 | 1900 | |
| 291 | Create a Maze | constructive algorithms | Statement | D | Codeforces Round 372 (Div. 1) {715} | PROGRAMMING | 3000 | ||
| 102 | Homework | constructive algorithms | Statement | C | Russian Code Cup 2016 - Finals [Unofficial Mirror, Div. 1 Only Recommended] {720} | PROGRAMMING | Russian Code Cup 2016 — Results and Tutorial | 3100 | |
| 8335 | Alyona and flowers | constructive algorithms | Statement | B | Codeforces Round 381 (Div. 2) {740} | PROGRAMMING | 1200 | ||
| 533 | Parquet Re-laying | constructive algorithms | Statement | D | Codeforces Round 402 (Div. 1) {778} | PROGRAMMING | Codeforces Round #402, Editorial | 2700 | |
| 6590 | Distances to Zero | constructive algorithms | Statement | B | Educational Codeforces Round 20 {803} | PROGRAMMING | 51768 | 1200 | |
| 4941 | Maximal Binary Matrix | constructive algorithms | Statement | A | Educational Codeforces Round 20 {803} | PROGRAMMING | 51768 | 1500 | |
| 431 | The same permutation | constructive algorithms | Statement | E | Codeforces Round 411 (Div. 1) {804} | PROGRAMMING | Codeforces Round #411 Editorial | 3100 | |
| 16976 | 3-palindrome | constructive algorithms | Statement | B | Codeforces Round 411 (Div. 2) {805} | PROGRAMMING | 51846 | 1000 | |
| 5638 | An express train to reveries | constructive algorithms | Statement | B | Codeforces Round 418 (Div. 2) {814} | PROGRAMMING | 1300 | ||
| 2380 | Sum of Nestings | constructive algorithms | Statement | C | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred) {847} | PROGRAMMING | 1900 | ||
| 5131 | From Y to Y | constructive algorithms | Statement | A | Codeforces Round 431 (Div. 1) {848} | PROGRAMMING | Codeforces Round #431 Editorial | 1600 | |
| 4098 | Mahmoud and Ehab and the xor | constructive algorithms | Statement | C | Codeforces Round 435 (Div. 2) {862} | PROGRAMMING | Codeforces round #435 editorial | 1800 | |
| 4333 | Save the problem! | constructive algorithms | Statement | A | MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists) {865} | PROGRAMMING | 1400 | ||
| 5728 | Slava and tanks | constructive algorithms | Statement | C | Codeforces Round 442 (Div. 2) {877} | PROGRAMMING | 55362 | 1600 | |
| 581 | AND-permutations | constructive algorithms | Statement | F | Codeforces Round 455 (Div. 2) {909} | PROGRAMMING | Codeforces Round #455 (Div. 2) Editorial | 2600 | |
| 523 | Aztec Catacombs | constructive algorithms | Statement | D | VK Cup 2018 - Round 3 {925} | PROGRAMMING | Разбор VK 2018 Round 3 + Codeforces Round #477 | 2700 | |
| 10307 | Palindromic Supersequence | constructive algorithms | Statement | A | ICM Technex 2018 and Codeforces Round 463 (Div. 1 + Div. 2, combined) {932} | PROGRAMMING | 57796 | 800 | |
| 238 | Puzzling Language | constructive algorithms | Statement | G | April Fools Contest 2018 {952} | PROGRAMMING | April Fools Day Contest 2018: editorial | 2500 | |
| 4701 | Marlin | constructive algorithms | Statement | B | Codeforces Round 480 (Div. 2) {980} | PROGRAMMING | Tutorial | 1600 | |
| 11391 | Binary String Constructing | constructive algorithms | Statement | B | Codeforces Round 494 (Div. 3) {1003} | PROGRAMMING | 60417 | 1300 | |
| 1146 | Restore Array | constructive algorithms | Statement | E | AIM Tech Round 5 (rated, Div. 1 + Div. 2) {1028} | PROGRAMMING | 61493 | 2400 | |
| 533 | Triple Flips | constructive algorithms | Statement | E | Technocup 2019 - Elimination Round 2 {1031} | PROGRAMMING | Codeforces Round #517 and Technocup 2019 Elimination Round 2 Editorial | 2900 | |
| 213 | 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 | |
| 657 | Knights | constructive algorithms | Statement | C | Codeforces Round 518 (Div. 1) [Thanks, Mail.Ru!] {1067} | PROGRAMMING | Tutorial | 2800 | |
| 302 | 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 | |
| 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 | |
| 1992 | Easy Chess | constructive algorithms | Statement | E | 2018-2019 ICPC, NEERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1089} | PROGRAMMING | 1800 | ||
| 2105 | Similar Arrays | constructive algorithms | Statement | D | 2018-2019 Russia Open High School Programming Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1090} | PROGRAMMING | 1900 | ||
| 326 | 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 | ||
| 2210 | Wrong Answer | constructive algorithms | Statement | B | Codeforces Round 542 [Alex Lopashev Thanks-Round] (Div. 1) {1129} | PROGRAMMING | 65520 | 2200 | |
| 506 | Nauuo and Portals | constructive algorithms | Statement | D | Codeforces Round 564 (Div. 1) {1172} | PROGRAMMING | Codeforces Round #564 Editorial | 2800 | |
| 4392 | Tolik and His Uncle | constructive algorithms | Statement | B | Codeforces Round 569 (Div. 1) {1179} | PROGRAMMING | Editorial of Round #569 | 1800 | |
| 6040 | Magic Grid | constructive algorithms | Statement | C | Manthan, Codefest 19 (open for everyone, rated, Div. 1 + Div. 2) {1208} | PROGRAMMING | 69357 | 1800 | |
| 9699 | Box | constructive algorithms | Statement | B | Technocup 2020 - Elimination Round 3 {1227} | PROGRAMMING | Разбор задач №2 | 1200 | |
| 5534 | Messy | constructive algorithms | Statement | C | Technocup 2020 - Elimination Round 3 {1227} | PROGRAMMING | Разбор задач №2 | 1700 | |
| 1050 | Not Same | constructive algorithms | Statement | G | Technocup 2020 - Elimination Round 3 {1227} | PROGRAMMING | Разбор задач №2 | 2500 | |
| 373 | Balanced Reversals | constructive algorithms | Statement | H | Codeforces Global Round 5 {1237} | PROGRAMMING | T | 3200 | |
| 232 | DevOps Best Practices | constructive algorithms | Statement | D | 2019-2020 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1267} | PROGRAMMING | nerc-2019-tutorial.pdf | 3200 | |
| 384 | Cactus Revenge | constructive algorithms | Statement | C | 2019-2020 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1267} | PROGRAMMING | 3400 | ||
| 153 | Help BerLine | constructive algorithms | Statement | H | 2019-2020 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1267} | PROGRAMMING | nerc-2019-tutorial.pdf | 3500 | |
| 90 | Four Stones | constructive algorithms | Statement | E | Codeforces Round 606 (Div. 1, based on Technocup 2020 Elimination Round 4) {1276} | PROGRAMMING | Technocup 2020 — Elimination Round 4 + Codeforces Round 606: Editorial | 3400 | |
| 145 | DAG | constructive algorithms | Statement | B | AIM Tech Poorly Prepared Contest (unrated, funny, Div. 1 preferred) {1302} | PROGRAMMING | 73599 | ||
| 13455 | Game with Chips | constructive algorithms | Statement | C | Educational Codeforces Round 84 (Rated for Div. 2) {1327} | PROGRAMMING | Educational Codeforces Round 84 Editorial | 1600 | |
| 24667 | Little Artem | constructive algorithms | Statement | A | Codeforces Round 632 (Div. 2) {1333} | PROGRAMMING | 500.0 | Codeforces Round #632 (Div. 2) editorial | |
| 38719 | Construct the String | constructive algorithms | Statement | B | Codeforces Round 634 (Div. 3) {1335} | PROGRAMMING | 75993 | 1000 | |
| 21509 | Special Permutation | constructive algorithms | Statement | G | Codeforces Round 640 (Div. 4) {1352} | PROGRAMMING | 77161 | 1600 | |
| 13479 | Even Picture | constructive algorithms | Statement | C | Codeforces Global Round 8 {1368} | PROGRAMMING | 1500.0 | Codeforces Global Round 8: editorial |