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 ... 58 59 60 61 62 ... 100 101 102 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 12246 | Prefix-Suffix Palindrome (Easy version) | hashing string suffix structures strings | Statement | D1 | Codeforces Global Round 7 {1326} | PROGRAMMING | 1000.0 | 74961 | 1500 |
| 10376 | Prefix-Suffix Palindrome (Hard version) | greedy hashing string suffix structures strings | Statement | D2 | Codeforces Global Round 7 {1326} | PROGRAMMING | 1000.0 | 74961 | 1800 |
| 2210 | Bombs | data structures two pointers | Statement | E | Codeforces Global Round 7 {1326} | PROGRAMMING | 2500.0 | 74961 | 2400 |
| 859 | Wise Men (Easy Version) | bitmasks brute force dp meet-in-the-middle | Statement | F1 | Codeforces Global Round 7 {1326} | PROGRAMMING | 2000.0 | 74961 | 2600 |
| 508 | Wise Men (Hard Version) | bitmasks dp math | Statement | F2 | Codeforces Global Round 7 {1326} | PROGRAMMING | 1500.0 | 74961 | 3200 |
| 86 | Spiderweb Trees | dp geometry trees | Statement | G | Codeforces Global Round 7 {1326} | PROGRAMMING | 4000.0 | 74961 | 3600 |
| 24311 | Maximums | implementation math | Statement | B | Codeforces Global Round 7 {1326} | PROGRAMMING | 1000.0 | 74961 | 900 |
| 40025 | Sum of Odd Integers | math | Statement | A | Educational Codeforces Round 84 (Rated for Div. 2) {1327} | PROGRAMMING | Educational Codeforces Round 84 Editorial | 1100 | |
| 18826 | Princesses and Princes | brute force graphs greedy | Statement | B | Educational Codeforces Round 84 (Rated for Div. 2) {1327} | PROGRAMMING | Educational Codeforces Round 84 Editorial | 1300 | |
| 13534 | Game with Chips | constructive algorithms | Statement | C | Educational Codeforces Round 84 (Rated for Div. 2) {1327} | PROGRAMMING | Educational Codeforces Round 84 Editorial | 1600 | |
| 9065 | Count The Blocks | combinatorics dp math | Statement | E | Educational Codeforces Round 84 (Rated for Div. 2) {1327} | PROGRAMMING | Educational Codeforces Round 84 Editorial | 1800 | |
| 3325 | Infinite Path | brute force dfs and similar graphs math number theory | Statement | D | Educational Codeforces Round 84 (Rated for Div. 2) {1327} | PROGRAMMING | Educational Codeforces Round 84 Editorial | 2200 | |
| 1720 | AND Segments | bitmasks combinatorics data structures dp two pointers | Statement | F | Educational Codeforces Round 84 (Rated for Div. 2) {1327} | PROGRAMMING | Educational Codeforces Round 84 Editorial | 2500 | |
| 436 | Letters and Question Marks | bitmasks dp string suffix structures | Statement | G | Educational Codeforces Round 84 (Rated for Div. 2) {1327} | PROGRAMMING | Educational Codeforces Round 84 Editorial | 2900 | |
| 30995 | Ternary XOR | greedy implementation | Statement | C | Codeforces Round 629 (Div. 3) {1328} | PROGRAMMING | 75246 | 1200 | |
| 29559 | K-th Beautiful String | combinatorics implementation math | Statement | B | Codeforces Round 629 (Div. 3) {1328} | PROGRAMMING | 75246 | 1300 | |
| 13475 | Carousel | greedy math | Statement | D | Codeforces Round 629 (Div. 3) {1328} | PROGRAMMING | 75246 | 1800 | |
| 9946 | Tree Queries | dfs and similar graphs trees | Statement | E | Codeforces Round 629 (Div. 3) {1328} | PROGRAMMING | 75246 | 2100 | |
| 3299 | Make k Equal | dp greedy | Statement | F | Codeforces Round 629 (Div. 3) {1328} | PROGRAMMING | 75246 | 2400 | |
| 107917 | Divisibility Problem | math | Statement | A | Codeforces Round 629 (Div. 3) {1328} | PROGRAMMING | 75246 | 800 | |
| 9217 | Dreamoon Likes Coloring | constructive algorithms greedy implementation math | Statement | A | Codeforces Round 631 (Div. 1) - Thanks, Denis aramis Shitov! {1329} | PROGRAMMING | 500.0 | Codeforces Round #631 Editorial | 1800 |
| 6742 | Dreamoon Likes Sequences | bitmasks combinatorics dp math | Statement | B | Codeforces Round 631 (Div. 1) - Thanks, Denis aramis Shitov! {1329} | PROGRAMMING | 750.0 | Codeforces Round #631 Editorial | 1900 |
| 1723 | Drazil Likes Heap | constructive algorithms data structures greedy implementation sortings | Statement | C | Codeforces Round 631 (Div. 1) - Thanks, Denis aramis Shitov! {1329} | PROGRAMMING | 1500.0 | Codeforces Round #631 Editorial | 2400 |
| 481 | Dreamoon Likes Strings | constructive algorithms data structures | Statement | D | Codeforces Round 631 (Div. 1) - Thanks, Denis aramis Shitov! {1329} | PROGRAMMING | 2000.0 | Codeforces Round #631 Editorial | 3000 |
| 189 | Dreamoon Loves AA | binary search greedy | Statement | E | Codeforces Round 631 (Div. 1) - Thanks, Denis aramis Shitov! {1329} | PROGRAMMING | 2500.0 | Codeforces Round #631 Editorial | 3300 |
| 18908 | Dreamoon and Ranking Collection | implementation | Statement | A | Codeforces Round 631 (Div. 2) - Thanks, Denis aramis Shitov! {1330} | PROGRAMMING | 500.0 | Codeforces Round #631 Editorial | 1000 |
| 14141 | Dreamoon Likes Permutations | implementation math | Statement | B | Codeforces Round 631 (Div. 2) - Thanks, Denis aramis Shitov! {1330} | PROGRAMMING | 1000.0 | Codeforces Round #631 Editorial | 1400 |
| 506 | Lingua Romana | Statement | G | April Fools Day Contest 2020 {1331} | PROGRAMMING | April Fools Day Contest 2020: editorial | |||
| 7023 | Limericks | math number theory | Statement | B | April Fools Day Contest 2020 {1331} | PROGRAMMING | April Fools Day Contest 2020: editorial | ||
| 1215 | Jordan Smiley | dfs and similar geometry implementation | Statement | E | April Fools Day Contest 2020 {1331} | PROGRAMMING | April Fools Day Contest 2020: editorial | ||
| 629 | It's showtime | Statement | H | April Fools Day Contest 2020 {1331} | PROGRAMMING | April Fools Day Contest 2020: editorial | |||
| 17158 | Is it rated? | Statement | A | April Fools Day Contest 2020 {1331} | PROGRAMMING | April Fools Day Contest 2020: editorial | |||
| 569 | Elementary! | brute force dp strings | Statement | F | April Fools Day Contest 2020 {1331} | PROGRAMMING | April Fools Day Contest 2020: editorial | ||
| 3164 | ...And after happily lived ever they | bitmasks | Statement | C | April Fools Day Contest 2020 {1331} | PROGRAMMING | April Fools Day Contest 2020: editorial | ||
| 11975 | Again? | implementation | Statement | D | April Fools Day Contest 2020 {1331} | PROGRAMMING | April Fools Day Contest 2020: editorial | ||
| 19474 | Exercising Walk | greedy implementation math | Statement | A | Codeforces Round 630 (Div. 2) {1332} | PROGRAMMING | 500.0 | Codeforces Round #630 Editorial | 1200 |
| 17131 | K-Complete Word | dfs and similar ds greedy implementation strings | Statement | C | Codeforces Round 630 (Div. 2) {1332} | PROGRAMMING | 1250.0 | Codeforces Round #630 Editorial | 1500 |
| 17850 | Composite Coloring | brute force constructive algorithms greedy math number theory | Statement | B | Codeforces Round 630 (Div. 2) {1332} | PROGRAMMING | 1000.0 | Codeforces Round #630 Editorial | 1500 |
| 8223 | Walk on Matrix | bitmasks constructive algorithms math | Statement | D | Codeforces Round 630 (Div. 2) {1332} | PROGRAMMING | 1250.0 | Codeforces Round #630 Editorial | 1700 |
| 3900 | Height All the Same | combinatorics constructive algorithms math matrices | Statement | E | Codeforces Round 630 (Div. 2) {1332} | PROGRAMMING | 1750.0 | Codeforces Round #630 Editorial | 2100 |
| 1030 | Independent Set | dfs and similar dp trees | Statement | F | Codeforces Round 630 (Div. 2) {1332} | PROGRAMMING | 2250.0 | Codeforces Round #630 Editorial | 2500 |
| 304 | No Monotone Triples | data structures | Statement | G | Codeforces Round 630 (Div. 2) {1332} | PROGRAMMING | 3000.0 | Codeforces Round #630 Editorial | 3000 |
| 1711 | Road to 1600 | brute force constructive algorithms | Statement | E | Codeforces Round 632 (Div. 2) {1333} | PROGRAMMING | 2000.0 | Codeforces Round #632 (Div. 2) editorial | |
| 24775 | Little Artem | constructive algorithms | Statement | A | Codeforces Round 632 (Div. 2) {1333} | PROGRAMMING | 500.0 | Codeforces Round #632 (Div. 2) editorial | |
| 21720 | Kind Anton | greedy implementation | Statement | B | Codeforces Round 632 (Div. 2) {1333} | PROGRAMMING | 750.0 | Codeforces Round #632 (Div. 2) editorial | |
| 4327 | Kate and imperfection | greedy implementation math number theory sortings two pointers | Statement | F | Codeforces Round 632 (Div. 2) {1333} | PROGRAMMING | 2500.0 | Codeforces Round #632 (Div. 2) editorial | |
| 12720 | Eugene and an array | binary search data structures hashing implementation two pointers | Statement | C | Codeforces Round 632 (Div. 2) {1333} | PROGRAMMING | 1250.0 | Codeforces Round #632 (Div. 2) editorial | |
| 3969 | Challenges in school №41 | brute force constructive algorithms games graphs greedy implementation sortings | Statement | D | Codeforces Round 632 (Div. 2) {1333} | PROGRAMMING | 1750.0 | Codeforces Round #632 (Div. 2) editorial | |
| 377 | Substring Search | brute force fft | Statement | G | Educational Codeforces Round 85 (Rated for Div. 2) {1334} | PROGRAMMING | Educational Codeforces Round 85 Editorial | ||
| 1350 | Strange Function | data structures dp | Statement | F | Educational Codeforces Round 85 (Rated for Div. 2) {1334} | PROGRAMMING | Educational Codeforces Round 85 Editorial | ||
| 7396 | Minimum Euler Cycle | constructive algorithms graphs greedy implementation | Statement | D | Educational Codeforces Round 85 (Rated for Div. 2) {1334} | PROGRAMMING | Educational Codeforces Round 85 Editorial | ||
| 26160 | Middle Class | greedy sortings | Statement | B | Educational Codeforces Round 85 (Rated for Div. 2) {1334} | PROGRAMMING | Educational Codeforces Round 85 Editorial | ||
| 23509 | Level Statistics | implementation math | Statement | A | Educational Codeforces Round 85 (Rated for Div. 2) {1334} | PROGRAMMING | Educational Codeforces Round 85 Editorial | ||
| 2884 | Divisor Paths | combinatorics graphs greedy math number theory | Statement | E | Educational Codeforces Round 85 (Rated for Div. 2) {1334} | PROGRAMMING | Educational Codeforces Round 85 Editorial | ||
| 16905 | Circle of Monsters | brute force constructive algorithms greedy math | Statement | C | Educational Codeforces Round 85 (Rated for Div. 2) {1334} | PROGRAMMING | Educational Codeforces Round 85 Editorial | ||
| 39183 | Construct the String | constructive algorithms | Statement | B | Codeforces Round 634 (Div. 3) {1335} | PROGRAMMING | 75993 | 1000 | |
| 35465 | Two Teams Composing | binary search greedy implementation sortings | Statement | C | Codeforces Round 634 (Div. 3) {1335} | PROGRAMMING | 75993 | 1100 | |
| 27825 | Anti-Sudoku | constructive algorithms implementation | Statement | D | Codeforces Round 634 (Div. 3) {1335} | PROGRAMMING | 75993 | 1300 | |
| 10997 | Three Blocks Palindrome (easy version) | binary search brute force data structures dp two pointers | Statement | E1 | Codeforces Round 634 (Div. 3) {1335} | PROGRAMMING | 75993 | 1700 | |
| 8462 | Three Blocks Palindrome (hard version) | brute force data structures dp two pointers | Statement | E2 | Codeforces Round 634 (Div. 3) {1335} | PROGRAMMING | 75993 | 2000 | |
| 2213 | Robots on a Grid | data structures dfs and similar ds graphs greedy matrices | Statement | F | Codeforces Round 634 (Div. 3) {1335} | PROGRAMMING | 75993 | 2600 | |
| 88307 | Candies and Two Sisters | math | Statement | A | Codeforces Round 634 (Div. 3) {1335} | PROGRAMMING | 75993 | 800 | |
| 20940 | Linova and Kingdom | dfs and similar dp greedy sortings trees | Statement | A | Codeforces Round 635 (Div. 1) {1336} | PROGRAMMING | 500.0 | Codeforces Round #635 Editorial | 1700 |
| 11533 | Xenia and Colorful Gems | binary search greedy math sortings two pointers | Statement | B | Codeforces Round 635 (Div. 1) {1336} | PROGRAMMING | 750.0 | Codeforces Round #635 Editorial | 1800 |
| 3660 | Kaavi and Magic Spell | dp strings | Statement | C | Codeforces Round 635 (Div. 1) {1336} | PROGRAMMING | 1500.0 | Codeforces Round #635 Editorial | 2200 |
| 715 | Chiori and Doll Picking (easy version) | bitmasks brute force combinatorics math | Statement | E1 | Codeforces Round 635 (Div. 1) {1336} | PROGRAMMING | 1750.0 | Codeforces Round #635 Editorial | 2600 |
| 488 | Yui and Mahjong Set | constructive algorithms interactive | Statement | D | Codeforces Round 635 (Div. 1) {1336} | PROGRAMMING | 2250.0 | Codeforces Round #635 Editorial | 3000 |
| 358 | Chiori and Doll Picking (hard version) | bitmasks brute force combinatorics math | Statement | E2 | Codeforces Round 635 (Div. 1) {1336} | PROGRAMMING | 1500.0 | Codeforces Round #635 Editorial | 3400 |
| 232 | Journey | data structures divide and conquer graphs trees | Statement | F | Codeforces Round 635 (Div. 1) {1336} | PROGRAMMING | 3250.0 | Codeforces Round #635 Editorial | 3600 |
| 34713 | Kana and Dragon Quest game | greedy implementation math | Statement | B | Codeforces Round 635 (Div. 2) {1337} | PROGRAMMING | 1000.0 | Codeforces Round #635 Editorial | 1000 |
| 39255 | Ichihime and Triangle | constructive algorithms math | Statement | A | Codeforces Round 635 (Div. 2) {1337} | PROGRAMMING | 500.0 | Codeforces Round #635 Editorial | 1000 |
| 24869 | Powered Addition | greedy math | Statement | A | Codeforces Round 633 (Div. 1) {1338} | PROGRAMMING | 500.0 | Editorial | |
| 3262 | Perfect Triples | bitmasks brute force constructive algorithms divide and conquer greedy implementation math | Statement | C | Codeforces Round 633 (Div. 1) {1338} | PROGRAMMING | 1500.0 | Editorial | |
| 1032 | Nested Rubber Bands | dfs and similar dp trees | Statement | D | Codeforces Round 633 (Div. 1) {1338} | PROGRAMMING | 2000.0 | Editorial | |
| 247 | JYPnation | graphs | Statement | E | Codeforces Round 633 (Div. 1) {1338} | PROGRAMMING | 2750.0 | Editorial | |
| 8568 | Edge Weight Assignment | bitmasks constructive algorithms greedy math trees | Statement | B | Codeforces Round 633 (Div. 1) {1338} | PROGRAMMING | 1000.0 | Editorial | |
| 26779 | Sorted Adjacent Differences | constructive algorithms sortings | Statement | B | Codeforces Round 633 (Div. 2) {1339} | PROGRAMMING | 750.0 | Codeforces Round #633 Editorial | |
| 32458 | Filling Diamonds | brute force dp | Statement | A | Codeforces Round 633 (Div. 2) {1339} | PROGRAMMING | 500.0 | Codeforces Round #633 Editorial | |
| 2278 | Nastya and Unexpected Guest | graphs shortest paths | Statement | C | Codeforces Round 637 (Div. 1) - Thanks, Ivan Belonogov! {1340} | PROGRAMMING | 1250.0 | Codeforces Round #637 Editorial | |
| 1005 | Nastya and Time Machine | constructive algorithms dfs and similar graphs trees | Statement | D | Codeforces Round 637 (Div. 1) - Thanks, Ivan Belonogov! {1340} | PROGRAMMING | 1750.0 | Codeforces Round #637 Editorial | |
| 13455 | Nastya and Strange Generator | brute force data structures greedy implementation | Statement | A | Codeforces Round 637 (Div. 1) - Thanks, Ivan Belonogov! {1340} | PROGRAMMING | 500.0 | Codeforces Round #637 Editorial | |
| 7913 | Nastya and Scoreboard | bitmasks dp greedy | Statement | B | Codeforces Round 637 (Div. 1) - Thanks, Ivan Belonogov! {1340} | PROGRAMMING | 750.0 | Codeforces Round #637 Editorial | |
| 548 | Nastya and CBS | brute force data structures hashing | Statement | F | Codeforces Round 637 (Div. 1) - Thanks, Ivan Belonogov! {1340} | PROGRAMMING | 3000.0 | Codeforces Round #637 Editorial | |
| 53 | Nastya and Bees | graphs interactive probabilities | Statement | E | Codeforces Round 637 (Div. 1) - Thanks, Ivan Belonogov! {1340} | PROGRAMMING | 2250.0 | Codeforces Round #637 Editorial | |
| 29276 | Nastya and Rice | math | Statement | A | Codeforces Round 637 (Div. 2) - Thanks, Ivan Belonogov! {1341} | PROGRAMMING | 500.0 | Codeforces Round #637 Editorial | |
| 20003 | Nastya and Door | greedy implementation | Statement | B | Codeforces Round 637 (Div. 2) - Thanks, Ivan Belonogov! {1341} | PROGRAMMING | 1000.0 | Codeforces Round #637 Editorial | |
| 41617 | Road To Zero | greedy math | Statement | A | Educational Codeforces Round 86 (Rated for Div. 2) {1342} | PROGRAMMING | 76633 | 1100 | |
| 23872 | Binary Period | constructive algorithms strings | Statement | B | Educational Codeforces Round 86 (Rated for Div. 2) {1342} | PROGRAMMING | 76633 | 1200 | |
| 14210 | Yet Another Counting Problem | math number theory | Statement | C | Educational Codeforces Round 86 (Rated for Div. 2) {1342} | PROGRAMMING | 76633 | 1700 | |
| 6155 | Multiple Testcases | binary search constructive algorithms data structures greedy sortings two pointers | Statement | D | Educational Codeforces Round 86 (Rated for Div. 2) {1342} | PROGRAMMING | 76633 | 1900 | |
| 3152 | Placing Rooks | combinatorics fft math | Statement | E | Educational Codeforces Round 86 (Rated for Div. 2) {1342} | PROGRAMMING | 76633 | 2300 | |
| 781 | Make It Ascending | bitmasks brute force dp | Statement | F | Educational Codeforces Round 86 (Rated for Div. 2) {1342} | PROGRAMMING | 76633 | 2900 | |
| 39197 | Alternating Subsequence | dp greedy two pointers | Statement | C | Codeforces Round 636 (Div. 3) {1343} | PROGRAMMING | 76352 | 1100 | |
| 12844 | Constant Palindrome Sum | brute force data structures greedy two pointers | Statement | D | Codeforces Round 636 (Div. 3) {1343} | PROGRAMMING | 76352 | 1800 | |
| 5268 | Weights Distributing | brute force graphs greedy shortest paths sortings | Statement | E | Codeforces Round 636 (Div. 3) {1343} | PROGRAMMING | 76352 | 2400 | |
| 1294 | Restore the Permutation by Sorted Segments | brute force constructive algorithms data structures greedy implementation | Statement | F | Codeforces Round 636 (Div. 3) {1343} | PROGRAMMING | 76352 | 2800 | |
| 58050 | Balanced Array | constructive algorithms math | Statement | B | Codeforces Round 636 (Div. 3) {1343} | PROGRAMMING | 76352 | 800 | |
| 48937 | Candies | brute force math | Statement | A | Codeforces Round 636 (Div. 3) {1343} | PROGRAMMING | 76352 | 900 | |
| 15792 | Hilbert's Hotel | math number theory sortings | Statement | A | Codeforces Round 639 (Div. 1) {1344} | PROGRAMMING | 500.0 | Codeforces Round #639 Editorial | 1600 |
| 6123 | Monopole Magnets | constructive algorithms dfs and similar ds graphs | Statement | B | Codeforces Round 639 (Div. 1) {1344} | PROGRAMMING | 1000.0 | Codeforces Round #639 Editorial | 2000 |