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 ... 61 62 63 64 65 ... 100 101 102 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 441 | Set Merging | constructive algorithms data structures divide and conquer | Statement | H | Codeforces Global Round 9 {1375} | PROGRAMMING | 2750.0 | 79731 | |
| 9388 | Replace by MEX | brute force constructive algorithms implementation | Statement | D | Codeforces Global Round 9 {1375} | PROGRAMMING | 1750.0 | 79731 | |
| 17377 | Neighbor Grid | constructive algorithms greedy | Statement | B | Codeforces Global Round 9 {1375} | PROGRAMMING | 750.0 | 79731 | |
| 3122 | Inversion SwapSort | constructive algorithms greedy sortings | Statement | E | Codeforces Global Round 9 {1375} | PROGRAMMING | 2000.0 | 79731 | |
| 2290 | Integer Game | brute force constructive algorithms games interactive math | Statement | F | Codeforces Global Round 9 {1375} | PROGRAMMING | 2000.0 | 79731 | |
| 21515 | Element Extermination | constructive algorithms greedy | Statement | C | Codeforces Global Round 9 {1375} | PROGRAMMING | 1500.0 | 79731 | |
| 265 | Cubic Lattice | geometry math matrices number theory | Statement | I | Codeforces Global Round 9 {1375} | PROGRAMMING | 4000.0 | 79731 | |
| 12783 | Dubious Cyrpto | binary search brute force math number theory | Statement | B | Codeforces Round 657 (Div. 2) {1379} | PROGRAMMING | 750.0 | Codeforces Round #657 Editorial | 1500 |
| 12022 | Acacius and String | brute force implementation strings | Statement | A | Codeforces Round 657 (Div. 2) {1379} | PROGRAMMING | 500.0 | Codeforces Round #657 Editorial | 1500 |
| 5666 | Choosing flowers | binary search data structures greedy math sortings two pointers | Statement | C | Codeforces Round 657 (Div. 2) {1379} | PROGRAMMING | 1250.0 | Codeforces Round #657 Editorial | 2000 |
| 1094 | New Passenger Trams | brute force data structures sortings two pointers | Statement | D | Codeforces Round 657 (Div. 2) {1379} | PROGRAMMING | 1500.0 | Codeforces Round #657 Editorial | 2400 |
| 434 | Inverse Genealogy | constructive algorithms divide and conquer dp math trees | Statement | E | Codeforces Round 657 (Div. 2) {1379} | PROGRAMMING | 2500.0 | Codeforces Round #657 Editorial | 2400 |
| 613 | Chess Strikes Back (easy version) | binary search data structures | Statement | F1 | Codeforces Round 657 (Div. 2) {1379} | PROGRAMMING | 1500.0 | Codeforces Round #657 Editorial | 2700 |
| 519 | Chess Strikes Back (hard version) | data structures divide and conquer | Statement | F2 | Codeforces Round 657 (Div. 2) {1379} | PROGRAMMING | 1500.0 | Codeforces Round #657 Editorial | 2800 |
| 14743 | Universal Solution | greedy | Statement | B | Educational Codeforces Round 91 (Rated for Div. 2) {1380} | PROGRAMMING | Educational Codeforces Round 91 Editorial | ||
| 27304 | Three Indices | brute force | Statement | A | Educational Codeforces Round 91 (Rated for Div. 2) {1380} | PROGRAMMING | Educational Codeforces Round 91 Editorial | ||
| 819 | Strange Addition | data structures dp matrices | Statement | F | Educational Codeforces Round 91 (Rated for Div. 2) {1380} | PROGRAMMING | Educational Codeforces Round 91 Editorial | ||
| 2214 | Merging Towers | data structures ds implementation trees | Statement | E | Educational Codeforces Round 91 (Rated for Div. 2) {1380} | PROGRAMMING | Educational Codeforces Round 91 Editorial | ||
| 21070 | Create The Teams | dp greedy sortings | Statement | C | Educational Codeforces Round 91 (Rated for Div. 2) {1380} | PROGRAMMING | Educational Codeforces Round 91 Editorial | ||
| 832 | Circular Dungeon | greedy math probabilities | Statement | G | Educational Codeforces Round 91 (Rated for Div. 2) {1380} | PROGRAMMING | Educational Codeforces Round 91 Editorial | ||
| 4743 | Berserk And Fireball | brute force greedy math | Statement | D | Educational Codeforces Round 91 (Rated for Div. 2) {1380} | PROGRAMMING | Educational Codeforces Round 91 Editorial | ||
| 20738 | Prefix Flip (Easy Version) | constructive algorithms data structures strings | Statement | A1 | Codeforces Round 658 (Div. 1) {1381} | PROGRAMMING | 500.0 | Codeforces Round #658 Editorial | 1300 |
| 13460 | Prefix Flip (Hard Version) | constructive algorithms data structures strings two pointers | Statement | A2 | Codeforces Round 658 (Div. 1) {1381} | PROGRAMMING | 500.0 | Codeforces Round #658 Editorial | 1700 |
| 9028 | Unmerge | combinatorics dp two pointers | Statement | B | Codeforces Round 658 (Div. 1) {1381} | PROGRAMMING | 1500.0 | Codeforces Round #658 Editorial | 1800 |
| 1646 | Mastermind | constructive algorithms greedy implementation sortings | Statement | C | Codeforces Round 658 (Div. 1) {1381} | PROGRAMMING | 2000.0 | Codeforces Round #658 Editorial | 2500 |
| 693 | The Majestic Brown Tree Snake | dfs and similar dp greedy trees two pointers | Statement | D | Codeforces Round 658 (Div. 1) {1381} | PROGRAMMING | 2500.0 | Codeforces Round #658 Editorial | 3000 |
| 269 | Origami | geometry math sortings | Statement | E | Codeforces Round 658 (Div. 1) {1381} | PROGRAMMING | 3000.0 | Codeforces Round #658 Editorial | 3300 |
| 24885 | Sequential Nim | games | Statement | B | Codeforces Round 658 (Div. 2) {1382} | PROGRAMMING | 1250.0 | Codeforces Round #658 Editorial | 1100 |
| 26665 | Common Subsequence | brute force | Statement | A | Codeforces Round 658 (Div. 2) {1382} | PROGRAMMING | 500.0 | Codeforces Round #658 Editorial | 800 |
| 584 | String Transformation 2 | dp graphs trees | Statement | C | Codeforces Round 659 (Div. 1) {1383} | PROGRAMMING | 1750.0 | Codeforces Round #659 Editorial | |
| 10761 | String Transformation 1 | ds graphs greedy sortings strings trees | Statement | A | Codeforces Round 659 (Div. 1) {1383} | PROGRAMMING | 1000.0 | Codeforces Round #659 Editorial | |
| 798 | Strange Operation | data structures dp | Statement | E | Codeforces Round 659 (Div. 1) {1383} | PROGRAMMING | 2000.0 | Codeforces Round #659 Editorial | |
| 374 | Special Edges | flows graphs | Statement | F | Codeforces Round 659 (Div. 1) {1383} | PROGRAMMING | 2250.0 | Codeforces Round #659 Editorial | |
| 694 | Rearrange | brute force constructive algorithms graphs greedy sortings | Statement | D | Codeforces Round 659 (Div. 1) {1383} | PROGRAMMING | 1750.0 | Codeforces Round #659 Editorial | |
| 5150 | GameGame | bitmasks constructive algorithms dp games greedy math | Statement | B | Codeforces Round 659 (Div. 1) {1383} | PROGRAMMING | 1000.0 | Codeforces Round #659 Editorial | |
| 2520 | Koa and the Beach (Hard Version) | constructive algorithms greedy | Statement | B2 | Codeforces Round 659 (Div. 2) {1384} | PROGRAMMING | 750.0 | Codeforces Round #659 Editorial | |
| 3955 | Koa and the Beach (Easy Version) | dp greedy | Statement | B1 | Codeforces Round 659 (Div. 2) {1384} | PROGRAMMING | 500.0 | Codeforces Round #659 Editorial | |
| 18960 | Common Prefixes | constructive algorithms greedy strings | Statement | A | Codeforces Round 659 (Div. 2) {1384} | PROGRAMMING | 500.0 | Codeforces Round #659 Editorial | |
| 27365 | Make It Good | binary search greedy | Statement | C | Codeforces Round 656 (Div. 3) {1385} | PROGRAMMING | Codeforces Round #656 (Div. 3) Editorial | 1200 | |
| 19652 | a-Good String | bitmasks brute force divide and conquer dp implementation | Statement | D | Codeforces Round 656 (Div. 3) {1385} | PROGRAMMING | Codeforces Round #656 (Div. 3) Editorial | 1500 | |
| 7672 | Directing Edges | dfs and similar graphs | Statement | E | Codeforces Round 656 (Div. 3) {1385} | PROGRAMMING | Codeforces Round #656 (Div. 3) Editorial | 2000 | |
| 2614 | Removing Leaves | data structures dfs and similar divide and conquer greedy implementation trees | Statement | F | Codeforces Round 656 (Div. 3) {1385} | PROGRAMMING | Codeforces Round #656 (Div. 3) Editorial | 2300 | |
| 1583 | Columns Swaps | 2-sat dfs and similar ds graphs implementation | Statement | G | Codeforces Round 656 (Div. 3) {1385} | PROGRAMMING | Codeforces Round #656 (Div. 3) Editorial | 2300 | |
| 39969 | Three Pairwise Maximums | math | Statement | A | Codeforces Round 656 (Div. 3) {1385} | PROGRAMMING | Codeforces Round #656 (Div. 3) Editorial | 800 | |
| 37636 | Restore the Permutation by Merger | greedy | Statement | B | Codeforces Round 656 (Div. 3) {1385} | PROGRAMMING | Codeforces Round #656 (Div. 3) Editorial | 800 | |
| 125 | Mixture | *special data structures geometry math sortings | Statement | B | Baltic Olympiad in Informatics 2020, Day 1 (IOI, Unofficial Mirror Contest, Unrated) {1386} | PROGRAMMING | T | ||
| 574 | Joker | *special bitmasks data structures divide and conquer ds | Statement | C | Baltic Olympiad in Informatics 2020, Day 1 (IOI, Unofficial Mirror Contest, Unrated) {1386} | PROGRAMMING | T | ||
| 310 | Colors | *special binary search constructive algorithms interactive | Statement | A | Baltic Olympiad in Informatics 2020, Day 1 (IOI, Unofficial Mirror Contest, Unrated) {1386} | PROGRAMMING | T | ||
| 145 | Viruses | *special | Statement | C | Baltic Olympiad in Informatics 2020, Day 2 (IOI, Unofficial Mirror Contest, Unrated) {1387} | PROGRAMMING | |||
| 1542 | Village (Minimum) | *special greedy | Statement | B1 | Baltic Olympiad in Informatics 2020, Day 2 (IOI, Unofficial Mirror Contest, Unrated) {1387} | PROGRAMMING | T | ||
| 964 | Village (Maximum) | *special | Statement | B2 | Baltic Olympiad in Informatics 2020, Day 2 (IOI, Unofficial Mirror Contest, Unrated) {1387} | PROGRAMMING | T | ||
| 755 | Graph | *special dfs and similar dp math | Statement | A | Baltic Olympiad in Informatics 2020, Day 2 (IOI, Unofficial Mirror Contest, Unrated) {1387} | PROGRAMMING | T | ||
| 22384 | Captain Flint and a Long Voyage | greedy math | Statement | B | Codeforces Round 660 (Div. 2) {1388} | PROGRAMMING | 1000.0 | Codeforces Round #660 Editorial | 1000 |
| 9839 | Uncle Bogdan and Country Happiness | dfs and similar dp greedy math trees | Statement | C | Codeforces Round 660 (Div. 2) {1388} | PROGRAMMING | 1500.0 | Codeforces Round #660 Editorial | 1800 |
| 6507 | Captain Flint and Treasure | data structures dfs and similar dp graphs greedy implementation trees | Statement | D | Codeforces Round 660 (Div. 2) {1388} | PROGRAMMING | 2000.0 | Codeforces Round #660 Editorial | 2000 |
| 595 | Uncle Bogdan and Projections | data structures geometry sortings | Statement | E | Codeforces Round 660 (Div. 2) {1388} | PROGRAMMING | 2750.0 | Codeforces Round #660 Editorial | 2700 |
| 25093 | Captain Flint and Crew Recruitment | brute force math number theory | Statement | A | Codeforces Round 660 (Div. 2) {1388} | PROGRAMMING | 750.0 | Codeforces Round #660 Editorial | 800 |
| 4360 | Segment Intersections | binary search brute force greedy implementation math | Statement | D | Educational Codeforces Round 92 (Rated for Div. 2) {1389} | PROGRAMMING | 80809 | ||
| 42895 | LCM Problem | constructive algorithms greedy math number theory | Statement | A | Educational Codeforces Round 92 (Rated for Div. 2) {1389} | PROGRAMMING | 80809 | ||
| 19267 | Good String | brute force dp greedy implementation two pointers | Statement | C | Educational Codeforces Round 92 (Rated for Div. 2) {1389} | PROGRAMMING | 80809 | ||
| 404 | Directing Edges | dfs and similar dp graphs greedy trees | Statement | G | Educational Codeforces Round 92 (Rated for Div. 2) {1389} | PROGRAMMING | 80809 | ||
| 3490 | Calendar Ambiguity | math number theory | Statement | E | Educational Codeforces Round 92 (Rated for Div. 2) {1389} | PROGRAMMING | 80809 | ||
| 1060 | Bicolored Segments | data structures dp graph matchings greedy sortings | Statement | F | Educational Codeforces Round 92 (Rated for Div. 2) {1389} | PROGRAMMING | 80809 | ||
| 17258 | Array Walk | dp greedy math | Statement | B | Educational Codeforces Round 92 (Rated for Div. 2) {1389} | PROGRAMMING | 80809 | ||
| 24538 | Suborrays | constructive algorithms math | Statement | A | Codeforces Round 663 (Div. 2) {1391} | PROGRAMMING | 500.0 | Codeforces Round #663 (Div. 2) Editorial | |
| 1737 | Pairs of Pairs | constructive algorithms dfs and similar graphs trees | Statement | E | Codeforces Round 663 (Div. 2) {1391} | PROGRAMMING | 2750.0 | Codeforces Round #663 (Div. 2) Editorial | |
| 27813 | Fix You | brute force greedy implementation | Statement | B | Codeforces Round 663 (Div. 2) {1391} | PROGRAMMING | 750.0 | Codeforces Round #663 (Div. 2) Editorial | |
| 15180 | Cyclic Permutations | combinatorics graphs math | Statement | C | Codeforces Round 663 (Div. 2) {1391} | PROGRAMMING | 1250.0 | Codeforces Round #663 (Div. 2) Editorial | |
| 5385 | 505 | bitmasks brute force dp implementation | Statement | D | Codeforces Round 663 (Div. 2) {1391} | PROGRAMMING | 2000.0 | Codeforces Round #663 (Div. 2) Editorial | |
| 799 | ZS Shuffles Cards | combinatorics math probabilities | Statement | H | Codeforces Global Round 10 {1392} | PROGRAMMING | 3500.0 | Codeforces Global Round 10 — Editorial | |
| 19006 | Omkar and Waterslide | greedy implementation | Statement | C | Codeforces Global Round 10 {1392} | PROGRAMMING | 1000.0 | Codeforces Global Round 10 — Editorial | |
| 521 | Omkar and Pies | bitmasks dfs and similar dp math | Statement | G | Codeforces Global Round 10 {1392} | PROGRAMMING | 3000.0 | Codeforces Global Round 10 — Editorial | |
| 20895 | Omkar and Password | greedy | Statement | A | Codeforces Global Round 10 {1392} | PROGRAMMING | 500.0 | Codeforces Global Round 10 — Editorial | |
| 2195 | Omkar and Landslide | binary search constructive algorithms greedy math | Statement | F | Codeforces Global Round 10 {1392} | PROGRAMMING | 2500.0 | Codeforces Global Round 10 — Editorial | |
| 18560 | Omkar and Infinity Clock | implementation math | Statement | B | Codeforces Global Round 10 {1392} | PROGRAMMING | 750.0 | Codeforces Global Round 10 — Editorial | |
| 3591 | Omkar and Duck | bitmasks constructive algorithms interactive math | Statement | E | Codeforces Global Round 10 {1392} | PROGRAMMING | 2000.0 | Codeforces Global Round 10 — Editorial | |
| 9123 | Omkar and Bed Wars | constructive algorithms dp greedy math strings | Statement | D | Codeforces Global Round 10 {1392} | PROGRAMMING | 1500.0 | Codeforces Global Round 10 — Editorial | |
| 206 | Kevin and Grid | fft graphs math | Statement | I | Codeforces Global Round 10 {1392} | PROGRAMMING | 4000.0 | Codeforces Global Round 10 — Editorial | |
| 382 | Twilight and Ancient Scroll (harder version) | dp implementation string suffix structures strings | Statement | E2 | Codeforces Round 662 (Div. 2) {1393} | PROGRAMMING | 1500.0 | Codeforces Round #662 Editorial | |
| 393 | Twilight and Ancient Scroll (easier version) | dp hashing implementation string suffix structures strings | Statement | E1 | Codeforces Round 662 (Div. 2) {1393} | PROGRAMMING | 1500.0 | Codeforces Round #662 Editorial | |
| 4035 | Rarity and New Dress | data structures dp graphs implementation | Statement | D | Codeforces Round 662 (Div. 2) {1393} | PROGRAMMING | 1750.0 | Codeforces Round #662 Editorial | |
| 20593 | Rainbow Dash, Fluttershy and Chess Coloring | greedy math | Statement | A | Codeforces Round 662 (Div. 2) {1393} | PROGRAMMING | 500.0 | Codeforces Round #662 Editorial | |
| 10704 | Pinkie Pie Eats Patty-cakes | binary search constructive algorithms data structures greedy math sortings | Statement | C | Codeforces Round 662 (Div. 2) {1393} | PROGRAMMING | 1500.0 | Codeforces Round #662 Editorial | |
| 16865 | Applejack and Storages | data structures greedy implementation | Statement | B | Codeforces Round 662 (Div. 2) {1393} | PROGRAMMING | 1000.0 | Codeforces Round #662 Editorial | |
| 6855 | Boboniu Chats with Du | brute force dp greedy sortings two pointers | Statement | A | Codeforces Round 664 (Div. 1) {1394} | PROGRAMMING | 500.0 | Codeforces Round #664 Editorial | 1800 |
| 2045 | Boboniu Walks on Graph | brute force graphs hashing implementation meet-in-the-middle | Statement | B | Codeforces Round 664 (Div. 1) {1394} | PROGRAMMING | 1000.0 | Codeforces Round #664 Editorial | 2300 |
| 1130 | Boboniu and String | binary search geometry ternary search | Statement | C | Codeforces Round 664 (Div. 1) {1394} | PROGRAMMING | 1500.0 | Codeforces Round #664 Editorial | 2600 |
| 1044 | Boboniu and Jianghu | dp greedy sortings trees | Statement | D | Codeforces Round 664 (Div. 1) {1394} | PROGRAMMING | 1750.0 | Codeforces Round #664 Editorial | 2800 |
| 152 | Boboniu and Banknote Collection | Statement | E | Codeforces Round 664 (Div. 1) {1394} | PROGRAMMING | 2500.0 | Codeforces Round #664 Editorial | 3500 | |
| 24385 | Boboniu Likes to Color Balls | brute force | Statement | A | Codeforces Round 664 (Div. 2) {1395} | PROGRAMMING | 500.0 | Codeforces Round #664 Editorial | 1000 |
| 16110 | Boboniu Plays Chess | constructive algorithms | Statement | B | Codeforces Round 664 (Div. 2) {1395} | PROGRAMMING | 750.0 | Codeforces Round #664 Editorial | 1100 |
| 14315 | Boboniu and Bit Operations | bitmasks brute force dp | Statement | C | Codeforces Round 664 (Div. 2) {1395} | PROGRAMMING | 1000.0 | Codeforces Round #664 Editorial | 1600 |
| 11586 | Stoned Game | brute force constructive algorithms games greedy | Statement | B | Codeforces Round 666 (Div. 1) {1396} | PROGRAMMING | 1000.0 | Codeforces Round #666 — Editorial | |
| 312 | Rainbow Rectangles | data structures | Statement | D | Codeforces Round 666 (Div. 1) {1396} | PROGRAMMING | 2250.0 | Codeforces Round #666 — Editorial | |
| 15686 | Multiples of Length | constructive algorithms greedy number theory | Statement | A | Codeforces Round 666 (Div. 1) {1396} | PROGRAMMING | 500.0 | Codeforces Round #666 — Editorial | |
| 2640 | Monster Invaders | dp greedy | Statement | C | Codeforces Round 666 (Div. 1) {1396} | PROGRAMMING | 1750.0 | Codeforces Round #666 — Editorial | |
| 356 | Distance Matching | binary search constructive algorithms dfs and similar trees | Statement | E | Codeforces Round 666 (Div. 1) {1396} | PROGRAMMING | 2500.0 | Codeforces Round #666 — Editorial | |
| 14886 | Power Sequence | binary search brute force math number theory ternary search | Statement | B | Codeforces Round 666 (Div. 2) {1397} | PROGRAMMING | 1000.0 | Codeforces Round #666 — Editorial | |
| 28842 | Juggling Letters | greedy strings | Statement | A | Codeforces Round 666 (Div. 2) {1397} | PROGRAMMING | 500.0 | Codeforces Round #666 — Editorial | |
| 2449 | Two Types of Spells | binary search data structures greedy implementation math sortings | Statement | E | Educational Codeforces Round 93 (Rated for Div. 2) {1398} | PROGRAMMING | Educational Codeforces Round 93 Editorial |