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 ... 10 11 12 13 14 ... 100 101 102 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 2056 | Not Wool Sequences | constructive algorithms math | Statement | A | Codeforces Round 148 (Div. 1) {238} | PROGRAMMING | Editorial for Codeforces Round #148 | 1700 | |
| 1341 | Boring Partition | constructive algorithms | Statement | B | Codeforces Round 148 (Div. 1) {238} | PROGRAMMING | 2100 | ||
| 1257 | World Eater Brothers | dfs and similar dp greedy trees | Statement | C | Codeforces Round 148 (Div. 1) {238} | PROGRAMMING | Editorial for Codeforces Round #148 | 2200 | |
| 253 | Tape Programming | data structures implementation | Statement | D | Codeforces Round 148 (Div. 1) {238} | PROGRAMMING | Editorial for Codeforces Round #148 | 2700 | |
| 401 | Meeting Her | dp graphs shortest paths | Statement | E | Codeforces Round 148 (Div. 1) {238} | PROGRAMMING | 2700 | ||
| 19224 | Two Bags of Potatoes | greedy implementation math | Statement | A | Codeforces Round 148 (Div. 2) {239} | PROGRAMMING | Editorial for Codeforces Round #148 | 1200 | |
| 1378 | Easy Tape Programming | brute force implementation | Statement | B | Codeforces Round 148 (Div. 2) {239} | PROGRAMMING | Editorial for Codeforces Round #148 | 1500 | |
| 2007 | TorCoder | data structures | Statement | F | Codeforces Round 145 (Div. 1, ACM-ICPC Rules) {240} | PROGRAMMING | 2600 | ||
| 357 | Road Repairs | dfs and similar graphs greedy | Statement | E | Codeforces Round 145 (Div. 1, ACM-ICPC Rules) {240} | PROGRAMMING | 2800 | ||
| 2263 | Old Peykan | greedy | Statement | A | Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements) {241} | PROGRAMMING | 1300 | ||
| 551 | Challenging Balloons | constructive algorithms | Statement | G | Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements) {241} | PROGRAMMING | 1900 | ||
| 513 | Mirror Box | geometry implementation | Statement | C | Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements) {241} | PROGRAMMING | 2000 | ||
| 266 | Race | brute force implementation | Statement | F | Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements) {241} | PROGRAMMING | 2300 | ||
| 1129 | Flights | graphs shortest paths | Statement | E | Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements) {241} | PROGRAMMING | 2600 | ||
| 873 | Friends | binary search bitmasks data structures math | Statement | B | Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements) {241} | PROGRAMMING | 2700 | ||
| 383 | Numbers | Statement | D | Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements) {241} | PROGRAMMING | 2900 | |||
| 6445 | Heads or Tails | brute force implementation | Statement | A | Codeforces Round 149 (Div. 2) {242} | PROGRAMMING | Codeforces Round #149 (Div. 2) Tutorial | 1100 | |
| 16002 | Big Segment | implementation sortings | Statement | B | Codeforces Round 149 (Div. 2) {242} | PROGRAMMING | Codeforces Round #149 (Div. 2) Tutorial | 1100 | |
| 8943 | King's Path | dfs and similar graphs hashing shortest paths | Statement | C | Codeforces Round 149 (Div. 2) {242} | PROGRAMMING | 1800 | ||
| 9779 | XOR on Segment | bitmasks data structures | Statement | E | Codeforces Round 149 (Div. 2) {242} | PROGRAMMING | 2000 | ||
| 1891 | Dispute | dfs and similar graphs greedy | Statement | D | Codeforces Round 149 (Div. 2) {242} | PROGRAMMING | 2100 | ||
| 3992 | The Brand New Function | bitmasks | Statement | A | Codeforces Round 150 (Div. 1) {243} | PROGRAMMING | 1900 | ||
| 1248 | Hydra | graphs sortings | Statement | B | Codeforces Round 150 (Div. 1) {243} | PROGRAMMING | 2100 | ||
| 531 | Colorado Potato Beetle | dfs and similar implementation | Statement | C | Codeforces Round 150 (Div. 1) {243} | PROGRAMMING | 2400 | ||
| 222 | Cubes | data structures dp geometry two pointers | Statement | D | Codeforces Round 150 (Div. 1) {243} | PROGRAMMING | Editorial for Codeforces Round #150 | 2700 | |
| 192 | Matrix | data structures | Statement | E | Codeforces Round 150 (Div. 1) {243} | PROGRAMMING | Editorial for Codeforces Round #150 | 2900 | |
| 8019 | Dividing Orange | implementation | Statement | A | Codeforces Round 150 (Div. 2) {244} | PROGRAMMING | Editorial for Codeforces Round #150 | 1000 | |
| 4548 | Undoubtedly Lucky Numbers | bitmasks brute force dfs and similar | Statement | B | Codeforces Round 150 (Div. 2) {244} | PROGRAMMING | Editorial for Codeforces Round #150 | 1600 | |
| 5273 | Internet Address | implementation strings | Statement | B | CROC-MBTU 2012, Elimination Round (ACM-ICPC) {245} | PROGRAMMING | КРОК-МВТУ 2012, Отборочный раунд (Разбор) | 1100 | |
| 3313 | Mishap in Club | greedy implementation | Statement | E | CROC-MBTU 2012, Elimination Round (ACM-ICPC) {245} | PROGRAMMING | КРОК-МВТУ 2012, Отборочный раунд (Разбор) | 1400 | |
| 2356 | Restoring Table | constructive algorithms greedy | Statement | D | CROC-MBTU 2012, Elimination Round (ACM-ICPC) {245} | PROGRAMMING | 1500 | ||
| 1557 | Game with Coins | greedy | Statement | C | CROC-MBTU 2012, Elimination Round (ACM-ICPC) {245} | PROGRAMMING | КРОК-МВТУ 2012, Отборочный раунд (Разбор) | 1700 | |
| 7047 | Queries for Number of Palindromes | dp hashing strings | Statement | H | CROC-MBTU 2012, Elimination Round (ACM-ICPC) {245} | PROGRAMMING | КРОК-МВТУ 2012, Отборочный раунд (Разбор) | 1900 | |
| 898 | Log Stream Analysis | binary search brute force implementation strings | Statement | F | CROC-MBTU 2012, Elimination Round (ACM-ICPC) {245} | PROGRAMMING | КРОК-МВТУ 2012, Отборочный раунд (Разбор) | 2000 | |
| 464 | Suggested Friends | brute force graphs | Statement | G | CROC-MBTU 2012, Elimination Round (ACM-ICPC) {245} | PROGRAMMING | 2200 | ||
| 8571 | System Administrator | implementation | Statement | A | CROC-MBTU 2012, Elimination Round (ACM-ICPC) {245} | PROGRAMMING | 700 | ||
| 9379 | Buggy Sorting | constructive algorithms greedy sortings | Statement | A | Codeforces Round 151 (Div. 2) {246} | PROGRAMMING | Codeforces Round #151 (Div. 2) Tutorial | 1000 | |
| 11464 | Increase and Decrease | greedy math | Statement | B | Codeforces Round 151 (Div. 2) {246} | PROGRAMMING | Codeforces Round #151 (Div. 2) Tutorial | 1300 | |
| 2661 | Beauty Pageant | brute force constructive algorithms greedy | Statement | C | Codeforces Round 151 (Div. 2) {246} | PROGRAMMING | 1600 | ||
| 9562 | Colorful Graph | brute force dfs and similar graphs | Statement | D | Codeforces Round 151 (Div. 2) {246} | PROGRAMMING | 1700 | ||
| 3492 | Blood Cousins Return | binary search data structures dfs and similar dp sortings | Statement | E | Codeforces Round 151 (Div. 2) {246} | PROGRAMMING | 2300 | ||
| 5402 | Chilly Willy | math number theory | Statement | B | Codeforces Round 152 (Div. 2) {248} | PROGRAMMING | Разбор задач Codeforces Round #152 | 1400 | |
| 857 | Robo-Footballer | binary search geometry | Statement | C | Codeforces Round 152 (Div. 2) {248} | PROGRAMMING | Разбор задач Codeforces Round #152 | 1900 | |
| 503 | Sweets for Everyone! | binary search greedy implementation | Statement | D | Codeforces Round 152 (Div. 2) {248} | PROGRAMMING | Разбор задач Codeforces Round #152 | 2400 | |
| 594 | Piglet's Birthday | dp math probabilities | Statement | E | Codeforces Round 152 (Div. 2) {248} | PROGRAMMING | 2700 | ||
| 22902 | Cupboards | implementation | Statement | A | Codeforces Round 152 (Div. 2) {248} | PROGRAMMING | 900 | ||
| 329 | Endless Matrix | math | Statement | E | Codeforces Round 152 (Div. 1) {249} | PROGRAMMING | 2500 | ||
| 471 | Donkey and Stars | data structures dp geometry math sortings | Statement | D | Codeforces Round 152 (Div. 1) {249} | PROGRAMMING | 2600 | ||
| 4190 | Paper Work | greedy | Statement | A | CROC-MBTU 2012, Final Round (Online version, Div. 2) {250} | PROGRAMMING | 1100 | ||
| 2012 | Restoring IPv6 | implementation strings | Statement | B | CROC-MBTU 2012, Final Round (Online version, Div. 2) {250} | PROGRAMMING | 1500 | ||
| 2036 | Movie Critics | greedy | Statement | C | CROC-MBTU 2012, Final Round (Online version, Div. 2) {250} | PROGRAMMING | 1600 | ||
| 916 | Building Bridge | geometry ternary search two pointers | Statement | D | CROC-MBTU 2012, Final Round (Online version, Div. 2) {250} | PROGRAMMING | 2000 | ||
| 476 | Mad Joe | brute force | Statement | E | CROC-MBTU 2012, Final Round (Online version, Div. 2) {250} | PROGRAMMING | CROC-MBTU 2012, Final Round, Editorial | 2400 | |
| 18201 | Points on Line | binary search combinatorics two pointers | Statement | A | Codeforces Round 153 (Div. 1) {251} | PROGRAMMING | Editorial of Codeforces Round #153 | 1400 | |
| 1282 | Playing with Permutations | implementation math | Statement | B | Codeforces Round 153 (Div. 1) {251} | PROGRAMMING | 1900 | ||
| 483 | Two Sets | bitmasks math | Statement | D | Codeforces Round 153 (Div. 1) {251} | PROGRAMMING | Editorial of Codeforces Round #153 | 2500 | |
| 1052 | Number Transformation | dp greedy number theory | Statement | C | Codeforces Round 153 (Div. 1) {251} | PROGRAMMING | Editorial of Codeforces Round #153 | 2500 | |
| 177 | Tree and Table | dfs and similar dp implementation trees | Statement | E | Codeforces Round 153 (Div. 1) {251} | PROGRAMMING | Editorial of Codeforces Round #153 | 3000 | |
| 5394 | Little Xor | brute force implementation | Statement | A | Codeforces Round 153 (Div. 2) {252} | PROGRAMMING | Editorial of Codeforces Round #153 | 1200 | |
| 1729 | Unsorting Array | brute force sortings | Statement | B | Codeforces Round 153 (Div. 2) {252} | PROGRAMMING | Editorial of Codeforces Round #153 | 1700 | |
| 11372 | Boys and Girls | greedy | Statement | A | Codeforces Round 154 (Div. 2) {253} | PROGRAMMING | Codeforces Round #154 (Div. 2) — tutorial | 1200 | |
| 10954 | Physics Practical | binary search dp sortings two pointers | Statement | B | Codeforces Round 154 (Div. 2) {253} | PROGRAMMING | 1400 | ||
| 2670 | Text Editor | data structures dfs and similar graphs greedy shortest paths | Statement | C | Codeforces Round 154 (Div. 2) {253} | PROGRAMMING | 1600 | ||
| 852 | Table with Letters - 2 | brute force two pointers | Statement | D | Codeforces Round 154 (Div. 2) {253} | PROGRAMMING | 2000 | ||
| 555 | Printer | binary search data structures implementation sortings | Statement | E | Codeforces Round 154 (Div. 2) {253} | PROGRAMMING | 2300 | ||
| 7177 | Cards with Numbers | constructive algorithms sortings | Statement | A | Codeforces Round 155 (Div. 2) {254} | PROGRAMMING | Codeforces Round #155 (Div. 2) — tutorial | 1300 | |
| 2164 | Jury Size | brute force implementation | Statement | B | Codeforces Round 155 (Div. 2) {254} | PROGRAMMING | 1500 | ||
| 1504 | Anagram | greedy strings | Statement | C | Codeforces Round 155 (Div. 2) {254} | PROGRAMMING | 1800 | ||
| 687 | Dormitory | dp implementation | Statement | E | Codeforces Round 155 (Div. 2) {254} | PROGRAMMING | 2400 | ||
| 583 | Rats | brute force dfs and similar graphs implementation shortest paths | Statement | D | Codeforces Round 155 (Div. 2) {254} | PROGRAMMING | 2600 | ||
| 5032 | Code Parsing | implementation | Statement | B | Codeforces Round 156 (Div. 2) {255} | PROGRAMMING | Codeforces Round #156 tutorial | 1200 | |
| 4761 | Almost Arithmetical Progression | brute force dp | Statement | C | Codeforces Round 156 (Div. 2) {255} | PROGRAMMING | Codeforces Round #156 tutorial | 1700 | |
| 2030 | Mr. Bender and Square | binary search implementation math | Statement | D | Codeforces Round 156 (Div. 2) {255} | PROGRAMMING | Codeforces Round #156 tutorial | 1900 | |
| 878 | Furlo and Rublo and Game | games implementation math | Statement | E | Codeforces Round 156 (Div. 2) {255} | PROGRAMMING | Codeforces Round #156 tutorial | 2200 | |
| 29217 | Greg's Workout | implementation | Statement | A | Codeforces Round 156 (Div. 2) {255} | PROGRAMMING | Codeforces Round #156 tutorial | 800 | |
| 672 | Lucky Arrays | data structures | Statement | E | Codeforces Round 156 (Div. 1) {256} | PROGRAMMING | 2400 | ||
| 258 | Liars and Serge | dp | Statement | D | Codeforces Round 156 (Div. 1) {256} | PROGRAMMING | qwer | 2700 | |
| 6563 | Sockets | greedy implementation sortings | Statement | A | Codeforces Round 159 (Div. 2) {257} | PROGRAMMING | 1200 | ||
| 7271 | Playing Cubes | games greedy implementation | Statement | B | Codeforces Round 159 (Div. 2) {257} | PROGRAMMING | Codeforces Round #159 (Div. 2) Разбор Задач | 1400 | |
| 4436 | View Angle | brute force geometry math | Statement | C | Codeforces Round 159 (Div. 2) {257} | PROGRAMMING | Codeforces Round #159 (Div. 2) Разбор Задач | 1700 | |
| 1638 | Sum | greedy math | Statement | D | Codeforces Round 159 (Div. 2) {257} | PROGRAMMING | Codeforces Round #159 (Div. 2) Разбор Задач | 1900 | |
| 302 | Greedy Elevator | data structures implementation | Statement | E | Codeforces Round 159 (Div. 2) {257} | PROGRAMMING | 2500 | ||
| 23496 | Little Elephant and Bits | greedy math | Statement | A | Codeforces Round 157 (Div. 1) {258} | PROGRAMMING | Codeforces Round #157 — Editorial | 1200 | |
| 1454 | Little Elephant and Elections | brute force combinatorics dp | Statement | B | Codeforces Round 157 (Div. 1) {258} | PROGRAMMING | Codeforces Round #157 — Editorial | 2100 | |
| 1147 | Little Elephant and Tree | data structures dfs and similar trees | Statement | E | Codeforces Round 157 (Div. 1) {258} | PROGRAMMING | Codeforces Round #157 — Editorial | 2400 | |
| 1807 | Little Elephant and LCM | binary search combinatorics dp math | Statement | C | Codeforces Round 157 (Div. 1) {258} | PROGRAMMING | Codeforces Round #157 — Editorial | 2400 | |
| 1301 | Little Elephant and Broken Sorting | dp math probabilities | Statement | D | Codeforces Round 157 (Div. 1) {258} | PROGRAMMING | 2600 | ||
| 14112 | Little Elephant and Magic Square | brute force implementation | Statement | B | Codeforces Round 157 (Div. 2) {259} | PROGRAMMING | Codeforces Round #157 — Editorial | 1100 | |
| 9248 | Little Elephant and Chess | brute force strings | Statement | A | Codeforces Round 157 (Div. 2) {259} | PROGRAMMING | 1100 | ||
| 15128 | Adding Digits | implementation math | Statement | A | Codeforces Round 158 (Div. 2) {260} | PROGRAMMING | Codeforces Round #158 (Div. 2) Tutorial | 1400 | |
| 3846 | Ancient Prophesy | brute force implementation strings | Statement | B | Codeforces Round 158 (Div. 2) {260} | PROGRAMMING | Codeforces Round #158 (Div. 2) Tutorial | 1600 | |
| 3000 | Balls and Boxes | constructive algorithms greedy implementation | Statement | C | Codeforces Round 158 (Div. 2) {260} | PROGRAMMING | 1700 | ||
| 1568 | Black and White Tree | constructive algorithms ds graphs greedy trees | Statement | D | Codeforces Round 158 (Div. 2) {260} | PROGRAMMING | 2200 | ||
| 465 | Dividing Kingdom | binary search brute force data structures | Statement | E | Codeforces Round 158 (Div. 2) {260} | PROGRAMMING | 2600 | ||
| 5276 | Maxim and Discounts | greedy sortings | Statement | A | Codeforces Round 160 (Div. 1) {261} | PROGRAMMING | 1400 | ||
| 1426 | Maxim and Restaurant | dp math probabilities | Statement | B | Codeforces Round 160 (Div. 1) {261} | PROGRAMMING | 2100 | ||
| 781 | Maxim and Matrix | constructive algorithms dp math | Statement | C | Codeforces Round 160 (Div. 1) {261} | PROGRAMMING | Codeforces Round #160 tutorial | 2300 | |
| 585 | Maxim and Increasing Subsequence | dp | Statement | D | Codeforces Round 160 (Div. 1) {261} | PROGRAMMING | 2500 | ||
| 418 | Maxim and Calculator | brute force dp two pointers | Statement | E | Codeforces Round 160 (Div. 1) {261} | PROGRAMMING | Codeforces Round #160 tutorial | 2800 | |
| 11538 | Roma and Changing Signs | greedy | Statement | B | Codeforces Round 160 (Div. 2) {262} | PROGRAMMING | Codeforces Round #160 tutorial | 1300 |