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 ... 8 9 10 11 12 ... 100 101 102 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 69208 | Cut Ribbon | brute force dp | Statement | A | Codeforces Round 119 (Div. 2) {189} | PROGRAMMING | Codeforces Round #119 — Editorial | 1300 | |
| 3976 | Counting Rhombi | brute force math | Statement | B | Codeforces Round 119 (Div. 2) {189} | PROGRAMMING | Codeforces Round #119 — Editorial | 1400 | |
| 5919 | Vasya and the Bus | greedy math | Statement | A | Codeforces Round 120 (Div. 2) {190} | PROGRAMMING | Codeforces Round #120 (Div.2) — editorial | 1300 | |
| 2885 | Surrounded | geometry | Statement | B | Codeforces Round 120 (Div. 2) {190} | PROGRAMMING | 1600 | ||
| 2911 | STL | dfs and similar | Statement | C | Codeforces Round 120 (Div. 2) {190} | PROGRAMMING | 1700 | ||
| 2368 | Non-Secret Cypher | two pointers | Statement | D | Codeforces Round 120 (Div. 2) {190} | PROGRAMMING | 1900 | ||
| 1572 | Counter Attack | data structures ds graphs hashing sortings | Statement | E | Codeforces Round 120 (Div. 2) {190} | PROGRAMMING | 2300 | ||
| 4094 | Dynasty Puzzles | dp | Statement | A | Codeforces Round 121 (Div. 1) {191} | PROGRAMMING | 1600 | ||
| 1016 | Demonstration | greedy | Statement | B | Codeforces Round 121 (Div. 1) {191} | PROGRAMMING | 1800 | ||
| 7445 | Fools and Roads | data structures dfs and similar trees | Statement | C | Codeforces Round 121 (Div. 1) {191} | PROGRAMMING | 2100 | ||
| 868 | Thwarting Demonstrations | binary search data structures trees | Statement | E | Codeforces Round 121 (Div. 1) {191} | PROGRAMMING | Разбор Codeforces Round #121 | 2200 | |
| 365 | Metro Scheme | graphs greedy | Statement | D | Codeforces Round 121 (Div. 1) {191} | PROGRAMMING | 2800 | ||
| 6340 | Walking in the Rain | brute force implementation | Statement | B | Codeforces Round 121 (Div. 2) {192} | PROGRAMMING | 1100 | ||
| 10519 | Funky Numbers | binary search brute force implementation | Statement | A | Codeforces Round 121 (Div. 2) {192} | PROGRAMMING | tutorial | 1300 | |
| 4071 | Cutting Figure | constructive algorithms graphs trees | Statement | A | Codeforces Round 122 (Div. 1) {193} | PROGRAMMING | Editoral Codeforces Round #122 | 1700 | |
| 1021 | Xor | brute force | Statement | B | Codeforces Round 122 (Div. 1) {193} | PROGRAMMING | Editoral Codeforces Round #122 | 2100 | |
| 517 | Hamming Distance | constructive algorithms greedy math matrices | Statement | C | Codeforces Round 122 (Div. 1) {193} | PROGRAMMING | 2400 | ||
| 563 | Two Segments | data structures | Statement | D | Codeforces Round 122 (Div. 1) {193} | PROGRAMMING | 2800 | ||
| 345 | Fibonacci Number | brute force math matrices | Statement | E | Codeforces Round 122 (Div. 1) {193} | PROGRAMMING | Editoral Codeforces Round #122 | 2900 | |
| 10022 | Exams | implementation math | Statement | A | Codeforces Round 122 (Div. 2) {194} | PROGRAMMING | Editoral Codeforces Round #122 | 1000 | |
| 3594 | Square | math | Statement | B | Codeforces Round 122 (Div. 2) {194} | PROGRAMMING | Editoral Codeforces Round #122 | 1300 | |
| 9184 | Let's Watch Football | binary search brute force math | Statement | A | Codeforces Round 123 (Div. 2) {195} | PROGRAMMING | 1100 | ||
| 5232 | After Training | data structures implementation math | Statement | B | Codeforces Round 123 (Div. 2) {195} | PROGRAMMING | Codeforces Round #123 (Div. 2) Разбор Задач | 1300 | |
| 1150 | Try and Catch | expression parsing implementation | Statement | C | Codeforces Round 123 (Div. 2) {195} | PROGRAMMING | 1700 | ||
| 1049 | Analyzing Polyline | geometry math sortings | Statement | D | Codeforces Round 123 (Div. 2) {195} | PROGRAMMING | Codeforces Round #123 (Div. 2) Разбор Задач | 1900 | |
| 736 | Building Forest | data structures ds graphs | Statement | E | Codeforces Round 123 (Div. 2) {195} | PROGRAMMING | 2200 | ||
| 5467 | Lexicographically Maximum Subsequence | greedy strings | Statement | A | Codeforces Round 124 (Div. 1) {196} | PROGRAMMING | Разбор задач | 1200 | |
| 2244 | Infinite Maze | dfs and similar graphs | Statement | B | Codeforces Round 124 (Div. 1) {196} | PROGRAMMING | Разбор задач | 1900 | |
| 971 | Paint Tree | constructive algorithms divide and conquer geometry sortings trees | Statement | C | Codeforces Round 124 (Div. 1) {196} | PROGRAMMING | Разбор задач | 2400 | |
| 1044 | Opening Portals | ds graphs shortest paths | Statement | E | Codeforces Round 124 (Div. 1) {196} | PROGRAMMING | 2500 | ||
| 543 | The Next Good String | data structures greedy hashing strings | Statement | D | Codeforces Round 124 (Div. 1) {196} | PROGRAMMING | 2600 | ||
| 4677 | Limit | math | Statement | B | Codeforces Round 124 (Div. 2) {197} | PROGRAMMING | Разбор задач | 1400 | |
| 6445 | Plate Game | constructive algorithms games math | Statement | A | Codeforces Round 124 (Div. 2) {197} | PROGRAMMING | Разбор задач | 1600 | |
| 4428 | Jumping on Walls | shortest paths | Statement | B | Codeforces Round 125 (Div. 1) {198} | PROGRAMMING | 1700 | ||
| 3173 | About Bacteria | implementation math | Statement | A | Codeforces Round 125 (Div. 1) {198} | PROGRAMMING | Solutions for Codeforces Round #125 | 1700 | |
| 451 | Gripping Story | binary search data structures sortings | Statement | E | Codeforces Round 125 (Div. 1) {198} | PROGRAMMING | 2400 | ||
| 379 | Delivering Carcinogen | binary search geometry | Statement | C | Codeforces Round 125 (Div. 1) {198} | PROGRAMMING | 2500 | ||
| 107 | Cube Snake | constructive algorithms | Statement | D | Codeforces Round 125 (Div. 1) {198} | PROGRAMMING | Solutions for Codeforces Round #125 | 2700 | |
| 27197 | Hexadecimal's theorem | brute force constructive algorithms implementation number theory | Statement | A | Codeforces Round 125 (Div. 2) {199} | PROGRAMMING | Solutions for Codeforces Round #125 | 1000 | |
| 808 | Special Olympics | geometry | Statement | B | Codeforces Round 125 (Div. 2) {199} | PROGRAMMING | 1900 | ||
| 1064 | Football Championship | brute force implementation | Statement | C | Codeforces Round 126 (Div. 2) {200} | PROGRAMMING | 1700 | ||
| 920 | Programming Language | binary search brute force expression parsing implementation | Statement | D | Codeforces Round 126 (Div. 2) {200} | PROGRAMMING | 1800 | ||
| 345 | Tractor College | implementation math number theory ternary search | Statement | E | Codeforces Round 126 (Div. 2) {200} | PROGRAMMING | Editorial of Codeforces Round #126 (Div. 2) | 2200 | |
| 695 | Cinema | brute force data structures | Statement | A | Codeforces Round 126 (Div. 2) {200} | PROGRAMMING | 2600 | ||
| 122036 | Drinks | implementation math | Statement | B | Codeforces Round 126 (Div. 2) {200} | PROGRAMMING | Editorial of Codeforces Round #126 (Div. 2) | 700 | |
| 3027 | Clear Symmetry | constructive algorithms dp math | Statement | A | Codeforces Round 127 (Div. 1) {201} | PROGRAMMING | Разбор задач | 1700 | |
| 1308 | Guess That Car! | math ternary search | Statement | B | Codeforces Round 127 (Div. 1) {201} | PROGRAMMING | 2000 | ||
| 1386 | Fragile Bridges | dp | Statement | C | Codeforces Round 127 (Div. 1) {201} | PROGRAMMING | 2200 | ||
| 419 | Brand New Problem | bitmasks brute force dp | Statement | D | Codeforces Round 127 (Div. 1) {201} | PROGRAMMING | 2500 | ||
| 429 | Thoroughly Bureaucratic Organization | binary search combinatorics | Statement | E | Codeforces Round 127 (Div. 1) {201} | PROGRAMMING | 2600 | ||
| 822 | Brand New Easy Problem | brute force | Statement | B | Codeforces Round 127 (Div. 2) {202} | PROGRAMMING | 1700 | ||
| 17329 | LLPS | binary search bitmasks brute force greedy implementation strings | Statement | A | Codeforces Round 127 (Div. 2) {202} | PROGRAMMING | 900 | ||
| 4214 | Two Problems | brute force implementation | Statement | A | Codeforces Round 128 (Div. 2) {203} | PROGRAMMING | 1200 | ||
| 5740 | Photographer | greedy sortings | Statement | C | Codeforces Round 128 (Div. 2) {203} | PROGRAMMING | 1400 | ||
| 2621 | Game on Paper | brute force implementation | Statement | B | Codeforces Round 128 (Div. 2) {203} | PROGRAMMING | 1400 | ||
| 1420 | Hit Ball | geometry implementation math | Statement | D | Codeforces Round 128 (Div. 2) {203} | PROGRAMMING | 1700 | ||
| 287 | Transportation | greedy sortings two pointers | Statement | E | Codeforces Round 128 (Div. 2) {203} | PROGRAMMING | 2400 | ||
| 5903 | Little Elephant and Interval | binary search combinatorics dp | Statement | A | Codeforces Round 129 (Div. 1) {204} | PROGRAMMING | Tutorial | 1600 | |
| 5334 | Little Elephant and Cards | binary search data structures | Statement | B | Codeforces Round 129 (Div. 1) {204} | PROGRAMMING | Tutorial | 1600 | |
| 1137 | Little Elephant and Furik and Rubik | math probabilities | Statement | C | Codeforces Round 129 (Div. 1) {204} | PROGRAMMING | 2200 | ||
| 589 | Little Elephant and Retro Strings | dp | Statement | D | Codeforces Round 129 (Div. 1) {204} | PROGRAMMING | 2400 | ||
| 1187 | Little Elephant and Strings | data structures implementation string suffix structures two pointers | Statement | E | Codeforces Round 129 (Div. 1) {204} | PROGRAMMING | Tutorial | 2800 | |
| 22874 | Little Elephant and Rozdil | brute force implementation | Statement | A | Codeforces Round 129 (Div. 2) {205} | PROGRAMMING | Codeforces Round #129 — Editorial | 1000 | |
| 6070 | Little Elephant and Sorting | brute force greedy | Statement | B | Codeforces Round 129 (Div. 2) {205} | PROGRAMMING | Codeforces Round #129 — Editorial | 1400 | |
| 303 | Beaver's Calculator 1.0 | greedy | Statement | A1 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 1600 | ||
| 284 | Military Trainings | Statement | B1 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 1700 | |||
| 245 | Beaver's Calculator 1.0 | greedy | Statement | A2 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 1800 | ||
| 117 | The Beaver's Problem - 3 | Statement | D1 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 1900 | |||
| 197 | Military Trainings | Statement | B2 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 1900 | |||
| 111 | The Beaver's Problem - 3 | Statement | D2 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 2000 | |||
| 223 | Beaver's Calculator 1.0 | greedy | Statement | A3 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 2000 | ||
| 136 | The Beaver's Problem - 3 | Statement | D3 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 2100 | |||
| 154 | The Beaver's Problem - 3 | Statement | D4 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 2200 | |||
| 181 | Military Trainings | Statement | B3 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 2200 | |||
| 95 | The Beaver's Problem - 3 | Statement | D8 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 2300 | |||
| 84 | The Beaver's Problem - 3 | Statement | D6 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 2300 | |||
| 148 | The Beaver's Problem - 3 | Statement | D5 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 2300 | |||
| 88 | The Beaver's Problem - 3 | Statement | D9 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 2400 | |||
| 102 | The Beaver's Problem - 3 | Statement | D7 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 2400 | |||
| 107 | Game with Two Trees | Statement | C1 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 2400 | |||
| 90 | Game with Two Trees | Statement | C2 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 2500 | |||
| 82 | The Beaver's Problem - 3 | Statement | D10 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 2700 | |||
| 134 | Game with Two Trees | data structures | Statement | C3 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 2700 | ||
| 91265 | Dubstep | strings | Statement | A | Codeforces Round 130 (Div. 2) {208} | PROGRAMMING | 4930 | 1100 | |
| 7632 | Prizes, Prizes, more Prizes | implementation | Statement | D | Codeforces Round 130 (Div. 2) {208} | PROGRAMMING | 1200 | ||
| 1373 | Solitaire | dfs and similar dp | Statement | B | Codeforces Round 130 (Div. 2) {208} | PROGRAMMING | 4930 | 1800 | |
| 1918 | Police Station | dp graphs shortest paths | Statement | C | Codeforces Round 130 (Div. 2) {208} | PROGRAMMING | 1900 | ||
| 7079 | Blood Cousins | binary search data structures dfs and similar trees | Statement | E | Codeforces Round 130 (Div. 2) {208} | PROGRAMMING | 2400 | ||
| 2412 | Multicolored Marbles | dp math | Statement | A | VK Cup 2012 Finals, Practice Session {209} | PROGRAMMING | 1700 | ||
| 404 | Pixels | constructive algorithms math | Statement | B | VK Cup 2012 Finals, Practice Session {209} | PROGRAMMING | 2200 | ||
| 766 | Trails and Glades | constructive algorithms ds graphs greedy | Statement | C | VK Cup 2012 Finals, Practice Session {209} | PROGRAMMING | 2400 | ||
| 1800 | IT Restaurants | dfs and similar dp trees | Statement | E | VK Cup 2012 Finals (unofficial online-version) {212} | PROGRAMMING | 1800 | ||
| 392 | Cowboys | combinatorics dp math | Statement | C | VK Cup 2012 Finals (unofficial online-version) {212} | PROGRAMMING | 2200 | ||
| 336 | Polycarpus is Looking for Good Substrings | bitmasks hashing implementation | Statement | B | VK Cup 2012 Finals (unofficial online-version) {212} | PROGRAMMING | 2300 | ||
| 523 | Cutting a Fence | binary search data structures ds | Statement | D | VK Cup 2012 Finals (unofficial online-version) {212} | PROGRAMMING | 2400 | ||
| 206 | Privatization | flows graphs | Statement | A | VK Cup 2012 Finals (unofficial online-version) {212} | PROGRAMMING | 2700 | ||
| 1733 | Game | dfs and similar greedy | Statement | A | Codeforces Round 131 (Div. 1) {213} | PROGRAMMING | 1800 | ||
| 2926 | Relay Race | dp | Statement | C | Codeforces Round 131 (Div. 1) {213} | PROGRAMMING | 2100 | ||
| 343 | Stars | constructive algorithms geometry | Statement | D | Codeforces Round 131 (Div. 1) {213} | PROGRAMMING | Codeforces Round #131 Tutorial | 2200 | |
| 1799 | Numbers | combinatorics dp | Statement | B | Codeforces Round 131 (Div. 1) {213} | PROGRAMMING | Codeforces Round #131 Tutorial | 2200 |