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 |
|---|---|---|---|---|---|---|---|---|---|
| 6984 | 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 | |
| 1134 | Divisor Tree | brute force number theory trees | Statement | E | Codeforces Round 196 (Div. 2) {337} | PROGRAMMING | Codeforces Round #196 — Problems Analysis | 2400 | |
| 1191 | Optimize! | data structures | Statement | E | Codeforces Round 196 (Div. 1) {338} | PROGRAMMING | Codeforces Round #196 — Problems Analysis | 2600 | |
| 1415 | GCD Table | chinese remainder theorem math number theory | Statement | D | Codeforces Round 196 (Div. 1) {338} | PROGRAMMING | Codeforces Round #196 — Problems Analysis | 2700 | |
| 82289 | Xenia and Ringroad | implementation | Statement | B | Codeforces Round 197 (Div. 2) {339} | PROGRAMMING | Codeforces Round #197 — Tutorial | 1100 | |
| 8782 | 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 | |
| 33087 | Xenia and Bit Operations | data structures trees | Statement | D | Codeforces Round 197 (Div. 2) {339} | PROGRAMMING | Codeforces Round #197 — Tutorial | 1700 | |
| 586 | Three Swaps | constructive algorithms dfs and similar greedy | Statement | E | Codeforces Round 197 (Div. 2) {339} | PROGRAMMING | Codeforces Round #197 — Tutorial | 2200 | |
| 279459 | Helpful Maths | greedy implementation sortings strings | Statement | A | Codeforces Round 197 (Div. 2) {339} | PROGRAMMING | Codeforces Round #197 — Tutorial | 900 | |
| 8374 | The Wall | math | Statement | A | Codeforces Round 198 (Div. 2) {340} | PROGRAMMING | Tutorial | 1300 | |
| 4699 | Tourist Problem | combinatorics implementation math | Statement | C | Codeforces Round 198 (Div. 2) {340} | PROGRAMMING | Tutorial | 1700 | |
| 7952 | Bubble Sort Graph | binary search data structures dp | Statement | D | Codeforces Round 198 (Div. 2) {340} | PROGRAMMING | Tutorial | 1800 | |
| 2341 | Maximal Area Quadrilateral | brute force geometry | Statement | B | Codeforces Round 198 (Div. 2) {340} | PROGRAMMING | Tutorial | 2000 | |
| 2768 | Iahub and Permutations | combinatorics math | Statement | E | Codeforces Round 198 (Div. 2) {340} | PROGRAMMING | Tutorial | 2200 | |
| 1387 | Iahub and Xors | data structures | Statement | D | Codeforces Round 198 (Div. 1) {341} | PROGRAMMING | Tutorial | 2500 | |
| 583 | Candies Game | constructive algorithms greedy | Statement | E | Codeforces Round 198 (Div. 1) {341} | PROGRAMMING | Tutorial | 2900 | |
| 13931 | Xenia and Divisors | greedy implementation | Statement | A | Codeforces Round 199 (Div. 2) {342} | PROGRAMMING | Tutorial | 1300 | |
| 4212 | Xenia and Spies | brute force greedy implementation | Statement | B | Codeforces Round 199 (Div. 2) {342} | PROGRAMMING | Tutorial | 1500 | |
| 2004 | Cupboard and Balloons | geometry | Statement | C | Codeforces Round 199 (Div. 2) {342} | PROGRAMMING | Tutorial | 1800 | |
| 11065 | Xenia and Tree | data structures divide and conquer trees | Statement | E | Codeforces Round 199 (Div. 2) {342} | PROGRAMMING | Tutorial | 2200 | |
| 569 | Xenia and Dominoes | bitmasks dfs and similar dp | Statement | D | Codeforces Round 199 (Div. 2) {342} | PROGRAMMING | Tutorial | 2500 | |
| 10127 | Rational Resistance | math number theory | Statement | A | Codeforces Round 200 (Div. 1) {343} | PROGRAMMING | Codeforces Round #200 Tutorial | 1600 | |
| 18205 | Alternating Current | data structures greedy implementation | Statement | B | Codeforces Round 200 (Div. 1) {343} | PROGRAMMING | Codeforces Round #200 Tutorial | 1600 | |
| 6964 | Water Tree | data structures dfs and similar graphs trees | Statement | D | Codeforces Round 200 (Div. 1) {343} | PROGRAMMING | Codeforces Round #200 Tutorial | 2100 | |
| 3221 | Read Time | binary search greedy two pointers | Statement | C | Codeforces Round 200 (Div. 1) {343} | PROGRAMMING | Codeforces Round #200 Tutorial | 2100 | |
| 918 | 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 | |
| 9628 | Simple Molecules | brute force graphs math | Statement | B | Codeforces Round 200 (Div. 2) {344} | PROGRAMMING | Codeforces Round #200 Tutorial | 1300 | |
| 155359 | Magnets | implementation | Statement | A | Codeforces Round 200 (Div. 2) {344} | PROGRAMMING | Codeforces Round #200 Tutorial | 700 | |
| 537 | Expecting Trouble | *special probabilities | Statement | A | Friday the 13th, Programmers Day {345} | PROGRAMMING | 1600 | ||
| 129 | Triskaidekaphobia | *special | Statement | B | Friday the 13th, Programmers Day {345} | PROGRAMMING | 2000 | ||
| 130 | Counting Fridays | *special | Statement | C | Friday the 13th, Programmers Day {345} | PROGRAMMING | 2000 | ||
| 83 | Chain Letter | *special dfs and similar graphs | Statement | D | Friday the 13th, Programmers Day {345} | PROGRAMMING | 2300 | ||
| 105 | Suffix Subgroup | *special strings | Statement | G | Friday the 13th, Programmers Day {345} | PROGRAMMING | 2600 | ||
| 52 | Superstitions Inspection | *special | Statement | F | Friday the 13th, Programmers Day {345} | PROGRAMMING | 2800 | ||
| 55 | Black Cat Rush | *special | Statement | E | Friday the 13th, Programmers Day {345} | PROGRAMMING | 2800 | ||
| 9381 | Alice and Bob | games math number theory | Statement | A | Codeforces Round 201 (Div. 1) {346} | PROGRAMMING | Codeforces Round #201 Editorial | 1600 | |
| 4322 | Lucky Common Subsequence | dp strings | Statement | B | Codeforces Round 201 (Div. 1) {346} | PROGRAMMING | Codeforces Round #201 Editorial | 2000 | |
| 1508 | Number Transformation II | greedy math | Statement | C | Codeforces Round 201 (Div. 1) {346} | PROGRAMMING | Codeforces Round #201 Editorial | 2200 | |
| 845 | Robot Control | dp graphs shortest paths | Statement | D | Codeforces Round 201 (Div. 1) {346} | PROGRAMMING | Codeforces Round #201 Editorial | 2600 | |
| 296 | Doodle Jump | math number theory | Statement | E | Codeforces Round 201 (Div. 1) {346} | PROGRAMMING | Codeforces Round #201 Editorial | 3000 | |
| 9890 | Fixed Points | brute force implementation math | Statement | B | Codeforces Round 201 (Div. 2) {347} | PROGRAMMING | Codeforces Round #201 Editorial | 1200 | |
| 9835 | Difference Row | constructive algorithms implementation sortings | Statement | A | Codeforces Round 201 (Div. 2) {347} | PROGRAMMING | Codeforces Round #201 Editorial | 1300 | |
| 14807 | Mafia | binary search math sortings | Statement | A | Codeforces Round 202 (Div. 1) {348} | PROGRAMMING | Editorial for Codeforces Round #202 | 1700 | |
| 2288 | Apple Tree | dfs and similar number theory trees | Statement | B | Codeforces Round 202 (Div. 1) {348} | PROGRAMMING | Editorial for Codeforces Round #202 | 2400 | |
| 2236 | Turtles | dp matrices | Statement | D | Codeforces Round 202 (Div. 1) {348} | PROGRAMMING | Editorial for Codeforces Round #202 | 2500 | |
| 2811 | Subset Sums | brute force data structures | Statement | C | Codeforces Round 202 (Div. 1) {348} | PROGRAMMING | Editorial for Codeforces Round #202 | 2600 | |
| 516 | Pilgrims | dfs and similar dp trees | Statement | E | Codeforces Round 202 (Div. 1) {348} | PROGRAMMING | Editorial for Codeforces Round #202 | 2800 | |
| 33958 | Cinema Line | greedy implementation | Statement | A | Codeforces Round 202 (Div. 2) {349} | PROGRAMMING | Editorial for Codeforces Round #202 | 1200 | |
| 15191 | Color the Fence | data structures dp greedy implementation | Statement | B | Codeforces Round 202 (Div. 2) {349} | PROGRAMMING | Editorial for Codeforces Round #202 | 1700 | |
| 17600 | TL | brute force greedy implementation | Statement | A | Codeforces Round 203 (Div. 2) {350} | PROGRAMMING | Editorial Codeforces Round #203 (Div. 2) | 1300 | |
| 3403 | Resort | graphs | Statement | B | Codeforces Round 203 (Div. 2) {350} | PROGRAMMING | Editorial Codeforces Round #203 (Div. 2) | 1600 | |
| 6840 | Bombs | greedy implementation sortings | Statement | C | Codeforces Round 203 (Div. 2) {350} | PROGRAMMING | Editorial Codeforces Round #203 (Div. 2) | 1600 | |
| 861 | 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 | |
| 299 | 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 | |
| 3104 | Jeff and Rounding | dp greedy implementation math | Statement | A | Codeforces Round 204 (Div. 1) {351} | PROGRAMMING | Codeforces Round #204 — tutorial | 1900 | |
| 2740 | Jeff and Furik | combinatorics dp probabilities | Statement | B | Codeforces Round 204 (Div. 1) {351} | PROGRAMMING | Codeforces Round #204 — tutorial | 2100 | |
| 1796 | Jeff and Permutation | greedy | Statement | E | Codeforces Round 204 (Div. 1) {351} | PROGRAMMING | Codeforces Round #204 — tutorial | 2200 | |
| 1358 | Jeff and Removing Periods | data structures | Statement | D | Codeforces Round 204 (Div. 1) {351} | PROGRAMMING | Codeforces Round #204 — tutorial | 2700 | |
| 636 | Jeff and Brackets | dp matrices | Statement | C | Codeforces Round 204 (Div. 1) {351} | PROGRAMMING | Codeforces Round #204 — tutorial | 2800 | |
| 28769 | Jeff and Digits | brute force implementation math | Statement | A | Codeforces Round 204 (Div. 2) {352} | PROGRAMMING | 1100 | ||
| 18245 | Jeff and Periods | implementation sortings | Statement | B | Codeforces Round 204 (Div. 2) {352} | PROGRAMMING | 1300 | ||
| 20058 | Domino | implementation math | Statement | A | Codeforces Round 205 (Div. 2) {353} | PROGRAMMING | 9145 | 1300 | |
| 5276 | Find Maximum | implementation math number theory | Statement | C | Codeforces Round 205 (Div. 2) {353} | PROGRAMMING | 9145 | 1600 | |
| 2443 | Two Heaps | combinatorics constructive algorithms greedy implementation math sortings | Statement | B | Codeforces Round 205 (Div. 2) {353} | PROGRAMMING | 9145 | 1800 | |
| 3194 | Queue | constructive algorithms dp | Statement | D | Codeforces Round 205 (Div. 2) {353} | PROGRAMMING | 9145 | 2100 | |
| 675 | Antichain | dp graph matchings greedy | Statement | E | Codeforces Round 205 (Div. 2) {353} | PROGRAMMING | 9145 | 2600 | |
| 5666 | Vasya and Robot | brute force greedy math | Statement | A | Codeforces Round 206 (Div. 1) {354} | PROGRAMMING | Codeforces Round #206 — Editorial | 1600 | |
| 3353 | Vasya and Beautiful Arrays | brute force dp number theory | Statement | C | Codeforces Round 206 (Div. 1) {354} | PROGRAMMING | Codeforces Round #206 — Editorial | 2000 | |
| 918 | Lucky Number Representation | constructive algorithms dfs and similar dp | Statement | E | Codeforces Round 206 (Div. 1) {354} | PROGRAMMING | Codeforces Round #206 — Editorial | 2200 | |
| 506 | Game with Strings | bitmasks dp games | Statement | B | Codeforces Round 206 (Div. 1) {354} | PROGRAMMING | Codeforces Round #206 — Editorial | 2500 | |
| 501 | Transferring Pyramid | dp | Statement | D | Codeforces Round 206 (Div. 1) {354} | PROGRAMMING | Codeforces Round #206 — Editorial | 2900 | |
| 9860 | Vasya and Digital Root | constructive algorithms implementation | Statement | A | Codeforces Round 206 (Div. 2) {355} | PROGRAMMING | Codeforces Round #206 — Editorial | 1100 | |
| 4916 | Vasya and Public Transport | greedy implementation | Statement | B | Codeforces Round 206 (Div. 2) {355} | PROGRAMMING | Codeforces Round #206 — Editorial | 1200 | |
| 16989 | Knight Tournament | data structures dsu | Statement | A | Codeforces Round 207 (Div. 1) {356} | PROGRAMMING | 9210 | 1700 | |
| 2094 | Xenia and Hamming | implementation math | Statement | B | Codeforces Round 207 (Div. 1) {356} | PROGRAMMING | 9210 | 2000 | |
| 1399 | Compartments | combinatorics constructive algorithms greedy implementation | Statement | C | Codeforces Round 207 (Div. 1) {356} | PROGRAMMING | Codeforces Round #207: разбор задач | 2200 | |
| 1099 | Bags and Coins | bitmasks constructive algorithms dp greedy | Statement | D | Codeforces Round 207 (Div. 1) {356} | PROGRAMMING | 9210 | 2500 | |
| 490 | Xenia and String Problem | dp hashing implementation string suffix structures strings | Statement | E | Codeforces Round 207 (Div. 1) {356} | PROGRAMMING | 9210 | 2800 | |
| 7735 | Group of Students | brute force greedy implementation | Statement | A | Codeforces Round 207 (Div. 2) {357} | PROGRAMMING | Codeforces Round #207: tutorial | 1200 | |
| 8573 | Flag Day | constructive algorithms implementation | Statement | B | Codeforces Round 207 (Div. 2) {357} | PROGRAMMING | Codeforces Round #207: tutorial | 1400 | |
| 8163 | Dima and Continuous Line | brute force implementation | Statement | A | Codeforces Round 208 (Div. 2) {358} | PROGRAMMING | Codeforces Round #208 (Div. 2) Разбор | 1400 | |
| 3910 | Dima and Text Messages | brute force strings | Statement | B | Codeforces Round 208 (Div. 2) {358} | PROGRAMMING | Codeforces Round #208 (Div. 2) Разбор | 1500 | |
| 4522 | Dima and Hares | dp greedy | Statement | D | Codeforces Round 208 (Div. 2) {358} | PROGRAMMING | Codeforces Round #208 (Div. 2) Разбор | 2000 | |
| 2296 | Dima and Containers | constructive algorithms greedy implementation | Statement | C | Codeforces Round 208 (Div. 2) {358} | PROGRAMMING | Codeforces Round #208 (Div. 2) Разбор | 2000 | |
| 433 | Dima and Kicks | brute force dsu graphs implementation | Statement | E | Codeforces Round 208 (Div. 2) {358} | PROGRAMMING | Codeforces Round #208 (Div. 2) Разбор | 2600 | |
| 9169 | Table | constructive algorithms greedy implementation | Statement | A | Codeforces Round 209 (Div. 2) {359} | PROGRAMMING | Editorial Codeforces Round #209 (Div. 2) | 1100 | |
| 8740 | Permutation | constructive algorithms dp math | Statement | B | Codeforces Round 209 (Div. 2) {359} | PROGRAMMING | Editorial Codeforces Round #209 (Div. 2) | 1400 | |
| 3585 | Prime Number | math number theory | Statement | C | Codeforces Round 209 (Div. 2) {359} | PROGRAMMING | Editorial Codeforces Round #209 (Div. 2) | 2000 | |
| 5776 | 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 | |
| 520 | Neatness | constructive algorithms dfs and similar | Statement | E | Codeforces Round 209 (Div. 2) {359} | PROGRAMMING | Editorial Codeforces Round #209 (Div. 2) | 2500 | |
| 2144 | Levko and Array Recovery | greedy implementation | Statement | A | Codeforces Round 210 (Div. 1) {360} | PROGRAMMING | Codeforces Round #210 editorial | 1800 | |
| 3522 | Levko and Array | binary search dp | Statement | B | Codeforces Round 210 (Div. 1) {360} | PROGRAMMING | Codeforces Round #210 editorial | 2300 | |
| 489 | Levko and Sets | number theory | Statement | D | Codeforces Round 210 (Div. 1) {360} | PROGRAMMING | Codeforces Round #210 editorial | 2600 | |
| 1233 | Levko and Strings | combinatorics dp | Statement | C | Codeforces Round 210 (Div. 1) {360} | PROGRAMMING | Codeforces Round #210 editorial | 2700 | |
| 818 | Levko and Game | graphs greedy shortest paths | Statement | E | Codeforces Round 210 (Div. 1) {360} | PROGRAMMING | Codeforces Round #210 editorial | 2800 | |
| 8819 | Levko and Permutation | constructive algorithms math number theory | Statement | B | Codeforces Round 210 (Div. 2) {361} | PROGRAMMING | Codeforces Round #210 editorial | 1200 | |
| 17879 | Levko and Table | constructive algorithms implementation | Statement | A | Codeforces Round 210 (Div. 2) {361} | PROGRAMMING | Codeforces Round #210 editorial | 800 | |
| 14781 | Petya and Staircases | implementation sortings | Statement | B | Codeforces Round 212 (Div. 2) {362} | PROGRAMMING | Codeforces Round #212 (Div. 2). Tutorial. Part 1. | 1200 | |
| 2808 | Two Semiknights Meet | greedy math | Statement | A | Codeforces Round 212 (Div. 2) {362} | PROGRAMMING | Codeforces Round #212 (Div. 2). Tutorial. Part 1. | 1500 | |
| 2028 | 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 | |
| 1027 | 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 | |
| 901 | 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 | |
| 11471 | Soroban | implementation | Statement | A | Codeforces Round 211 (Div. 2) {363} | PROGRAMMING | 9537 | 1000 | |
| 68301 | Fence | brute force dp | Statement | B | Codeforces Round 211 (Div. 2) {363} | PROGRAMMING | 9537 | 1200 | |
| 14158 | Fixing Typos | greedy implementation | Statement | C | Codeforces Round 211 (Div. 2) {363} | PROGRAMMING | 9537 | 1400 | |
| 4352 | Renting Bikes | binary search greedy | Statement | D | Codeforces Round 211 (Div. 2) {363} | PROGRAMMING | 9537 | 1800 | |
| 227 | Two Circles | brute force data structures implementation | Statement | E | Codeforces Round 211 (Div. 2) {363} | PROGRAMMING | 9537 | 2600 | |
| 4971 | Matrix | combinatorics data structures implementation | Statement | A | Codeforces Round 213 (Div. 1) {364} | PROGRAMMING | Codeforces Round #213 Editorial | 1800 | |
| 1255 | Free Market | dp greedy | Statement | B | Codeforces Round 213 (Div. 1) {364} | PROGRAMMING | Codeforces Round #213 Editorial | 2300 | |
| 642 | Beautiful Set | brute force number theory | Statement | C | Codeforces Round 213 (Div. 1) {364} | PROGRAMMING | Codeforces Round #213 Editorial | 2500 | |
| 2551 | Ghd | brute force math probabilities | Statement | D | Codeforces Round 213 (Div. 1) {364} | PROGRAMMING | Codeforces Round #213 Editorial | 2600 | |
| 631 | Empty Rectangles | divide and conquer two pointers | Statement | E | Codeforces Round 213 (Div. 1) {364} | PROGRAMMING | Codeforces Round #213 Editorial | 3000 | |
| 23133 | Good Number | implementation | Statement | A | Codeforces Round 213 (Div. 2) {365} | PROGRAMMING | Codeforces Round #213 Editorial | 1100 | |
| 15415 | The Fibonacci Segment | implementation | Statement | B | Codeforces Round 213 (Div. 2) {365} | PROGRAMMING | Codeforces Round #213 Editorial | 1200 | |
| 4822 | Dima and Guards | implementation | Statement | A | Codeforces Round 214 (Div. 2) {366} | PROGRAMMING | Codeforces Round #214 (Div. 2) — Tutorial | 1100 | |
| 7164 | Dima and To-do List | brute force implementation | Statement | B | Codeforces Round 214 (Div. 2) {366} | PROGRAMMING | Codeforces Round #214 (Div. 2) — Tutorial | 1200 | |
| 6006 | Dima and Salad | dp | Statement | C | Codeforces Round 214 (Div. 2) {366} | PROGRAMMING | Codeforces Round #214 (Div. 2) — Tutorial | 1900 | |
| 847 | Dima and Magic Guitar | brute force implementation math | Statement | E | Codeforces Round 214 (Div. 2) {366} | PROGRAMMING | Codeforces Round #214 (Div. 2) — Tutorial | 2300 | |
| 1739 | 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 | |
| 4556 | Sereja and Algorithm | data structures implementation | Statement | A | Codeforces Round 215 (Div. 1) {367} | PROGRAMMING | Codeforces Round #215 — tutorial | 1500 | |
| 2724 | Sereja ans Anagrams | binary search data structures | Statement | B | Codeforces Round 215 (Div. 1) {367} | PROGRAMMING | Codeforces Round #215 — tutorial | 2000 | |
| 1926 | Sereja and the Arrangement of Numbers | graphs greedy sortings | Statement | C | Codeforces Round 215 (Div. 1) {367} | PROGRAMMING | Codeforces Round #215 — tutorial | 2200 | |
| 689 | Sereja and Sets | bitmasks dfs and similar | Statement | D | Codeforces Round 215 (Div. 1) {367} | PROGRAMMING | Codeforces Round #215 — tutorial | 2400 | |
| 1408 | Sereja and Intervals | combinatorics dp | Statement | E | Codeforces Round 215 (Div. 1) {367} | PROGRAMMING | Codeforces Round #215 — tutorial | 2600 | |
| 50387 | Sereja and Suffixes | data structures dp | Statement | B | Codeforces Round 215 (Div. 2) {368} | PROGRAMMING | Codeforces Round #215 — tutorial | 1100 | |
| 8016 | Sereja and Coat Rack | implementation | Statement | A | Codeforces Round 215 (Div. 2) {368} | PROGRAMMING | Codeforces Round #215 — tutorial | 1100 | |
| 12272 | Valera and Plates | greedy implementation | Statement | A | Codeforces Round 216 (Div. 2) {369} | PROGRAMMING | Editorial Codeforces Round #216 (Div. 2) | 1000 | |
| 6888 | Valera and Contest | constructive algorithms implementation math | Statement | B | Codeforces Round 216 (Div. 2) {369} | PROGRAMMING | Editorial Codeforces Round #216 (Div. 2) | 1500 | |
| 12155 | Valera and Elections | dfs and similar graphs trees | Statement | C | Codeforces Round 216 (Div. 2) {369} | PROGRAMMING | Editorial Codeforces Round #216 (Div. 2) | 1700 | |
| 1292 | 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 | |
| 2805 | Valera and Queries | binary search data structures | Statement | E | Codeforces Round 216 (Div. 2) {369} | PROGRAMMING | Editorial Codeforces Round #216 (Div. 2) | 2400 | |
| 12162 | Rook, Bishop and King | graphs math shortest paths | Statement | A | Codeforces Round 217 (Div. 2) {370} | PROGRAMMING | Codeforces Round #217 (Div. 2): tutorial | 1200 | |
| 2692 | Berland Bingo | implementation | Statement | B | Codeforces Round 217 (Div. 2) {370} | PROGRAMMING | Codeforces Round #217 (Div. 2): tutorial | 1300 | |
| 1726 | Mittens | constructive algorithms greedy sortings | Statement | C | Codeforces Round 217 (Div. 2) {370} | PROGRAMMING | Codeforces Round #217 (Div. 2): tutorial | 1800 | |
| 706 | Broken Monitor | brute force constructive algorithms greedy implementation | Statement | D | Codeforces Round 217 (Div. 2) {370} | PROGRAMMING | Codeforces Round #217 (Div. 2): tutorial | 2100 | |
| 321 | Summer Reading | dp greedy | Statement | E | Codeforces Round 217 (Div. 2) {370} | PROGRAMMING | Codeforces Round #217 (Div. 2): tutorial | 2500 | |
| 6683 | K-Periodic Array | greedy implementation math | Statement | A | Codeforces Round 218 (Div. 2) {371} | PROGRAMMING | Codeforces Round #218 (Div. 2): Tutorial | 1200 | |
| 12600 | Fox Dividing Cheese | math number theory | Statement | B | Codeforces Round 218 (Div. 2) {371} | PROGRAMMING | Codeforces Round #218 (Div. 2): Tutorial | 1400 | |
| 35482 | Hamburgers | binary search brute force | Statement | C | Codeforces Round 218 (Div. 2) {371} | PROGRAMMING | Codeforces Round #218 (Div. 2): Tutorial | 1600 | |
| 6565 | Vessels | data structures dsu implementation trees | Statement | D | Codeforces Round 218 (Div. 2) {371} | PROGRAMMING | Codeforces Round #218 (Div. 2): Tutorial | 1900 | |
| 1448 | Subway Innovation | greedy math two pointers | Statement | E | Codeforces Round 218 (Div. 2) {371} | PROGRAMMING | Codeforces Round #218 (Div. 2): Tutorial | 2200 | |
| 15737 | Counting Kangaroos is Fun | binary search greedy sortings two pointers | Statement | A | Codeforces Round 219 (Div. 1) {372} | PROGRAMMING | 9944 | 1700 | |
| 2847 | Counting Rectangles is Fun | brute force divide and conquer dp | Statement | B | Codeforces Round 219 (Div. 1) {372} | PROGRAMMING | 9944 | 2100 | |
| 4989 | Watching Fireworks is Fun | data structures dp math | Statement | C | Codeforces Round 219 (Div. 1) {372} | PROGRAMMING | 9944 | 2400 | |
| 1135 | 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 | |
| 190 | Drawing Circles is Fun | combinatorics geometry | Statement | E | Codeforces Round 219 (Div. 1) {372} | PROGRAMMING | 9944 | 2900 | |
| 11513 | Collecting Beats is Fun | implementation | Statement | A | Codeforces Round 219 (Div. 2) {373} | PROGRAMMING | Codeforces Round #219 editorial | 1000 | |
| 2805 | Making Sequences is Fun | binary search implementation math | Statement | B | Codeforces Round 219 (Div. 2) {373} | PROGRAMMING | Codeforces Round #219 editorial | 1600 | |
| 3495 | Inna and Nine | combinatorics greedy | Statement | B | Codeforces Round 220 (Div. 2) {374} | PROGRAMMING | Codeforces Round #220 (Div. 2) разбор | 1600 | |
| 3100 | Inna and Pink Pony | greedy implementation | Statement | A | Codeforces Round 220 (Div. 2) {374} | PROGRAMMING | Codeforces Round #220 (Div. 2) разбор | 1800 | |
| 3031 | Inna and Dima | dfs and similar dp graphs implementation | Statement | C | Codeforces Round 220 (Div. 2) {374} | PROGRAMMING | Codeforces Round #220 (Div. 2) разбор | 2000 | |
| 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 | |
| 5447 | Maximum Submatrix 2 | data structures dp implementation sortings | Statement | B | Codeforces Round 221 (Div. 1) {375} | PROGRAMMING | Codeforces Round #221 Tutorial | 1800 | |
| 5371 | Divisible by Seven | math number theory | Statement | A | Codeforces Round 221 (Div. 1) {375} | PROGRAMMING | Codeforces Round #221 Tutorial | 1800 | |
| 9074 | Tree and Queries | data structures dfs and similar trees | Statement | D | Codeforces Round 221 (Div. 1) {375} | PROGRAMMING | Codeforces Round #221 Tutorial | 2400 | |
| 638 | Circling Round Treasures | bitmasks shortest paths | Statement | C | Codeforces Round 221 (Div. 1) {375} | PROGRAMMING | Codeforces Round #221 Tutorial | 2600 | |
| 494 | Red and Black Tree | dp implementation math | Statement | E | Codeforces Round 221 (Div. 1) {375} | PROGRAMMING | Codeforces Round #221 Tutorial | 3000 | |
| 9933 | Lever | implementation math | Statement | A | Codeforces Round 221 (Div. 2) {376} | PROGRAMMING | Codeforces Round #221 Tutorial | 1000 | |
| 6969 | I.O.U. | implementation | Statement | B | Codeforces Round 221 (Div. 2) {376} | PROGRAMMING | Codeforces Round #221 Tutorial | 1300 | |
| 27514 | Maze | dfs and similar | Statement | A | Codeforces Round 222 (Div. 1) {377} | PROGRAMMING | Codeforces Round #222 — Problem Analysis | 1600 | |
| 2500 | 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 | |
| 1349 | Developing Game | data structures | Statement | D | Codeforces Round 222 (Div. 1) {377} | PROGRAMMING | Codeforces Round #222 — Problem Analysis | 2400 | |
| 1268 | Captains Mode | bitmasks dp games | Statement | C | Codeforces Round 222 (Div. 1) {377} | PROGRAMMING | Codeforces Round #222 — Problem Analysis | 2400 | |
| 570 | Cookie Clicker | dp geometry | Statement | E | Codeforces Round 222 (Div. 1) {377} | PROGRAMMING | Codeforces Round #222 — Problem Analysis | 2700 | |
| 6222 | Semifinals | implementation sortings | Statement | B | Codeforces Round 222 (Div. 2) {378} | PROGRAMMING | Codeforces Round #222 — Problem Analysis | 1300 | |
| 26045 | Playing with Dice | brute force | Statement | A | Codeforces Round 222 (Div. 2) {378} | PROGRAMMING | Codeforces Round #222 — Problem Analysis | 800 | |
| 53700 | New Year Candles | implementation | Statement | A | Good Bye 2013 {379} | PROGRAMMING | Tutorial Good Bye 2013 | 1100 | |
| 7624 | New Year Present | constructive algorithms implementation | Statement | B | Good Bye 2013 {379} | PROGRAMMING | Tutorial Good Bye 2013 | 1200 | |
| 7067 | New Year Ratings Change | greedy sortings | Statement | C | Good Bye 2013 {379} | PROGRAMMING | Tutorial Good Bye 2013 | 1500 | |
| 1666 | New Year Letter | bitmasks brute force dp | Statement | D | Good Bye 2013 {379} | PROGRAMMING | Tutorial Good Bye 2013 | 2000 | |
| 2773 | New Year Tree | data structures divide and conquer trees | Statement | F | Good Bye 2013 {379} | PROGRAMMING | Tutorial Good Bye 2013 | 2400 | |
| 380 | New Year Tree Decorations | geometry schedules sortings | Statement | E | Good Bye 2013 {379} | PROGRAMMING | Tutorial Good Bye 2013 | 2500 | |
| 152 | New Year Cactus | dp | Statement | G | Good Bye 2013 {379} | PROGRAMMING | Tutorial Good Bye 2013 | 3100 | |
| 2932 | Sereja and Prefixes | binary search brute force | Statement | A | Codeforces Round 223 (Div. 1) {380} | PROGRAMMING | Codeforces Round #223 — Tutorial | 1700 | |
| 20221 | Sereja and Brackets | data structures schedules | Statement | C | Codeforces Round 223 (Div. 1) {380} | PROGRAMMING | Codeforces Round #223 — Tutorial | 2100 | |
| 576 | Sereja and Tree | graphs implementation | Statement | B | Codeforces Round 223 (Div. 1) {380} | PROGRAMMING | Codeforces Round #223 — Tutorial | 2500 | |
| 523 | Sereja and Cinema | combinatorics math | Statement | D | Codeforces Round 223 (Div. 1) {380} | PROGRAMMING | Codeforces Round #223 — Tutorial | 2500 | |
| 352 | Sereja and Dividing | data structures | Statement | E | Codeforces Round 223 (Div. 1) {380} | PROGRAMMING | Codeforces Round #223 — Tutorial | 2600 | |
| 7379 | Sereja and Stairs | greedy implementation sortings | Statement | B | Codeforces Round 223 (Div. 2) {381} | PROGRAMMING | Codeforces Round #223 — Tutorial | 1100 | |
| 91481 | Sereja and Dima | greedy implementation two pointers | Statement | A | Codeforces Round 223 (Div. 2) {381} | PROGRAMMING | Codeforces Round #223 — Tutorial | 800 | |
| 13731 | Ksenia and Pan Scales | greedy implementation | Statement | A | Codeforces Round 224 (Div. 2) {382} | PROGRAMMING | Codeforces Round #224 (Div. 2) Editorial | 1100 | |
| 8758 | Arithmetic Progression | implementation sortings | Statement | C | Codeforces Round 224 (Div. 2) {382} | PROGRAMMING | Codeforces Round #224 (Div. 2) Editorial | 1700 | |
| 1506 | Number Busters | binary search math | Statement | B | Codeforces Round 224 (Div. 2) {382} | PROGRAMMING | Codeforces Round #224 (Div. 2) Editorial | 2000 | |
| 733 | 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 | |
| 440 | Ksenia and Combinatorics | combinatorics dp | Statement | E | Codeforces Round 224 (Div. 2) {382} | PROGRAMMING | Codeforces Round #224 (Div. 2) Editorial | 2600 | |
| 5580 | Milking cows | data structures greedy | Statement | A | Codeforces Round 225 (Div. 1) {383} | PROGRAMMING | Tutorial | 1500 | |
| 785 | Volcanoes | binary search implementation sortings two pointers | Statement | B | Codeforces Round 225 (Div. 1) {383} | PROGRAMMING | Tutorial | 2200 | |
| 3366 | Antimatter | dp | Statement | D | Codeforces Round 225 (Div. 1) {383} | PROGRAMMING | Tutorial | 2300 | |
| 7623 | Propagating tree | data structures dfs and similar trees | Statement | C | Codeforces Round 225 (Div. 1) {383} | PROGRAMMING | Tutorial | 2400 | |
| 4383 | Vowels | combinatorics divide and conquer dp | Statement | E | Codeforces Round 225 (Div. 1) {383} | PROGRAMMING | Tutorial | 2700 | |
| 3816 | Multitasking | greedy implementation sortings two pointers | Statement | B | Codeforces Round 225 (Div. 2) {384} | PROGRAMMING | Codeforces Round #225 — Editorial | 1500 | |
| 17264 | Coder | implementation | Statement | A | Codeforces Round 225 (Div. 2) {384} | PROGRAMMING | Codeforces Round #225 — Editorial | 800 | |
| 17367 | Bear and Raspberry | brute force greedy implementation | Statement | A | Codeforces Round 226 (Div. 2) {385} | PROGRAMMING | Codeforces Round #226 (Div. 2) — Editorial | 1100 | |
| 10885 | 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 | |
| 10647 | 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 | |
| 950 | Bear and Floodlight | bitmasks dp geometry | Statement | D | Codeforces Round 226 (Div. 2) {385} | PROGRAMMING | Codeforces Round #226 (Div. 2) — Editorial | 2500 | |
| 668 | Bear in the Field | math matrices | Statement | E | Codeforces Round 226 (Div. 2) {385} | PROGRAMMING | Codeforces Round #226 (Div. 2) — Editorial | 2700 | |
| 7772 | Second-Price Auction | implementation | Statement | A | Testing Round 9 {386} | PROGRAMMING | 1100 | ||
| 2535 | Fly, freebies, fly! | binary search brute force implementation | Statement | B | Testing Round 9 {386} | PROGRAMMING | 1500 | ||
| 953 | Diverse Substrings | dp strings two pointers | Statement | C | Testing Round 9 {386} | PROGRAMMING | 2100 | ||
| 552 | Game with Points | dp graphs implementation shortest paths | Statement | D | Testing Round 9 {386} | PROGRAMMING | 2300 | ||
| 10585 | George and Sleep | implementation | Statement | A | Codeforces Round 227 (Div. 2) {387} | PROGRAMMING | Editorial Codeforces Round #227 (Div. 2) | 1000 | |
| 12991 | George and Round | brute force greedy two pointers | Statement | B | Codeforces Round 227 (Div. 2) {387} | PROGRAMMING | Editorial Codeforces Round #227 (Div. 2) | 1200 | |
| 2298 | George and Number | greedy implementation | Statement | C | Codeforces Round 227 (Div. 2) {387} | PROGRAMMING | Editorial Codeforces Round #227 (Div. 2) | 1700 | |
| 992 | George and Cards | binary search data structures | Statement | E | Codeforces Round 227 (Div. 2) {387} | PROGRAMMING | Editorial Codeforces Round #227 (Div. 2) | 2500 | |
| 1185 | George and Interesting Graph | graph matchings | Statement | D | Codeforces Round 227 (Div. 2) {387} | PROGRAMMING | Editorial Codeforces Round #227 (Div. 2) | 2700 | |
| 11968 | Fox and Box Accumulation | greedy sortings | Statement | A | Codeforces Round 228 (Div. 1) {388} | PROGRAMMING | Codeforces Round #228 — Editorial | 1400 | |
| 2606 | Fox and Minimal path | bitmasks constructive algorithms graphs implementation math | Statement | B | Codeforces Round 228 (Div. 1) {388} | PROGRAMMING | Codeforces Round #228 — Editorial | 2000 | |
| 3835 | Fox and Card Game | games greedy sortings | Statement | C | Codeforces Round 228 (Div. 1) {388} | PROGRAMMING | Codeforces Round #228 — Editorial | 2000 | |
| 497 | Fox and Perfect Sets | math | Statement | D | Codeforces Round 228 (Div. 1) {388} | PROGRAMMING | Codeforces Round #228 — Editorial | 2700 | |
| 133 | Fox and Meteor Shower | geometry | Statement | E | Codeforces Round 228 (Div. 1) {388} | PROGRAMMING | Codeforces Round #228 — Editorial | 3000 | |
| 15016 | Fox and Number Game | greedy math | Statement | A | Codeforces Round 228 (Div. 2) {389} | PROGRAMMING | Codeforces Round #228 — Editorial | 1100 | |
| 7352 | Fox and Cross | greedy implementation | Statement | B | Codeforces Round 228 (Div. 2) {389} | PROGRAMMING | Codeforces Round #228 — Editorial | 1200 | |
| 1258 | 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 | |||
| 700 | Inna and Candy Boxes | data structures | Statement | C | Codeforces Round 229 (Div. 2) {390} | PROGRAMMING | 1500.0 | ||
| 3761 | Inna and Alarm Clock | implementation | Statement | A | Codeforces Round 229 (Div. 2) {390} | PROGRAMMING | 500.0 | ||
| 443 | Word Folding | brute force | Statement | B | Rockethon 2014 {391} | PROGRAMMING | 5.0 | ||
| 187 | Three Trees | Statement | E2 | Rockethon 2014 {391} | PROGRAMMING | 13.0 | |||
| 136 | Three Trees | Statement | E1 | Rockethon 2014 {391} | PROGRAMMING | 11.0 | |||
| 179 | The Tournament | Statement | C3 | Rockethon 2014 {391} | PROGRAMMING | 8.0 | |||
| 154 | The Tournament | greedy | Statement | C2 | Rockethon 2014 {391} | PROGRAMMING | 4.0 | ||
| 212 | The Tournament | brute force | Statement | C1 | Rockethon 2014 {391} | PROGRAMMING | 4.0 | ||
| 218 | Supercollider | data structures | Statement | D2 | Rockethon 2014 {391} | PROGRAMMING | 16.0 | ||
| 294 | Supercollider | brute force | Statement | D1 | Rockethon 2014 {391} | PROGRAMMING | 3.0 | ||
| 120 | Stock Trading | Statement | F3 | Rockethon 2014 {391} | PROGRAMMING | 10.0 | |||
| 121 | Stock Trading | greedy | Statement | F2 | Rockethon 2014 {391} | PROGRAMMING | 15.0 | ||
| 225 | Stock Trading | dp | Statement | F1 | Rockethon 2014 {391} | PROGRAMMING | 8.0 | ||
| 1811 | Genetic Engineering | implementation two pointers | Statement | A | Rockethon 2014 {391} | PROGRAMMING | 3.0 | Rockethon 2014 Editorial | |
| 681 | Yet Another Number Sequence | combinatorics math matrices | Statement | C | Codeforces Round 230 (Div. 1) {392} | PROGRAMMING | 1500.0 | 83942 | |
| 1062 | Tower of Hanoi | dp | Statement | B | Codeforces Round 230 (Div. 1) {392} | PROGRAMMING | 1000.0 | 83942 | |
| 235 | 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 | ||
| 1010 | Blocked Points | math | Statement | A | Codeforces Round 230 (Div. 1) {392} | PROGRAMMING | 500.0 | 83942 | |
| 2075 | Three matrices | Statement | B | Codeforces Round 230 (Div. 2) {393} | PROGRAMMING | 1000.0 | 83942 | ||
| 7000 | Nineteen | Statement | A | Codeforces Round 230 (Div. 2) {393} | PROGRAMMING | 500.0 | 83942 | ||
| 628 | Very Beautiful Number | math | Statement | B | Codeforces Round 231 (Div. 2) {394} | PROGRAMMING | 1000.0 | ||
| 299 | Physical Education and Buns | brute force implementation math | Statement | D | Codeforces Round 231 (Div. 2) {394} | PROGRAMMING | 2000.0 | ||
| 133 | Lightbulb for Minister | geometry | Statement | E | Codeforces Round 231 (Div. 2) {394} | PROGRAMMING | 2500.0 | ||
| 559 | Dominoes | constructive algorithms greedy | Statement | C | Codeforces Round 231 (Div. 2) {394} | PROGRAMMING | 1500.0 | ||
| 2739 | Counting Sticks | brute force implementation | Statement | A | Codeforces Round 231 (Div. 2) {394} | PROGRAMMING | 500.0 | ||
| 465 | 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) | |
| 1194 | On Sum of Fractions | math number theory | Statement | B | Codeforces Round 232 (Div. 1) {396} | PROGRAMMING | 1000.0 | Codeforces Round #232 Editorial (restored) | |
| 1633 | 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) | |
| 1817 | On Changing Tree | data structures graphs trees | Statement | C | Codeforces Round 232 (Div. 1) {396} | PROGRAMMING | 1500.0 | Codeforces Round #232 Editorial (restored) | |
| 2729 | On Segment's Own Points | implementation | Statement | A | Codeforces Round 232 (Div. 2) {397} | PROGRAMMING | 500.0 | Codeforces Round #232 Editorial (restored) | |
| 835 | On Corruption and Numbers | constructive algorithms implementation math | Statement | B | Codeforces Round 232 (Div. 2) {397} | PROGRAMMING | 1000.0 | Codeforces Round #232 Editorial (restored) |