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 ... 60 61 62 63 64 ... 100 101 102 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 33404 | Similar Pairs | constructive algorithms graph matchings greedy sortings | Statement | C | Codeforces Round 644 (Div. 3) {1360} | PROGRAMMING | Codeforces Round #644 (Div. 3) Editorial | 1100 | |
| 25875 | Polygon | dp graphs implementation shortest paths | Statement | E | Codeforces Round 644 (Div. 3) {1360} | PROGRAMMING | Codeforces Round #644 (Div. 3) Editorial | 1300 | |
| 34453 | Buying Shovels | math number theory | Statement | D | Codeforces Round 644 (Div. 3) {1360} | PROGRAMMING | Codeforces Round #644 (Div. 3) Editorial | 1300 | |
| 12619 | Spy-string | bitmasks brute force constructive algorithms dp hashing strings | Statement | F | Codeforces Round 644 (Div. 3) {1360} | PROGRAMMING | Codeforces Round #644 (Div. 3) Editorial | 1700 | |
| 7895 | A/B Matrix | constructive algorithms flows greedy math number theory | Statement | G | Codeforces Round 644 (Div. 3) {1360} | PROGRAMMING | Codeforces Round #644 (Div. 3) Editorial | 1900 | |
| 4643 | Binary Median | bitmasks brute force constructive algorithms | Statement | H | Codeforces Round 644 (Div. 3) {1360} | PROGRAMMING | Codeforces Round #644 (Div. 3) Editorial | 2100 | |
| 52231 | Minimal Square | greedy math | Statement | A | Codeforces Round 644 (Div. 3) {1360} | PROGRAMMING | Codeforces Round #644 (Div. 3) Editorial | 800 | |
| 48968 | Honest Coach | greedy sortings | Statement | B | Codeforces Round 644 (Div. 3) {1360} | PROGRAMMING | Codeforces Round #644 (Div. 3) Editorial | 800 | |
| 8487 | Johnny and Contribution | constructive algorithms graphs greedy sortings | Statement | A | Codeforces Round 647 (Div. 1) - Thanks, Algo Muse! {1361} | PROGRAMMING | 500.0 | Codeforces Round #647 Editorial | 1700 |
| 3714 | Johnny and Grandmaster | greedy implementation math sortings | Statement | B | Codeforces Round 647 (Div. 1) - Thanks, Algo Muse! {1361} | PROGRAMMING | 1250.0 | Codeforces Round #647 Editorial | 1900 |
| 1668 | Johnny and Megan's Necklace | binary search bitmasks constructive algorithms dfs and similar ds graphs | Statement | C | Codeforces Round 647 (Div. 1) - Thanks, Algo Muse! {1361} | PROGRAMMING | 2000.0 | Codeforces Round #647 Editorial | 2500 |
| 323 | Johnny and James | greedy implementation math trees | Statement | D | Codeforces Round 647 (Div. 1) - Thanks, Algo Muse! {1361} | PROGRAMMING | 2500.0 | Codeforces Round #647 Editorial | 2900 |
| 716 | James and the Chase | dfs and similar graphs probabilities trees | Statement | E | Codeforces Round 647 (Div. 1) - Thanks, Algo Muse! {1361} | PROGRAMMING | 3000.0 | Codeforces Round #647 Editorial | 3000 |
| 156 | Johnny and New Toy | data structures implementation math | Statement | F | Codeforces Round 647 (Div. 1) - Thanks, Algo Muse! {1361} | PROGRAMMING | 3500.0 | Codeforces Round #647 Editorial | 3300 |
| 25148 | Johnny and Ancient Computer | implementation | Statement | A | Codeforces Round 647 (Div. 2) - Thanks, Algo Muse! {1362} | PROGRAMMING | 500.0 | Codeforces Round #647 Editorial | 1000 |
| 19651 | Johnny and His Hobbies | bitmasks brute force | Statement | B | Codeforces Round 647 (Div. 2) - Thanks, Algo Muse! {1362} | PROGRAMMING | 1000.0 | Codeforces Round #647 Editorial | 1200 |
| 19043 | Johnny and Another Rating Drop | bitmasks greedy math | Statement | C | Codeforces Round 647 (Div. 2) - Thanks, Algo Muse! {1362} | PROGRAMMING | 1500.0 | Codeforces Round #647 Editorial | 1400 |
| 36695 | Odd Selection | brute force implementation math | Statement | A | Codeforces Round 646 (Div. 2) {1363} | PROGRAMMING | 500.0 | 78202 | 1200 |
| 24031 | Subsequence Hate | implementation strings | Statement | B | Codeforces Round 646 (Div. 2) {1363} | PROGRAMMING | 1000.0 | 78202 | 1400 |
| 19160 | Game On Leaves | games trees | Statement | C | Codeforces Round 646 (Div. 2) {1363} | PROGRAMMING | 1500.0 | 78202 | 1600 |
| 6912 | Tree Shuffling | dfs and similar dp ds greedy trees | Statement | E | Codeforces Round 646 (Div. 2) {1363} | PROGRAMMING | 2250.0 | 78202 | 2000 |
| 4120 | Guess The Maximums | binary search divide and conquer implementation interactive math | Statement | D | Codeforces Round 646 (Div. 2) {1363} | PROGRAMMING | 2000.0 | 78202 | 2100 |
| 1567 | Rotating Substrings | dp strings | Statement | F | Codeforces Round 646 (Div. 2) {1363} | PROGRAMMING | 3000.0 | 78202 | 2600 |
| 28736 | XXXXX | brute force data structures number theory two pointers | Statement | A | Codeforces Round 649 (Div. 2) {1364} | PROGRAMMING | 750.0 | Codeforces round #649 editorial | 1200 |
| 20544 | Most socially-distanced subsequence | greedy two pointers | Statement | B | Codeforces Round 649 (Div. 2) {1364} | PROGRAMMING | 1000.0 | Codeforces round #649 editorial | 1300 |
| 13370 | Ehab and Prefix MEXs | brute force constructive algorithms greedy | Statement | C | Codeforces Round 649 (Div. 2) {1364} | PROGRAMMING | 1500.0 | Codeforces round #649 editorial | 1600 |
| 4485 | Ehab's Last Corollary | constructive algorithms data structures dfs and similar dp graphs implementation trees | Statement | D | Codeforces Round 649 (Div. 2) {1364} | PROGRAMMING | 2000.0 | Codeforces round #649 editorial | 2100 |
| 1452 | X-OR | bitmasks constructive algorithms interactive probabilities | Statement | E | Codeforces Round 649 (Div. 2) {1364} | PROGRAMMING | 2500.0 | Codeforces round #649 editorial | 2700 |
| 24302 | Matrix Game | games greedy implementation | Statement | A | Codeforces Round 648 (Div. 2) {1365} | PROGRAMMING | 500.0 | Editorial — Codeforces Round #648 | 1100 |
| 27261 | Trouble Sort | constructive algorithms implementation | Statement | B | Codeforces Round 648 (Div. 2) {1365} | PROGRAMMING | 750.0 | Editorial — Codeforces Round #648 | 1300 |
| 23471 | Rotation Matching | constructive algorithms data structures greedy implementation | Statement | C | Codeforces Round 648 (Div. 2) {1365} | PROGRAMMING | 1250.0 | Editorial — Codeforces Round #648 | 1400 |
| 17901 | Solve The Maze | constructive algorithms dfs and similar ds graphs greedy implementation shortest paths | Statement | D | Codeforces Round 648 (Div. 2) {1365} | PROGRAMMING | 1500.0 | Editorial — Codeforces Round #648 | 1700 |
| 7947 | Maximum Subsequence Value | brute force constructive algorithms | Statement | E | Codeforces Round 648 (Div. 2) {1365} | PROGRAMMING | 2000.0 | Editorial — Codeforces Round #648 | 1900 |
| 4505 | Swaps Again | constructive algorithms implementation sortings | Statement | F | Codeforces Round 648 (Div. 2) {1365} | PROGRAMMING | 2500.0 | Editorial — Codeforces Round #648 | 2100 |
| 1189 | Secure Password | bitmasks combinatorics constructive algorithms interactive math | Statement | G | Codeforces Round 648 (Div. 2) {1365} | PROGRAMMING | 3000.0 | Editorial — Codeforces Round #648 | 2800 |
| 10822 | Two Divisors | constructive algorithms math number theory | Statement | D | Educational Codeforces Round 89 (Rated for Div. 2) {1366} | PROGRAMMING | Educational Codeforces Round 89 Editorial | ||
| 4328 | Two Arrays | binary search brute force combinatorics dp greedy implementation two pointers | Statement | E | Educational Codeforces Round 89 (Rated for Div. 2) {1366} | PROGRAMMING | Educational Codeforces Round 89 Editorial | ||
| 21778 | Shuffle | math two pointers | Statement | B | Educational Codeforces Round 89 (Rated for Div. 2) {1366} | PROGRAMMING | Educational Codeforces Round 89 Editorial | ||
| 30732 | Shovels and Swords | binary search greedy math | Statement | A | Educational Codeforces Round 89 (Rated for Div. 2) {1366} | PROGRAMMING | Educational Codeforces Round 89 Editorial | ||
| 13669 | Palindromic Paths | ds greedy math | Statement | C | Educational Codeforces Round 89 (Rated for Div. 2) {1366} | PROGRAMMING | Educational Codeforces Round 89 Editorial | ||
| 833 | Jog Around The Graph | binary search dp geometry graphs | Statement | F | Educational Codeforces Round 89 (Rated for Div. 2) {1366} | PROGRAMMING | Educational Codeforces Round 89 Editorial | ||
| 568 | Construct the String | dp strings | Statement | G | Educational Codeforces Round 89 (Rated for Div. 2) {1366} | PROGRAMMING | Educational Codeforces Round 89 Editorial | ||
| 8426 | Task On The Board | constructive algorithms greedy implementation sortings | Statement | D | Codeforces Round 650 (Div. 3) {1367} | PROGRAMMING | Codeforces Round #650 (Div. 3) Editorial | ||
| 23830 | Social Distance | constructive algorithms greedy math | Statement | C | Codeforces Round 650 (Div. 3) {1367} | PROGRAMMING | Codeforces Round #650 (Div. 3) Editorial | ||
| 58964 | Short Substrings | implementation strings | Statement | A | Codeforces Round 650 (Div. 3) {1367} | PROGRAMMING | Codeforces Round #650 (Div. 3) Editorial | ||
| 5529 | Necklace Assembly | binary search brute force dp greedy number theory | Statement | E | Codeforces Round 650 (Div. 3) {1367} | PROGRAMMING | Codeforces Round #650 (Div. 3) Editorial | ||
| 1699 | Flying Sort (Hard Version) | binary search dp greedy two pointers | Statement | F2 | Codeforces Round 650 (Div. 3) {1367} | PROGRAMMING | Codeforces Round #650 (Div. 3) Editorial | ||
| 3333 | Flying Sort (Easy Version) | dp greedy two pointers | Statement | F1 | Codeforces Round 650 (Div. 3) {1367} | PROGRAMMING | Codeforces Round #650 (Div. 3) Editorial | ||
| 55418 | Even Array | greedy math | Statement | B | Codeforces Round 650 (Div. 3) {1367} | PROGRAMMING | Codeforces Round #650 (Div. 3) Editorial | ||
| 2245 | Ski Accidents | constructive algorithms dfs and similar greedy | Statement | E | Codeforces Global Round 8 {1368} | PROGRAMMING | 2500.0 | Codeforces Global Round 8: editorial | |
| 614 | Shifting Dominoes | data structures geometry graphs trees | Statement | G | Codeforces Global Round 8 {1368} | PROGRAMMING | 3500.0 | Codeforces Global Round 8: editorial | |
| 1059 | Lamps on a Circle | games greedy implementation interactive math | Statement | F | Codeforces Global Round 8 {1368} | PROGRAMMING | 3000.0 | Codeforces Global Round 8: editorial | |
| 13558 | Even Picture | constructive algorithms | Statement | C | Codeforces Global Round 8 {1368} | PROGRAMMING | 1500.0 | Codeforces Global Round 8: editorial | |
| 20055 | Codeforces Subsequences | brute force constructive algorithms greedy math strings | Statement | B | Codeforces Global Round 8 {1368} | PROGRAMMING | 1000.0 | Codeforces Global Round 8: editorial | |
| 40630 | C+= | brute force greedy math | Statement | A | Codeforces Global Round 8 {1368} | PROGRAMMING | 500.0 | Codeforces Global Round 8: editorial | |
| 235 | Breadboard Capacity (hard version) | Statement | H2 | Codeforces Global Round 8 {1368} | PROGRAMMING | 1500.0 | Codeforces Global Round 8: editorial | ||
| 365 | Breadboard Capacity (easy version) | Statement | H1 | Codeforces Global Round 8 {1368} | PROGRAMMING | 3000.0 | Codeforces Global Round 8: editorial | ||
| 12078 | AND, OR and square sum | bitmasks greedy math | Statement | D | Codeforces Global Round 8 {1368} | PROGRAMMING | 1750.0 | Codeforces Global Round 8: editorial | |
| 24655 | AccurateLee | greedy implementation strings | Statement | B | Codeforces Round 652 (Div. 2) {1369} | PROGRAMMING | 1000.0 | Codeforces Round #652 (Div. 2) Editorial | 1200 |
| 19793 | RationalLee | greedy math sortings | Statement | C | Codeforces Round 652 (Div. 2) {1369} | PROGRAMMING | 1500.0 | Codeforces Round #652 (Div. 2) Editorial | 1400 |
| 8748 | TediousLee | dp graphs greedy math matrices trees | Statement | D | Codeforces Round 652 (Div. 2) {1369} | PROGRAMMING | 2000.0 | Codeforces Round #652 (Div. 2) Editorial | 1900 |
| 2296 | DeadLee | constructive algorithms data structures graphs greedy implementation sortings | Statement | E | Codeforces Round 652 (Div. 2) {1369} | PROGRAMMING | 2500.0 | Codeforces Round #652 (Div. 2) Editorial | 2400 |
| 665 | BareLee | dfs and similar dp games | Statement | F | Codeforces Round 652 (Div. 2) {1369} | PROGRAMMING | 3000.0 | Codeforces Round #652 (Div. 2) Editorial | 2700 |
| 37041 | FashionabLee | geometry math | Statement | A | Codeforces Round 652 (Div. 2) {1369} | PROGRAMMING | 500.0 | Codeforces Round #652 (Div. 2) Editorial | 800 |
| 1519 | The Hidden Pair (Hard Version) | binary search dfs and similar graphs interactive shortest paths trees | Statement | F2 | Codeforces Round 651 (Div. 2) {1370} | PROGRAMMING | 1250.0 | Editorial — Codeforces Round #651 | |
| 1643 | The Hidden Pair (Easy Version) | binary search dfs and similar graphs interactive shortest paths trees | Statement | F1 | Codeforces Round 651 (Div. 2) {1370} | PROGRAMMING | 2000.0 | Editorial — Codeforces Round #651 | |
| 9878 | Odd-Even Subsequence | binary search dp greedy implementation sortings | Statement | D | Codeforces Round 651 (Div. 2) {1370} | PROGRAMMING | 2000.0 | Editorial — Codeforces Round #651 | |
| 25059 | Number Game | games math number theory | Statement | C | Codeforces Round 651 (Div. 2) {1370} | PROGRAMMING | 1500.0 | Editorial — Codeforces Round #651 | |
| 54269 | Maximum GCD | brute force greedy implementation number theory | Statement | A | Codeforces Round 651 (Div. 2) {1370} | PROGRAMMING | 500.0 | Editorial — Codeforces Round #651 | |
| 23928 | GCD Compression | brute force constructive algorithms math number theory | Statement | B | Codeforces Round 651 (Div. 2) {1370} | PROGRAMMING | 1000.0 | Editorial — Codeforces Round #651 | |
| 4946 | Binary Subsequence Rotation | binary search data structures dp greedy implementation | Statement | E | Codeforces Round 651 (Div. 2) {1370} | PROGRAMMING | 2500.0 | Editorial — Codeforces Round #651 | |
| 626 | Raging Thunder | data structures implementation | Statement | F | Codeforces Round 654 (Div. 2) {1371} | PROGRAMMING | 3000.0 | Codeforces Round #654 (Div. 2) Editorial | |
| 47006 | Magical Sticks | math | Statement | A | Codeforces Round 654 (Div. 2) {1371} | PROGRAMMING | 500.0 | Codeforces Round #654 (Div. 2) Editorial | |
| 19256 | Magical Calendar | constructive algorithms math | Statement | B | Codeforces Round 654 (Div. 2) {1371} | PROGRAMMING | 1000.0 | Codeforces Round #654 (Div. 2) Editorial | |
| 13094 | Grid-00100 | constructive algorithms greedy math | Statement | D | Codeforces Round 654 (Div. 2) {1371} | PROGRAMMING | 1500.0 | Codeforces Round #654 (Div. 2) Editorial | |
| 2374 | Asterism (Hard Version) | binary search math number theory sortings | Statement | E2 | Codeforces Round 654 (Div. 2) {1371} | PROGRAMMING | 1250.0 | Codeforces Round #654 (Div. 2) Editorial | |
| 5298 | Asterism (Easy Version) | brute force combinatorics implementation math number theory sortings | Statement | E1 | Codeforces Round 654 (Div. 2) {1371} | PROGRAMMING | 1500.0 | Codeforces Round #654 (Div. 2) Editorial | |
| 20713 | A Cookie for You | constructive algorithms greedy implementation math | Statement | C | Codeforces Round 654 (Div. 2) {1371} | PROGRAMMING | 1250.0 | Codeforces Round #654 (Div. 2) Editorial | |
| 29028 | Omkar and Last Class of Math | constructive algorithms greedy math number theory | Statement | B | Codeforces Round 655 (Div. 2) {1372} | PROGRAMMING | 1000.0 | Codeforces Round #655 Editorial | 1300 |
| 18094 | Omkar and Baseball | constructive algorithms math | Statement | C | Codeforces Round 655 (Div. 2) {1372} | PROGRAMMING | 1500.0 | Codeforces Round #655 Editorial | 1500 |
| 5455 | Omkar and Circle | brute force constructive algorithms dp games greedy | Statement | D | Codeforces Round 655 (Div. 2) {1372} | PROGRAMMING | 2000.0 | Codeforces Round #655 Editorial | 2100 |
| 457 | Omkar and Modes | interactive | Statement | F | Codeforces Round 655 (Div. 2) {1372} | PROGRAMMING | 3000.0 | Codeforces Round #655 Editorial | 2800 |
| 1282 | Omkar and Last Floor | dp two pointers | Statement | E | Codeforces Round 655 (Div. 2) {1372} | PROGRAMMING | 2500.0 | Codeforces Round #655 Editorial | 2900 |
| 32179 | Omkar and Completion | constructive algorithms implementation | Statement | A | Codeforces Round 655 (Div. 2) {1372} | PROGRAMMING | 500.0 | Codeforces Round #655 Editorial | 800 |
| 2774 | Sum of Digits | brute force constructive algorithms dp greedy math number theory | Statement | E | Educational Codeforces Round 90 (Rated for Div. 2) {1373} | PROGRAMMING | Educational Codeforces Round 90 Editorial | ||
| 18521 | Pluses and Minuses | binary search dp greedy implementation math | Statement | C | Educational Codeforces Round 90 (Rated for Div. 2) {1373} | PROGRAMMING | Educational Codeforces Round 90 Editorial | ||
| 819 | Pawns | data structures greedy | Statement | G | Educational Codeforces Round 90 (Rated for Div. 2) {1373} | PROGRAMMING | Educational Codeforces Round 90 Editorial | ||
| 1687 | Network Coverage | binary search data structures flows graph matchings graphs greedy | Statement | F | Educational Codeforces Round 90 (Rated for Div. 2) {1373} | PROGRAMMING | Educational Codeforces Round 90 Editorial | ||
| 15880 | Maximum Sum on Even Positions | data structures dp greedy | Statement | D | Educational Codeforces Round 90 (Rated for Div. 2) {1373} | PROGRAMMING | Educational Codeforces Round 90 Editorial | ||
| 27527 | Donut Shops | greedy implementation math | Statement | A | Educational Codeforces Round 90 (Rated for Div. 2) {1373} | PROGRAMMING | Educational Codeforces Round 90 Editorial | ||
| 37771 | 01 Game | brute force constructive algorithms dp games implementation strings | Statement | B | Educational Codeforces Round 90 (Rated for Div. 2) {1373} | PROGRAMMING | Educational Codeforces Round 90 Editorial | ||
| 24639 | Zero Remainder Array | math sortings two pointers | Statement | D | Codeforces Round 653 (Div. 3) {1374} | PROGRAMMING | 79517 | ||
| 55517 | Required Remainder | math | Statement | A | Codeforces Round 653 (Div. 3) {1374} | PROGRAMMING | 79517 | ||
| 951 | Reading Books (hard version) | binary search data structures greedy sortings ternary search two pointers | Statement | E2 | Codeforces Round 653 (Div. 3) {1374} | PROGRAMMING | 79517 | ||
| 14192 | Reading Books (easy version) | data structures greedy implementation sortings | Statement | E1 | Codeforces Round 653 (Div. 3) {1374} | PROGRAMMING | 79517 | ||
| 53133 | Multiply by 2, divide by 6 | math | Statement | B | Codeforces Round 653 (Div. 3) {1374} | PROGRAMMING | 79517 | ||
| 48977 | Move Brackets | greedy strings | Statement | C | Codeforces Round 653 (Div. 3) {1374} | PROGRAMMING | 79517 | ||
| 1317 | Cyclic Shifts Sorting | brute force constructive algorithms implementation | Statement | F | Codeforces Round 653 (Div. 3) {1374} | PROGRAMMING | 79517 | ||
| 1996 | Tree Modification | dfs and similar greedy trees | Statement | G | Codeforces Global Round 9 {1375} | PROGRAMMING | 2250.0 | 79731 | |
| 18457 | Sign Flipping | constructive algorithms | Statement | A | Codeforces Global Round 9 {1375} | PROGRAMMING | 500.0 | 79731 |