Review the problem statement from Codeforces (link will open a new tab). When you've matched your problem, go to the solutions.
Get exact match for tags using this format, eg: [u'brute force', 'dp']
< 1 2 3 ... 14 15 16 17 18 ... 100 101 102 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 6265 | Book of Evil | dfs and similar divide and conquer dp trees | Statement | D | Codeforces Round 196 (Div. 2) {337} | PROGRAMMING | 2100 | ||
| 1035 | Divisor Tree | brute force number theory trees | Statement | E | Codeforces Round 196 (Div. 2) {337} | PROGRAMMING | Codeforces Round #196 — Problems Analysis | 2400 | |
| 1022 | Optimize! | data structures | Statement | E | Codeforces Round 196 (Div. 1) {338} | PROGRAMMING | Codeforces Round #196 — Problems Analysis | 2600 | |
| 1183 | GCD Table | chinese remainder theorem math number theory | Statement | D | Codeforces Round 196 (Div. 1) {338} | PROGRAMMING | Codeforces Round #196 — Problems Analysis | 2700 | |
| 71722 | Xenia and Ringroad | implementation | Statement | B | Codeforces Round 197 (Div. 2) {339} | PROGRAMMING | Codeforces Round #197 — Tutorial | 1100 | |
| 8389 | 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 | |
| 26690 | Xenia and Bit Operations | data structures trees | Statement | D | Codeforces Round 197 (Div. 2) {339} | PROGRAMMING | 1700 | ||
| 554 | Three Swaps | constructive algorithms dfs and similar greedy | Statement | E | Codeforces Round 197 (Div. 2) {339} | PROGRAMMING | 2200 | ||
| 224810 | Helpful Maths | greedy implementation sortings strings | Statement | A | Codeforces Round 197 (Div. 2) {339} | PROGRAMMING | Codeforces Round #197 — Tutorial | 900 | |
| 7772 | The Wall | math | Statement | A | Codeforces Round 198 (Div. 2) {340} | PROGRAMMING | Tutorial | 1300 | |
| 4296 | Tourist Problem | combinatorics implementation math | Statement | C | Codeforces Round 198 (Div. 2) {340} | PROGRAMMING | Tutorial | 1700 | |
| 7314 | Bubble Sort Graph | binary search data structures dp | Statement | D | Codeforces Round 198 (Div. 2) {340} | PROGRAMMING | Tutorial | 1800 | |
| 2123 | Maximal Area Quadrilateral | brute force geometry | Statement | B | Codeforces Round 198 (Div. 2) {340} | PROGRAMMING | Tutorial | 2000 | |
| 2509 | Iahub and Permutations | combinatorics math | Statement | E | Codeforces Round 198 (Div. 2) {340} | PROGRAMMING | Tutorial | 2200 | |
| 1258 | Iahub and Xors | data structures | Statement | D | Codeforces Round 198 (Div. 1) {341} | PROGRAMMING | 2500 | ||
| 467 | Candies Game | constructive algorithms greedy | Statement | E | Codeforces Round 198 (Div. 1) {341} | PROGRAMMING | 2900 | ||
| 12819 | Xenia and Divisors | greedy implementation | Statement | A | Codeforces Round 199 (Div. 2) {342} | PROGRAMMING | Tutorial | 1300 | |
| 4043 | Xenia and Spies | brute force greedy implementation | Statement | B | Codeforces Round 199 (Div. 2) {342} | PROGRAMMING | 1500 | ||
| 1865 | Cupboard and Balloons | geometry | Statement | C | Codeforces Round 199 (Div. 2) {342} | PROGRAMMING | Tutorial | 1800 | |
| 8826 | Xenia and Tree | data structures divide and conquer trees | Statement | E | Codeforces Round 199 (Div. 2) {342} | PROGRAMMING | Tutorial | 2200 | |
| 506 | Xenia and Dominoes | bitmasks dfs and similar dp | Statement | D | Codeforces Round 199 (Div. 2) {342} | PROGRAMMING | 2500 | ||
| 9025 | Rational Resistance | math number theory | Statement | A | Codeforces Round 200 (Div. 1) {343} | PROGRAMMING | Codeforces Round #200 Tutorial | 1600 | |
| 14232 | Alternating Current | data structures greedy implementation | Statement | B | Codeforces Round 200 (Div. 1) {343} | PROGRAMMING | 1600 | ||
| 5929 | Water Tree | data structures dfs and similar graphs trees | Statement | D | Codeforces Round 200 (Div. 1) {343} | PROGRAMMING | Codeforces Round #200 Tutorial | 2100 | |
| 3035 | Read Time | binary search greedy two pointers | Statement | C | Codeforces Round 200 (Div. 1) {343} | PROGRAMMING | 2100 | ||
| 779 | Pumping Stations | brute force dfs and similar divide and conquer flows graphs greedy trees | Statement | E | Codeforces Round 200 (Div. 1) {343} | PROGRAMMING | 2800 | ||
| 8959 | Simple Molecules | brute force graphs math | Statement | B | Codeforces Round 200 (Div. 2) {344} | PROGRAMMING | Codeforces Round #200 Tutorial | 1300 | |
| 126285 | Magnets | implementation | Statement | A | Codeforces Round 200 (Div. 2) {344} | PROGRAMMING | Codeforces Round #200 Tutorial | 700 | |
| 495 | Expecting Trouble | *special probabilities | Statement | A | Friday the 13th, Programmers Day {345} | PROGRAMMING | 1600 | ||
| 126 | Triskaidekaphobia | *special | Statement | B | Friday the 13th, Programmers Day {345} | PROGRAMMING | 2000 | ||
| 128 | Counting Fridays | *special | Statement | C | Friday the 13th, Programmers Day {345} | PROGRAMMING | 2000 | ||
| 80 | Chain Letter | *special dfs and similar graphs | Statement | D | Friday the 13th, Programmers Day {345} | PROGRAMMING | 2300 | ||
| 101 | Suffix Subgroup | *special strings | Statement | G | Friday the 13th, Programmers Day {345} | PROGRAMMING | 2600 | ||
| 47 | Superstitions Inspection | *special | Statement | F | Friday the 13th, Programmers Day {345} | PROGRAMMING | 2800 | ||
| 50 | Black Cat Rush | *special | Statement | E | Friday the 13th, Programmers Day {345} | PROGRAMMING | 2800 | ||
| 8790 | Alice and Bob | games math number theory | Statement | A | Codeforces Round 201 (Div. 1) {346} | PROGRAMMING | Codeforces Round #201 Editorial | 1600 | |
| 3628 | Lucky Common Subsequence | dp strings | Statement | B | Codeforces Round 201 (Div. 1) {346} | PROGRAMMING | Codeforces Round #201 Editorial | 2000 | |
| 1444 | Number Transformation II | greedy math | Statement | C | Codeforces Round 201 (Div. 1) {346} | PROGRAMMING | Codeforces Round #201 Editorial | 2200 | |
| 758 | Robot Control | dp graphs shortest paths | Statement | D | Codeforces Round 201 (Div. 1) {346} | PROGRAMMING | 2600 | ||
| 266 | Doodle Jump | math number theory | Statement | E | Codeforces Round 201 (Div. 1) {346} | PROGRAMMING | 3000 | ||
| 9389 | Fixed Points | brute force implementation math | Statement | B | Codeforces Round 201 (Div. 2) {347} | PROGRAMMING | Codeforces Round #201 Editorial | 1200 | |
| 9079 | Difference Row | constructive algorithms implementation sortings | Statement | A | Codeforces Round 201 (Div. 2) {347} | PROGRAMMING | 1300 | ||
| 13382 | Mafia | binary search math sortings | Statement | A | Codeforces Round 202 (Div. 1) {348} | PROGRAMMING | Editorial for Codeforces Round #202 | 1700 | |
| 2116 | Apple Tree | dfs and similar number theory trees | Statement | B | Codeforces Round 202 (Div. 1) {348} | PROGRAMMING | Editorial for Codeforces Round #202 | 2400 | |
| 1771 | Turtles | dp matrices | Statement | D | Codeforces Round 202 (Div. 1) {348} | PROGRAMMING | Editorial for Codeforces Round #202 | 2500 | |
| 2252 | Subset Sums | brute force data structures | Statement | C | Codeforces Round 202 (Div. 1) {348} | PROGRAMMING | Editorial for Codeforces Round #202 | 2600 | |
| 450 | Pilgrims | dfs and similar dp trees | Statement | E | Codeforces Round 202 (Div. 1) {348} | PROGRAMMING | 2800 | ||
| 30744 | Cinema Line | greedy implementation | Statement | A | Codeforces Round 202 (Div. 2) {349} | PROGRAMMING | Editorial for Codeforces Round #202 | 1200 | |
| 14132 | Color the Fence | data structures dp greedy implementation | Statement | B | Codeforces Round 202 (Div. 2) {349} | PROGRAMMING | Editorial for Codeforces Round #202 | 1700 | |
| 16584 | TL | brute force greedy implementation | Statement | A | Codeforces Round 203 (Div. 2) {350} | PROGRAMMING | Editorial Codeforces Round #203 (Div. 2) | 1300 | |
| 3217 | Resort | graphs | Statement | B | Codeforces Round 203 (Div. 2) {350} | PROGRAMMING | 1600 | ||
| 6590 | Bombs | greedy implementation sortings | Statement | C | Codeforces Round 203 (Div. 2) {350} | PROGRAMMING | Editorial Codeforces Round #203 (Div. 2) | 1600 | |
| 792 | 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 | |
| 271 | 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 | |
| 2944 | Jeff and Rounding | dp greedy implementation math | Statement | A | Codeforces Round 204 (Div. 1) {351} | PROGRAMMING | Codeforces Round #204 — tutorial | 1900 | |
| 2418 | Jeff and Furik | combinatorics dp probabilities | Statement | B | Codeforces Round 204 (Div. 1) {351} | PROGRAMMING | 2100 | ||
| 1640 | Jeff and Permutation | greedy | Statement | E | Codeforces Round 204 (Div. 1) {351} | PROGRAMMING | Codeforces Round #204 — tutorial | 2200 | |
| 1133 | Jeff and Removing Periods | data structures | Statement | D | Codeforces Round 204 (Div. 1) {351} | PROGRAMMING | Codeforces Round #204 — tutorial | 2700 | |
| 568 | Jeff and Brackets | dp matrices | Statement | C | Codeforces Round 204 (Div. 1) {351} | PROGRAMMING | Codeforces Round #204 — tutorial | 2800 | |
| 26197 | Jeff and Digits | brute force implementation math | Statement | A | Codeforces Round 204 (Div. 2) {352} | PROGRAMMING | 1100 | ||
| 16784 | Jeff and Periods | implementation sortings | Statement | B | Codeforces Round 204 (Div. 2) {352} | PROGRAMMING | 1300 | ||
| 18807 | Domino | implementation math | Statement | A | Codeforces Round 205 (Div. 2) {353} | PROGRAMMING | Разбор задач Codeforces Round #205 (Div. 2) | 1300 | |
| 4956 | Find Maximum | implementation math number theory | Statement | C | Codeforces Round 205 (Div. 2) {353} | PROGRAMMING | Разбор задач Codeforces Round #205 (Div. 2) | 1600 | |
| 2313 | Two Heaps | combinatorics constructive algorithms greedy implementation math sortings | Statement | B | Codeforces Round 205 (Div. 2) {353} | PROGRAMMING | 1800 | ||
| 2968 | Queue | constructive algorithms dp | Statement | D | Codeforces Round 205 (Div. 2) {353} | PROGRAMMING | 2100 | ||
| 611 | Antichain | dp graph matchings greedy | Statement | E | Codeforces Round 205 (Div. 2) {353} | PROGRAMMING | Разбор задач Codeforces Round #205 (Div. 2) | 2600 | |
| 5500 | Vasya and Robot | brute force greedy math | Statement | A | Codeforces Round 206 (Div. 1) {354} | PROGRAMMING | 1600 | ||
| 3106 | Vasya and Beautiful Arrays | brute force dp number theory | Statement | C | Codeforces Round 206 (Div. 1) {354} | PROGRAMMING | Codeforces Round #206 — Editorial | 2000 | |
| 881 | Lucky Number Representation | constructive algorithms dfs and similar dp | Statement | E | Codeforces Round 206 (Div. 1) {354} | PROGRAMMING | Codeforces Round #206 — Editorial | 2200 | |
| 465 | Game with Strings | bitmasks dp games | Statement | B | Codeforces Round 206 (Div. 1) {354} | PROGRAMMING | 2500 | ||
| 465 | Transferring Pyramid | dp | Statement | D | Codeforces Round 206 (Div. 1) {354} | PROGRAMMING | 2900 | ||
| 9513 | Vasya and Digital Root | constructive algorithms implementation | Statement | A | Codeforces Round 206 (Div. 2) {355} | PROGRAMMING | 1100 | ||
| 4527 | Vasya and Public Transport | greedy implementation | Statement | B | Codeforces Round 206 (Div. 2) {355} | PROGRAMMING | Codeforces Round #206 — Editorial | 1200 | |
| 14024 | Knight Tournament | data structures ds | Statement | A | Codeforces Round 207 (Div. 1) {356} | PROGRAMMING | 1700 | ||
| 1960 | Xenia and Hamming | implementation math | Statement | B | Codeforces Round 207 (Div. 1) {356} | PROGRAMMING | Codeforces Round #207: разбор задач | 2000 | |
| 1278 | Compartments | combinatorics constructive algorithms greedy implementation | Statement | C | Codeforces Round 207 (Div. 1) {356} | PROGRAMMING | Codeforces Round #207: разбор задач | 2200 | |
| 982 | Bags and Coins | bitmasks constructive algorithms dp greedy | Statement | D | Codeforces Round 207 (Div. 1) {356} | PROGRAMMING | 2500 | ||
| 410 | Xenia and String Problem | dp hashing implementation string suffix structures strings | Statement | E | Codeforces Round 207 (Div. 1) {356} | PROGRAMMING | 2800 | ||
| 6914 | Group of Students | brute force greedy implementation | Statement | A | Codeforces Round 207 (Div. 2) {357} | PROGRAMMING | Codeforces Round #207: tutorial | 1200 | |
| 8252 | Flag Day | constructive algorithms implementation | Statement | B | Codeforces Round 207 (Div. 2) {357} | PROGRAMMING | Codeforces Round #207: tutorial | 1400 | |
| 7832 | Dima and Continuous Line | brute force implementation | Statement | A | Codeforces Round 208 (Div. 2) {358} | PROGRAMMING | Codeforces Round #208 (Div. 2) Разбор | 1400 | |
| 3763 | Dima and Text Messages | brute force strings | Statement | B | Codeforces Round 208 (Div. 2) {358} | PROGRAMMING | Codeforces Round #208 (Div. 2) Разбор | 1500 | |
| 4116 | Dima and Hares | dp greedy | Statement | D | Codeforces Round 208 (Div. 2) {358} | PROGRAMMING | Codeforces Round #208 (Div. 2) Разбор | 2000 | |
| 2060 | Dima and Containers | constructive algorithms greedy implementation | Statement | C | Codeforces Round 208 (Div. 2) {358} | PROGRAMMING | Codeforces Round #208 (Div. 2) Разбор | 2000 | |
| 400 | Dima and Kicks | brute force ds graphs implementation | Statement | E | Codeforces Round 208 (Div. 2) {358} | PROGRAMMING | Codeforces Round #208 (Div. 2) Разбор | 2600 | |
| 8609 | Table | constructive algorithms greedy implementation | Statement | A | Codeforces Round 209 (Div. 2) {359} | PROGRAMMING | Editorial Codeforces Round #209 (Div. 2) | 1100 | |
| 8160 | Permutation | constructive algorithms dp math | Statement | B | Codeforces Round 209 (Div. 2) {359} | PROGRAMMING | 1400 | ||
| 3208 | Prime Number | math number theory | Statement | C | Codeforces Round 209 (Div. 2) {359} | PROGRAMMING | Editorial Codeforces Round #209 (Div. 2) | 2000 | |
| 5198 | 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 | |
| 484 | Neatness | constructive algorithms dfs and similar | Statement | E | Codeforces Round 209 (Div. 2) {359} | PROGRAMMING | Editorial Codeforces Round #209 (Div. 2) | 2500 | |
| 2090 | Levko and Array Recovery | greedy implementation | Statement | A | Codeforces Round 210 (Div. 1) {360} | PROGRAMMING | 1800 | ||
| 3060 | Levko and Array | binary search dp | Statement | B | Codeforces Round 210 (Div. 1) {360} | PROGRAMMING | Codeforces Round #210 editorial | 2300 | |
| 409 | Levko and Sets | number theory | Statement | D | Codeforces Round 210 (Div. 1) {360} | PROGRAMMING | Codeforces Round #210 editorial | 2600 | |
| 1124 | Levko and Strings | combinatorics dp | Statement | C | Codeforces Round 210 (Div. 1) {360} | PROGRAMMING | Codeforces Round #210 editorial | 2700 | |
| 720 | Levko and Game | graphs greedy shortest paths | Statement | E | Codeforces Round 210 (Div. 1) {360} | PROGRAMMING | 2800 | ||
| 8161 | Levko and Permutation | constructive algorithms math number theory | Statement | B | Codeforces Round 210 (Div. 2) {361} | PROGRAMMING | Codeforces Round #210 editorial | 1200 | |
| 16953 | Levko and Table | constructive algorithms implementation | Statement | A | Codeforces Round 210 (Div. 2) {361} | PROGRAMMING | Codeforces Round #210 editorial | 800 | |
| 14001 | Petya and Staircases | implementation sortings | Statement | B | Codeforces Round 212 (Div. 2) {362} | PROGRAMMING | Codeforces Round #212 (Div. 2). Tutorial. Part 1. | 1200 | |
| 2715 | Two Semiknights Meet | greedy math | Statement | A | Codeforces Round 212 (Div. 2) {362} | PROGRAMMING | 1500 | ||
| 1822 | 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 |