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 ... 6 7 8 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 110119 | Registration System | data structures hashing implementation | Statement | C | Codeforces Beta Round 4 (Div. 2 Only) {4} | PROGRAMMING | 1500 | ||
| 18283 | Longest Regular Bracket Sequence | constructive algorithms data structures dp greedy sortings strings | Statement | C | Codeforces Beta Round 5 {5} | PROGRAMMING | C, D и E с CBR5 - разбор | 1900 | |
| 2510 | Bindian Signalizing | data structures | Statement | E | Codeforces Beta Round 5 {5} | PROGRAMMING | C, D и E с CBR5 - разбор | 2400 | |
| 3905 | Exposition | binary search data structures dsu trees two pointers | Statement | E | Codeforces Beta Round 6 (Div. 2 Only) {6} | PROGRAMMING | Beta Round #6 - Разбор задач | 1900 | |
| 2915 | Ball | data structures sortings | Statement | D | Codeforces Beta Round 12 (Div 2 Only) {12} | PROGRAMMING | 2400 | ||
| 8105 | Holes | data structures dsu | Statement | E | Codeforces Beta Round 13 {13} | PROGRAMMING | Codeforces Beta Round #13 editorial | 2700 | |
| 925 | Map | data structures implementation sortings | Statement | D | Codeforces Beta Round 15 {15} | PROGRAMMING | Короткий разбор задач CF #15 | 2500 | |
| 15493 | Stripe | data structures implementation | Statement | C | Codeforces Beta Round 18 (Div. 2 Only) {18} | PROGRAMMING | Codeforces Beta Round #18(Div. 2) Tutorial | 1400 | |
| 3201 | Points | data structures | Statement | D | Codeforces Beta Round 19 {19} | PROGRAMMING | Code Force Beta Round 19 Solution | 2800 | |
| 681 | Don't fear, DravDe is kind | binary search data structures dp hashing | Statement | D | Codeforces Beta Round 28 (Codeforces format) {28} | PROGRAMMING | Codeforces Beta Round #28 (Разбор задач A и B) | 2600 | |
| 6547 | Mail Stamps | data structures dfs and similar graphs implementation | Statement | C | Codeforces Beta Round 29 (Div. 2, Codeforces format) {29} | PROGRAMMING | My solution @ Round #29, [without Problem E] | 1700 | |
| 926 | Tricky and Clever Password | binary search constructive algorithms data structures greedy hashing strings | Statement | E | Codeforces Beta Round 30 (Codeforces format) {30} | PROGRAMMING | Codeforces Beta Round #30. Tutorial for problem A | 2700 | |
| 882 | Parade | data structures sortings | Statement | E | Codeforces Beta Round 35 (Div. 2) {35} | PROGRAMMING | 2300 | ||
| 2216 | Old Berland Language | data structures greedy trees | Statement | C | Codeforces Beta Round 37 {37} | PROGRAMMING | Codeforces Beta Round #37 (Tutorial) | 1900 | |
| 815 | Queue | data structures | Statement | G | School Personal Contest #1 (Winter Computer School 2010/11) - Codeforces Beta Round 38 (ACM-ICPC Rules) {38} | PROGRAMMING | Школьная индивидуальная олимпиада #1 - Codeforces Beta Round #38. (Разбор задачи C) | 2300 | |
| 503 | Shooting Gallery | data structures implementation | Statement | G | School Team Contest 2 (Winter Computer School 2010/11) {44} | PROGRAMMING | School Team Contest #2 (Winter Computer School 2010/2011): tutorial of A-E, H, J. | 2600 | |
| 1152 | Dancing Lessons | data structures | Statement | C | School Team Contest 3 (Winter Computer School 2010/11) {45} | PROGRAMMING | 2000 | ||
| 1098 | Parking Lot | data structures implementation | Statement | D | School Personal Contest #2 (Winter Computer School 2010/11) - Codeforces Beta Round 43 (ACM-ICPC Rules) {46} | PROGRAMMING | School Individual Contest #2 (WCS 2010/11) - Codeforces Beta Round #43 (ACM-ICPC Rules). Tasks B, D, E tutorial. | 1800 | |
| 1163 | Comb | data structures dp | Statement | E | School Personal Contest #2 (Winter Computer School 2010/11) - Codeforces Beta Round 43 (ACM-ICPC Rules) {46} | PROGRAMMING | School Individual Contest #2 (WCS 2010/11) - Codeforces Beta Round #43 (ACM-ICPC Rules): A, C, F and G tutorial | 1900 | |
| 443 | Cannon | data structures geometry sortings | Statement | E | Codeforces Beta Round 44 (Div. 2) {47} | PROGRAMMING | Codeforces Beta Round #44: tutorial | 2100 | |
| 11395 | Circular RMQ | data structures | Statement | C | Codeforces Testing Round 1 {52} | PROGRAMMING | 2200 | ||
| 1311 | Corporation Mail | data structures expression parsing implementation | Statement | C | Codeforces Beta Round 52 (Div. 2) {56} | PROGRAMMING | CodeForces Beta Round #52 :: Разбор задач | 1800 | |
| 2848 | Domino Principle | binary search data structures sortings | Statement | E | Codeforces Beta Round 52 (Div. 2) {56} | PROGRAMMING | CodeForces Beta Round #52 :: Разбор задач | 2100 | |
| 15410 | Enemy is weak | data structures trees | Statement | E | Codeforces Beta Round 57 (Div. 2) {61} | PROGRAMMING | Round 57-A | 2100 | |
| 1195 | Petya and File System | data structures implementation | Statement | C | Codeforces Beta Round 61 (Div. 2) {66} | PROGRAMMING | Codeforces Beta Round #61 (Div. 2): Editorial | 1800 | |
| 927 | Petya and Post | data structures dp | Statement | E | Codeforces Beta Round 61 (Div. 2) {66} | PROGRAMMING | Codeforces Beta Round #61 (Div. 2): Editorial | 2100 | |
| 1780 | Optical Experiment | binary search data structures dp | Statement | D | Manthan 2011 {67} | PROGRAMMING | 1900 | ||
| 532 | Half-decay tree | data structures divide and conquer dp math probabilities | Statement | D | Codeforces Beta Round 62 {68} | PROGRAMMING | 2400 | ||
| 5111 | Subsegments | data structures implementation | Statement | E | Codeforces Beta Round 63 (Div. 2) {69} | PROGRAMMING | Analysis Codeforces Beta Round #63 (Div. 2) | 1800 | |
| 632 | Lucky Tickets | binary search data structures sortings two pointers | Statement | C | Codeforces Beta Round 64 {70} | PROGRAMMING | Analysis Codeforces Beta Round #64 | 2200 | |
| 1100 | Professor's task | data structures geometry | Statement | D | Codeforces Beta Round 64 {70} | PROGRAMMING | Analysis Codeforces Beta Round #64 | 2700 | |
| 420 | Hanger | data structures | Statement | D | Codeforces Beta Round 68 {74} | PROGRAMMING | Codeforces Beta Round #68, solutions problem A and problem C | 2300 | |
| 2079 | Big Maximum Sum | data structures dp greedy implementation math trees | Statement | D | Codeforces Beta Round 67 (Div. 2) {75} | PROGRAMMING | Codeforces Beta Round #67 (Div. 2) Editorial | 2100 | |
| 778 | Tourist | binary search data structures dp | Statement | F | All-Ukrainian School Olympiad in Informatics {76} | PROGRAMMING | All-Ukrainian School Olympiad in Informatics: editorial (A,B,C,D,E,F) | 2400 | |
| 2122 | Beaver | data structures dp greedy hashing strings two pointers | Statement | C | Codeforces Beta Round 71 {79} | PROGRAMMING | Codeforces Beta Round #71 Editorial | 1800 | |
| 872 | General Mobilization | data structures dfs and similar sortings | Statement | C | Yandex.Algorithm 2011: Qualification 2 {82} | PROGRAMMING | 1889 | 1900 | |
| 1085 | Embassy Queue | data structures greedy | Statement | B | Yandex.Algorithm 2011: Round 1 {85} | PROGRAMMING | Yandex.Algorithm 2011 - Round 1. Problem C. Tutorial | 1800 | |
| 2428 | Sum of Medians | binary search brute force data structures implementation | Statement | D | Yandex.Algorithm 2011: Round 1 {85} | PROGRAMMING | Yandex.Algorithm 2011 - Round 1. Problem C. Tutorial | 2200 | |
| 17011 | Powerful array | data structures implementation math two pointers | Statement | D | Yandex.Algorithm 2011: Round 2 {86} | PROGRAMMING | Problemset analysis (Yandex, Round 2) | 2700 | |
| 689 | Chip Play | brute force data structures implementation | Statement | C | Codeforces Beta Round 74 (Div. 1 Only) {89} | PROGRAMMING | Solutions for Codeforces Beta Round #74 | 2100 | |
| 7799 | Queue | binary search data structures | Statement | B | Codeforces Beta Round 75 (Div. 1 Only) {91} | PROGRAMMING | Analysis Codeforces Beta Round #75 | 1600 | |
| 673 | Igloo Skyscraper | data structures geometry | Statement | E | Codeforces Beta Round 75 (Div. 1 Only) {91} | PROGRAMMING | Analysis Codeforces Beta Round #75 | 2400 | |
| 143 | Name the album | *special data structures implementation | Statement | G | Unknown Language Round 3 {100} | PROGRAMMING | 2000 | ||
| 3211 | Buses | binary search data structures dp | Statement | B | Codeforces Beta Round 79 (Div. 1 Only) {101} | PROGRAMMING | Codeforces Beta Round 79, editoral | 1900 | |
| 2549 | Time to Raid Cowavans | brute force data structures sortings | Statement | D | Codeforces Beta Round 80 (Div. 1 Only) {103} | PROGRAMMING | Tutorial | 2200 | |
| 4117 | Petya and Divisors | binary search data structures number theory | Statement | B | Codeforces Beta Round 85 (Div. 1 Only) {111} | PROGRAMMING | Codeforces Beta Round #85: Разбор задач | 1900 | |
| 3271 | Petr# | brute force data structures hashing strings | Statement | B | Codeforces Beta Round 86 (Div. 1 Only) {113} | PROGRAMMING | Codeforces Beta Round #86 Editorial | 1900 | |
| 2227 | Linear Kingdom Races | data structures dp | Statement | E | Codeforces Beta Round 87 (Div. 1 Only) {115} | PROGRAMMING | Tutorial | 2400 | |
| 417 | Tree or not Tree | data structures divide and conquer implementation trees | Statement | E | Codeforces Beta Round 88 {117} | PROGRAMMING | Codeforces Beta Round #88 (Editorial) | 2800 | |
| 2063 | Lucky Array | data structures | Statement | E | Codeforces Beta Round 91 (Div. 1 Only) {121} | PROGRAMMING | Разбор задач | 2300 | |
| 1381 | Last Chance | data structures implementation strings | Statement | E | Codeforces Beta Round 98 (Div. 2) {137} | PROGRAMMING | Codeforces Beta Round #98 (Div. 2): Editorial | 2000 | |
| 963 | Mushroom Gnomes - 2 | binary search data structures probabilities sortings | Statement | C | Codeforces Beta Round 99 (Div. 1) {138} | PROGRAMMING | Codeforces Beta Round #99: editorial | 2500 | |
| 4767 | New Year Snowmen | binary search data structures greedy | Statement | C | Codeforces Round 100 {140} | PROGRAMMING | Codeforces Round #100: problem analysis | 1800 | |
| 5116 | Missile Silos | data structures dfs and similar graphs shortest paths | Statement | D | Codeforces Round 103 (Div. 2) {144} | PROGRAMMING | Codeforces Round #103 (Div. 2) Разбор Задач. | 1900 | |
| 685 | Competition | data structures greedy | Statement | E | Codeforces Round 103 (Div. 2) {144} | PROGRAMMING | Codeforces Round #103 (Div. 2) Разбор Задач. | 2300 | |
| 4003 | Lucky Queries | data structures | Statement | E | Codeforces Round 104 (Div. 1) {145} | PROGRAMMING | Codeforces Round #104 - Editorial | 2400 | |
| 269 | Lucky Pair | combinatorics data structures implementation | Statement | D | Codeforces Round 104 (Div. 1) {145} | PROGRAMMING | Codeforces Round #104 - Editorial | 2800 | |
| 748 | Smart Cheater | data structures math probabilities | Statement | C | Codeforces Round 107 (Div. 1) {150} | PROGRAMMING | Tutorial | 2300 | |
| 1041 | Freezing with Style | binary search data structures divide and conquer trees | Statement | E | Codeforces Round 107 (Div. 1) {150} | PROGRAMMING | Tutorial | 3000 | |
| 2455 | Suspects | constructive algorithms data structures implementation | Statement | B | Codeforces Round 110 (Div. 1) {156} | PROGRAMMING | Codeforces Round 110 — Разбор задач | 1800 | |
| 10432 | Cd and pwd commands | *special data structures implementation | Statement | C | VK Cup 2012 Qualification Round 1 {158} | PROGRAMMING | Simple solution to vk cup Qualification Round 1 and 2 | 1900 | |
| 3208 | String Manipulation 1.0 | *special binary search brute force data structures strings | Statement | C | VK Cup 2012 Qualification Round 2 {159} | PROGRAMMING | Simple solution to vk cup Qualification Round 1 and 2 | 2000 | |
| 1099 | Zebra Tower | *special data structures greedy sortings | Statement | E | VK Cup 2012 Qualification Round 2 {159} | PROGRAMMING | Simple solution to vk cup Qualification Round 1 and 2 | 2100 | |
| 686 | Buses and People | binary search data structures sortings | Statement | E | Codeforces Round 111 (Div. 2) {160} | PROGRAMMING | Codeforces Round #111 (Div. 2) Разбор Задач | 2400 | |
| 2202 | e-Government | data structures dfs and similar dp strings trees | Statement | E | VK Cup 2012 Round 2 {163} | PROGRAMMING | VK Cup 2012 Round 2 — Разбор | 2800 | |
| 1937 | Beard Graph | data structures dsu trees | Statement | D | Codeforces Round 112 (Div. 2) {165} | PROGRAMMING | Codeforces Round #112 (Div. 2) Tutorial | 2200 | |
| 217 | Wizards and Roads | data structures divide and conquer graph matchings graphs greedy | Statement | D | Codeforces Round 114 (Div. 1) {167} | PROGRAMMING | Codeforces Round #114 — Tutorial | 2900 | |
| 648 | Camping Groups | data structures sortings | Statement | E | Croc Champ 2012 - Round 1 {173} | PROGRAMMING | Croc Champ 2012 — Round 1 — Editorial | 2600 | |
| 1260 | Range Increments | data structures greedy | Statement | C | VK Cup 2012 Round 3 (Unofficial Div. 2 Edition) {174} | PROGRAMMING | VK Cup 2012 Round 3 — Разбор | 1800 | |
| 70 | Gnomes of Might and Magic | data structures graphs implementation shortest paths | Statement | F | Codeforces Round 115 {175} | PROGRAMMING | Codeforces Round #115 — editorial A-E | 3000 | |
| 1529 | Archaeology | data structures dfs and similar trees | Statement | E | Croc Champ 2012 - Round 2 {176} | PROGRAMMING | Croc Champ 2012 — Round 2 — Editorial | 3000 | |
| 2706 | Encrypting Messages | data structures | Statement | D2 | ABBYY Cup 2.0 - Easy {177} | PROGRAMMING | 1500 | ||
| 822 | Optimal Sum | data structures greedy | Statement | C | Codeforces Round 117 (Div. 2) {182} | PROGRAMMING | Codeforces Round #117 (Div. 2) Разбор Задач | 2300 | |
| 173 | Soap Time! - 2 | binary search data structures | Statement | E | Codeforces Round 118 (Div. 1) {185} | PROGRAMMING | Tutorial | 2900 | |
| 583 | BRT Contract | data structures | Statement | D | Codeforces Round 119 (Div. 1) {187} | PROGRAMMING | Tutorial | 2700 | |
| 117 | Heaven Tour | data structures greedy | Statement | E | Codeforces Round 119 (Div. 1) {187} | PROGRAMMING | Tutorial | 2800 | |
| 1750 | Counter Attack | data structures dsu graphs hashing sortings | Statement | E | Codeforces Round 120 (Div. 2) {190} | PROGRAMMING | Codeforces Round #120 (Div.2) — editorial | 2300 | |
| 9371 | Fools and Roads | data structures dfs and similar trees | Statement | C | Codeforces Round 121 (Div. 1) {191} | PROGRAMMING | Разбор Codeforces Round #121 | 2100 | |
| 961 | Thwarting Demonstrations | binary search data structures trees | Statement | E | Codeforces Round 121 (Div. 1) {191} | PROGRAMMING | Разбор Codeforces Round #121 | 2200 | |
| 608 | Two Segments | data structures | Statement | D | Codeforces Round 122 (Div. 1) {193} | PROGRAMMING | Editoral Codeforces Round #122 | 2800 | |
| 5520 | After Training | data structures implementation math | Statement | B | Codeforces Round 123 (Div. 2) {195} | PROGRAMMING | Codeforces Round #123 (Div. 2) Разбор Задач | 1300 | |
| 861 | Building Forest | data structures dsu graphs | Statement | E | Codeforces Round 123 (Div. 2) {195} | PROGRAMMING | Codeforces Round #123 (Div. 2) Разбор Задач | 2200 | |
| 603 | The Next Good String | data structures greedy hashing strings | Statement | D | Codeforces Round 124 (Div. 1) {196} | PROGRAMMING | Codeforces Round #124 — editorial | 2600 | |
| 558 | Gripping Story | binary search data structures sortings | Statement | E | Codeforces Round 125 (Div. 1) {198} | PROGRAMMING | Solutions for Codeforces Round #125 | 2400 | |
| 735 | Cinema | brute force data structures | Statement | A | Codeforces Round 126 (Div. 2) {200} | PROGRAMMING | Editorial of Codeforces Round #126 (Div. 2) | 2600 | |
| 5918 | Little Elephant and Cards | binary search data structures | Statement | B | Codeforces Round 129 (Div. 1) {204} | PROGRAMMING | Tutorial | 1600 | |
| 1450 | Little Elephant and Strings | data structures implementation string suffix structures two pointers | Statement | E | Codeforces Round 129 (Div. 1) {204} | PROGRAMMING | Tutorial | 2800 | |
| 164 | Game with Two Trees | data structures | Statement | C3 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 2700 | ||
| 9061 | Blood Cousins | binary search data structures dfs and similar trees | Statement | E | Codeforces Round 130 (Div. 2) {208} | PROGRAMMING | 4930 | 2400 | |
| 615 | Cutting a Fence | binary search data structures dsu | Statement | D | VK Cup 2012 Finals (unofficial online-version) {212} | PROGRAMMING | 2400 | ||
| 972 | Two Permutations | data structures hashing strings | Statement | E | Codeforces Round 131 (Div. 1) {213} | PROGRAMMING | Codeforces Round #131 Tutorial | 2600 | |
| 355 | Alien DNA | data structures dsu trees | Statement | E | Codeforces Round 134 (Div. 1) {217} | PROGRAMMING | Editorial for Codeforces Round #134 | 2700 | |
| 698 | Parking Lot | data structures | Statement | E | Codeforces Round 135 (Div. 2) {219} | PROGRAMMING | User editorial for Codeforces Round #135 (Div. 2) | 2500 | |
| 13020 | Little Elephant and Array | constructive algorithms data structures | Statement | B | Codeforces Round 136 (Div. 1) {220} | PROGRAMMING | Codeforces Round #136 — Editorial | 1900 | |
| 1039 | Little Elephant and Shifts | data structures | Statement | C | Codeforces Round 136 (Div. 1) {220} | PROGRAMMING | Codeforces Round #136 — Editorial | 2300 | |
| 1726 | Little Elephant and Inversions | data structures two pointers | Statement | E | Codeforces Round 136 (Div. 1) {220} | PROGRAMMING | Codeforces Round #136 — Editorial | 2400 | |
| 6580 | Cosmic Tables | data structures implementation | Statement | B | Codeforces Round 137 (Div. 2) {222} | PROGRAMMING | Разбор задач | 1300 | |
| 2821 | Bracket Sequence | data structures expression parsing implementation | Statement | A | Codeforces Round 138 (Div. 1) {223} | PROGRAMMING | 1800 | ||
| 2036 | Two Strings | data structures dp strings | Statement | B | Codeforces Round 138 (Div. 1) {223} | PROGRAMMING | 2000 | ||
| 1017 | Anniversary | data structures implementation math matrices number theory | Statement | C | Codeforces Round 140 (Div. 1) {226} | PROGRAMMING | Codeforces Round #140 Editorial | 2100 | |
| 551 | Noble Knight's Path | data structures trees | Statement | E | Codeforces Round 140 (Div. 1) {226} | PROGRAMMING | Codeforces Round #140 Editorial | 2900 | |
| 439 | Zigzag | data structures | Statement | D | Codeforces Round 141 (Div. 2) {228} | PROGRAMMING | Codeforces Round #141 (Div. 2) Tutorial | 2300 | |
| 5827 | Planets | binary search data structures graphs shortest paths | Statement | B | Codeforces Round 142 (Div. 1) {229} | PROGRAMMING | Codeforces Round #142 Problem Analysis | 1900 | |
| 2332 | Cactus | data structures dfs and similar dp graphs trees | Statement | E | Codeforces Round 143 (Div. 2) {231} | PROGRAMMING | Tutorial Codeforces Round #143 | 2400 | |
| 523 | Fence | binary search data structures string suffix structures | Statement | D | Codeforces Round 144 (Div. 1) {232} | PROGRAMMING | Editorial for Codeforces Round #144 | 2700 | |
| 2483 | Cyclical Quest | data structures string suffix structures strings | Statement | C | Codeforces Round 146 (Div. 1) {235} | PROGRAMMING | Codeforces Round #146 Tutorial | 2700 | |
| 268 | Tape Programming | data structures implementation | Statement | D | Codeforces Round 148 (Div. 1) {238} | PROGRAMMING | Editorial for Codeforces Round #148 | 2700 | |
| 2281 | TorCoder | data structures | Statement | F | Codeforces Round 145 (Div. 1, ACM-ICPC Rules) {240} | PROGRAMMING | 2600 | ||
| 985 | Friends | binary search bitmasks data structures math | Statement | B | Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements) {241} | PROGRAMMING | 2700 | ||
| 12001 | XOR on Segment | bitmasks data structures | Statement | E | Codeforces Round 149 (Div. 2) {242} | PROGRAMMING | Codeforces Round #149 (Div. 2) Tutorial | 2000 | |
| 233 | Cubes | data structures dp geometry two pointers | Statement | D | Codeforces Round 150 (Div. 1) {243} | PROGRAMMING | Editorial for Codeforces Round #150 | 2700 | |
| 216 | Matrix | data structures | Statement | E | Codeforces Round 150 (Div. 1) {243} | PROGRAMMING | Editorial for Codeforces Round #150 | 2900 | |
| 4593 | Blood Cousins Return | binary search data structures dfs and similar dp sortings | Statement | E | Codeforces Round 151 (Div. 2) {246} | PROGRAMMING | Codeforces Round #151 (Div. 2) Tutorial | 2300 | |
| 509 | Donkey and Stars | data structures dp geometry math sortings | Statement | D | Codeforces Round 152 (Div. 1) {249} | PROGRAMMING | Разбор задач Codeforces Round #152 | 2600 | |
| 2912 | Text Editor | data structures dfs and similar graphs greedy shortest paths | Statement | C | Codeforces Round 154 (Div. 2) {253} | PROGRAMMING | Codeforces Round #154 (Div. 2) — tutorial | 1600 | |
| 585 | Printer | binary search data structures implementation sortings | Statement | E | Codeforces Round 154 (Div. 2) {253} | PROGRAMMING | Codeforces Round #154 (Div. 2) — tutorial | 2300 | |
| 731 | Lucky Arrays | data structures | Statement | E | Codeforces Round 156 (Div. 1) {256} | PROGRAMMING | Codeforces Round #156 tutorial | 2400 | |
| 347 | Greedy Elevator | data structures implementation | Statement | E | Codeforces Round 159 (Div. 2) {257} | PROGRAMMING | Codeforces Round #159 (Div. 2) Разбор Задач | 2500 | |
| 1324 | Little Elephant and Tree | data structures dfs and similar trees | Statement | E | Codeforces Round 157 (Div. 1) {258} | PROGRAMMING | Codeforces Round #157 — Editorial | 2400 | |
| 512 | Dividing Kingdom | binary search brute force data structures | Statement | E | Codeforces Round 158 (Div. 2) {260} | PROGRAMMING | Codeforces Round #158 (Div. 2) Tutorial | 2600 | |
| 446 | Rhombus | brute force data structures dp | Statement | E | Codeforces Round 161 (Div. 2) {263} | PROGRAMMING | Codeforces Round #161 Tutorial | 2600 | |
| 11832 | Escape from Stones | constructive algorithms data structures implementation two pointers | Statement | A | Codeforces Round 162 (Div. 1) {264} | PROGRAMMING | Tutorial | 1400 | |
| 472 | Roadside Trees | data structures dp | Statement | E | Codeforces Round 162 (Div. 1) {264} | PROGRAMMING | Tutorial | 2900 | |
| 1064 | More Queries to Array... | data structures math | Statement | E | Codeforces Round 163 (Div. 2) {266} | PROGRAMMING | Codeforces Round #163 (Div. 2) Tutorial | 2600 | |
| 496 | Maximum Waterfall | data structures dp graphs sortings | Statement | D | Codeforces Round 165 (Div. 1) {269} | PROGRAMMING | Разбор Codeforces Round #165 | 2500 | |
| 4451 | Multithreading | data structures greedy implementation | Statement | B | Codeforces Round 165 (Div. 2) {270} | PROGRAMMING | Разбор Codeforces Round #165 | 1400 | |
| 14172 | Good Substrings | data structures strings | Statement | D | Codeforces Round 166 (Div. 2) {271} | PROGRAMMING | editroal | 1800 | |
| 7213 | Dima and Staircase | data structures implementation | Statement | C | Codeforces Round 167 (Div. 2) {272} | PROGRAMMING | Codeforces Round #167 tutorial | 1500 | |
| 344 | Mirror Room | data structures implementation | Statement | E | Codeforces Round 168 (Div. 1) {274} | PROGRAMMING | Codeforces Round #168 Editorial | 3000 | |
| 40148 | Little Girl and Maximum Sum | data structures greedy implementation sortings | Statement | C | Codeforces Round 169 (Div. 2) {276} | PROGRAMMING | Codeforces Round #169 — Unofficial Editorial | 1600 | |
| 1863 | Little Girl and Problem on Trees | data structures graphs trees | Statement | E | Codeforces Round 169 (Div. 2) {276} | PROGRAMMING | Codeforces Round #169 — Unofficial Editorial | 2300 | |
| 5286 | Maximum Xor Secondary | data structures implementation two pointers | Statement | B | Codeforces Round 172 (Div. 1) {280} | PROGRAMMING | T | 2000 | |
| 1663 | k-Maximum Subsequence Sum | data structures flows graphs implementation | Statement | D | Codeforces Round 172 (Div. 1) {280} | PROGRAMMING | T | 2800 | |
| 274 | Sequence Transformation | data structures dp implementation math | Statement | E | Codeforces Round 172 (Div. 1) {280} | PROGRAMMING | Codeforces Round #172 Editorial | 3000 | |
| 4400 | Sausage Maximization | bitmasks data structures trees | Statement | E | Codeforces Round 173 (Div. 2) {282} | PROGRAMMING | Round #173 — Editorial | 2100 | |
| 6877 | Cows and Sequence | constructive algorithms data structures implementation | Statement | A | Codeforces Round 174 (Div. 1) {283} | PROGRAMMING | Editorial for Codeforces #174 | 1600 | |
| 856 | Cow Tennis Tournament | combinatorics data structures math | Statement | E | Codeforces Round 174 (Div. 1) {283} | PROGRAMMING | Math Problems on Codeforces #174 | 2700 | |
| 458 | Tourists | data structures sortings | Statement | D | Codeforces Round 176 (Div. 1) {286} | PROGRAMMING | Tutorial | 2500 | |
| 4943 | Copying Data | data structures | Statement | E | Croc Champ 2013 - Round 1 {292} | PROGRAMMING | Чемпионат КРОК 2013 — Раунд 1 (Разбор задач) | 1900 | |
| 2784 | Connected Components | data structures dfs and similar dp dsu | Statement | D | Croc Champ 2013 - Round 1 {292} | PROGRAMMING | Чемпионат КРОК 2013 — Раунд 1 (Разбор задач) | 1900 | |
| 2008 | Close Vertices | data structures divide and conquer trees | Statement | E | Croc Champ 2013 - Round 2 {293} | PROGRAMMING | Croc Champ 2013 — Round 2 — Editorial | 2700 | |
| 26354 | Greg and Array | data structures implementation | Statement | A | Codeforces Round 179 (Div. 1) {295} | PROGRAMMING | Codeforces Round #179 tutorial | 1500 | |
| 824 | Yaroslav and Points | data structures | Statement | E | Codeforces Round 179 (Div. 1) {295} | PROGRAMMING | Codeforces Round #179 tutorial | 2500 | |
| 433 | Mystic Carvings | data structures | Statement | E | Codeforces Round 180 (Div. 1) {297} | PROGRAMMING | Tutorial | 3000 | |
| 3049 | Yaroslav and Divisors | data structures | Statement | D | Codeforces Round 182 (Div. 1) {301} | PROGRAMMING | Codeforces Round #182 tutorial | 2200 | |
| 519 | Optimizer | data structures greedy sortings | Statement | B | Testing Round 6 {306} | PROGRAMMING | 2000 | ||
| 4342 | Cats Transport | data structures dp | Statement | B | Codeforces Round 185 (Div. 1) {311} | PROGRAMMING | Codeforces Round #185 Editorial | 2400 | |
| 784 | Interval Cubing | data structures math | Statement | D | Codeforces Round 185 (Div. 1) {311} | PROGRAMMING | Codeforces Round #185 Editorial (Div.2 B&Div.1 E) | 2500 | |
| 552 | Fetch the Treasure | brute force data structures graphs shortest paths | Statement | C | Codeforces Round 185 (Div. 1) {311} | PROGRAMMING | Codeforces Round #185 Editorial | 2600 | |
| 605 | Ilya and Two Numbers | constructive algorithms data structures dsu greedy | Statement | E | Codeforces Round 186 (Div. 2) {313} | PROGRAMMING | Tutorial | 2300 | |
| 2008 | Sereja and Subsequences | data structures dp | Statement | C | Codeforces Round 187 (Div. 1) {314} | PROGRAMMING | Codeforces Round #187 tutorial | 2300 | |
| 578 | Sereja and Straight Lines | binary search data structures geometry sortings two pointers | Statement | D | Codeforces Round 187 (Div. 1) {314} | PROGRAMMING | Codeforces Round #187 tutorial | 2400 | |
| 1553 | Summer Homework | brute force data structures | Statement | E1 | ABBYY Cup 3.0 {316} | PROGRAMMING | ABBYY Cup 3.0. Solutions | 1500 | |
| 437 | Summer Homework | data structures math | Statement | E2 | ABBYY Cup 3.0 {316} | PROGRAMMING | ABBYY Cup 3.0. Solutions | 2400 | |
| 589 | Summer Homework | data structures math | Statement | E3 | ABBYY Cup 3.0 {316} | PROGRAMMING | ABBYY Cup 3.0. Solutions | 2500 | |
| 4771 | Psychos in a Line | data structures implementation | Statement | B | Codeforces Round 189 (Div. 1) {319} | PROGRAMMING | Codeforces Round #189 — Editorial | 2000 | |
| 740 | Ping-Pong | data structures | Statement | E | Codeforces Round 189 (Div. 1) {319} | PROGRAMMING | Codeforces Round #189 — Editorial | 3000 | |
| 6307 | Ciel and Gondolas | data structures divide and conquer dp | Statement | E | Codeforces Round 190 (Div. 1) {321} | PROGRAMMING | Codeforces Round #190 — Editorial | 2600 | |
| 679 | Two permutations | data structures | Statement | C | Testing Round 7 {323} | PROGRAMMING | 2200 | ||
| 1548 | Oh Sweet Beaverette | data structures sortings | Statement | A2 | ABBYY Cup 3.0 - Finals (online version) {331} | PROGRAMMING | ABBYY Cup 3.0 — Finals. Solutions | 1600 | |
| 834 | Shave Beaver! | data structures | Statement | B2 | ABBYY Cup 3.0 - Finals (online version) {331} | PROGRAMMING | ABBYY Cup 3.0 — Finals. Solutions | 1900 | |
| 204 | Escaping on Beaveractor | data structures implementation trees | Statement | D3 | ABBYY Cup 3.0 - Finals (online version) {331} | PROGRAMMING | ABBYY Cup 3.0 — Finals. Solutions | 2900 | |
| 8730 | Maximum Absurdity | data structures dp implementation | Statement | B | Codeforces Round 193 (Div. 2) {332} | PROGRAMMING | 8447 | 1500 | |
| 1030 | Students' Revenge | data structures greedy sortings | Statement | C | Codeforces Round 193 (Div. 2) {332} | PROGRAMMING | 8447 | 2200 | |
| 1188 | Optimize! | data structures | Statement | E | Codeforces Round 196 (Div. 1) {338} | PROGRAMMING | Codeforces Round #196 — Problems Analysis | 2600 | |
| 32856 | Xenia and Bit Operations | data structures trees | Statement | D | Codeforces Round 197 (Div. 2) {339} | PROGRAMMING | Codeforces Round #197 — Tutorial | 1700 | |
| 7936 | Bubble Sort Graph | binary search data structures dp | Statement | D | Codeforces Round 198 (Div. 2) {340} | PROGRAMMING | Tutorial | 1800 | |
| 1386 | Iahub and Xors | data structures | Statement | D | Codeforces Round 198 (Div. 1) {341} | PROGRAMMING | Tutorial | 2500 | |
| 10987 | Xenia and Tree | data structures divide and conquer trees | Statement | E | Codeforces Round 199 (Div. 2) {342} | PROGRAMMING | Tutorial | 2200 | |
| 18133 | Alternating Current | data structures greedy implementation | Statement | B | Codeforces Round 200 (Div. 1) {343} | PROGRAMMING | Codeforces Round #200 Tutorial | 1600 | |
| 6924 | Water Tree | data structures dfs and similar graphs trees | Statement | D | Codeforces Round 200 (Div. 1) {343} | PROGRAMMING | Codeforces Round #200 Tutorial | 2100 | |
| 2784 | Subset Sums | brute force data structures | Statement | C | Codeforces Round 202 (Div. 1) {348} | PROGRAMMING | Editorial for Codeforces Round #202 | 2600 | |
| 15159 | Color the Fence | data structures dp greedy implementation | Statement | B | Codeforces Round 202 (Div. 2) {349} | PROGRAMMING | Editorial for Codeforces Round #202 | 1700 | |
| 296 | Looking for Owls | binary search data structures geometry hashing sortings | Statement | D | Codeforces Round 203 (Div. 2) {350} | PROGRAMMING | Editorial Codeforces Round #203 (Div. 2) | 2600 | |
| 1353 | Jeff and Removing Periods | data structures | Statement | D | Codeforces Round 204 (Div. 1) {351} | PROGRAMMING | Codeforces Round #204 — tutorial | 2700 | |
| 16903 | Knight Tournament | data structures dsu | Statement | A | Codeforces Round 207 (Div. 1) {356} | PROGRAMMING | 9210 | 1700 | |
| 5756 | Pair of Numbers | binary search brute force data structures math two pointers | Statement | D | Codeforces Round 209 (Div. 2) {359} | PROGRAMMING | Editorial Codeforces Round #209 (Div. 2) | 2100 | |
| 2026 | Insertion Sort | data structures dp implementation math | Statement | C | Codeforces Round 212 (Div. 2) {362} | PROGRAMMING | Codeforces Round #212 (Div. 2). Tutorial. Part 1. | 2000 | |
| 1023 | Fools and Foolproof Roads | data structures dfs and similar dsu graphs greedy | Statement | D | Codeforces Round 212 (Div. 2) {362} | PROGRAMMING | Codeforces Round #212 (Div. 2). Tutorial. Part 1. | 2500 | |
| 226 | Two Circles | brute force data structures implementation | Statement | E | Codeforces Round 211 (Div. 2) {363} | PROGRAMMING | 9537 | 2600 | |
| 4963 | Matrix | combinatorics data structures implementation | Statement | A | Codeforces Round 213 (Div. 1) {364} | PROGRAMMING | Codeforces Round #213 Editorial | 1800 | |
| 1734 | Dima and Trap Graph | binary search data structures dfs and similar dsu shortest paths two pointers | Statement | D | Codeforces Round 214 (Div. 2) {366} | PROGRAMMING | Codeforces Round #214 (Div. 2) — Tutorial | 2400 | |
| 4550 | Sereja and Algorithm | data structures implementation | Statement | A | Codeforces Round 215 (Div. 1) {367} | PROGRAMMING | Codeforces Round #215 — tutorial | 1500 | |
| 2711 | Sereja ans Anagrams | binary search data structures | Statement | B | Codeforces Round 215 (Div. 1) {367} | PROGRAMMING | Codeforces Round #215 — tutorial | 2000 | |
| 50213 | Sereja and Suffixes | data structures dp | Statement | B | Codeforces Round 215 (Div. 2) {368} | PROGRAMMING | Codeforces Round #215 — tutorial | 1100 | |
| 2798 | Valera and Queries | binary search data structures | Statement | E | Codeforces Round 216 (Div. 2) {369} | PROGRAMMING | Editorial Codeforces Round #216 (Div. 2) | 2400 | |
| 6547 | Vessels | data structures dsu implementation trees | Statement | D | Codeforces Round 218 (Div. 2) {371} | PROGRAMMING | Codeforces Round #218 (Div. 2): Tutorial | 1900 | |
| 4966 | Watching Fireworks is Fun | data structures dp math | Statement | C | Codeforces Round 219 (Div. 1) {372} | PROGRAMMING | 9944 | 2400 | |
| 1131 | Choosing Subtree is Fun | binary search data structures dfs and similar trees two pointers | Statement | D | Codeforces Round 219 (Div. 1) {372} | PROGRAMMING | 9944 | 2600 | |
| 993 | Inna and Sequence | binary search data structures dp trees | Statement | D | Codeforces Round 220 (Div. 2) {374} | PROGRAMMING | Codeforces Round #220 (Div. 2) разбор | 2300 | |
| 207 | Inna and Babies | binary search data structures dsu geometry implementation | Statement | E | Codeforces Round 220 (Div. 2) {374} | PROGRAMMING | Codeforces Round #220 (Div. 2) разбор | 2600 | |
| 5442 | Maximum Submatrix 2 | data structures dp implementation sortings | Statement | B | Codeforces Round 221 (Div. 1) {375} | PROGRAMMING | Codeforces Round #221 Tutorial | 1800 | |
| 9018 | Tree and Queries | data structures dfs and similar trees | Statement | D | Codeforces Round 221 (Div. 1) {375} | PROGRAMMING | Codeforces Round #221 Tutorial | 2400 | |
| 2453 | Preparing for the Contest | binary search data structures greedy sortings | Statement | B | Codeforces Round 222 (Div. 1) {377} | PROGRAMMING | Codeforces Round #222 — Problem Analysis | 2100 | |
| 1344 | Developing Game | data structures | Statement | D | Codeforces Round 222 (Div. 1) {377} | PROGRAMMING | Codeforces Round #222 — Problem Analysis | 2400 | |
| 2769 | New Year Tree | data structures divide and conquer trees | Statement | F | Good Bye 2013 {379} | PROGRAMMING | Tutorial Good Bye 2013 | 2400 | |
| 19988 | Sereja and Brackets | data structures schedules | Statement | C | Codeforces Round 223 (Div. 1) {380} | PROGRAMMING | Codeforces Round #223 — Tutorial | 2100 | |
| 352 | Sereja and Dividing | data structures | Statement | E | Codeforces Round 223 (Div. 1) {380} | PROGRAMMING | Codeforces Round #223 — Tutorial | 2600 | |
| 5574 | Milking cows | data structures greedy | Statement | A | Codeforces Round 225 (Div. 1) {383} | PROGRAMMING | Tutorial | 1500 | |
| 7586 | Propagating tree | data structures dfs and similar trees | Statement | C | Codeforces Round 225 (Div. 1) {383} | PROGRAMMING | Tutorial | 2400 | |
| 10625 | Bear and Prime Numbers | binary search brute force data structures dp implementation math number theory | Statement | C | Codeforces Round 226 (Div. 2) {385} | PROGRAMMING | Codeforces Round #226 (Div. 2) — Editorial | 1800 | |
| 991 | George and Cards | binary search data structures | Statement | E | Codeforces Round 227 (Div. 2) {387} | PROGRAMMING | Editorial Codeforces Round #227 (Div. 2) | 2500 | |
| 700 | Inna and Candy Boxes | data structures | Statement | C | Codeforces Round 229 (Div. 2) {390} | PROGRAMMING | 1500.0 | ||
| 218 | Supercollider | data structures | Statement | D2 | Rockethon 2014 {391} | PROGRAMMING | 16.0 | ||
| 235 | Three Arrays | data structures | Statement | D | Codeforces Round 230 (Div. 1) {392} | PROGRAMMING | 2000.0 | 83942 | |
| 1813 | On Changing Tree | data structures graphs trees | Statement | C | Codeforces Round 232 (Div. 1) {396} | PROGRAMMING | 1500.0 | Codeforces Round #232 Editorial (restored) | |
| 1309 | Instant Messanger | data structures | Statement | D | Codeforces Round 233 (Div. 1) {398} | PROGRAMMING | 2000.0 | Codeforces Round #233 Editorial | |
| 1045 | Inna and Binary Logic | binary search bitmasks data structures | Statement | E | Codeforces Round 234 (Div. 2) {400} | PROGRAMMING | Codeforces Round #234 (Div. 2) — Tutorial | 2400 | |
| 242 | Two Rooted Trees | data structures implementation trees | Statement | E | Codeforces Round 236 (Div. 1) {403} | PROGRAMMING | Editorial Codeforces Round #236 | 2900 | |
| 977 | k-d-sequence | data structures | Statement | E | Codeforces Round 239 (Div. 1) {407} | PROGRAMMING | Codeforces Round #239 Editorial | 3100 | |
| 853 | Maze 2D | data structures divide and conquer | Statement | E | Coder-Strike 2014 - Round 2 {413} | PROGRAMMING | Editorial of Coder-Strike 2014 Round 2 | 2100 | |
| 749 | Mashmokh and Water Tanks | binary search data structures greedy trees two pointers | Statement | D | Codeforces Round 240 (Div. 1) {414} | PROGRAMMING | Codeforces Round #240 Editorial | 2300 | |
| 211 | Mashmokh's Designed Problem | data structures | Statement | E | Codeforces Round 240 (Div. 1) {414} | PROGRAMMING | Codeforces Round #240 Editorial | 3100 | |
| 546 | Big Problems for Organizers | data structures graphs trees | Statement | D | RCC 2014 Warmup (Div. 1) {418} | PROGRAMMING | RCC 2014 WarmUp Analysis | 2700 | |
| 351 | Tricky Password | data structures | Statement | E | RCC 2014 Warmup (Div. 1) {418} | PROGRAMMING | RCC 2014 WarmUp Analysis | 3100 | |
| 1397 | Bug in Code | data structures graphs implementation two pointers | Statement | C | Coder-Strike 2014 - Finals (online edition, Div. 1) {420} | PROGRAMMING | Editorial Coder-Strike 2014 Finals | 1900 | |
| 1002 | Cup Trick | data structures | Statement | D | Coder-Strike 2014 - Finals (online edition, Div. 1) {420} | PROGRAMMING | Editorial Coder-Strike 2014 Finals | 2500 | |
| 696 | Bug in Code | binary search data structures sortings | Statement | D | Coder-Strike 2014 - Finals (online edition, Div. 2) {421} | PROGRAMMING | Editorial Coder-Strike 2014 Finals | 2100 | |
| 613 | Biathlon Track | binary search brute force constructive algorithms data structures dp | Statement | D | Codeforces Round 242 (Div. 2) {424} | PROGRAMMING | Codeforces Round #242 (Div. 2) Editorial | 2200 | |
| 1636 | Sereja and Squares | binary search data structures hashing | Statement | D | Codeforces Round 243 (Div. 1) {425} | PROGRAMMING | Codeforces Round #243 tutorial | 2300 | |
| 985 | Sereja and Two Sequences | data structures dp | Statement | C | Codeforces Round 243 (Div. 1) {425} | PROGRAMMING | Codeforces Round #243 tutorial | 2400 | |
| 15530 | Prison Transfer | data structures implementation | Statement | B | Codeforces Round 244 (Div. 2) {427} | PROGRAMMING | Codeforces Round #244 (Div. 2) Editorial | 1100 | |
| 3239 | Tricky Function | data structures divide and conquer geometry | Statement | D | Codeforces Round 245 (Div. 1) {429} | PROGRAMMING | Codeforces Round #245 — Editorial | 2100 | |
| 1193 | Chemistry Experiment | binary search data structures ternary search | Statement | E | Codeforces Round 247 (Div. 2) {431} | PROGRAMMING | Editorial Codeforces Round #247 (Div. 2) | 2500 | |
| 1830 | Cardboard Box | data structures greedy | Statement | E | Zepto Code Rush 2014 {436} | PROGRAMMING | Zepto Code Rush 2014 — solutions A-D | 2500 | |
| 463 | Banners | brute force data structures dp | Statement | F | Zepto Code Rush 2014 {436} | PROGRAMMING | Zepto Code Rush 2014 — solutions A-D | 2900 | |
| 11751 | The Child and Sequence | data structures math | Statement | D | Codeforces Round 250 (Div. 1) {438} | PROGRAMMING | Tutorial | 2300 | |
| 1952 | Artem and Array | data structures greedy | Statement | C | Codeforces Round 253 (Div. 1) {442} | PROGRAMMING | Codeforces #253 editorial | 2500 | |
| 1138 | Adam and Tree | data structures trees | Statement | D | Codeforces Round 253 (Div. 1) {442} | PROGRAMMING | Codeforces #253 editorial | 2500 | |
| 3373 | DZY Loves Colors | data structures | Statement | C | Codeforces Round 254 (Div. 1) {444} | PROGRAMMING | Codeforces Round #254 Editorial | 2300 | |
| 3863 | DZY Loves Modification | brute force data structures greedy | Statement | B | Codeforces Round #FF (Div. 1) {446} | PROGRAMMING | Codeforces Round #FF(255) Editorial | 2100 | |
| 3958 | DZY Loves Fibonacci Numbers | data structures math number theory | Statement | C | Codeforces Round #FF (Div. 1) {446} | PROGRAMMING | Codeforces Round #FF(255) Editorial | 2600 | |
| 17444 | Suffix Structures | implementation strings | Statement | B | Codeforces Round 256 (Div. 2) {448} | PROGRAMMING | Tutorial | 1400 | |
| 1203 | Three strings | data structures dsu string suffix structures strings | Statement | E | MemSQL Start[c]UP 2.0 - Round 1 {452} | PROGRAMMING | MemSQL Start[c]UP 2.0 Round 1 and 2 Editorials | 2400 | |
| 1801 | Permutation | data structures divide and conquer hashing | Statement | F | MemSQL Start[c]UP 2.0 - Round 1 {452} | PROGRAMMING | MemSQL Start[c]UP 2.0 Round 1 and 2 Editorials | 2600 | |
| 913 | Little Pony and Lord Tirek | data structures | Statement | E | Codeforces Round 259 (Div. 1) {453} | PROGRAMMING | Codeforces Round #259 Editorial | 3000 | |
| 3721 | Serega and Fun | data structures | Statement | D | Codeforces Round 260 (Div. 1) {455} | PROGRAMMING | Codeforces Round #260 — Editorial | 2600 | |
| 788 | Function | data structures | Statement | E | Codeforces Round 260 (Div. 1) {455} | PROGRAMMING | Codeforces Round #260 — Editorial | 2800 | |
| 12931 | Pashmak and Parmida's problem | data structures divide and conquer sortings | Statement | D | Codeforces Round 261 (Div. 2) {459} | PROGRAMMING | Codeforces Round #261 Editorial | 1800 | |
| 6826 | Present | binary search data structures greedy | Statement | C | Codeforces Round 262 (Div. 2) {460} | PROGRAMMING | 13465 | 1900 | |
| 1396 | Appleman and a Sheet of Paper | data structures implementation | Statement | C | Codeforces Round 263 (Div. 1) {461} | PROGRAMMING | Tutorial | 2500 | |
| 1860 | The Classic Problem | data structures graphs shortest paths | Statement | E | Codeforces Round 265 (Div. 1) {464} | PROGRAMMING | Codeforces Round #265 Editorial | 2900 | |
| 42157 | Number of Ways | binary search brute force data structures dp two pointers | Statement | C | Codeforces Round 266 (Div. 2) {466} | PROGRAMMING | Editorial Codeforces Round #266 (Div. 2) | 1700 | |
| 856 | Alex and Complicated Task | data structures dp greedy | Statement | E | Codeforces Round 267 (Div. 2) {467} | PROGRAMMING | Разбор задач | 2900 | |
| 88 | MUH and Lots and Lots of Segments | data structures dsu | Statement | E | Codeforces Round 269 (Div. 2) {471} | PROGRAMMING | Codeforces Round #269 Editorial | 2700 | |
| 463 | Design Tutorial: Increase the Constraints | bitmasks data structures fft | Statement | G | Codeforces Round 270 {472} | PROGRAMMING | Editorial | 2800 | |
| 4236 | Pillars | binary search data structures dp sortings trees | Statement | E | Codeforces Round 271 (Div. 2) {474} | PROGRAMMING | Codeforces Round #271 (Div. 2) Editorial | 2200 | |
| 11784 | Ant colony | data structures math number theory | Statement | F | Codeforces Round 271 (Div. 2) {474} | PROGRAMMING | Codeforces Round #271 (Div. 2) Editorial | 2200 | |
| 6631 | CGCDSSQ | brute force data structures math | Statement | D | Bayan 2015 Contest Warm Up {475} | PROGRAMMING | Bayan 2015 Contest Warm Up Editorial | 2000 | |
| 267 | Meta-universe | data structures | Statement | F | Bayan 2015 Contest Warm Up {475} | PROGRAMMING | Bayan 2015 Contest Warm Up Editorial | 2800 |