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 ... 5 6 7 8 9 ... 44 45 46 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 7152 | Book of Evil | dfs and similar divide and conquer dp trees | Statement | D | Codeforces Round 196 (Div. 2) {337} | PROGRAMMING | Codeforces Round #196 — Problems Analysis | 2100 | |
| 1162 | Divisor Tree | brute force number theory trees | Statement | E | Codeforces Round 196 (Div. 2) {337} | PROGRAMMING | Codeforces Round #196 — Problems Analysis | 2400 | |
| 1229 | Optimize! | data structures | Statement | E | Codeforces Round 196 (Div. 1) {338} | PROGRAMMING | Codeforces Round #196 — Problems Analysis | 2600 | |
| 1511 | GCD Table | chinese remainder theorem math number theory | Statement | D | Codeforces Round 196 (Div. 1) {338} | PROGRAMMING | Codeforces Round #196 — Problems Analysis | 2700 | |
| 83790 | Xenia and Ringroad | implementation | Statement | B | Codeforces Round 197 (Div. 2) {339} | PROGRAMMING | Codeforces Round #197 — Tutorial | 1100 | |
| 8838 | Xenia and Weights | constructive algorithms dfs and similar dp graphs greedy shortest paths | Statement | C | Codeforces Round 197 (Div. 2) {339} | PROGRAMMING | Codeforces Round #197 — Tutorial | 1700 | |
| 34377 | Xenia and Bit Operations | data structures trees | Statement | D | Codeforces Round 197 (Div. 2) {339} | PROGRAMMING | Codeforces Round #197 — Tutorial | 1700 | |
| 613 | Three Swaps | constructive algorithms dfs and similar greedy | Statement | E | Codeforces Round 197 (Div. 2) {339} | PROGRAMMING | Codeforces Round #197 — Tutorial | 2200 | |
| 288121 | Helpful Maths | greedy implementation sortings strings | Statement | A | Codeforces Round 197 (Div. 2) {339} | PROGRAMMING | Codeforces Round #197 — Tutorial | 900 | |
| 8436 | The Wall | math | Statement | A | Codeforces Round 198 (Div. 2) {340} | PROGRAMMING | Tutorial | 1300 | |
| 4748 | Tourist Problem | combinatorics implementation math | Statement | C | Codeforces Round 198 (Div. 2) {340} | PROGRAMMING | Tutorial | 1700 | |
| 8050 | Bubble Sort Graph | binary search data structures dp | Statement | D | Codeforces Round 198 (Div. 2) {340} | PROGRAMMING | Tutorial | 1800 | |
| 2394 | Maximal Area Quadrilateral | brute force geometry | Statement | B | Codeforces Round 198 (Div. 2) {340} | PROGRAMMING | Tutorial | 2000 | |
| 2850 | Iahub and Permutations | combinatorics math | Statement | E | Codeforces Round 198 (Div. 2) {340} | PROGRAMMING | Tutorial | 2200 | |
| 1435 | Iahub and Xors | data structures | Statement | D | Codeforces Round 198 (Div. 1) {341} | PROGRAMMING | Tutorial | 2500 | |
| 623 | Candies Game | constructive algorithms greedy | Statement | E | Codeforces Round 198 (Div. 1) {341} | PROGRAMMING | Tutorial | 2900 | |
| 14154 | Xenia and Divisors | greedy implementation | Statement | A | Codeforces Round 199 (Div. 2) {342} | PROGRAMMING | Tutorial | 1300 | |
| 4229 | Xenia and Spies | brute force greedy implementation | Statement | B | Codeforces Round 199 (Div. 2) {342} | PROGRAMMING | Tutorial | 1500 | |
| 2018 | Cupboard and Balloons | geometry | Statement | C | Codeforces Round 199 (Div. 2) {342} | PROGRAMMING | Tutorial | 1800 | |
| 11515 | Xenia and Tree | data structures divide and conquer trees | Statement | E | Codeforces Round 199 (Div. 2) {342} | PROGRAMMING | Tutorial | 2200 | |
| 589 | Xenia and Dominoes | bitmasks dfs and similar dp | Statement | D | Codeforces Round 199 (Div. 2) {342} | PROGRAMMING | Tutorial | 2500 | |
| 10209 | Rational Resistance | math number theory | Statement | A | Codeforces Round 200 (Div. 1) {343} | PROGRAMMING | Codeforces Round #200 Tutorial | 1600 | |
| 18923 | Alternating Current | data structures greedy implementation | Statement | B | Codeforces Round 200 (Div. 1) {343} | PROGRAMMING | Codeforces Round #200 Tutorial | 1600 | |
| 7366 | Water Tree | data structures dfs and similar graphs trees | Statement | D | Codeforces Round 200 (Div. 1) {343} | PROGRAMMING | Codeforces Round #200 Tutorial | 2100 | |
| 3265 | Read Time | binary search greedy two pointers | Statement | C | Codeforces Round 200 (Div. 1) {343} | PROGRAMMING | Codeforces Round #200 Tutorial | 2100 | |
| 993 | Pumping Stations | brute force dfs and similar divide and conquer flows graphs greedy trees | Statement | E | Codeforces Round 200 (Div. 1) {343} | PROGRAMMING | Codeforces Round #200 Tutorial | 2800 | |
| 9689 | Simple Molecules | brute force graphs math | Statement | B | Codeforces Round 200 (Div. 2) {344} | PROGRAMMING | Codeforces Round #200 Tutorial | 1300 | |
| 159260 | Magnets | implementation | Statement | A | Codeforces Round 200 (Div. 2) {344} | PROGRAMMING | Codeforces Round #200 Tutorial | 700 | |
| 561 | Expecting Trouble | *special probabilities | Statement | A | Пятница, 13-ое, День Программиста {345} | PROGRAMMING | 1600 | ||
| 129 | Triskaidekaphobia | *special | Statement | B | Пятница, 13-ое, День Программиста {345} | PROGRAMMING | 2000 | ||
| 130 | Counting Fridays | *special | Statement | C | Пятница, 13-ое, День Программиста {345} | PROGRAMMING | 2000 | ||
| 83 | Chain Letter | *special dfs and similar graphs | Statement | D | Пятница, 13-ое, День Программиста {345} | PROGRAMMING | 2300 | ||
| 105 | Suffix Subgroup | *special strings | Statement | G | Пятница, 13-ое, День Программиста {345} | PROGRAMMING | 2600 | ||
| 55 | Superstitions Inspection | *special | Statement | F | Пятница, 13-ое, День Программиста {345} | PROGRAMMING | 2800 | ||
| 57 | Black Cat Rush | *special | Statement | E | Пятница, 13-ое, День Программиста {345} | PROGRAMMING | 2800 | ||
| 9444 | Alice and Bob | games math number theory | Statement | A | Codeforces Round 201 (Div. 1) {346} | PROGRAMMING | Codeforces Round #201 Editorial | 1600 | |
| 4452 | Lucky Common Subsequence | dp strings | Statement | B | Codeforces Round 201 (Div. 1) {346} | PROGRAMMING | Codeforces Round #201 Editorial | 2000 | |
| 1529 | Number Transformation II | greedy math | Statement | C | Codeforces Round 201 (Div. 1) {346} | PROGRAMMING | Codeforces Round #201 Editorial | 2200 | |
| 892 | Robot Control | dp graphs shortest paths | Statement | D | Codeforces Round 201 (Div. 1) {346} | PROGRAMMING | Codeforces Round #201 Editorial | 2600 | |
| 388 | Doodle Jump | math number theory | Statement | E | Codeforces Round 201 (Div. 1) {346} | PROGRAMMING | Codeforces Round #201 Editorial | 3000 | |
| 9954 | Fixed Points | brute force implementation math | Statement | B | Codeforces Round 201 (Div. 2) {347} | PROGRAMMING | Codeforces Round #201 Editorial | 1200 | |
| 9896 | Difference Row | constructive algorithms implementation sortings | Statement | A | Codeforces Round 201 (Div. 2) {347} | PROGRAMMING | Codeforces Round #201 Editorial | 1300 | |
| 15022 | Mafia | binary search math sortings | Statement | A | Codeforces Round 202 (Div. 1) {348} | PROGRAMMING | Editorial for Codeforces Round #202 | 1700 | |
| 2322 | Apple Tree | dfs and similar number theory trees | Statement | B | Codeforces Round 202 (Div. 1) {348} | PROGRAMMING | Editorial for Codeforces Round #202 | 2400 | |
| 2346 | Turtles | dp matrices | Statement | D | Codeforces Round 202 (Div. 1) {348} | PROGRAMMING | Editorial for Codeforces Round #202 | 2500 | |
| 2925 | Subset Sums | brute force data structures | Statement | C | Codeforces Round 202 (Div. 1) {348} | PROGRAMMING | Editorial for Codeforces Round #202 | 2600 | |
| 653 | Pilgrims | dfs and similar dp trees | Statement | E | Codeforces Round 202 (Div. 1) {348} | PROGRAMMING | Editorial for Codeforces Round #202 | 2800 | |
| 34492 | Cinema Line | greedy implementation | Statement | A | Codeforces Round 202 (Div. 2) {349} | PROGRAMMING | Editorial for Codeforces Round #202 | 1200 | |
| 15282 | Color the Fence | data structures dp greedy implementation | Statement | B | Codeforces Round 202 (Div. 2) {349} | PROGRAMMING | Editorial for Codeforces Round #202 | 1700 | |
| 17694 | TL | brute force greedy implementation | Statement | A | Codeforces Round 203 (Div. 2) {350} | PROGRAMMING | Editorial Codeforces Round #203 (Div. 2) | 1300 | |
| 3437 | Resort | graphs | Statement | B | Codeforces Round 203 (Div. 2) {350} | PROGRAMMING | Editorial Codeforces Round #203 (Div. 2) | 1600 | |
| 6864 | Bombs | greedy implementation sortings | Statement | C | Codeforces Round 203 (Div. 2) {350} | PROGRAMMING | Editorial Codeforces Round #203 (Div. 2) | 1600 | |
| 885 | Wrong Floyd | brute force constructive algorithms dfs and similar graphs | Statement | E | Codeforces Round 203 (Div. 2) {350} | PROGRAMMING | Editorial Codeforces Round #203 (Div. 2) | 2200 | |
| 326 | 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 | |
| 3113 | Jeff and Rounding | dp greedy implementation math | Statement | A | Codeforces Round 204 (Div. 1) {351} | PROGRAMMING | Codeforces Round #204 — tutorial | 1900 | |
| 2822 | Jeff and Furik | combinatorics dp probabilities | Statement | B | Codeforces Round 204 (Div. 1) {351} | PROGRAMMING | Codeforces Round #204 — tutorial | 2100 | |
| 1843 | Jeff and Permutation | greedy | Statement | E | Codeforces Round 204 (Div. 1) {351} | PROGRAMMING | Codeforces Round #204 — tutorial | 2200 | |
| 1429 | Jeff and Removing Periods | data structures | Statement | D | Codeforces Round 204 (Div. 1) {351} | PROGRAMMING | Codeforces Round #204 — tutorial | 2700 | |
| 666 | Jeff and Brackets | dp matrices | Statement | C | Codeforces Round 204 (Div. 1) {351} | PROGRAMMING | Codeforces Round #204 — tutorial | 2800 | |
| 29088 | Jeff and Digits | brute force implementation math | Statement | A | Codeforces Round 204 (Div. 2) {352} | PROGRAMMING | 1100 | ||
| 18431 | Jeff and Periods | implementation sortings | Statement | B | Codeforces Round 204 (Div. 2) {352} | PROGRAMMING | 1300 | ||
| 20212 | Domino | implementation math | Statement | A | Codeforces Round 205 (Div. 2) {353} | PROGRAMMING | 9145 | 1300 | |
| 5309 | Find Maximum | implementation math number theory | Statement | C | Codeforces Round 205 (Div. 2) {353} | PROGRAMMING | 9145 | 1600 | |
| 2447 | Two Heaps | combinatorics constructive algorithms greedy implementation math sortings | Statement | B | Codeforces Round 205 (Div. 2) {353} | PROGRAMMING | 9145 | 1800 | |
| 3229 | Queue | constructive algorithms dp | Statement | D | Codeforces Round 205 (Div. 2) {353} | PROGRAMMING | 9145 | 2100 | |
| 704 | Antichain | dp graph matchings greedy | Statement | E | Codeforces Round 205 (Div. 2) {353} | PROGRAMMING | 9145 | 2600 | |
| 5683 | Vasya and Robot | brute force greedy math | Statement | A | Codeforces Round 206 (Div. 1) {354} | PROGRAMMING | Codeforces Round #206 — Editorial | 1600 | |
| 3393 | Vasya and Beautiful Arrays | brute force dp number theory | Statement | C | Codeforces Round 206 (Div. 1) {354} | PROGRAMMING | Codeforces Round #206 — Editorial | 2000 | |
| 937 | Lucky Number Representation | constructive algorithms dfs and similar dp | Statement | E | Codeforces Round 206 (Div. 1) {354} | PROGRAMMING | Codeforces Round #206 — Editorial | 2200 | |
| 529 | Game with Strings | bitmasks dp games | Statement | B | Codeforces Round 206 (Div. 1) {354} | PROGRAMMING | Codeforces Round #206 — Editorial | 2500 | |
| 531 | Transferring Pyramid | dp | Statement | D | Codeforces Round 206 (Div. 1) {354} | PROGRAMMING | Codeforces Round #206 — Editorial | 2900 | |
| 9894 | Vasya and Digital Root | constructive algorithms implementation | Statement | A | Codeforces Round 206 (Div. 2) {355} | PROGRAMMING | Codeforces Round #206 — Editorial | 1100 | |
| 4977 | Vasya and Public Transport | greedy implementation | Statement | B | Codeforces Round 206 (Div. 2) {355} | PROGRAMMING | Codeforces Round #206 — Editorial | 1200 | |
| 17323 | Knight Tournament | data structures dsu | Statement | A | Codeforces Round 207 (Div. 1) {356} | PROGRAMMING | 9210 | 1700 | |
| 2120 | Xenia and Hamming | implementation math | Statement | B | Codeforces Round 207 (Div. 1) {356} | PROGRAMMING | 9210 | 2000 | |
| 1420 | Compartments | combinatorics constructive algorithms greedy implementation | Statement | C | Codeforces Round 207 (Div. 1) {356} | PROGRAMMING | Codeforces Round #207: разбор задач | 2200 | |
| 1157 | Bags and Coins | bitmasks constructive algorithms dp greedy | Statement | D | Codeforces Round 207 (Div. 1) {356} | PROGRAMMING | 9210 | 2500 | |
| 605 | Xenia and String Problem | dp hashing implementation string suffix structures strings | Statement | E | Codeforces Round 207 (Div. 1) {356} | PROGRAMMING | 9210 | 2800 | |
| 7788 | Group of Students | brute force greedy implementation | Statement | A | Codeforces Round 207 (Div. 2) {357} | PROGRAMMING | Codeforces Round #207: tutorial | 1200 | |
| 8605 | Flag Day | constructive algorithms implementation | Statement | B | Codeforces Round 207 (Div. 2) {357} | PROGRAMMING | Codeforces Round #207: tutorial | 1400 | |
| 8199 | Dima and Continuous Line | brute force implementation | Statement | A | Codeforces Round 208 (Div. 2) {358} | PROGRAMMING | Codeforces Round #208 (Div. 2) Разбор | 1400 | |
| 3919 | Dima and Text Messages | brute force strings | Statement | B | Codeforces Round 208 (Div. 2) {358} | PROGRAMMING | Codeforces Round #208 (Div. 2) Разбор | 1500 | |
| 4581 | Dima and Hares | dp greedy | Statement | D | Codeforces Round 208 (Div. 2) {358} | PROGRAMMING | Codeforces Round #208 (Div. 2) Разбор | 2000 | |
| 2352 | Dima and Containers | constructive algorithms greedy implementation | Statement | C | Codeforces Round 208 (Div. 2) {358} | PROGRAMMING | Codeforces Round #208 (Div. 2) Разбор | 2000 | |
| 448 | Dima and Kicks | brute force dsu graphs implementation | Statement | E | Codeforces Round 208 (Div. 2) {358} | PROGRAMMING | Codeforces Round #208 (Div. 2) Разбор | 2600 | |
| 9346 | Table | constructive algorithms greedy implementation | Statement | A | Codeforces Round 209 (Div. 2) {359} | PROGRAMMING | Editorial Codeforces Round #209 (Div. 2) | 1100 | |
| 8821 | Permutation | constructive algorithms dp math | Statement | B | Codeforces Round 209 (Div. 2) {359} | PROGRAMMING | Editorial Codeforces Round #209 (Div. 2) | 1400 | |
| 3633 | Prime Number | math number theory | Statement | C | Codeforces Round 209 (Div. 2) {359} | PROGRAMMING | Editorial Codeforces Round #209 (Div. 2) | 2000 | |
| 5920 | 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 | |
| 558 | Neatness | constructive algorithms dfs and similar | Statement | E | Codeforces Round 209 (Div. 2) {359} | PROGRAMMING | Editorial Codeforces Round #209 (Div. 2) | 2500 | |
| 2150 | Levko and Array Recovery | greedy implementation | Statement | A | Codeforces Round 210 (Div. 1) {360} | PROGRAMMING | Codeforces Round #210 editorial | 1800 | |
| 3718 | Levko and Array | binary search dp | Statement | B | Codeforces Round 210 (Div. 1) {360} | PROGRAMMING | Codeforces Round #210 editorial | 2300 | |
| 527 | Levko and Sets | number theory | Statement | D | Codeforces Round 210 (Div. 1) {360} | PROGRAMMING | Codeforces Round #210 editorial | 2600 | |
| 1280 | Levko and Strings | combinatorics dp | Statement | C | Codeforces Round 210 (Div. 1) {360} | PROGRAMMING | Codeforces Round #210 editorial | 2700 | |
| 849 | Levko and Game | graphs greedy shortest paths | Statement | E | Codeforces Round 210 (Div. 1) {360} | PROGRAMMING | Codeforces Round #210 editorial | 2800 | |
| 8895 | Levko and Permutation | constructive algorithms math number theory | Statement | B | Codeforces Round 210 (Div. 2) {361} | PROGRAMMING | Codeforces Round #210 editorial | 1200 | |
| 17977 | Levko and Table | constructive algorithms implementation | Statement | A | Codeforces Round 210 (Div. 2) {361} | PROGRAMMING | Codeforces Round #210 editorial | 800 | |
| 14854 | Petya and Staircases | implementation sortings | Statement | B | Codeforces Round 212 (Div. 2) {362} | PROGRAMMING | Codeforces Round #212 (Div. 2). Tutorial. Part 1. | 1200 | |
| 2823 | Two Semiknights Meet | greedy math | Statement | A | Codeforces Round 212 (Div. 2) {362} | PROGRAMMING | Codeforces Round #212 (Div. 2). Tutorial. Part 1. | 1500 | |
| 2053 | 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 | |
| 1121 | 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 | |
| 945 | Petya and Pipes | flows graphs shortest paths | Statement | E | Codeforces Round 212 (Div. 2) {362} | PROGRAMMING | Codeforces Round #212 (Div. 2). Tutorial. Part 1. | 2700 | |
| 11561 | Soroban | implementation | Statement | A | Codeforces Round 211 (Div. 2) {363} | PROGRAMMING | 9537 | 1000 | |
| 71140 | Fence | brute force dp | Statement | B | Codeforces Round 211 (Div. 2) {363} | PROGRAMMING | 9537 | 1200 | |
| 14255 | Fixing Typos | greedy implementation | Statement | C | Codeforces Round 211 (Div. 2) {363} | PROGRAMMING | 9537 | 1400 | |
| 4454 | Renting Bikes | binary search greedy | Statement | D | Codeforces Round 211 (Div. 2) {363} | PROGRAMMING | 9537 | 1800 | |
| 255 | Two Circles | brute force data structures implementation | Statement | E | Codeforces Round 211 (Div. 2) {363} | PROGRAMMING | 9537 | 2600 | |
| 5005 | Matrix | combinatorics data structures implementation | Statement | A | Codeforces Round 213 (Div. 1) {364} | PROGRAMMING | Codeforces Round #213 Editorial | 1800 | |
| 1282 | Free Market | dp greedy | Statement | B | Codeforces Round 213 (Div. 1) {364} | PROGRAMMING | Codeforces Round #213 Editorial | 2300 | |
| 657 | Beautiful Set | brute force number theory | Statement | C | Codeforces Round 213 (Div. 1) {364} | PROGRAMMING | Codeforces Round #213 Editorial | 2500 | |
| 2655 | Ghd | brute force math probabilities | Statement | D | Codeforces Round 213 (Div. 1) {364} | PROGRAMMING | Codeforces Round #213 Editorial | 2600 | |
| 743 | Empty Rectangles | divide and conquer two pointers | Statement | E | Codeforces Round 213 (Div. 1) {364} | PROGRAMMING | Codeforces Round #213 Editorial | 3000 | |
| 23515 | Good Number | implementation | Statement | A | Codeforces Round 213 (Div. 2) {365} | PROGRAMMING | Codeforces Round #213 Editorial | 1100 | |
| 15519 | The Fibonacci Segment | implementation | Statement | B | Codeforces Round 213 (Div. 2) {365} | PROGRAMMING | Codeforces Round #213 Editorial | 1200 | |
| 4857 | Dima and Guards | implementation | Statement | A | Codeforces Round 214 (Div. 2) {366} | PROGRAMMING | Codeforces Round #214 (Div. 2) — Tutorial | 1100 | |
| 7203 | Dima and To-do List | brute force implementation | Statement | B | Codeforces Round 214 (Div. 2) {366} | PROGRAMMING | Codeforces Round #214 (Div. 2) — Tutorial | 1200 | |
| 6274 | Dima and Salad | dp | Statement | C | Codeforces Round 214 (Div. 2) {366} | PROGRAMMING | Codeforces Round #214 (Div. 2) — Tutorial | 1900 | |
| 876 | Dima and Magic Guitar | brute force implementation math | Statement | E | Codeforces Round 214 (Div. 2) {366} | PROGRAMMING | Codeforces Round #214 (Div. 2) — Tutorial | 2300 | |
| 1776 | 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 | |
| 4572 | Sereja and Algorithm | data structures implementation | Statement | A | Codeforces Round 215 (Div. 1) {367} | PROGRAMMING | Codeforces Round #215 — tutorial | 1500 | |
| 2746 | Sereja ans Anagrams | binary search data structures | Statement | B | Codeforces Round 215 (Div. 1) {367} | PROGRAMMING | Codeforces Round #215 — tutorial | 2000 | |
| 1966 | Sereja and the Arrangement of Numbers | graphs greedy sortings | Statement | C | Codeforces Round 215 (Div. 1) {367} | PROGRAMMING | Codeforces Round #215 — tutorial | 2200 | |
| 721 | Sereja and Sets | bitmasks dfs and similar | Statement | D | Codeforces Round 215 (Div. 1) {367} | PROGRAMMING | Codeforces Round #215 — tutorial | 2400 | |
| 1455 | Sereja and Intervals | combinatorics dp | Statement | E | Codeforces Round 215 (Div. 1) {367} | PROGRAMMING | Codeforces Round #215 — tutorial | 2600 | |
| 51497 | Sereja and Suffixes | data structures dp | Statement | B | Codeforces Round 215 (Div. 2) {368} | PROGRAMMING | Codeforces Round #215 — tutorial | 1100 | |
| 8080 | Sereja and Coat Rack | implementation | Statement | A | Codeforces Round 215 (Div. 2) {368} | PROGRAMMING | Codeforces Round #215 — tutorial | 1100 | |
| 12366 | Valera and Plates | greedy implementation | Statement | A | Codeforces Round 216 (Div. 2) {369} | PROGRAMMING | Editorial Codeforces Round #216 (Div. 2) | 1000 | |
| 6932 | Valera and Contest | constructive algorithms implementation math | Statement | B | Codeforces Round 216 (Div. 2) {369} | PROGRAMMING | Editorial Codeforces Round #216 (Div. 2) | 1500 | |
| 12348 | Valera and Elections | dfs and similar graphs trees | Statement | C | Codeforces Round 216 (Div. 2) {369} | PROGRAMMING | Editorial Codeforces Round #216 (Div. 2) | 1700 | |
| 1332 | Valera and Fools | dfs and similar dp graphs shortest paths | Statement | D | Codeforces Round 216 (Div. 2) {369} | PROGRAMMING | Editorial Codeforces Round #216 (Div. 2) | 2300 | |
| 2950 | Valera and Queries | binary search data structures | Statement | E | Codeforces Round 216 (Div. 2) {369} | PROGRAMMING | Editorial Codeforces Round #216 (Div. 2) | 2400 | |
| 12297 | Rook, Bishop and King | graphs math shortest paths | Statement | A | Codeforces Round 217 (Div. 2) {370} | PROGRAMMING | Codeforces Round #217 (Div. 2): tutorial | 1200 | |
| 2705 | Berland Bingo | implementation | Statement | B | Codeforces Round 217 (Div. 2) {370} | PROGRAMMING | Codeforces Round #217 (Div. 2): tutorial | 1300 | |
| 1753 | Mittens | constructive algorithms greedy sortings | Statement | C | Codeforces Round 217 (Div. 2) {370} | PROGRAMMING | Codeforces Round #217 (Div. 2): tutorial | 1800 | |
| 726 | Broken Monitor | brute force constructive algorithms greedy implementation | Statement | D | Codeforces Round 217 (Div. 2) {370} | PROGRAMMING | Codeforces Round #217 (Div. 2): tutorial | 2100 | |
| 351 | Summer Reading | dp greedy | Statement | E | Codeforces Round 217 (Div. 2) {370} | PROGRAMMING | Codeforces Round #217 (Div. 2): tutorial | 2500 | |
| 6769 | K-Periodic Array | greedy implementation math | Statement | A | Codeforces Round 218 (Div. 2) {371} | PROGRAMMING | Codeforces Round #218 (Div. 2): Tutorial | 1200 | |
| 12748 | Fox Dividing Cheese | math number theory | Statement | B | Codeforces Round 218 (Div. 2) {371} | PROGRAMMING | Codeforces Round #218 (Div. 2): Tutorial | 1400 | |
| 36987 | Hamburgers | binary search brute force | Statement | C | Codeforces Round 218 (Div. 2) {371} | PROGRAMMING | Codeforces Round #218 (Div. 2): Tutorial | 1600 | |
| 6842 | Vessels | data structures dsu implementation trees | Statement | D | Codeforces Round 218 (Div. 2) {371} | PROGRAMMING | Codeforces Round #218 (Div. 2): Tutorial | 1900 | |
| 1478 | Subway Innovation | greedy math two pointers | Statement | E | Codeforces Round 218 (Div. 2) {371} | PROGRAMMING | Codeforces Round #218 (Div. 2): Tutorial | 2200 | |
| 15983 | Counting Kangaroos is Fun | binary search greedy sortings two pointers | Statement | A | Codeforces Round 219 (Div. 1) {372} | PROGRAMMING | 9944 | 1700 | |
| 2879 | Counting Rectangles is Fun | brute force divide and conquer dp | Statement | B | Codeforces Round 219 (Div. 1) {372} | PROGRAMMING | 9944 | 2100 | |
| 5233 | Watching Fireworks is Fun | data structures dp math | Statement | C | Codeforces Round 219 (Div. 1) {372} | PROGRAMMING | 9944 | 2400 | |
| 1196 | 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 | |
| 297 | Drawing Circles is Fun | combinatorics geometry | Statement | E | Codeforces Round 219 (Div. 1) {372} | PROGRAMMING | 9944 | 2900 | |
| 11583 | Collecting Beats is Fun | implementation | Statement | A | Codeforces Round 219 (Div. 2) {373} | PROGRAMMING | Codeforces Round #219 editorial | 1000 | |
| 2823 | Making Sequences is Fun | binary search implementation math | Statement | B | Codeforces Round 219 (Div. 2) {373} | PROGRAMMING | Codeforces Round #219 editorial | 1600 | |
| 3526 | Inna and Nine | combinatorics greedy | Statement | B | Codeforces Round 220 (Div. 2) {374} | PROGRAMMING | Codeforces Round #220 (Div. 2) разбор | 1600 | |
| 3136 | Inna and Pink Pony | greedy implementation | Statement | A | Codeforces Round 220 (Div. 2) {374} | PROGRAMMING | Codeforces Round #220 (Div. 2) разбор | 1800 | |
| 3064 | Inna and Dima | dfs and similar dp graphs implementation | Statement | C | Codeforces Round 220 (Div. 2) {374} | PROGRAMMING | Codeforces Round #220 (Div. 2) разбор | 2000 | |
| 1042 | Inna and Sequence | binary search data structures dp trees | Statement | D | Codeforces Round 220 (Div. 2) {374} | PROGRAMMING | Codeforces Round #220 (Div. 2) разбор | 2300 | |
| 248 | 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 | |
| 5475 | Maximum Submatrix 2 | data structures dp implementation sortings | Statement | B | Codeforces Round 221 (Div. 1) {375} | PROGRAMMING | Codeforces Round #221 Tutorial | 1800 | |
| 5410 | Divisible by Seven | math number theory | Statement | A | Codeforces Round 221 (Div. 1) {375} | PROGRAMMING | Codeforces Round #221 Tutorial | 1800 | |
| 9487 | Tree and Queries | data structures dfs and similar trees | Statement | D | Codeforces Round 221 (Div. 1) {375} | PROGRAMMING | Codeforces Round #221 Tutorial | 2400 | |
| 686 | Circling Round Treasures | bitmasks shortest paths | Statement | C | Codeforces Round 221 (Div. 1) {375} | PROGRAMMING | Codeforces Round #221 Tutorial | 2600 | |
| 675 | Red and Black Tree | dp implementation math | Statement | E | Codeforces Round 221 (Div. 1) {375} | PROGRAMMING | Codeforces Round #221 Tutorial | 3000 | |
| 9989 | Lever | implementation math | Statement | A | Codeforces Round 221 (Div. 2) {376} | PROGRAMMING | Codeforces Round #221 Tutorial | 1000 | |
| 7015 | I.O.U. | implementation | Statement | B | Codeforces Round 221 (Div. 2) {376} | PROGRAMMING | Codeforces Round #221 Tutorial | 1300 | |
| 28572 | Maze | dfs and similar | Statement | A | Codeforces Round 222 (Div. 1) {377} | PROGRAMMING | Codeforces Round #222 — Problem Analysis | 1600 | |
| 2611 | 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 | |
| 1519 | Developing Game | data structures | Statement | D | Codeforces Round 222 (Div. 1) {377} | PROGRAMMING | Codeforces Round #222 — Problem Analysis | 2400 | |
| 1442 | Captains Mode | bitmasks dp games | Statement | C | Codeforces Round 222 (Div. 1) {377} | PROGRAMMING | Codeforces Round #222 — Problem Analysis | 2400 | |
| 605 | Cookie Clicker | dp geometry | Statement | E | Codeforces Round 222 (Div. 1) {377} | PROGRAMMING | Codeforces Round #222 — Problem Analysis | 2700 | |
| 6256 | Semifinals | implementation sortings | Statement | B | Codeforces Round 222 (Div. 2) {378} | PROGRAMMING | Codeforces Round #222 — Problem Analysis | 1300 | |
| 26200 | Playing with Dice | brute force | Statement | A | Codeforces Round 222 (Div. 2) {378} | PROGRAMMING | Codeforces Round #222 — Problem Analysis | 800 | |
| 54482 | New Year Candles | implementation | Statement | A | Good Bye 2013 {379} | PROGRAMMING | Tutorial Good Bye 2013 | 1100 | |
| 7642 | New Year Present | constructive algorithms implementation | Statement | B | Good Bye 2013 {379} | PROGRAMMING | Tutorial Good Bye 2013 | 1200 | |
| 7095 | New Year Ratings Change | greedy sortings | Statement | C | Good Bye 2013 {379} | PROGRAMMING | Tutorial Good Bye 2013 | 1500 | |
| 1688 | New Year Letter | bitmasks brute force dp | Statement | D | Good Bye 2013 {379} | PROGRAMMING | Tutorial Good Bye 2013 | 2000 | |
| 2841 | New Year Tree | data structures divide and conquer trees | Statement | F | Good Bye 2013 {379} | PROGRAMMING | Tutorial Good Bye 2013 | 2400 | |
| 406 | New Year Tree Decorations | geometry schedules sortings | Statement | E | Good Bye 2013 {379} | PROGRAMMING | Tutorial Good Bye 2013 | 2500 | |
| 345 | New Year Cactus | dp | Statement | G | Good Bye 2013 {379} | PROGRAMMING | Tutorial Good Bye 2013 | 3100 | |
| 2956 | Sereja and Prefixes | binary search brute force | Statement | A | Codeforces Round 223 (Div. 1) {380} | PROGRAMMING | Codeforces Round #223 — Tutorial | 1700 | |
| 21382 | Sereja and Brackets | data structures schedules | Statement | C | Codeforces Round 223 (Div. 1) {380} | PROGRAMMING | Codeforces Round #223 — Tutorial | 2100 | |
| 585 | Sereja and Tree | graphs implementation | Statement | B | Codeforces Round 223 (Div. 1) {380} | PROGRAMMING | Codeforces Round #223 — Tutorial | 2500 | |
| 559 | Sereja and Cinema | combinatorics math | Statement | D | Codeforces Round 223 (Div. 1) {380} | PROGRAMMING | Codeforces Round #223 — Tutorial | 2500 | |
| 376 | Sereja and Dividing | data structures | Statement | E | Codeforces Round 223 (Div. 1) {380} | PROGRAMMING | Codeforces Round #223 — Tutorial | 2600 | |
| 7428 | Sereja and Stairs | greedy implementation sortings | Statement | B | Codeforces Round 223 (Div. 2) {381} | PROGRAMMING | Codeforces Round #223 — Tutorial | 1100 | |
| 94897 | Sereja and Dima | greedy implementation two pointers | Statement | A | Codeforces Round 223 (Div. 2) {381} | PROGRAMMING | Codeforces Round #223 — Tutorial | 800 | |
| 13880 | Ksenia and Pan Scales | greedy implementation | Statement | A | Codeforces Round 224 (Div. 2) {382} | PROGRAMMING | Codeforces Round #224 (Div. 2) Editorial | 1100 | |
| 8807 | Arithmetic Progression | implementation sortings | Statement | C | Codeforces Round 224 (Div. 2) {382} | PROGRAMMING | Codeforces Round #224 (Div. 2) Editorial | 1700 | |
| 1529 | Number Busters | binary search math | Statement | B | Codeforces Round 224 (Div. 2) {382} | PROGRAMMING | Codeforces Round #224 (Div. 2) Editorial | 2000 | |
| 756 | Ksenia and Pawns | dfs and similar graphs implementation trees | Statement | D | Codeforces Round 224 (Div. 2) {382} | PROGRAMMING | Codeforces Round #224 (Div. 2) Editorial | 2300 | |
| 469 | Ksenia and Combinatorics | combinatorics dp | Statement | E | Codeforces Round 224 (Div. 2) {382} | PROGRAMMING | Codeforces Round #224 (Div. 2) Editorial | 2600 | |
| 5628 | Milking cows | data structures greedy | Statement | A | Codeforces Round 225 (Div. 1) {383} | PROGRAMMING | Tutorial | 1500 | |
| 820 | Volcanoes | binary search implementation sortings two pointers | Statement | B | Codeforces Round 225 (Div. 1) {383} | PROGRAMMING | Tutorial | 2200 | |
| 3435 | Antimatter | dp | Statement | D | Codeforces Round 225 (Div. 1) {383} | PROGRAMMING | Tutorial | 2300 | |
| 7957 | Propagating tree | data structures dfs and similar trees | Statement | C | Codeforces Round 225 (Div. 1) {383} | PROGRAMMING | Tutorial | 2400 | |
| 4741 | Vowels | combinatorics divide and conquer dp | Statement | E | Codeforces Round 225 (Div. 1) {383} | PROGRAMMING | Tutorial | 2700 | |
| 3836 | Multitasking | greedy implementation sortings two pointers | Statement | B | Codeforces Round 225 (Div. 2) {384} | PROGRAMMING | Codeforces Round #225 — Editorial | 1500 | |
| 17454 | Coder | implementation | Statement | A | Codeforces Round 225 (Div. 2) {384} | PROGRAMMING | Codeforces Round #225 — Editorial | 800 | |
| 17450 | Bear and Raspberry | brute force greedy implementation | Statement | A | Codeforces Round 226 (Div. 2) {385} | PROGRAMMING | Codeforces Round #226 (Div. 2) — Editorial | 1100 | |
| 10977 | Bear and Strings | brute force greedy implementation math strings | Statement | B | Codeforces Round 226 (Div. 2) {385} | PROGRAMMING | Codeforces Round #226 (Div. 2) — Editorial | 1300 | |
| 10863 | 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 | |
| 972 | Bear and Floodlight | bitmasks dp geometry | Statement | D | Codeforces Round 226 (Div. 2) {385} | PROGRAMMING | Codeforces Round #226 (Div. 2) — Editorial | 2500 | |
| 692 | Bear in the Field | math matrices | Statement | E | Codeforces Round 226 (Div. 2) {385} | PROGRAMMING | Codeforces Round #226 (Div. 2) — Editorial | 2700 | |
| 7856 | Second-Price Auction | implementation | Statement | A | Testing Round 9 {386} | PROGRAMMING | 1100 | ||
| 2561 | Fly, freebies, fly! | binary search brute force implementation | Statement | B | Testing Round 9 {386} | PROGRAMMING | 1500 | ||
| 980 | Diverse Substrings | dp strings two pointers | Statement | C | Testing Round 9 {386} | PROGRAMMING | 2100 | ||
| 586 | Game with Points | dp graphs implementation shortest paths | Statement | D | Testing Round 9 {386} | PROGRAMMING | 2300 | ||
| 10664 | George and Sleep | implementation | Statement | A | Codeforces Round 227 (Div. 2) {387} | PROGRAMMING | Editorial Codeforces Round #227 (Div. 2) | 1000 | |
| 13086 | George and Round | brute force greedy two pointers | Statement | B | Codeforces Round 227 (Div. 2) {387} | PROGRAMMING | Editorial Codeforces Round #227 (Div. 2) | 1200 | |
| 2304 | George and Number | greedy implementation | Statement | C | Codeforces Round 227 (Div. 2) {387} | PROGRAMMING | Editorial Codeforces Round #227 (Div. 2) | 1700 | |
| 1023 | George and Cards | binary search data structures | Statement | E | Codeforces Round 227 (Div. 2) {387} | PROGRAMMING | Editorial Codeforces Round #227 (Div. 2) | 2500 | |
| 1229 | George and Interesting Graph | graph matchings | Statement | D | Codeforces Round 227 (Div. 2) {387} | PROGRAMMING | Editorial Codeforces Round #227 (Div. 2) | 2700 | |
| 12014 | Fox and Box Accumulation | greedy sortings | Statement | A | Codeforces Round 228 (Div. 1) {388} | PROGRAMMING | Codeforces Round #228 — Editorial | 1400 | |
| 2617 | Fox and Minimal path | bitmasks constructive algorithms graphs implementation math | Statement | B | Codeforces Round 228 (Div. 1) {388} | PROGRAMMING | Codeforces Round #228 — Editorial | 2000 | |
| 3965 | Fox and Card Game | games greedy sortings | Statement | C | Codeforces Round 228 (Div. 1) {388} | PROGRAMMING | Codeforces Round #228 — Editorial | 2000 | |
| 526 | Fox and Perfect Sets | math | Statement | D | Codeforces Round 228 (Div. 1) {388} | PROGRAMMING | Codeforces Round #228 — Editorial | 2700 | |
| 262 | Fox and Meteor Shower | geometry | Statement | E | Codeforces Round 228 (Div. 1) {388} | PROGRAMMING | Codeforces Round #228 — Editorial | 3000 | |
| 15091 | Fox and Number Game | greedy math | Statement | A | Codeforces Round 228 (Div. 2) {389} | PROGRAMMING | Codeforces Round #228 — Editorial | 1100 | |
| 7382 | Fox and Cross | greedy implementation | Statement | B | Codeforces Round 228 (Div. 2) {389} | PROGRAMMING | Codeforces Round #228 — Editorial | 1200 | |
| 1314 | Inna, Dima and Song | implementation | Statement | B | Codeforces Round 229 (Div. 2) {390} | PROGRAMMING | 1000.0 | ||
| 539 | Inna and Sweet Matrix | constructive algorithms | Statement | D | Codeforces Round 229 (Div. 2) {390} | PROGRAMMING | 2000.0 | ||
| 279 | Inna and Large Sweet Matrix | Statement | E | Codeforces Round 229 (Div. 2) {390} | PROGRAMMING | 2500.0 | |||
| 701 | Inna and Candy Boxes | data structures | Statement | C | Codeforces Round 229 (Div. 2) {390} | PROGRAMMING | 1500.0 | ||
| 3776 | Inna and Alarm Clock | implementation | Statement | A | Codeforces Round 229 (Div. 2) {390} | PROGRAMMING | 500.0 | ||
| 444 | Word Folding | brute force | Statement | B | Rockethon 2014 {391} | PROGRAMMING | 5.0 | ||
| 191 | Three Trees | Statement | E2 | Rockethon 2014 {391} | PROGRAMMING | 13.0 | |||
| 137 | Three Trees | Statement | E1 | Rockethon 2014 {391} | PROGRAMMING | 11.0 | |||
| 180 | The Tournament | Statement | C3 | Rockethon 2014 {391} | PROGRAMMING | 8.0 | |||
| 156 | The Tournament | greedy | Statement | C2 | Rockethon 2014 {391} | PROGRAMMING | 4.0 | ||
| 214 | The Tournament | brute force | Statement | C1 | Rockethon 2014 {391} | PROGRAMMING | 4.0 | ||
| 218 | Supercollider | data structures | Statement | D2 | Rockethon 2014 {391} | PROGRAMMING | 16.0 | ||
| 295 | Supercollider | brute force | Statement | D1 | Rockethon 2014 {391} | PROGRAMMING | 3.0 | ||
| 120 | Stock Trading | Statement | F3 | Rockethon 2014 {391} | PROGRAMMING | 10.0 | |||
| 123 | Stock Trading | greedy | Statement | F2 | Rockethon 2014 {391} | PROGRAMMING | 15.0 | ||
| 228 | Stock Trading | dp | Statement | F1 | Rockethon 2014 {391} | PROGRAMMING | 8.0 | ||
| 1817 | Genetic Engineering | implementation two pointers | Statement | A | Rockethon 2014 {391} | PROGRAMMING | 3.0 | Rockethon 2014 Editorial | |
| 690 | Yet Another Number Sequence | combinatorics math matrices | Statement | C | Codeforces Round 230 (Div. 1) {392} | PROGRAMMING | 1500.0 | 83942 | |
| 1071 | Tower of Hanoi | dp | Statement | B | Codeforces Round 230 (Div. 1) {392} | PROGRAMMING | 1000.0 | 83942 | |
| 243 | Three Arrays | data structures | Statement | D | Codeforces Round 230 (Div. 1) {392} | PROGRAMMING | 2000.0 | 83942 | |
| 188 | Deleting Substrings | Statement | E | Codeforces Round 230 (Div. 1) {392} | PROGRAMMING | 2500.0 | 83942 | ||
| 1012 | Blocked Points | math | Statement | A | Codeforces Round 230 (Div. 1) {392} | PROGRAMMING | 500.0 | 83942 | |
| 2082 | Three matrices | Statement | B | Codeforces Round 230 (Div. 2) {393} | PROGRAMMING | 1000.0 | 83942 | ||
| 7019 | Nineteen | Statement | A | Codeforces Round 230 (Div. 2) {393} | PROGRAMMING | 500.0 | 83942 | ||
| 629 | Very Beautiful Number | math | Statement | B | Codeforces Round 231 (Div. 2) {394} | PROGRAMMING | 1000.0 | ||
| 300 | Physical Education and Buns | brute force implementation math | Statement | D | Codeforces Round 231 (Div. 2) {394} | PROGRAMMING | 2000.0 | ||
| 134 | Lightbulb for Minister | geometry | Statement | E | Codeforces Round 231 (Div. 2) {394} | PROGRAMMING | 2500.0 | ||
| 561 | Dominoes | constructive algorithms greedy | Statement | C | Codeforces Round 231 (Div. 2) {394} | PROGRAMMING | 1500.0 | ||
| 2742 | Counting Sticks | brute force implementation | Statement | A | Codeforces Round 231 (Div. 2) {394} | PROGRAMMING | 500.0 | ||
| 466 | On Sum of Number of Inversions in Permutations | combinatorics math | Statement | D | Codeforces Round 232 (Div. 1) {396} | PROGRAMMING | 2000.0 | Codeforces Round #232 Editorial (restored) | |
| 1202 | On Sum of Fractions | math number theory | Statement | B | Codeforces Round 232 (Div. 1) {396} | PROGRAMMING | 1000.0 | Codeforces Round #232 Editorial (restored) | |
| 1656 | On Number of Decompositions into Multipliers | combinatorics math number theory | Statement | A | Codeforces Round 232 (Div. 1) {396} | PROGRAMMING | 500.0 | Codeforces Round #232 Editorial (restored) | |
| 167 | On Iteration of One Well-Known Function | math | Statement | E | Codeforces Round 232 (Div. 1) {396} | PROGRAMMING | 2500.0 | Codeforces Round #232 Editorial (restored) | |
| 1886 | On Changing Tree | data structures graphs trees | Statement | C | Codeforces Round 232 (Div. 1) {396} | PROGRAMMING | 1500.0 | Codeforces Round #232 Editorial (restored) | |
| 2738 | On Segment's Own Points | implementation | Statement | A | Codeforces Round 232 (Div. 2) {397} | PROGRAMMING | 500.0 | Codeforces Round #232 Editorial (restored) | |
| 836 | On Corruption and Numbers | constructive algorithms implementation math | Statement | B | Codeforces Round 232 (Div. 2) {397} | PROGRAMMING | 1000.0 | Codeforces Round #232 Editorial (restored) |