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 ... 22 23 24 25 26 ... 100 101 102 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 1553 | Demiurges Play Again | dfs and similar dp math trees | Statement | E | Codeforces Round 300 {538} | PROGRAMMING | 2200 | ||
| 1754 | A Heap of Heaps | brute force data structures math sortings | Statement | F | Codeforces Round 300 {538} | PROGRAMMING | 2200 | ||
| 674 | Summer Dichotomy | 2-sat data structures dfs and similar greedy | Statement | H | Codeforces Round 300 {538} | PROGRAMMING | 3100 | ||
| 477 | Berserk Robot | constructive algorithms math sortings | Statement | G | Codeforces Round 300 {538} | PROGRAMMING | 3100 | ||
| 4727 | School Marks | greedy implementation | Statement | B | Codeforces Round 301 (Div. 2) {540} | PROGRAMMING | 1700 | ||
| 7470 | Ice Cave | dfs and similar | Statement | C | Codeforces Round 301 (Div. 2) {540} | PROGRAMMING | 1800 | ||
| 5617 | Bad Luck Island | dp probabilities | Statement | D | Codeforces Round 301 (Div. 2) {540} | PROGRAMMING | Tutorial | 2100 | |
| 2173 | Infinite Inversions | binary search data structures implementation sortings trees | Statement | E | Codeforces Round 301 (Div. 2) {540} | PROGRAMMING | Tutorial | 2400 | |
| 33083 | Combination Lock | implementation | Statement | A | Codeforces Round 301 (Div. 2) {540} | PROGRAMMING | Tutorial | 900 | |
| 1149 | Idempotent functions | constructive algorithms graphs math | Statement | C | VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only) {542} | PROGRAMMING | 17697 | 2000 | |
| 945 | Quest | dp greedy | Statement | F | VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only) {542} | PROGRAMMING | 2100 | ||
| 583 | Place Your Ad Here | data structures sortings | Statement | A | VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only) {542} | PROGRAMMING | 2500 | ||
| 521 | Superhero's Job | dfs and similar dp hashing math number theory | Statement | D | VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only) {542} | PROGRAMMING | 17697 | 2600 | |
| 884 | Playing on Graph | graphs shortest paths | Statement | E | VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only) {542} | PROGRAMMING | 2600 | ||
| 207 | Duck Hunt | data structures | Statement | B | VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only) {542} | PROGRAMMING | 3200 | ||
| 8085 | Writing Code | dp | Statement | A | Codeforces Round 302 (Div. 1) {543} | PROGRAMMING | Editorial Codeforces Round #302 | 1900 | |
| 2823 | Road Improvement | dp trees | Statement | D | Codeforces Round 302 (Div. 1) {543} | PROGRAMMING | Editorial Codeforces Round #302 | 2300 | |
| 4192 | Destroying Roads | constructive algorithms graphs shortest paths | Statement | B | Codeforces Round 302 (Div. 1) {543} | PROGRAMMING | Editorial Codeforces Round #302 | 2300 | |
| 1414 | Remembering Strings | bitmasks dp | Statement | C | Codeforces Round 302 (Div. 1) {543} | PROGRAMMING | Editorial Codeforces Round #302 | 2600 | |
| 303 | Listening to Music | constructive algorithms data structures | Statement | E | Codeforces Round 302 (Div. 1) {543} | PROGRAMMING | 3200 | ||
| 8348 | Set of Strings | implementation strings | Statement | A | Codeforces Round 302 (Div. 2) {544} | PROGRAMMING | Editorial Codeforces Round #302 | 1100 | |
| 8130 | Sea and Islands | constructive algorithms implementation | Statement | B | Codeforces Round 302 (Div. 2) {544} | PROGRAMMING | Editorial Codeforces Round #302 | 1400 | |
| 11695 | Toy Cars | implementation | Statement | A | Codeforces Round 303 (Div. 2) {545} | PROGRAMMING | Codeforces Round #303 (Div.2) editorial | 1000 | |
| 11747 | Equidistant String | greedy | Statement | B | Codeforces Round 303 (Div. 2) {545} | PROGRAMMING | Codeforces Round #303 (Div.2) editorial | 1200 | |
| 25670 | Queue | greedy implementation sortings | Statement | D | Codeforces Round 303 (Div. 2) {545} | PROGRAMMING | Codeforces Round #303 (Div.2) editorial | 1400 | |
| 28763 | Woodcutters | dp greedy | Statement | C | Codeforces Round 303 (Div. 2) {545} | PROGRAMMING | Codeforces Round #303 (Div.2) editorial | 1500 | |
| 4860 | Paths and Trees | graphs greedy shortest paths | Statement | E | Codeforces Round 303 (Div. 2) {545} | PROGRAMMING | 2100 | ||
| 17716 | Soldier and Badges | brute force greedy implementation sortings | Statement | B | Codeforces Round 304 (Div. 2) {546} | PROGRAMMING | Codeforces Round #304 (Div.2) editorial | 1300 | |
| 17871 | Soldier and Cards | brute force dfs and similar games | Statement | C | Codeforces Round 304 (Div. 2) {546} | PROGRAMMING | Codeforces Round #304 (Div.2) editorial | 1400 | |
| 12168 | Soldier and Number Game | constructive algorithms dp math number theory | Statement | D | Codeforces Round 304 (Div. 2) {546} | PROGRAMMING | Codeforces Round #304 (Div.2) editorial | 1700 | |
| 3884 | Soldier and Traveling | flows graphs math | Statement | E | Codeforces Round 304 (Div. 2) {546} | PROGRAMMING | Codeforces Round #304 (Div.2) editorial | 2300 | |
| 192260 | Soldier and Bananas | brute force implementation math | Statement | A | Codeforces Round 304 (Div. 2) {546} | PROGRAMMING | Codeforces Round #304 (Div.2) editorial | 800 | |
| 2612 | Mike and Frog | brute force greedy implementation math | Statement | A | Codeforces Round 305 (Div. 1) {547} | PROGRAMMING | Codeforces Round #305 Editorial | 1900 | |
| 9059 | Mike and Feet | binary search data structures dp ds | Statement | B | Codeforces Round 305 (Div. 1) {547} | PROGRAMMING | Codeforces Round #305 Editorial | 2100 | |
| 2673 | Mike and Fish | constructive algorithms dfs and similar graphs | Statement | D | Codeforces Round 305 (Div. 1) {547} | PROGRAMMING | Codeforces Round #305 Editorial | 2500 | |
| 2953 | Mike and Foam | bitmasks combinatorics dp math number theory | Statement | C | Codeforces Round 305 (Div. 1) {547} | PROGRAMMING | Codeforces Round #305 Editorial | 2700 | |
| 2155 | Mike and Friends | data structures string suffix structures strings trees | Statement | E | Codeforces Round 305 (Div. 1) {547} | PROGRAMMING | Codeforces Round #305 Editorial | 2800 | |
| 10033 | Mike and Fax | brute force implementation strings | Statement | A | Codeforces Round 305 (Div. 2) {548} | PROGRAMMING | Codeforces Round #305 Editorial | 1200 | |
| 8535 | Mike and Fun | brute force dp greedy implementation | Statement | B | Codeforces Round 305 (Div. 2) {548} | PROGRAMMING | Codeforces Round #305 Editorial | 1400 | |
| 9553 | Face Detection | implementation strings | Statement | A | Looksery Cup 2015 {549} | PROGRAMMING | Looksery Cup 2015 Editorial | 1000 | |
| 2152 | Haar Features | greedy implementation | Statement | D | Looksery Cup 2015 {549} | PROGRAMMING | 1800 | ||
| 2007 | Degenerate Matrix | binary search math | Statement | H | Looksery Cup 2015 {549} | PROGRAMMING | Looksery Cup 2015 Editorial | 2100 | |
| 1752 | The Game Of Parity | games | Statement | C | Looksery Cup 2015 {549} | PROGRAMMING | Looksery Cup 2015 Editorial | 2200 | |
| 2480 | Happy Line | constructive algorithms greedy sortings | Statement | G | Looksery Cup 2015 {549} | PROGRAMMING | 2200 | ||
| 1510 | Looksery Party | constructive algorithms dfs and similar graphs greedy | Statement | B | Looksery Cup 2015 {549} | PROGRAMMING | 2300 | ||
| 912 | Yura and Developers | data structures divide and conquer | Statement | F | Looksery Cup 2015 {549} | PROGRAMMING | 2700 | ||
| 157 | Sasha Circle | geometry math | Statement | E | Looksery Cup 2015 {549} | PROGRAMMING | 3200 | ||
| 38886 | Two Substrings | brute force dp greedy implementation strings | Statement | A | Codeforces Round 306 (Div. 2) {550} | PROGRAMMING | Разбор задач Codeforces Round #306 (Div. 2) | 1500 | |
| 22175 | Preparing Olympiad | bitmasks brute force | Statement | B | Codeforces Round 306 (Div. 2) {550} | PROGRAMMING | Разбор задач Codeforces Round #306 (Div. 2) | 1500 | |
| 29310 | Divisibility by Eight | brute force dp math | Statement | C | Codeforces Round 306 (Div. 2) {550} | PROGRAMMING | Разбор задач Codeforces Round #306 (Div. 2) | 1500 | |
| 3510 | Regular Bridge | constructive algorithms graphs implementation | Statement | D | Codeforces Round 306 (Div. 2) {550} | PROGRAMMING | Разбор задач Codeforces Round #306 (Div. 2) | 2000 | |
| 1402 | Brackets in Implications | constructive algorithms greedy implementation math | Statement | E | Codeforces Round 306 (Div. 2) {550} | PROGRAMMING | 2300 | ||
| 16589 | GukiZ and Contest | brute force implementation sortings | Statement | A | Codeforces Round 307 (Div. 2) {551} | PROGRAMMING | Tutorial | 1000 | |
| 3875 | ZgukistringZ | brute force constructive algorithms implementation strings | Statement | B | Codeforces Round 307 (Div. 2) {551} | PROGRAMMING | Tutorial | 1800 | |
| 3647 | GukiZ hates Boxes | binary search greedy | Statement | C | Codeforces Round 307 (Div. 2) {551} | PROGRAMMING | 2200 | ||
| 1990 | GukiZ and Binary Operations | combinatorics implementation math matrices number theory | Statement | D | Codeforces Round 307 (Div. 2) {551} | PROGRAMMING | Tutorial | 2400 | |
| 1900 | GukiZ and GukiZiana | binary search data structures implementation | Statement | E | Codeforces Round 307 (Div. 2) {551} | PROGRAMMING | Tutorial | 2600 | |
| 9679 | Vanya and Table | implementation math | Statement | A | Codeforces Round 308 (Div. 2) {552} | PROGRAMMING | Codeforces #308 (Div. 2) Editorial | 1100 | |
| 15526 | Vanya and Books | implementation math | Statement | B | Codeforces Round 308 (Div. 2) {552} | PROGRAMMING | Codeforces #308 (Div. 2) Editorial | 1300 | |
| 5525 | Vanya and Scales | brute force dp greedy math meet-in-the-middle number theory | Statement | C | Codeforces Round 308 (Div. 2) {552} | PROGRAMMING | Codeforces #308 (Div. 2) Editorial | 1800 | |
| 4527 | Vanya and Triangles | brute force combinatorics data structures geometry math sortings | Statement | D | Codeforces Round 308 (Div. 2) {552} | PROGRAMMING | Codeforces #308 (Div. 2) Editorial | 1900 | |
| 1640 | Vanya and Brackets | brute force dp expression parsing greedy implementation strings | Statement | E | Codeforces Round 308 (Div. 2) {552} | PROGRAMMING | Codeforces #308 (Div. 2) Editorial | 2300 | |
| 8808 | Kyoya and Colored Balls | combinatorics dp math | Statement | A | Codeforces Round 309 (Div. 1) {553} | PROGRAMMING | Codeforces Round #309 Editorial | 1700 | |
| 2143 | Kyoya and Permutation | binary search combinatorics constructive algorithms greedy implementation math | Statement | B | Codeforces Round 309 (Div. 1) {553} | PROGRAMMING | 2200 | ||
| 1016 | Nudist Beach | binary search graphs greedy | Statement | D | Codeforces Round 309 (Div. 1) {553} | PROGRAMMING | 2300 | ||
| 1827 | Love Triangles | dfs and similar ds graphs | Statement | C | Codeforces Round 309 (Div. 1) {553} | PROGRAMMING | 2300 | ||
| 564 | Kyoya and Train | dp fft graphs math probabilities | Statement | E | Codeforces Round 309 (Div. 1) {553} | PROGRAMMING | 3300 | ||
| 10074 | Ohana Cleans Up | brute force greedy strings | Statement | B | Codeforces Round 309 (Div. 2) {554} | PROGRAMMING | Codeforces Round #309 Editorial | 1200 | |
| 13393 | Kyoya and Photobooks | brute force math strings | Statement | A | Codeforces Round 309 (Div. 2) {554} | PROGRAMMING | Codeforces Round #309 Editorial | 900 | |
| 6562 | Case of Matryoshkas | implementation | Statement | A | Codeforces Round 310 (Div. 1) {555} | PROGRAMMING | 1500 | ||
| 3793 | Case of Fugitive | data structures greedy sortings | Statement | B | Codeforces Round 310 (Div. 1) {555} | PROGRAMMING | 2100 | ||
| 1988 | Case of Chocolate | data structures | Statement | C | Codeforces Round 310 (Div. 1) {555} | PROGRAMMING | 2500 | ||
| 882 | Case of a Top Secret | binary search implementation math | Statement | D | Codeforces Round 310 (Div. 1) {555} | PROGRAMMING | 2500 | ||
| 2454 | Case of Computer Network | dfs and similar graphs trees | Statement | E | Codeforces Round 310 (Div. 1) {555} | PROGRAMMING | 2800 | ||
| 40998 | Case of the Zeros and Ones | greedy | Statement | A | Codeforces Round 310 (Div. 2) {556} | PROGRAMMING | Codeforces Round #310 Editorial | 1100 | |
| 7962 | Case of Fake Numbers | brute force implementation | Statement | B | Codeforces Round 310 (Div. 2) {556} | PROGRAMMING | 1100 | ||
| 8290 | Ilya and Diplomas | greedy implementation math | Statement | A | Codeforces Round 311 (Div. 2) {557} | PROGRAMMING | 1200 | ||
| 7224 | Pasha and Tea | constructive algorithms implementation math sortings | Statement | B | Codeforces Round 311 (Div. 2) {557} | PROGRAMMING | Codeforces Round #311 (Div.2) Editorial | 1500 | |
| 4044 | Arthur and Table | brute force data structures dp greedy math sortings | Statement | C | Codeforces Round 311 (Div. 2) {557} | PROGRAMMING | Codeforces Round #311 (Div.2) Editorial | 1900 | |
| 2241 | Vitaly and Cycle | combinatorics dfs and similar graphs math | Statement | D | Codeforces Round 311 (Div. 2) {557} | PROGRAMMING | Codeforces Round #311 (Div.2) Editorial | 2300 | |
| 1098 | Ann and Half-Palindrome | data structures dp graphs string suffix structures strings trees | Statement | E | Codeforces Round 311 (Div. 2) {557} | PROGRAMMING | 2700 | ||
| 10474 | Lala Land and Apple Trees | brute force implementation sortings | Statement | A | Codeforces Round 312 (Div. 2) {558} | PROGRAMMING | 1200 | ||
| 7910 | Amr and The Large Array | implementation | Statement | B | Codeforces Round 312 (Div. 2) {558} | PROGRAMMING | Codeforces Round #312 (Div. 2) Editorial | 1400 | |
| 4009 | Amr and Chemistry | brute force graphs greedy math shortest paths | Statement | C | Codeforces Round 312 (Div. 2) {558} | PROGRAMMING | Codeforces Round #312 (Div. 2) Editorial | 2000 | |
| 1160 | Guess Your Way Out! II | data structures implementation sortings | Statement | D | Codeforces Round 312 (Div. 2) {558} | PROGRAMMING | 2500 | ||
| 6354 | A Simple Task | data structures sortings strings | Statement | E | Codeforces Round 312 (Div. 2) {558} | PROGRAMMING | Codeforces Round #312 (Div. 2) Editorial | 2600 | |
| 10509 | Gerald's Hexagon | brute force geometry math | Statement | A | Codeforces Round 313 (Div. 1) {559} | PROGRAMMING | Codeforces Round 313 — Extended editoral | 1600 | |
| 10771 | Equivalent Strings | divide and conquer hashing sortings strings | Statement | B | Codeforces Round 313 (Div. 1) {559} | PROGRAMMING | Codeforces Round 313 — Extended editoral | 1800 | |
| 6686 | Gerald and Giant Chess | combinatorics dp math number theory | Statement | C | Codeforces Round 313 (Div. 1) {559} | PROGRAMMING | Codeforces Round 313 — Extended editoral | 2500 | |
| 442 | Randomizer | combinatorics geometry probabilities | Statement | D | Codeforces Round 313 (Div. 1) {559} | PROGRAMMING | Codeforces Round 313 — Extended editoral | 2800 | |
| 962 | Gerald and Path | dp sortings | Statement | E | Codeforces Round 313 (Div. 1) {559} | PROGRAMMING | Codeforces Round 313 — Extended editoral | 2900 | |
| 17314 | Currency System in Geraldion | implementation sortings | Statement | A | Codeforces Round 313 (Div. 2) {560} | PROGRAMMING | Codeforces Round 313 — Extended editoral | 1100 | |
| 7988 | Gerald is into Art | constructive algorithms implementation | Statement | B | Codeforces Round 313 (Div. 2) {560} | PROGRAMMING | Codeforces Round 313 — Extended editoral | 1300 | |
| 3735 | Clique in the Divisibility Graph | dp math number theory | Statement | F | VK Cup 2015 - Finals, online mirror {566} | PROGRAMMING | Editorial for VK Cup 2015 — Finals | 1600 | |
| 3365 | Restructuring Company | data structures ds | Statement | D | VK Cup 2015 - Finals, online mirror {566} | PROGRAMMING | Editorial for VK Cup 2015 — Finals | 1900 | |
| 926 | Matching Names | dfs and similar strings trees | Statement | A | VK Cup 2015 - Finals, online mirror {566} | PROGRAMMING | 2300 | ||
| 339 | Max and Min | geometry | Statement | G | VK Cup 2015 - Finals, online mirror {566} | PROGRAMMING | 2500 | ||
| 275 | Replicating Processes | constructive algorithms greedy | Statement | B | VK Cup 2015 - Finals, online mirror {566} | PROGRAMMING | 2600 | ||
| 775 | Logistical Questions | dfs and similar divide and conquer trees | Statement | C | VK Cup 2015 - Finals, online mirror {566} | PROGRAMMING | 3000 | ||
| 640 | Restoring Map | bitmasks constructive algorithms trees | Statement | E | VK Cup 2015 - Finals, online mirror {566} | PROGRAMMING | 3200 |