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 ... 52 53 54 55 56 ... 100 101 102 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 2187 | You Are Given Some Strings... | brute force string suffix structures strings | Statement | E | Educational Codeforces Round 70 (Rated for Div. 2) {1202} | PROGRAMMING | 68972 | 2500 | |
| 421 | You Are Given Some Letters... | binary search implementation math | Statement | F | Educational Codeforces Round 70 (Rated for Div. 2) {1202} | PROGRAMMING | 68972 | 2800 | |
| 16811 | Circle of Students | implementation | Statement | A | Codeforces Round 579 (Div. 3) {1203} | PROGRAMMING | Codeforces Round #579 (Div. 3) Editorial | 1100 | |
| 16116 | Equal Rectangles | greedy math | Statement | B | Codeforces Round 579 (Div. 3) {1203} | PROGRAMMING | Codeforces Round #579 (Div. 3) Editorial | 1200 | |
| 21189 | Common Divisors | implementation math | Statement | C | Codeforces Round 579 (Div. 3) {1203} | PROGRAMMING | Codeforces Round #579 (Div. 3) Editorial | 1300 | |
| 14040 | Boxers | greedy sortings | Statement | E | Codeforces Round 579 (Div. 3) {1203} | PROGRAMMING | Codeforces Round #579 (Div. 3) Editorial | 1500 | |
| 8944 | Remove the Substring (easy version) | greedy implementation | Statement | D1 | Codeforces Round 579 (Div. 3) {1203} | PROGRAMMING | Codeforces Round #579 (Div. 3) Editorial | 1600 | |
| 7547 | Remove the Substring (hard version) | binary search greedy implementation two pointers | Statement | D2 | Codeforces Round 579 (Div. 3) {1203} | PROGRAMMING | Codeforces Round #579 (Div. 3) Editorial | 1800 | |
| 3623 | Complete the Projects (easy version) | greedy | Statement | F1 | Codeforces Round 579 (Div. 3) {1203} | PROGRAMMING | Codeforces Round #579 (Div. 3) Editorial | 2100 | |
| 2952 | Complete the Projects (hard version) | dp greedy | Statement | F2 | Codeforces Round 579 (Div. 3) {1203} | PROGRAMMING | Codeforces Round #579 (Div. 3) Editorial | 2400 | |
| 17634 | Mislove Has Lost an Array | greedy math | Statement | B | Codeforces Round 581 (Div. 2) {1204} | PROGRAMMING | 69244 | 1000 | |
| 21205 | BowWow and the Timetable | math | Statement | A | Codeforces Round 581 (Div. 2) {1204} | PROGRAMMING | 69244 | 1100 | |
| 6786 | Anna, Svyatoslav and Maps | dp graphs greedy shortest paths | Statement | C | Codeforces Round 581 (Div. 2) {1204} | PROGRAMMING | 69244 | 1700 | |
| 3099 | Kirk and a Binary String (easy version) | brute force greedy strings | Statement | D1 | Codeforces Round 581 (Div. 2) {1204} | PROGRAMMING | 69244 | 2000 | |
| 3274 | Kirk and a Binary String (hard version) | data structures greedy math strings | Statement | D2 | Codeforces Round 581 (Div. 2) {1204} | PROGRAMMING | 69244 | 2100 | |
| 1728 | Natasha, Sasha and the Prefix Sums | combinatorics dp math number theory | Statement | E | Codeforces Round 581 (Div. 2) {1204} | PROGRAMMING | 69244 | 2400 | |
| 14308 | Almost Equal | constructive algorithms greedy math | Statement | A | Codeforces Round 580 (Div. 1) {1205} | PROGRAMMING | 69158 | 1300 | |
| 6819 | Shortest Cycle | bitmasks brute force graphs shortest paths | Statement | B | Codeforces Round 580 (Div. 1) {1205} | PROGRAMMING | 69158 | 1900 | |
| 1193 | Palindromic Paths | implementation interactive | Statement | C | Codeforces Round 580 (Div. 1) {1205} | PROGRAMMING | 69158 | 2500 | |
| 674 | Almost All | constructive algorithms trees | Statement | D | Codeforces Round 580 (Div. 1) {1205} | PROGRAMMING | 69158 | 2800 | |
| 287 | Expected Value Again | combinatorics strings | Statement | E | Codeforces Round 580 (Div. 1) {1205} | PROGRAMMING | 69158 | 3100 | |
| 124 | Beauty of a Permutation | constructive algorithms math | Statement | F | Codeforces Round 580 (Div. 1) {1205} | PROGRAMMING | 69158 | 3400 | |
| 24734 | Choose Two Numbers | math sortings | Statement | A | Codeforces Round 580 (Div. 2) {1206} | PROGRAMMING | Editorial of Codeforces Round #580 | 800 | |
| 27368 | Make Product Equal One | dp implementation | Statement | B | Codeforces Round 580 (Div. 2) {1206} | PROGRAMMING | Editorial of Codeforces Round #580 | 900 | |
| 13359 | Square Filling | constructive algorithms greedy implementation | Statement | B | Educational Codeforces Round 71 (Rated for Div. 2) {1207} | PROGRAMMING | Educational Codeforces Round 71 Editorial | 1200 | |
| 9937 | Gas Pipeline | dp greedy | Statement | C | Educational Codeforces Round 71 (Rated for Div. 2) {1207} | PROGRAMMING | Educational Codeforces Round 71 Editorial | 1500 | |
| 6092 | XOR Guessing | bitmasks interactive math | Statement | E | Educational Codeforces Round 71 (Rated for Div. 2) {1207} | PROGRAMMING | Educational Codeforces Round 71 Editorial | 1800 | |
| 6153 | Number Of Permutations | combinatorics | Statement | D | Educational Codeforces Round 71 (Rated for Div. 2) {1207} | PROGRAMMING | Educational Codeforces Round 71 Editorial | 1800 | |
| 5483 | Remainder Problem | brute force data structures implementation | Statement | F | Educational Codeforces Round 71 (Rated for Div. 2) {1207} | PROGRAMMING | Educational Codeforces Round 71 Editorial | 2100 | |
| 1061 | Indie Album | data structures dfs and similar hashing string suffix structures strings trees | Statement | G | Educational Codeforces Round 71 (Rated for Div. 2) {1207} | PROGRAMMING | Educational Codeforces Round 71 Editorial | 2600 | |
| 22191 | There Are Two Types Of Burgers | brute force greedy implementation math | Statement | A | Educational Codeforces Round 71 (Rated for Div. 2) {1207} | PROGRAMMING | Educational Codeforces Round 71 Editorial | 700 | |
| 10678 | Uniqueness | binary search brute force implementation two pointers | Statement | B | Manthan, Codefest 19 (open for everyone, rated, Div. 1 + Div. 2) {1208} | PROGRAMMING | 69357 | 1500 | |
| 6094 | Magic Grid | constructive algorithms | Statement | C | Manthan, Codefest 19 (open for everyone, rated, Div. 1 + Div. 2) {1208} | PROGRAMMING | 69357 | 1800 | |
| 5011 | Restore Permutation | binary search data structures greedy implementation | Statement | D | Manthan, Codefest 19 (open for everyone, rated, Div. 1 + Div. 2) {1208} | PROGRAMMING | 69357 | 1900 | |
| 2061 | Let Them Slide | data structures implementation | Statement | E | Manthan, Codefest 19 (open for everyone, rated, Div. 1 + Div. 2) {1208} | PROGRAMMING | 69357 | 2200 | |
| 2633 | Bits And Pieces | bitmasks dfs and similar dp greedy | Statement | F | Manthan, Codefest 19 (open for everyone, rated, Div. 1 + Div. 2) {1208} | PROGRAMMING | 69357 | 2600 | |
| 794 | Polygons | greedy math number theory | Statement | G | Manthan, Codefest 19 (open for everyone, rated, Div. 1 + Div. 2) {1208} | PROGRAMMING | 69357 | 2700 | |
| 153 | Red Blue Tree | data structures implementation trees | Statement | H | Manthan, Codefest 19 (open for everyone, rated, Div. 1 + Div. 2) {1208} | PROGRAMMING | 69357 | 3500 | |
| 16982 | XORinacci | math | Statement | A | Manthan, Codefest 19 (open for everyone, rated, Div. 1 + Div. 2) {1208} | PROGRAMMING | 69357 | 900 | |
| 8234 | Koala and Lights | implementation math number theory | Statement | B | Codeforces Round 584 - Dasha Code Championship - Elimination Round (rated, open for everyone, Div. 1 + Div. 2) {1209} | PROGRAMMING | 69791 | 1300 | |
| 7599 | Paint the Digits | constructive algorithms greedy implementation | Statement | C | Codeforces Round 584 - Dasha Code Championship - Elimination Round (rated, open for everyone, Div. 1 + Div. 2) {1209} | PROGRAMMING | 69791 | 1600 | |
| 9574 | Cow and Snacks | dfs and similar ds graphs | Statement | D | Codeforces Round 584 - Dasha Code Championship - Elimination Round (rated, open for everyone, Div. 1 + Div. 2) {1209} | PROGRAMMING | 69791 | 1700 | |
| 3016 | Rotate Columns (easy version) | bitmasks brute force dp greedy sortings | Statement | E1 | Codeforces Round 584 - Dasha Code Championship - Elimination Round (rated, open for everyone, Div. 1 + Div. 2) {1209} | PROGRAMMING | 69791 | 2000 | |
| 3339 | Into Blocks (easy version) | data structures ds greedy implementation two pointers | Statement | G1 | Codeforces Round 584 - Dasha Code Championship - Elimination Round (rated, open for everyone, Div. 1 + Div. 2) {1209} | PROGRAMMING | 69791 | 2000 | |
| 2033 | Rotate Columns (hard version) | bitmasks dp greedy sortings | Statement | E2 | Codeforces Round 584 - Dasha Code Championship - Elimination Round (rated, open for everyone, Div. 1 + Div. 2) {1209} | PROGRAMMING | 69791 | 2400 | |
| 1200 | Koala and Notebook | data structures dfs and similar graphs shortest paths strings trees | Statement | F | Codeforces Round 584 - Dasha Code Championship - Elimination Round (rated, open for everyone, Div. 1 + Div. 2) {1209} | PROGRAMMING | 69791 | 2600 | |
| 462 | Into Blocks (hard version) | data structures | Statement | G2 | Codeforces Round 584 - Dasha Code Championship - Elimination Round (rated, open for everyone, Div. 1 + Div. 2) {1209} | PROGRAMMING | 69791 | 3200 | |
| 142 | Moving Walkways | data structures greedy math | Statement | H | Codeforces Round 584 - Dasha Code Championship - Elimination Round (rated, open for everyone, Div. 1 + Div. 2) {1209} | PROGRAMMING | 69791 | 3300 | |
| 12371 | Paint the Numbers | greedy implementation math | Statement | A | Codeforces Round 584 - Dasha Code Championship - Elimination Round (rated, open for everyone, Div. 1 + Div. 2) {1209} | PROGRAMMING | 69791 | 900 | |
| 5191 | Anadi and Domino | brute force graphs | Statement | A | Dasha Code Championship - SPb Finals Round (only for onsite-finalists) {1210} | PROGRAMMING | Dasha Code Championship Finals and Mirror Round 588 Editorial | 1600 | |
| 5847 | Marcin and Training Camp | brute force greedy | Statement | B | Dasha Code Championship - SPb Finals Round (only for onsite-finalists) {1210} | PROGRAMMING | Dasha Code Championship Finals and Mirror Round 588 Editorial | 1800 | |
| 3367 | Kamil and Making a Stream | math number theory trees | Statement | C | Dasha Code Championship - SPb Finals Round (only for onsite-finalists) {1210} | PROGRAMMING | Dasha Code Championship Finals and Mirror Round 588 Editorial | 2100 | |
| 1524 | Konrad and Company Evaluation | graphs | Statement | D | Dasha Code Championship - SPb Finals Round (only for onsite-finalists) {1210} | PROGRAMMING | Dasha Code Championship Finals and Mirror Round 588 Editorial | 2300 | |
| 410 | Wojtek and Card Tricks | math | Statement | E | Dasha Code Championship - SPb Finals Round (only for onsite-finalists) {1210} | PROGRAMMING | Dasha Code Championship Finals and Mirror Round 588 Editorial | 2700 | |
| 217 | Marek and Matching (easy version) | brute force probabilities | Statement | F1 | Dasha Code Championship - SPb Finals Round (only for onsite-finalists) {1210} | PROGRAMMING | Dasha Code Championship Finals and Mirror Round 588 Editorial | 2900 | |
| 227 | Marek and Matching (hard version) | brute force probabilities | Statement | F2 | Dasha Code Championship - SPb Finals Round (only for onsite-finalists) {1210} | PROGRAMMING | Dasha Code Championship Finals and Mirror Round 588 Editorial | 3100 | |
| 180 | Mateusz and Escape Room | dp | Statement | G | Dasha Code Championship - SPb Finals Round (only for onsite-finalists) {1210} | PROGRAMMING | Dasha Code Championship Finals and Mirror Round 588 Editorial | 3400 | |
| 1450 | Three Problems | *special implementation | Statement | A | Kotlin Heroes: Episode 2 {1211} | PROGRAMMING | Kotlin Heroes: Episode 2 Editorial | 1300 | |
| 769 | Traveling Around the Golden Ring of Berland | *special implementation | Statement | B | Kotlin Heroes: Episode 2 {1211} | PROGRAMMING | Kotlin Heroes: Episode 2 Editorial | 1500 | |
| 524 | Ice Cream | *special greedy sortings | Statement | C | Kotlin Heroes: Episode 2 {1211} | PROGRAMMING | Kotlin Heroes: Episode 2 Editorial | 2000 | |
| 233 | Teams | *special binary search greedy math | Statement | D | Kotlin Heroes: Episode 2 {1211} | PROGRAMMING | Kotlin Heroes: Episode 2 Editorial | 2200 | |
| 198 | Double Permutation Inc. | *special binary search greedy | Statement | E | Kotlin Heroes: Episode 2 {1211} | PROGRAMMING | Kotlin Heroes: Episode 2 Editorial | 2200 | |
| 129 | kotlinkotlinkotlinkotlin... | *special graphs implementation strings | Statement | F | Kotlin Heroes: Episode 2 {1211} | PROGRAMMING | Kotlin Heroes: Episode 2 Editorial | 2400 | |
| 72 | King's Path | *special math trees | Statement | G | Kotlin Heroes: Episode 2 {1211} | PROGRAMMING | Kotlin Heroes: Episode 2 Editorial | 2500 | |
| 41 | Unusual Graph | *special graphs | Statement | I | Kotlin Heroes: Episode 2 {1211} | PROGRAMMING | Kotlin Heroes: Episode 2 Editorial | 3000 | |
| 46 | Road Repair in Treeland | *special binary search dp trees | Statement | H | Kotlin Heroes: Episode 2 {1211} | PROGRAMMING | Kotlin Heroes: Episode 2 Editorial | 3000 | |
| 27220 | Bad Prices | data structures implementation | Statement | B | Codeforces Round 582 (Div. 3) {1213} | PROGRAMMING | Codeforces Round #582 (Div. 3) Editorial | 1100 | |
| 18642 | Book Reading | math | Statement | C | Codeforces Round 582 (Div. 3) {1213} | PROGRAMMING | Codeforces Round #582 (Div. 3) Editorial | 1200 | |
| 11505 | Equalizing by Division (easy version) | brute force implementation | Statement | D1 | Codeforces Round 582 (Div. 3) {1213} | PROGRAMMING | Codeforces Round #582 (Div. 3) Editorial | 1500 | |
| 11579 | Equalizing by Division (hard version) | brute force math sortings | Statement | D2 | Codeforces Round 582 (Div. 3) {1213} | PROGRAMMING | Codeforces Round #582 (Div. 3) Editorial | 1600 | |
| 5246 | Two Small Strings | brute force constructive algorithms | Statement | E | Codeforces Round 582 (Div. 3) {1213} | PROGRAMMING | Codeforces Round #582 (Div. 3) Editorial | 2000 | |
| 7604 | Path Queries | divide and conquer ds graphs sortings trees | Statement | G | Codeforces Round 582 (Div. 3) {1213} | PROGRAMMING | Codeforces Round #582 (Div. 3) Editorial | 2000 | |
| 2645 | Unstable String Sort | data structures dfs and similar ds graphs greedy implementation strings | Statement | F | Codeforces Round 582 (Div. 3) {1213} | PROGRAMMING | Codeforces Round #582 (Div. 3) Editorial | 2400 | |
| 24348 | Chips Moving | math | Statement | A | Codeforces Round 582 (Div. 3) {1213} | PROGRAMMING | Codeforces Round #582 (Div. 3) Editorial | 900 | |
| 10915 | Badges | brute force math | Statement | B | Codeforces Round 583 (Div. 1 + Div. 2, based on Olympiad of Metropolises) {1214} | PROGRAMMING | Tutorial | 1100 | |
| 13443 | Bad Sequence | data structures greedy | Statement | C | Codeforces Round 583 (Div. 1 + Div. 2, based on Olympiad of Metropolises) {1214} | PROGRAMMING | Tutorial | 1200 | |
| 9172 | Optimal Currency Exchange | brute force math | Statement | A | Codeforces Round 583 (Div. 1 + Div. 2, based on Olympiad of Metropolises) {1214} | PROGRAMMING | Tutorial | 1300 | |
| 5250 | Treasure Island | dfs and similar dp flows hashing | Statement | D | Codeforces Round 583 (Div. 1 + Div. 2, based on Olympiad of Metropolises) {1214} | PROGRAMMING | Tutorial | 1800 | |
| 2724 | Petya and Construction Set | constructive algorithms graphs math sortings trees | Statement | E | Codeforces Round 583 (Div. 1 + Div. 2, based on Olympiad of Metropolises) {1214} | PROGRAMMING | Tutorial | 2000 | |
| 403 | Tiles Placement | constructive algorithms dfs and similar trees | Statement | H | Codeforces Round 583 (Div. 1 + Div. 2, based on Olympiad of Metropolises) {1214} | PROGRAMMING | Tutorial | 2700 | |
| 463 | Employment | greedy sortings | Statement | F | Codeforces Round 583 (Div. 1 + Div. 2, based on Olympiad of Metropolises) {1214} | PROGRAMMING | Tutorial | 2700 | |
| 312 | Feeling Good | bitmasks data structures | Statement | G | Codeforces Round 583 (Div. 1 + Div. 2, based on Olympiad of Metropolises) {1214} | PROGRAMMING | Tutorial | 3100 | |
| 11639 | Yellow Cards | greedy implementation math | Statement | A | Codeforces Round 585 (Div. 2) {1215} | PROGRAMMING | Codeforces Round #585 Editorial | 1000 | |
| 13554 | The Number of Products | combinatorics dp implementation | Statement | B | Codeforces Round 585 (Div. 2) {1215} | PROGRAMMING | Codeforces Round #585 Editorial | 1500 | |
| 11360 | Swap Letters | constructive algorithms greedy | Statement | C | Codeforces Round 585 (Div. 2) {1215} | PROGRAMMING | Codeforces Round #585 Editorial | 1500 | |
| 6232 | Ticket Game | games greedy math | Statement | D | Codeforces Round 585 (Div. 2) {1215} | PROGRAMMING | Codeforces Round #585 Editorial | 1700 | |
| 3112 | Marbles | bitmasks dp | Statement | E | Codeforces Round 585 (Div. 2) {1215} | PROGRAMMING | Codeforces Round #585 Editorial | 2200 | |
| 1019 | Radio Stations | 2-sat | Statement | F | Codeforces Round 585 (Div. 2) {1215} | PROGRAMMING | Codeforces Round #585 Editorial | 2800 | |
| 18629 | Shooting | greedy implementation sortings | Statement | B | Codeforces Round 587 (Div. 3) {1216} | PROGRAMMING | Codeforces Round #587 (Div. 3) Editorial | 1000 | |
| 11307 | Swords | math | Statement | D | Codeforces Round 587 (Div. 3) {1216} | PROGRAMMING | Codeforces Round #587 (Div. 3) Editorial | 1300 | |
| 9445 | White Sheet | geometry math | Statement | C | Codeforces Round 587 (Div. 3) {1216} | PROGRAMMING | Codeforces Round #587 (Div. 3) Editorial | 1500 | |
| 3500 | Numerical Sequence (easy version) | binary search brute force math | Statement | E1 | Codeforces Round 587 (Div. 3) {1216} | PROGRAMMING | Codeforces Round #587 (Div. 3) Editorial | 1900 | |
| 2747 | Wi-Fi | data structures dp greedy | Statement | F | Codeforces Round 587 (Div. 3) {1216} | PROGRAMMING | Codeforces Round #587 (Div. 3) Editorial | 2300 | |
| 1523 | Numerical Sequence (hard version) | binary search math | Statement | E2 | Codeforces Round 587 (Div. 3) {1216} | PROGRAMMING | Codeforces Round #587 (Div. 3) Editorial | 2300 | |
| 18812 | Prefixes | strings | Statement | A | Codeforces Round 587 (Div. 3) {1216} | PROGRAMMING | Codeforces Round #587 (Div. 3) Editorial | 900 | |
| 15123 | Creating a Character | binary search math | Statement | A | Educational Codeforces Round 72 (Rated for Div. 2) {1217} | PROGRAMMING | Educational Codeforces Round 72 Editorial | 1300 | |
| 11379 | Zmei Gorynich | greedy math | Statement | B | Educational Codeforces Round 72 (Rated for Div. 2) {1217} | PROGRAMMING | Educational Codeforces Round 72 Editorial | 1600 | |
| 7524 | The Number Of Good Substrings | binary search bitmasks brute force | Statement | C | Educational Codeforces Round 72 (Rated for Div. 2) {1217} | PROGRAMMING | Educational Codeforces Round 72 Editorial | 1600 | |
| 5456 | Coloring Edges | constructive algorithms dfs and similar graphs | Statement | D | Educational Codeforces Round 72 (Rated for Div. 2) {1217} | PROGRAMMING | Educational Codeforces Round 72 Editorial | 2000 | |
| 1941 | Sum Queries? | data structures greedy implementation math | Statement | E | Educational Codeforces Round 72 (Rated for Div. 2) {1217} | PROGRAMMING | Educational Codeforces Round 72 Editorial | 2300 |