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 ... 12 13 14 15 16 ... 100 101 102 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 6532 | Polo the Penguin and Strings | greedy | Statement | A | Codeforces Round 177 (Div. 1) {288} | PROGRAMMING | Codeforces Round #177, editorial | 1300 | |
| 2959 | Polo the Penguin and Houses | combinatorics | Statement | B | Codeforces Round 177 (Div. 1) {288} | PROGRAMMING | Codeforces Round #177, editorial | 1700 | |
| 2348 | Polo the Penguin and XOR operation | implementation math | Statement | C | Codeforces Round 177 (Div. 1) {288} | PROGRAMMING | Codeforces Round #177, editorial | 1900 | |
| 761 | Polo the Penguin and Trees | combinatorics dfs and similar trees | Statement | D | Codeforces Round 177 (Div. 1) {288} | PROGRAMMING | Codeforces Round #177, editorial | 2300 | |
| 301 | Polo the Penguin and Lucky Numbers | dp implementation math | Statement | E | Codeforces Round 177 (Div. 1) {288} | PROGRAMMING | Codeforces Round #177, editorial | 2800 | |
| 9457 | Polo the Penguin and Segments | brute force implementation | Statement | A | Codeforces Round 177 (Div. 2) {289} | PROGRAMMING | Codeforces Round #177, editorial | 1100 | |
| 17641 | Polo the Penguin and Matrix | brute force dp implementation sortings ternary search | Statement | B | Codeforces Round 177 (Div. 2) {289} | PROGRAMMING | Codeforces Round #177, editorial | 1400 | |
| 3016 | Mysterious strings | *special implementation | Statement | A | April Fools Day Contest 2013 {290} | PROGRAMMING | April Fools Day Contest 2013: editorial | 1400 | |
| 2458 | QR code | *special implementation | Statement | B | April Fools Day Contest 2013 {290} | PROGRAMMING | April Fools Day Contest 2013: editorial | 1500 | |
| 1818 | Orange | *special implementation | Statement | D | April Fools Day Contest 2013 {290} | PROGRAMMING | April Fools Day Contest 2013: editorial | 1600 | |
| 1555 | WTF? | *special graph matchings implementation trees | Statement | C | April Fools Day Contest 2013 {290} | PROGRAMMING | April Fools Day Contest 2013: editorial | 1800 | |
| 206 | HQ | *special constructive algorithms | Statement | E | April Fools Day Contest 2013 {290} | PROGRAMMING | April Fools Day Contest 2013: editorial | 2700 | |
| 134 | Greedy Petya | *special dfs and similar graphs greedy | Statement | F | April Fools Day Contest 2013 {290} | PROGRAMMING | April Fools Day Contest 2013: editorial | 2800 | |
| 6171 | Spyke Talks | *special implementation sortings | Statement | A | Croc Champ 2013 - Qualification Round {291} | PROGRAMMING | 1900 | ||
| 3038 | Command Line Arguments | *special implementation strings | Statement | B | Croc Champ 2013 - Qualification Round {291} | PROGRAMMING | 2000 | ||
| 1689 | Network Mask | *special bitmasks brute force implementation | Statement | C | Croc Champ 2013 - Qualification Round {291} | PROGRAMMING | 2100 | ||
| 1486 | Parallel Programming | *special greedy | Statement | D | Croc Champ 2013 - Qualification Round {291} | PROGRAMMING | 2200 | ||
| 1329 | Tree-String Problem | *special dfs and similar hashing strings | Statement | E | Croc Champ 2013 - Qualification Round {291} | PROGRAMMING | 2400 | ||
| 2722 | SMSC | implementation | Statement | A | Croc Champ 2013 - Round 1 {292} | PROGRAMMING | 1100 | ||
| 8681 | Network Topology | graphs implementation | Statement | B | Croc Champ 2013 - Round 1 {292} | PROGRAMMING | 1200 | ||
| 4261 | Copying Data | data structures | Statement | E | Croc Champ 2013 - Round 1 {292} | PROGRAMMING | 1900 | ||
| 2466 | Connected Components | data structures dfs and similar dp ds | Statement | D | Croc Champ 2013 - Round 1 {292} | PROGRAMMING | 1900 | ||
| 1176 | Beautiful IP Addresses | brute force | Statement | C | Croc Champ 2013 - Round 1 {292} | PROGRAMMING | Чемпионат КРОК 2013 — Раунд 1 (Разбор задач) | 2000 | |
| 2938 | Weird Game | games greedy | Statement | A | Croc Champ 2013 - Round 2 {293} | PROGRAMMING | Croc Champ 2013 — Round 2 — Editorial | 1500 | |
| 581 | Cube Problem | brute force math number theory | Statement | C | Croc Champ 2013 - Round 2 {293} | PROGRAMMING | 2300 | ||
| 884 | Distinct Paths | brute force combinatorics | Statement | B | Croc Champ 2013 - Round 2 {293} | PROGRAMMING | Croc Champ 2013 — Round 2 — Editorial | 2600 | |
| 240 | Ksusha and Square | geometry math probabilities two pointers | Statement | D | Croc Champ 2013 - Round 2 {293} | PROGRAMMING | Croc Champ 2013 — Round 2 — Editorial | 2700 | |
| 1490 | Close Vertices | data structures divide and conquer trees | Statement | E | Croc Champ 2013 - Round 2 {293} | PROGRAMMING | Croc Champ 2013 — Round 2 — Editorial | 2700 | |
| 4600 | Shaass and Bookshelf | dp greedy | Statement | B | Codeforces Round 178 (Div. 2) {294} | PROGRAMMING | Codeforces Round #178 Editorial | 1700 | |
| 3875 | Shaass and Lights | combinatorics number theory | Statement | C | Codeforces Round 178 (Div. 2) {294} | PROGRAMMING | Codeforces Round #178 Editorial | 1900 | |
| 984 | Shaass the Great | dp trees | Statement | E | Codeforces Round 178 (Div. 2) {294} | PROGRAMMING | Codeforces Round #178 Editorial | 2700 | |
| 364 | Shaass and Painter Robot | brute force implementation number theory | Statement | D | Codeforces Round 178 (Div. 2) {294} | PROGRAMMING | 2700 | ||
| 24110 | Shaass and Oskols | implementation math | Statement | A | Codeforces Round 178 (Div. 2) {294} | PROGRAMMING | Codeforces Round #178 Editorial | 900 | |
| 18960 | Greg and Array | data structures implementation | Statement | A | Codeforces Round 179 (Div. 1) {295} | PROGRAMMING | 1500 | ||
| 14773 | Greg and Graph | dp graphs shortest paths | Statement | B | Codeforces Round 179 (Div. 1) {295} | PROGRAMMING | Codeforces Round #179 tutorial | 1900 | |
| 670 | Greg and Caves | combinatorics dp | Statement | D | Codeforces Round 179 (Div. 1) {295} | PROGRAMMING | Codeforces Round #179 tutorial | 2400 | |
| 701 | Yaroslav and Points | data structures | Statement | E | Codeforces Round 179 (Div. 1) {295} | PROGRAMMING | Codeforces Round #179 tutorial | 2500 | |
| 1773 | Greg and Friends | combinatorics dp graphs shortest paths | Statement | C | Codeforces Round 179 (Div. 1) {295} | PROGRAMMING | 2500 | ||
| 23694 | Yaroslav and Permutations | greedy math | Statement | A | Codeforces Round 179 (Div. 2) {296} | PROGRAMMING | Codeforces Round #179 tutorial | 1100 | |
| 2332 | Yaroslav and Two Strings | combinatorics dp | Statement | B | Codeforces Round 179 (Div. 2) {296} | PROGRAMMING | Codeforces Round #179 tutorial | 2000 | |
| 3668 | Parity Game | constructive algorithms | Statement | A | Codeforces Round 180 (Div. 1) {297} | PROGRAMMING | Tutorial for E | 1700 | |
| 3557 | Fish Weight | constructive algorithms greedy | Statement | B | Codeforces Round 180 (Div. 1) {297} | PROGRAMMING | 1700 | ||
| 591 | Color the Carpet | constructive algorithms | Statement | D | Codeforces Round 180 (Div. 1) {297} | PROGRAMMING | 2400 | ||
| 970 | Splitting the Uniqueness | constructive algorithms | Statement | C | Codeforces Round 180 (Div. 1) {297} | PROGRAMMING | 2700 | ||
| 384 | Mystic Carvings | data structures | Statement | E | Codeforces Round 180 (Div. 1) {297} | PROGRAMMING | 3000 | ||
| 11062 | Snow Footprints | greedy implementation | Statement | A | Codeforces Round 180 (Div. 2) {298} | PROGRAMMING | Codeforces Round #180 Editorial | 1300 | |
| 14449 | Sail | brute force greedy implementation | Statement | B | Codeforces Round 180 (Div. 2) {298} | PROGRAMMING | Codeforces Round #180 Editorial | 1300 | |
| 5527 | Ksusha the Squirrel | brute force implementation | Statement | B | Croc Champ 2013 - Round 2 (Div. 2 Edition) {299} | PROGRAMMING | Croc Champ 2013 — Round 2 — Editorial | 1000 | |
| 8308 | Ksusha and Array | brute force number theory sortings | Statement | A | Croc Champ 2013 - Round 2 (Div. 2 Edition) {299} | PROGRAMMING | Croc Champ 2013 — Round 2 — Editorial | 1000 | |
| 23428 | Array | brute force constructive algorithms implementation | Statement | A | Codeforces Round 181 (Div. 2) {300} | PROGRAMMING | English Tutorial | 1200 | |
| 6430 | Coach | brute force dfs and similar graphs | Statement | B | Codeforces Round 181 (Div. 2) {300} | PROGRAMMING | English Tutorial | 1500 | |
| 9880 | Beautiful Numbers | brute force combinatorics | Statement | C | Codeforces Round 181 (Div. 2) {300} | PROGRAMMING | English Tutorial | 1800 | |
| 1050 | Empire Strikes Back | binary search math number theory | Statement | E | Codeforces Round 181 (Div. 2) {300} | PROGRAMMING | English Tutorial | 2400 | |
| 760 | Painting Square | dp fft | Statement | D | Codeforces Round 181 (Div. 2) {300} | PROGRAMMING | English Tutorial | 2700 | |
| 3100 | Yaroslav and Sequence | constructive algorithms | Statement | A | Codeforces Round 182 (Div. 1) {301} | PROGRAMMING | Codeforces Round #182 tutorial | 1800 | |
| 2418 | Yaroslav and Time | binary search graphs shortest paths | Statement | B | Codeforces Round 182 (Div. 1) {301} | PROGRAMMING | 2000 | ||
| 2498 | Yaroslav and Divisors | data structures | Statement | D | Codeforces Round 182 (Div. 1) {301} | PROGRAMMING | Codeforces Round #182 tutorial | 2200 | |
| 475 | Yaroslav and Algorithm | constructive algorithms | Statement | C | Codeforces Round 182 (Div. 1) {301} | PROGRAMMING | Codeforces Round #182 tutorial | 2700 | |
| 366 | Yaroslav and Arrangements | dp | Statement | E | Codeforces Round 182 (Div. 1) {301} | PROGRAMMING | Codeforces Round #182 tutorial | 2900 | |
| 9189 | Eugeny and Array | implementation | Statement | A | Codeforces Round 182 (Div. 2) {302} | PROGRAMMING | Codeforces Round #182 tutorial | 1100 | |
| 8355 | Eugeny and Play List | binary search implementation two pointers | Statement | B | Codeforces Round 182 (Div. 2) {302} | PROGRAMMING | Codeforces Round #182 tutorial | 1200 | |
| 8035 | Lucky Permutation Triple | constructive algorithms implementation math | Statement | A | Codeforces Round 183 (Div. 1) {303} | PROGRAMMING | Codeforces Round #183 Editorial | 1400 | |
| 1348 | Rectangle Puzzle II | implementation math | Statement | B | Codeforces Round 183 (Div. 1) {303} | PROGRAMMING | 1900 | ||
| 302 | Rotatable Number | math number theory | Statement | D | Codeforces Round 183 (Div. 1) {303} | PROGRAMMING | Codeforces Round #183 Editorial | 2500 | |
| 898 | Minimum Modular | brute force graphs math number theory | Statement | C | Codeforces Round 183 (Div. 1) {303} | PROGRAMMING | Codeforces Round #183 Editorial | 2700 | |
| 327 | Random Ranking | dp math probabilities | Statement | E | Codeforces Round 183 (Div. 1) {303} | PROGRAMMING | Codeforces Round #183 Editorial | 2800 | |
| 10921 | Pythagorean Theorem II | brute force math | Statement | A | Codeforces Round 183 (Div. 2) {304} | PROGRAMMING | Codeforces Round #183 Editorial | 1300 | |
| 3004 | Calendar | brute force implementation | Statement | B | Codeforces Round 183 (Div. 2) {304} | PROGRAMMING | Codeforces Round #183 Editorial | 1400 | |
| 4892 | Strange Addition | brute force constructive algorithms implementation | Statement | A | Codeforces Round 184 (Div. 2) {305} | PROGRAMMING | 7712 | 1600 | |
| 2480 | Ivan and Powers of Two | greedy implementation | Statement | C | Codeforces Round 184 (Div. 2) {305} | PROGRAMMING | 7712 | 1600 | |
| 2161 | Continued Fractions | brute force implementation math | Statement | B | Codeforces Round 184 (Div. 2) {305} | PROGRAMMING | 7712 | 1600 | |
| 650 | Playing with String | games | Statement | E | Codeforces Round 184 (Div. 2) {305} | PROGRAMMING | 7712 | 2500 | |
| 516 | Olya and Graph | combinatorics math | Statement | D | Codeforces Round 184 (Div. 2) {305} | PROGRAMMING | 2600 | ||
| 7175 | Candies | implementation | Statement | A | Testing Round 6 {306} | PROGRAMMING | 1000 | ||
| 453 | Optimizer | data structures greedy sortings | Statement | B | Testing Round 6 {306} | PROGRAMMING | 2000 | ||
| 501 | White, Black and White Again | combinatorics number theory | Statement | C | Testing Round 6 {306} | PROGRAMMING | 2200 | ||
| 296 | Polygon | constructive algorithms geometry | Statement | D | Testing Round 6 {306} | PROGRAMMING | 2300 | ||
| 1377 | Memory for Arrays | binary search bitmasks greedy | Statement | C | Croc Champ 2013 - Finals (online version, Div. 1) {309} | PROGRAMMING | Чемпионат КРОК 2013 — Финальный раунд — Разбор | 1900 | |
| 493 | Morning run | binary search math two pointers | Statement | A | Croc Champ 2013 - Finals (online version, Div. 1) {309} | PROGRAMMING | 2000 | ||
| 735 | Context Advertising | dp two pointers | Statement | B | Croc Champ 2013 - Finals (online version, Div. 1) {309} | PROGRAMMING | 2100 | ||
| 176 | Tennis Rackets | brute force geometry | Statement | D | Croc Champ 2013 - Finals (online version, Div. 1) {309} | PROGRAMMING | Чемпионат КРОК 2013 — Финальный раунд — Разбор | 2600 | |
| 233 | Sheep | binary search greedy | Statement | E | Croc Champ 2013 - Finals (online version, Div. 1) {309} | PROGRAMMING | 2900 | ||
| 4081 | The Closest Pair | constructive algorithms implementation | Statement | A | Codeforces Round 185 (Div. 1) {311} | PROGRAMMING | Codeforces Round #185 Editorial (Div.2 B&Div.1 E) | 1400 | |
| 3590 | Cats Transport | data structures dp | Statement | B | Codeforces Round 185 (Div. 1) {311} | PROGRAMMING | 2400 | ||
| 677 | Interval Cubing | data structures math | Statement | D | Codeforces Round 185 (Div. 1) {311} | PROGRAMMING | Codeforces Round #185 Editorial (Div.2 B&Div.1 E) | 2500 | |
| 491 | Fetch the Treasure | brute force data structures graphs shortest paths | Statement | C | Codeforces Round 185 (Div. 1) {311} | PROGRAMMING | 2600 | ||
| 1258 | Biologist | flows | Statement | E | Codeforces Round 185 (Div. 1) {311} | PROGRAMMING | 2900 | ||
| 5030 | Whose sentence is it? | implementation strings | Statement | A | Codeforces Round 185 (Div. 2) {312} | PROGRAMMING | Codeforces Round #185 Editorial | 1300 | |
| 11884 | Archer | math probabilities | Statement | B | Codeforces Round 185 (Div. 2) {312} | PROGRAMMING | Codeforces Round #185 Editorial | 1300 | |
| 45834 | Ilya and Queries | dp implementation | Statement | B | Codeforces Round 186 (Div. 2) {313} | PROGRAMMING | Tutorial | 1200 | |
| 5681 | Ilya and Matrix | constructive algorithms greedy implementation sortings | Statement | C | Codeforces Round 186 (Div. 2) {313} | PROGRAMMING | Tutorial | 1400 | |
| 1496 | Ilya and Roads | dp | Statement | D | Codeforces Round 186 (Div. 2) {313} | PROGRAMMING | Tutorial | 2100 | |
| 558 | Ilya and Two Numbers | constructive algorithms data structures ds greedy | Statement | E | Codeforces Round 186 (Div. 2) {313} | PROGRAMMING | Tutorial | 2300 | |
| 57931 | Ilya and Bank Account | implementation number theory | Statement | A | Codeforces Round 186 (Div. 2) {313} | PROGRAMMING | Tutorial | 900 | |
| 2087 | Sereja and Contest | implementation | Statement | A | Codeforces Round 187 (Div. 1) {314} | PROGRAMMING | 1700 | ||
| 1530 | Sereja and Periods | binary search dfs and similar strings | Statement | B | Codeforces Round 187 (Div. 1) {314} | PROGRAMMING | Codeforces Round #187 tutorial | 2000 | |
| 1848 | Sereja and Subsequences | data structures dp | Statement | C | Codeforces Round 187 (Div. 1) {314} | PROGRAMMING | Codeforces Round #187 tutorial | 2300 | |
| 533 | Sereja and Straight Lines | binary search data structures geometry sortings two pointers | Statement | D | Codeforces Round 187 (Div. 1) {314} | PROGRAMMING | Codeforces Round #187 tutorial | 2400 | |
| 373 | Sereja and Squares | dp | Statement | E | Codeforces Round 187 (Div. 1) {314} | PROGRAMMING | Codeforces Round #187 tutorial | 2900 | |
| 7071 | Sereja and Array | implementation | Statement | B | Codeforces Round 187 (Div. 2) {315} | PROGRAMMING | Codeforces Round #187 tutorial | 1200 |