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 ... 30 31 32 33 34 ... 100 101 102 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 1618 | Toda 2 | greedy implementation | Statement | A | 2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {730} | PROGRAMMING | 2000 | ||
| 3538 | Bottles | dp | Statement | J | 2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {730} | PROGRAMMING | 2000 | ||
| 2148 | Olympiad in Programming and Sports | dp flows greedy | Statement | I | 2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {730} | PROGRAMMING | 2200 | ||
| 1257 | Bulmart | binary search dfs and similar | Statement | C | 2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {730} | PROGRAMMING | 2200 | ||
| 884 | Running Over The Bridges | greedy implementation math | Statement | D | 2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {730} | PROGRAMMING | 2400 | ||
| 726 | Award Ceremony | greedy implementation | Statement | E | 2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {730} | PROGRAMMING | 2400 | ||
| 91 | Ber Patio | Statement | F | 2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {730} | PROGRAMMING | Разбор задач (видео, по-русски) | 3200 | ||
| 111 | Roads Orientation Problem | Statement | K | 2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {730} | PROGRAMMING | 3300 | |||
| 86 | Expression Queries | Statement | L | 2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {730} | PROGRAMMING | 3300 | |||
| 8071 | Coupons and Discounts | constructive algorithms greedy | Statement | B | Codeforces Round 376 (Div. 2) {731} | PROGRAMMING | 1200 | ||
| 7094 | Socks | dfs and similar ds graphs greedy | Statement | C | Codeforces Round 376 (Div. 2) {731} | PROGRAMMING | 1600 | ||
| 2897 | Video Cards | brute force data structures implementation math number theory | Statement | F | Codeforces Round 376 (Div. 2) {731} | PROGRAMMING | 1900 | ||
| 1189 | 80-th Level Archeology | brute force data structures greedy sortings | Statement | D | Codeforces Round 376 (Div. 2) {731} | PROGRAMMING | 2200 | ||
| 1744 | Funny Game | dp games | Statement | E | Codeforces Round 376 (Div. 2) {731} | PROGRAMMING | 2300 | ||
| 47128 | Night at the Museum | implementation strings | Statement | A | Codeforces Round 376 (Div. 2) {731} | PROGRAMMING | 47840 | 800 | |
| 24811 | Cormen --- The Best Friend Of a Man | dp greedy | Statement | B | Codeforces Round 377 (Div. 2) {732} | PROGRAMMING | 1100 | ||
| 9814 | Sanatorium | binary search constructive algorithms greedy implementation math | Statement | C | Codeforces Round 377 (Div. 2) {732} | PROGRAMMING | 1300 | ||
| 5607 | Exams | binary search greedy sortings | Statement | D | Codeforces Round 377 (Div. 2) {732} | PROGRAMMING | 1700 | ||
| 1618 | Sockets | greedy sortings | Statement | E | Codeforces Round 377 (Div. 2) {732} | PROGRAMMING | 2000 | ||
| 2698 | Tourist Reform | dfs and similar graphs | Statement | F | Codeforces Round 377 (Div. 2) {732} | PROGRAMMING | 2400 | ||
| 75031 | Buy a Shovel | brute force constructive algorithms implementation math | Statement | A | Codeforces Round 377 (Div. 2) {732} | PROGRAMMING | Codeforces Round #377 (Div. 2) Editorial | 800 | |
| 16258 | Grasshopper And the String | implementation | Statement | A | Codeforces Round 378 (Div. 2) {733} | PROGRAMMING | Codeforces Round #378 (Div. 2) editorial | 1000 | |
| 10709 | Parade | math | Statement | B | Codeforces Round 378 (Div. 2) {733} | PROGRAMMING | 1100 | ||
| 4196 | Kostya the Sculptor | data structures hashing | Statement | D | Codeforces Round 378 (Div. 2) {733} | PROGRAMMING | Codeforces Round #378 (Div. 2) editorial | 1600 | |
| 3413 | Epidemic in Monstropolis | constructive algorithms dp greedy two pointers | Statement | C | Codeforces Round 378 (Div. 2) {733} | PROGRAMMING | 1800 | ||
| 968 | Sleep in Class | constructive algorithms data structures math two pointers | Statement | E | Codeforces Round 378 (Div. 2) {733} | PROGRAMMING | 2500 | ||
| 1147 | Drivers Dissatisfaction | data structures ds graphs trees | Statement | F | Codeforces Round 378 (Div. 2) {733} | PROGRAMMING | 2500 | ||
| 5370 | Anton and Making Potions | binary search dp greedy two pointers | Statement | C | Codeforces Round 379 (Div. 2) {734} | PROGRAMMING | 1600 | ||
| 3760 | Anton and Chess | implementation | Statement | D | Codeforces Round 379 (Div. 2) {734} | PROGRAMMING | Tutorial of Codeforces Round #379 (Div. 2) | 1700 | |
| 4312 | Anton and Tree | dfs and similar dp trees | Statement | E | Codeforces Round 379 (Div. 2) {734} | PROGRAMMING | 2100 | ||
| 1323 | Anton and School | bitmasks constructive algorithms implementation math | Statement | F | Codeforces Round 379 (Div. 2) {734} | PROGRAMMING | Tutorial of Codeforces Round #379 (Div. 2) | 2600 | |
| 160399 | Anton and Danik | implementation strings | Statement | A | Codeforces Round 379 (Div. 2) {734} | PROGRAMMING | Tutorial of Codeforces Round #379 (Div. 2) | 700 | |
| 29740 | Anton and Digits | brute force greedy implementation math | Statement | B | Codeforces Round 379 (Div. 2) {734} | PROGRAMMING | Tutorial of Codeforces Round #379 (Div. 2) | 800 | |
| 12609 | Ostap and Grasshopper | implementation strings | Statement | A | Codeforces Round 382 (Div. 2) {735} | PROGRAMMING | 1000 | ||
| 8437 | Urbanization | greedy number theory sortings | Statement | B | Codeforces Round 382 (Div. 2) {735} | PROGRAMMING | 1200 | ||
| 13914 | Taxes | math number theory | Statement | D | Codeforces Round 382 (Div. 2) {735} | PROGRAMMING | Codeforces Round #382 Editorial | 1600 | |
| 7589 | Tennis Championship | combinatorics constructive algorithms greedy math | Statement | C | Codeforces Round 382 (Div. 2) {735} | PROGRAMMING | Codeforces Round #382 Editorial | 1700 | |
| 887 | Ostap and Tree | dp trees | Statement | E | Codeforces Round 382 (Div. 2) {735} | PROGRAMMING | 2800 | ||
| 466 | Permutations | math matrices | Statement | D | Codeforces Round 382 (Div. 1) {736} | PROGRAMMING | 48659 | 2700 | |
| 187 | Chess Championship | constructive algorithms flows greedy math | Statement | E | Codeforces Round 382 (Div. 1) {736} | PROGRAMMING | 2800 | ||
| 125 | Tanya is 5! | graph matchings graphs greedy schedules | Statement | E | Codeforces Round 380 (Div. 1, Rated, Based on Technocup 2017 - Elimination Round 2) {737} | PROGRAMMING | 3300 | ||
| 70 | Dirty plates | constructive algorithms math | Statement | F | Codeforces Round 380 (Div. 1, Rated, Based on Technocup 2017 - Elimination Round 2) {737} | PROGRAMMING | 3300 | ||
| 7998 | Alyona and mex | constructive algorithms greedy | Statement | A | Codeforces Round 381 (Div. 1) {739} | PROGRAMMING | 48582 | 1600 | |
| 4705 | Alyona and a tree | binary search data structures dfs and similar graphs trees | Statement | B | Codeforces Round 381 (Div. 1) {739} | PROGRAMMING | 48582 | 2000 | |
| 1543 | Alyona and towers | data structures | Statement | C | Codeforces Round 381 (Div. 1) {739} | PROGRAMMING | 2500 | ||
| 2236 | Gosha is hunting | brute force data structures dp flows math probabilities sortings | Statement | E | Codeforces Round 381 (Div. 1) {739} | PROGRAMMING | 2900 | ||
| 201 | Recover a functional graph | graph matchings | Statement | D | Codeforces Round 381 (Div. 1) {739} | PROGRAMMING | 48582 | 3400 | |
| 8375 | Alyona and flowers | constructive algorithms | Statement | B | Codeforces Round 381 (Div. 2) {740} | PROGRAMMING | 1200 | ||
| 8932 | Alyona and copybooks | brute force implementation | Statement | A | Codeforces Round 381 (Div. 2) {740} | PROGRAMMING | Tutorial | 1300 | |
| 5462 | Arpa's loud Owf and Mehrdad's evil plan | dfs and similar math | Statement | A | Codeforces Round 383 (Div. 1) {741} | PROGRAMMING | 1600 | ||
| 5347 | Arpa's weak amphitheater and Mehrdad's valuable Hoses | dfs and similar dp ds | Statement | B | Codeforces Round 383 (Div. 1) {741} | PROGRAMMING | 1700 | ||
| 2663 | Arpa’s overnight party and Mehrdad’s silent entering | constructive algorithms dfs and similar graphs | Statement | C | Codeforces Round 383 (Div. 1) {741} | PROGRAMMING | Codeforces Round #383 editorial | 2600 | |
| 2860 | Arpa’s letter-marked tree and Mehrdad’s Dokhtar-kosh paths | data structures dfs and similar trees | Statement | D | Codeforces Round 383 (Div. 1) {741} | PROGRAMMING | Codeforces Round #383 editorial | 2700 | |
| 180 | Arpa’s abnormal DNA and Mehrdad’s deep interest | data structures string suffix structures | Statement | E | Codeforces Round 383 (Div. 1) {741} | PROGRAMMING | 3300 | ||
| 44048 | Arpa’s hard exam and Mehrdad’s naive cheat | implementation math number theory | Statement | A | Codeforces Round 383 (Div. 2) {742} | PROGRAMMING | Test data | 1000 | |
| 9396 | Arpa’s obvious problem and Mehrdad’s terrible solution | brute force math number theory | Statement | B | Codeforces Round 383 (Div. 2) {742} | PROGRAMMING | Test data | 1500 | |
| 11254 | Vladik and flights | constructive algorithms greedy implementation | Statement | A | Codeforces Round 384 (Div. 2) {743} | PROGRAMMING | 1200 | ||
| 15081 | Chloe and the sequence | binary search bitmasks constructive algorithms implementation | Statement | B | Codeforces Round 384 (Div. 2) {743} | PROGRAMMING | Codeforces Round #384 Editorial | 1200 | |
| 12507 | Vladik and fractions | brute force constructive algorithms math number theory | Statement | C | Codeforces Round 384 (Div. 2) {743} | PROGRAMMING | Codeforces Round #384 Editorial | 1500 | |
| 4412 | Chloe and pleasant prizes | dfs and similar dp graphs trees | Statement | D | Codeforces Round 384 (Div. 2) {743} | PROGRAMMING | 1800 | ||
| 1522 | Vladik and cards | binary search bitmasks brute force dp | Statement | E | Codeforces Round 384 (Div. 2) {743} | PROGRAMMING | Codeforces Round #384 Editorial | 2300 | |
| 8572 | Hongcow Builds A Nation | dfs and similar graphs | Statement | A | Codeforces Round 385 (Div. 1) {744} | PROGRAMMING | Codeforces Round #385 Editorial | 1500 | |
| 1796 | Hongcow's Game | bitmasks divide and conquer interactive | Statement | B | Codeforces Round 385 (Div. 1) {744} | PROGRAMMING | 2000 | ||
| 1177 | Hongcow Buys a Deck of Cards | bitmasks brute force dp | Statement | C | Codeforces Round 385 (Div. 1) {744} | PROGRAMMING | Codeforces Round #385 Editorial | 2500 | |
| 126 | Hongcow Draws a Circle | geometry | Statement | D | Codeforces Round 385 (Div. 1) {744} | PROGRAMMING | Codeforces Round #385 Editorial | 3000 | |
| 143 | Hongcow Masters the Cyclic Shift | strings two pointers | Statement | E | Codeforces Round 385 (Div. 1) {744} | PROGRAMMING | Codeforces Round #385 Editorial | 3100 | |
| 3772 | Hongcow Solves A Puzzle | implementation | Statement | B | Codeforces Round 385 (Div. 2) {745} | PROGRAMMING | Tutorial | 1400 | |
| 10540 | Hongcow Learns the Cyclic Shift | implementation strings | Statement | A | Codeforces Round 385 (Div. 2) {745} | PROGRAMMING | Tutorial | 900 | |
| 5152 | Green and Black Tea | constructive algorithms greedy math | Statement | D | Codeforces Round 386 (Div. 2) {746} | PROGRAMMING | Codeforces Round #386 (Div.2) Editorial | 1500 | |
| 3755 | Tram | constructive algorithms implementation math | Statement | C | Codeforces Round 386 (Div. 2) {746} | PROGRAMMING | 1600 | ||
| 1755 | Numbers Exchange | greedy implementation math | Statement | E | Codeforces Round 386 (Div. 2) {746} | PROGRAMMING | Codeforces Round #386 (Div.2) Editorial | 1800 | |
| 1541 | New Roads | constructive algorithms graphs trees | Statement | G | Codeforces Round 386 (Div. 2) {746} | PROGRAMMING | 2100 | ||
| 784 | Music in Car | data structures greedy two pointers | Statement | F | Codeforces Round 386 (Div. 2) {746} | PROGRAMMING | 2500 | ||
| 22008 | Compote | implementation math | Statement | A | Codeforces Round 386 (Div. 2) {746} | PROGRAMMING | Codeforces Round #386 (Div.2) Editorial | 800 | |
| 28721 | Decoding | implementation strings | Statement | B | Codeforces Round 386 (Div. 2) {746} | PROGRAMMING | 900 | ||
| 9045 | Mammoth's Genome Decoding | implementation strings | Statement | B | Codeforces Round 387 (Div. 2) {747} | PROGRAMMING | 49171 | 1000 | |
| 10390 | Display Size | brute force math | Statement | A | Codeforces Round 387 (Div. 2) {747} | PROGRAMMING | 49171 | 1000 | |
| 4718 | Servers | implementation | Statement | C | Codeforces Round 387 (Div. 2) {747} | PROGRAMMING | 1400 | ||
| 1980 | Comments | dfs and similar expression parsing implementation strings | Statement | E | Codeforces Round 387 (Div. 2) {747} | PROGRAMMING | 49171 | 1700 | |
| 3309 | Winter Is Coming | dp greedy sortings | Statement | D | Codeforces Round 387 (Div. 2) {747} | PROGRAMMING | 1800 | ||
| 430 | Igor and Interesting Numbers | brute force combinatorics dp math | Statement | F | Codeforces Round 387 (Div. 2) {747} | PROGRAMMING | 49171 | 2600 | |
| 4662 | Santa Claus and Robot | constructive algorithms math | Statement | C | Technocup 2017 - Elimination Round 3 {748} | PROGRAMMING | Codeforces Round 389 (Div.2) Editorial | 1400 | |
| 5404 | Santa Claus and Keyboard Check | implementation strings | Statement | B | Technocup 2017 - Elimination Round 3 {748} | PROGRAMMING | Codeforces Round 389 (Div.2) Editorial | 1500 | |
| 1514 | Santa Claus and Tangerines | binary search data structures greedy two pointers | Statement | E | Technocup 2017 - Elimination Round 3 {748} | PROGRAMMING | 2000 | ||
| 1902 | Santa Claus and a Palindrome | constructive algorithms data structures greedy | Statement | D | Technocup 2017 - Elimination Round 3 {748} | PROGRAMMING | Codeforces Round 389 (Div.2) Editorial | 2000 | |
| 671 | Santa Clauses and a Soccer Championship | constructive algorithms dfs and similar graphs trees | Statement | F | Technocup 2017 - Elimination Round 3 {748} | PROGRAMMING | 2500 | ||
| 9040 | Santa Claus and a Place in a Class | implementation math | Statement | A | Technocup 2017 - Elimination Round 3 {748} | PROGRAMMING | Codeforces Round 389 (Div.2) Editorial | 900 | |
| 8535 | Parallelogram is Back | brute force constructive algorithms geometry | Statement | B | Codeforces Round 388 (Div. 2) {749} | PROGRAMMING | Tutorial | 1300 | |
| 6038 | Voting | greedy implementation two pointers | Statement | C | Codeforces Round 388 (Div. 2) {749} | PROGRAMMING | Tutorial | 1600 | |
| 2583 | Leaving Auction | binary search data structures | Statement | D | Codeforces Round 388 (Div. 2) {749} | PROGRAMMING | 2000 | ||
| 1125 | Inversions After Shuffle | data structures probabilities | Statement | E | Codeforces Round 388 (Div. 2) {749} | PROGRAMMING | Tutorial | 2600 | |
| 50859 | Bachgold Problem | greedy implementation math number theory | Statement | A | Codeforces Round 388 (Div. 2) {749} | PROGRAMMING | Tutorial | 700 | |
| 9521 | New Year and North Pole | geometry implementation | Statement | B | Good Bye 2016 {750} | PROGRAMMING | Good Bye 2016 — hints and codes | 1300 | |
| 6606 | New Year and Rating | binary search greedy math | Statement | C | Good Bye 2016 {750} | PROGRAMMING | Good Bye 2016 — hints and codes | 1600 | |
| 3099 | New Year and Fireworks | brute force data structures dfs and similar dp implementation | Statement | D | Good Bye 2016 {750} | PROGRAMMING | 1900 | ||
| 1641 | New Year and Old Subsequence | data structures divide and conquer dp matrices | Statement | E | Good Bye 2016 {750} | PROGRAMMING | Good Bye 2016 — hints and codes | 2600 | |
| 496 | New Year and Finding Roots | constructive algorithms implementation interactive trees | Statement | F | Good Bye 2016 {750} | PROGRAMMING | 2700 | ||
| 462 | New Year and Binary Tree Paths | bitmasks brute force combinatorics dp | Statement | G | Good Bye 2016 {750} | PROGRAMMING | Good Bye 2016 — hints and codes | 3100 | |
| 195 | New Year and Snowy Grid | dfs and similar ds graphs interactive | Statement | H | Good Bye 2016 {750} | PROGRAMMING | 3400 | ||
| 78757 | New Year and Hurry | binary search brute force implementation math | Statement | A | Good Bye 2016 {750} | PROGRAMMING | Good Bye 2016 — hints and codes | 800 |