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 ... 29 30 31 32 33 ... 100 101 102 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 1029 | Student's Camp | dp math | Statement | E | AIM Tech Round 3 (Div. 1) {708} | PROGRAMMING | 3100 | ||
| 33190 | Juicer | implementation | Statement | A | AIM Tech Round 3 (Div. 2) {709} | PROGRAMMING | 1000 | ||
| 4770 | Checkpoints | greedy implementation sortings | Statement | B | AIM Tech Round 3 (Div. 2) {709} | PROGRAMMING | 1500 | ||
| 13950 | King Moves | implementation | Statement | A | Educational Codeforces Round 16 {710} | PROGRAMMING | Editorial of Educational Codeforces Round 16 | 1000 | |
| 8851 | Optimal Point on a Line | brute force sortings | Statement | B | Educational Codeforces Round 16 {710} | PROGRAMMING | Editorial of Educational Codeforces Round 16 | 1400 | |
| 5175 | Magic Odd Square | constructive algorithms math | Statement | C | Educational Codeforces Round 16 {710} | PROGRAMMING | Editorial of Educational Codeforces Round 16 | 1600 | |
| 5280 | Generate a String | dfs and similar dp | Statement | E | Educational Codeforces Round 16 {710} | PROGRAMMING | Editorial of Educational Codeforces Round 16 | 2100 | |
| 1387 | Two Arithmetic Progressions | math | Statement | D | Educational Codeforces Round 16 {710} | PROGRAMMING | Editorial of Educational Codeforces Round 16 | 2500 | |
| 1963 | String Set Queries | brute force data structures hashing string suffix structures strings | Statement | F | Educational Codeforces Round 16 {710} | PROGRAMMING | Editorial of Educational Codeforces Round 16 | 2700 | |
| 8439 | Chris and Magic Square | constructive algorithms implementation | Statement | B | Codeforces Round 369 (Div. 2) {711} | PROGRAMMING | 1400 | ||
| 8408 | Coloring Trees | dp | Statement | C | Codeforces Round 369 (Div. 2) {711} | PROGRAMMING | 1700 | ||
| 4543 | Directed Roads | combinatorics dfs and similar graphs math | Statement | D | Codeforces Round 369 (Div. 2) {711} | PROGRAMMING | 1900 | ||
| 1285 | ZS and The Birthday Paradox | math number theory probabilities | Statement | E | Codeforces Round 369 (Div. 2) {711} | PROGRAMMING | 2400 | ||
| 29755 | Bus to Udayland | brute force implementation | Statement | A | Codeforces Round 369 (Div. 2) {711} | PROGRAMMING | 46830 | 700 | |
| 9817 | Memory and Trident | implementation strings | Statement | B | Codeforces Round 370 (Div. 2) {712} | PROGRAMMING | Codeforces Round #370 Editorial | 1200 | |
| 5955 | Memory and De-Evolution | greedy math | Statement | C | Codeforces Round 370 (Div. 2) {712} | PROGRAMMING | Codeforces Round #370 Editorial | 1600 | |
| 1861 | Memory and Scores | combinatorics dp math | Statement | D | Codeforces Round 370 (Div. 2) {712} | PROGRAMMING | 2100 | ||
| 625 | Memory and Casinos | data structures math probabilities | Statement | E | Codeforces Round 370 (Div. 2) {712} | PROGRAMMING | 2700 | ||
| 11991 | Memory and Crow | implementation math | Statement | A | Codeforces Round 370 (Div. 2) {712} | PROGRAMMING | Codeforces Round #370 Editorial | 900 | |
| 8531 | Sonya and Queries | data structures implementation | Statement | A | Codeforces Round 371 (Div. 1) {713} | PROGRAMMING | Codeforces Round #371 Editorial | 1500 | |
| 1468 | Searching Rectangles | binary search constructive algorithms interactive | Statement | B | Codeforces Round 371 (Div. 1) {713} | PROGRAMMING | 2200 | ||
| 5635 | Sonya and Problem Wihtout a Legend | dp sortings | Statement | C | Codeforces Round 371 (Div. 1) {713} | PROGRAMMING | Codeforces Round #371 Editorial | 2400 | |
| 1176 | Animals and Puzzle | binary search data structures | Statement | D | Codeforces Round 371 (Div. 1) {713} | PROGRAMMING | 2700 | ||
| 358 | Sonya Partymaker | binary search dp | Statement | E | Codeforces Round 371 (Div. 1) {713} | PROGRAMMING | Codeforces Round #371 Editorial | 3100 | |
| 10822 | Meeting of Old Friends | implementation math | Statement | A | Codeforces Round 371 (Div. 2) {714} | PROGRAMMING | Codeforces Round #371 Editorial | 1100 | |
| 14666 | Filya and Homework | implementation sortings | Statement | B | Codeforces Round 371 (Div. 2) {714} | PROGRAMMING | Codeforces Round #371 Editorial | 1200 | |
| 5650 | Plus and Square Root | constructive algorithms math | Statement | A | Codeforces Round 372 (Div. 1) {715} | PROGRAMMING | 1600 | ||
| 2959 | Complete The Graph | binary search constructive algorithms graphs shortest paths | Statement | B | Codeforces Round 372 (Div. 1) {715} | PROGRAMMING | 2200 | ||
| 2202 | Digit Tree | dfs and similar divide and conquer ds trees | Statement | C | Codeforces Round 372 (Div. 1) {715} | PROGRAMMING | 2800 | ||
| 316 | Create a Maze | constructive algorithms | Statement | D | Codeforces Round 372 (Div. 1) {715} | PROGRAMMING | 3000 | ||
| 361 | Complete the Permutations | combinatorics fft graphs math | Statement | E | Codeforces Round 372 (Div. 1) {715} | PROGRAMMING | 3400 | ||
| 12298 | Complete the Word | greedy two pointers | Statement | B | Codeforces Round 372 (Div. 2) {716} | PROGRAMMING | 1400 | ||
| 22788 | Crazy Computer | implementation | Statement | A | Codeforces Round 372 (Div. 2) {716} | PROGRAMMING | 800 | ||
| 4042 | Potions Homework | implementation sortings | Statement | C | Bubble Cup 9 - Finals [Online Mirror] {717} | PROGRAMMING | 1200 | ||
| 1487 | Paint it really, really dark gray | dfs and similar | Statement | E | Bubble Cup 9 - Finals [Online Mirror] {717} | PROGRAMMING | 1900 | ||
| 1453 | Dexterina’s Lab | games matrices probabilities | Statement | D | Bubble Cup 9 - Finals [Online Mirror] {717} | PROGRAMMING | 1900 | ||
| 678 | Underfail | flows | Statement | G | Bubble Cup 9 - Finals [Online Mirror] {717} | PROGRAMMING | 2400 | ||
| 436 | Pokermon League challenge | math probabilities | Statement | H | Bubble Cup 9 - Finals [Online Mirror] {717} | PROGRAMMING | 2400 | ||
| 337 | Heroes of Making Magic III | data structures | Statement | F | Bubble Cup 9 - Finals [Online Mirror] {717} | PROGRAMMING | 2700 | ||
| 379 | Festival Organization | math number theory | Statement | A | Bubble Cup 9 - Finals [Online Mirror] {717} | PROGRAMMING | Tutorial | 3000 | |
| 162 | R3D3’s Summer Adventure | dp greedy | Statement | B | Bubble Cup 9 - Finals [Online Mirror] {717} | PROGRAMMING | 3200 | ||
| 209 | Cowboy Beblop at his computer | geometry | Statement | I | Bubble Cup 9 - Finals [Online Mirror] {717} | PROGRAMMING | 3800 | ||
| 4407 | Efim and Strange Grade | dp implementation math | Statement | A | Codeforces Round 373 (Div. 1) {718} | PROGRAMMING | 1700 | ||
| 3974 | Sasha and Array | data structures math matrices | Statement | C | Codeforces Round 373 (Div. 1) {718} | PROGRAMMING | 2300 | ||
| 403 | Andrew and Chemistry | dp hashing trees | Statement | D | Codeforces Round 373 (Div. 1) {718} | PROGRAMMING | Codeforces Round #373 — Editorial | 2900 | |
| 364 | Matvey's Birthday | bitmasks graphs | Statement | E | Codeforces Round 373 (Div. 1) {718} | PROGRAMMING | Codeforces Round #373 — Editorial | 3400 | |
| 15606 | Vitya in the Countryside | implementation | Statement | A | Codeforces Round 373 (Div. 2) {719} | PROGRAMMING | Codeforces Round #373 — Editorial | 1100 | |
| 8534 | Anatoly and Cockroaches | greedy | Statement | B | Codeforces Round 373 (Div. 2) {719} | PROGRAMMING | Codeforces Round #373 — Editorial | 1400 | |
| 868 | Closing ceremony | greedy | Statement | A | Russian Code Cup 2016 - Finals [Unofficial Mirror, Div. 1 Only Recommended] {720} | PROGRAMMING | Russian Code Cup 2016 — Results and Tutorial | 2000 | |
| 409 | Cactusophobia | dfs and similar flows | Statement | B | Russian Code Cup 2016 - Finals [Unofficial Mirror, Div. 1 Only Recommended] {720} | PROGRAMMING | Russian Code Cup 2016 — Results and Tutorial | 2300 | |
| 308 | Slalom | data structures dp sortings | Statement | D | Russian Code Cup 2016 - Finals [Unofficial Mirror, Div. 1 Only Recommended] {720} | PROGRAMMING | 3100 | ||
| 142 | Homework | constructive algorithms | Statement | C | Russian Code Cup 2016 - Finals [Unofficial Mirror, Div. 1 Only Recommended] {720} | PROGRAMMING | Russian Code Cup 2016 — Results and Tutorial | 3100 | |
| 65 | Cipher | implementation | Statement | E | Russian Code Cup 2016 - Finals [Unofficial Mirror, Div. 1 Only Recommended] {720} | PROGRAMMING | 3100 | ||
| 163 | Array Covering | data structures | Statement | F | Russian Code Cup 2016 - Finals [Unofficial Mirror, Div. 1 Only Recommended] {720} | PROGRAMMING | Russian Code Cup 2016 — Results and Tutorial | 3100 | |
| 12143 | Passwords | implementation math sortings strings | Statement | B | Codeforces Round 374 (Div. 2) {721} | PROGRAMMING | 1200 | ||
| 5969 | Journey | dp graphs | Statement | C | Codeforces Round 374 (Div. 2) {721} | PROGRAMMING | 1800 | ||
| 2370 | Maxim and Array | constructive algorithms data structures greedy math | Statement | D | Codeforces Round 374 (Div. 2) {721} | PROGRAMMING | Codeforces Round #374 (Div. 2) Editorial | 2000 | |
| 309 | Road to Home | binary search dp | Statement | E | Codeforces Round 374 (Div. 2) {721} | PROGRAMMING | 2800 | ||
| 18692 | One-dimensional Japanese Crossword | implementation | Statement | A | Codeforces Round 374 (Div. 2) {721} | PROGRAMMING | Codeforces Round #374 (Div. 2) Editorial | 700 | |
| 6534 | Verse Pattern | implementation strings | Statement | B | Intel Code Challenge Elimination Round (Div. 1 + Div. 2, combined) {722} | PROGRAMMING | 1200 | ||
| 6667 | Broken Clock | brute force implementation | Statement | A | Intel Code Challenge Elimination Round (Div. 1 + Div. 2, combined) {722} | PROGRAMMING | Tutorial | 1300 | |
| 9699 | Destroying Array | data structures ds | Statement | C | Intel Code Challenge Elimination Round (Div. 1 + Div. 2, combined) {722} | PROGRAMMING | Tutorial | 1600 | |
| 3207 | Generating Sets | binary search data structures dfs and similar greedy strings trees | Statement | D | Intel Code Challenge Elimination Round (Div. 1 + Div. 2, combined) {722} | PROGRAMMING | Tutorial | 1900 | |
| 902 | Research Rover | combinatorics dp | Statement | E | Intel Code Challenge Elimination Round (Div. 1 + Div. 2, combined) {722} | PROGRAMMING | 2800 | ||
| 533 | Cyclic Cipher | chinese remainder theorem data structures implementation number theory two pointers | Statement | F | Intel Code Challenge Elimination Round (Div. 1 + Div. 2, combined) {722} | PROGRAMMING | Tutorial | 2800 | |
| 10251 | Text Document Analysis | expression parsing implementation strings | Statement | B | Codeforces Round 375 (Div. 2) {723} | PROGRAMMING | Codeforces Round #375 (Div.2) Editorial | 1100 | |
| 4775 | Polycarp at the Radio | greedy | Statement | C | Codeforces Round 375 (Div. 2) {723} | PROGRAMMING | 1600 | ||
| 7031 | Lakes in Berland | dfs and similar ds graphs greedy implementation | Statement | D | Codeforces Round 375 (Div. 2) {723} | PROGRAMMING | 1600 | ||
| 1527 | st-Spanning Tree | ds graphs greedy implementation | Statement | F | Codeforces Round 375 (Div. 2) {723} | PROGRAMMING | 2200 | ||
| 2025 | One-Way Reform | constructive algorithms dfs and similar flows graphs greedy | Statement | E | Codeforces Round 375 (Div. 2) {723} | PROGRAMMING | 2300 | ||
| 82410 | The New Year: Meeting Friends | implementation math sortings | Statement | A | Codeforces Round 375 (Div. 2) {723} | PROGRAMMING | Codeforces Round #375 (Div.2) Editorial | 800 | |
| 7121 | Checking the Calendar | implementation | Statement | A | Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined) {724} | PROGRAMMING | Tutorial | 1000 | |
| 4027 | Batch Sort | brute force greedy implementation math | Statement | B | Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined) {724} | PROGRAMMING | Tutorial | 1500 | |
| 2151 | Ray Tracing | greedy hashing implementation math number theory sortings | Statement | C | Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined) {724} | PROGRAMMING | 1800 | ||
| 2349 | Dense Subsequence | data structures greedy strings | Statement | D | Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined) {724} | PROGRAMMING | 1900 | ||
| 1094 | Xor-matic Number of the Graph | bitmasks graphs math number theory trees | Statement | G | Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined) {724} | PROGRAMMING | Tutorial | 2600 | |
| 459 | Uniformly Branched Trees | combinatorics dp trees | Statement | F | Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined) {724} | PROGRAMMING | Tutorial | 2800 | |
| 1381 | Goods transportation | dp flows greedy | Statement | E | Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined) {724} | PROGRAMMING | Tutorial | 2900 | |
| 7168 | Jumping Ball | implementation | Statement | A | Canada Cup 2016 {725} | PROGRAMMING | Canada Cup Editorial | 1100 | |
| 5172 | Food on the Plane | implementation math | Statement | B | Canada Cup 2016 {725} | PROGRAMMING | 1200 | ||
| 2699 | Hidden Word | brute force constructive algorithms implementation strings | Statement | C | Canada Cup 2016 {725} | PROGRAMMING | Canada Cup Editorial | 1600 | |
| 2822 | Contest Balloons | data structures greedy | Statement | D | Canada Cup 2016 {725} | PROGRAMMING | 1800 | ||
| 659 | Too Much Money | brute force greedy | Statement | E | Canada Cup 2016 {725} | PROGRAMMING | 2500 | ||
| 543 | Family Photos | games greedy | Statement | F | Canada Cup 2016 {725} | PROGRAMMING | Canada Cup Editorial | 2900 | |
| 164 | Messages on a Tree | Statement | G | Canada Cup 2016 {725} | PROGRAMMING | 3300 | |||
| 14347 | Transformation: from A to B | brute force dfs and similar math | Statement | A | Technocup 2017 - Elimination Round 1 (Unofficially Open for Everyone, Rated for Div. 2) {727} | PROGRAMMING | Tutorial | 1100 | |
| 7644 | Guess the Array | constructive algorithms interactive math | Statement | C | Technocup 2017 - Elimination Round 1 (Unofficially Open for Everyone, Rated for Div. 2) {727} | PROGRAMMING | Tutorial | 1400 | |
| 2029 | Bill Total Value | expression parsing implementation strings | Statement | B | Technocup 2017 - Elimination Round 1 (Unofficially Open for Everyone, Rated for Div. 2) {727} | PROGRAMMING | Tutorial | 1600 | |
| 1902 | T-shirts Distribution | constructive algorithms flows greedy | Statement | D | Technocup 2017 - Elimination Round 1 (Unofficially Open for Everyone, Rated for Div. 2) {727} | PROGRAMMING | 1800 | ||
| 812 | Polycarp's problems | binary search dp greedy | Statement | F | Technocup 2017 - Elimination Round 1 (Unofficially Open for Everyone, Rated for Div. 2) {727} | PROGRAMMING | 2300 | ||
| 1277 | Games on a CD | data structures hashing string suffix structures strings | Statement | E | Technocup 2017 - Elimination Round 1 (Unofficially Open for Everyone, Rated for Div. 2) {727} | PROGRAMMING | 2300 | ||
| 7562 | Interview with Oleg | implementation strings | Statement | A | Technocup 2017 - Elimination Round 2 {729} | PROGRAMMING | Technocup 2017 — Elimination Round 2 (and Codeforces Round 380) Editorial | 1000 | |
| 8056 | Spotlights | dp implementation | Statement | B | Technocup 2017 - Elimination Round 2 {729} | PROGRAMMING | Technocup 2017 — Elimination Round 2 (and Codeforces Round 380) Editorial | 1300 | |
| 3790 | Sea Battle | constructive algorithms greedy math | Statement | D | Technocup 2017 - Elimination Round 2 {729} | PROGRAMMING | 1700 | ||
| 3963 | Road to Cinema | binary search greedy sortings | Statement | C | Technocup 2017 - Elimination Round 2 {729} | PROGRAMMING | 1700 | ||
| 2246 | Subordinates | constructive algorithms data structures graphs greedy sortings | Statement | E | Technocup 2017 - Elimination Round 2 {729} | PROGRAMMING | Technocup 2017 — Elimination Round 2 (and Codeforces Round 380) Editorial | 2000 | |
| 1007 | Financiers Game | dp | Statement | F | Technocup 2017 - Elimination Round 2 {729} | PROGRAMMING | Technocup 2017 — Elimination Round 2 (and Codeforces Round 380) Editorial | 2600 | |
| 3076 | Delete Them | constructive algorithms implementation | Statement | H | 2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {730} | PROGRAMMING | 1400 | ||
| 2193 | Car Repair Shop | implementation | Statement | G | 2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {730} | PROGRAMMING | Разбор задач (видео, по-русски) | 1700 | |
| 2509 | Minimum and Maximum | constructive algorithms interactive | Statement | B | 2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {730} | PROGRAMMING | 1900 |