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 ... 50 51 52 53 54 ... 100 101 102 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 738 | Vicky's Delivery Service | data structures ds graphs hashing | Statement | F | Codeforces Round 561 (Div. 2) {1166} | PROGRAMMING | Codeforces Round #561 (Div. 2) Editorial | 2800 | |
| 14441 | Silent Classroom | combinatorics greedy | Statement | A | Codeforces Round 561 (Div. 2) {1166} | PROGRAMMING | Codeforces Round #561 (Div. 2) Editorial | 900 | |
| 19344 | News Distribution | dfs and similar ds graphs | Statement | C | Educational Codeforces Round 65 (Rated for Div. 2) {1167} | PROGRAMMING | 67058 | 1400 | |
| 12410 | Lost Numbers | brute force divide and conquer interactive math | Statement | B | Educational Codeforces Round 65 (Rated for Div. 2) {1167} | PROGRAMMING | 67058 | 1400 | |
| 7052 | Bicolored RBS | constructive algorithms greedy | Statement | D | Educational Codeforces Round 65 (Rated for Div. 2) {1167} | PROGRAMMING | 67058 | 1500 | |
| 2715 | Range Deleting | binary search combinatorics data structures two pointers | Statement | E | Educational Codeforces Round 65 (Rated for Div. 2) {1167} | PROGRAMMING | 67058 | 2100 | |
| 1675 | Scalar Queries | combinatorics data structures math sortings | Statement | F | Educational Codeforces Round 65 (Rated for Div. 2) {1167} | PROGRAMMING | 67058 | 2300 | |
| 150 | Low Budget Inception | brute force geometry | Statement | G | Educational Codeforces Round 65 (Rated for Div. 2) {1167} | PROGRAMMING | 67058 | 3000 | |
| 19538 | Telephone Number | brute force greedy strings | Statement | A | Educational Codeforces Round 65 (Rated for Div. 2) {1167} | PROGRAMMING | 67058 | 700 | |
| 6989 | Increasing by Modulo | binary search greedy | Statement | A | Codeforces Round 562 (Div. 1) {1168} | PROGRAMMING | Codeforces Round #562 — Editorial | 1800 | |
| 3628 | Good Triple | brute force two pointers | Statement | B | Codeforces Round 562 (Div. 1) {1168} | PROGRAMMING | Codeforces Round #562 — Editorial | 2000 | |
| 2463 | And Reachability | bitmasks dp | Statement | C | Codeforces Round 562 (Div. 1) {1168} | PROGRAMMING | Codeforces Round #562 — Editorial | 2400 | |
| 385 | Anagram Paths | dp implementation trees | Statement | D | Codeforces Round 562 (Div. 1) {1168} | PROGRAMMING | Codeforces Round #562 — Editorial | 2900 | |
| 379 | Xor Permutations | constructive algorithms math | Statement | E | Codeforces Round 562 (Div. 1) {1168} | PROGRAMMING | Codeforces Round #562 — Editorial | 3100 | |
| 12150 | Circle Metro | implementation math | Statement | A | Codeforces Round 562 (Div. 2) {1169} | PROGRAMMING | Codeforces Round #562 — Editorial | 1000 | |
| 9951 | Pairs | graphs implementation | Statement | B | Codeforces Round 562 (Div. 2) {1169} | PROGRAMMING | Codeforces Round #562 — Editorial | 1500 | |
| 123 | Wheels | *special binary search greedy | Statement | F | Kotlin Heroes: Episode 1 {1170} | PROGRAMMING | Kotlin Heroes Editorial | ||
| 1493 | Three Integers Again | *special math | Statement | A | Kotlin Heroes: Episode 1 {1170} | PROGRAMMING | Kotlin Heroes Editorial | ||
| 262 | Sliding Doors | *special binary search | Statement | E | Kotlin Heroes: Episode 1 {1170} | PROGRAMMING | Kotlin Heroes Editorial | ||
| 801 | Minus and Minus Give Plus | *special implementation strings | Statement | C | Kotlin Heroes: Episode 1 {1170} | PROGRAMMING | Kotlin Heroes Editorial | ||
| 49 | Longest Saw | *special constructive algorithms | Statement | H | Kotlin Heroes: Episode 1 {1170} | PROGRAMMING | Kotlin Heroes Editorial | ||
| 75 | Graph Decomposition | *special graphs | Statement | G | Kotlin Heroes: Episode 1 {1170} | PROGRAMMING | Kotlin Heroes Editorial | ||
| 41 | Good Subsets | *special dp | Statement | I | Kotlin Heroes: Episode 1 {1170} | PROGRAMMING | Kotlin Heroes Editorial | ||
| 476 | Decoding of Integer Sequences | *special data structures implementation | Statement | D | Kotlin Heroes: Episode 1 {1170} | PROGRAMMING | Kotlin Heroes Editorial | ||
| 1098 | Bad Days | *special implementation | Statement | B | Kotlin Heroes: Episode 1 {1170} | PROGRAMMING | Kotlin Heroes Editorial | ||
| 5010 | Nauuo and Cards | greedy implementation | Statement | A | Codeforces Round 564 (Div. 1) {1172} | PROGRAMMING | Codeforces Round #564 Editorial | 1800 | |
| 4120 | Nauuo and Circle | combinatorics dfs and similar dp trees | Statement | B | Codeforces Round 564 (Div. 1) {1172} | PROGRAMMING | Codeforces Round #564 Editorial | 2000 | |
| 1112 | Nauuo and Pictures (easy version) | dp probabilities | Statement | C1 | Codeforces Round 564 (Div. 1) {1172} | PROGRAMMING | Codeforces Round #564 Editorial | 2500 | |
| 871 | Nauuo and Pictures (hard version) | dp probabilities | Statement | C2 | Codeforces Round 564 (Div. 1) {1172} | PROGRAMMING | Codeforces Round #564 Editorial | 2700 | |
| 519 | Nauuo and Portals | constructive algorithms | Statement | D | Codeforces Round 564 (Div. 1) {1172} | PROGRAMMING | Codeforces Round #564 Editorial | 2800 | |
| 323 | Nauuo and ODT | data structures | Statement | E | Codeforces Round 564 (Div. 1) {1172} | PROGRAMMING | Codeforces Round #564 Editorial | 3300 | |
| 534 | Nauuo and Bug | data structures | Statement | F | Codeforces Round 564 (Div. 1) {1172} | PROGRAMMING | Codeforces Round #564 Editorial | 3300 | |
| 9145 | Nauuo and Chess | constructive algorithms greedy | Statement | B | Codeforces Round 564 (Div. 2) {1173} | PROGRAMMING | Codeforces Round #564 Editorial | 1100 | |
| 16313 | Nauuo and Votes | greedy | Statement | A | Codeforces Round 564 (Div. 2) {1173} | PROGRAMMING | Codeforces Round #564 Editorial | 700 | |
| 17933 | Ehab Fails to Be Thanos | constructive algorithms greedy sortings | Statement | A | Codeforces Round 563 (Div. 2) {1174} | PROGRAMMING | Codeforces round #563 editorial | 1000 | |
| 15679 | Ehab Is an Odd Person | sortings | Statement | B | Codeforces Round 563 (Div. 2) {1174} | PROGRAMMING | Codeforces round #563 editorial | 1200 | |
| 12169 | Ehab and a Special Coloring Problem | constructive algorithms number theory | Statement | C | Codeforces Round 563 (Div. 2) {1174} | PROGRAMMING | Codeforces round #563 editorial | 1300 | |
| 4754 | Ehab and the Expected XOR Problem | bitmasks constructive algorithms | Statement | D | Codeforces Round 563 (Div. 2) {1174} | PROGRAMMING | Codeforces round #563 editorial | 1900 | |
| 1763 | Ehab and the Big Finale | constructive algorithms divide and conquer graphs implementation interactive trees | Statement | F | Codeforces Round 563 (Div. 2) {1174} | PROGRAMMING | Codeforces round #563 editorial | 2300 | |
| 1587 | Ehab and the Expected GCD Problem | combinatorics dp math number theory | Statement | E | Codeforces Round 563 (Div. 2) {1174} | PROGRAMMING | Codeforces round #563 editorial | 2500 | |
| 18494 | From Hero to Zero | implementation math | Statement | A | Educational Codeforces Round 66 (Rated for Div. 2) {1175} | PROGRAMMING | Editorial | 1000 | |
| 6907 | Electrification | binary search brute force greedy | Statement | C | Educational Codeforces Round 66 (Rated for Div. 2) {1175} | PROGRAMMING | Editorial | 1600 | |
| 10908 | Catch Overflow! | data structures expression parsing implementation | Statement | B | Educational Codeforces Round 66 (Rated for Div. 2) {1175} | PROGRAMMING | Editorial | 1600 | |
| 6396 | Array Splitting | greedy sortings | Statement | D | Educational Codeforces Round 66 (Rated for Div. 2) {1175} | PROGRAMMING | Editorial | 1900 | |
| 3766 | Minimal Segment Cover | data structures dfs and similar divide and conquer dp greedy implementation trees | Statement | E | Educational Codeforces Round 66 (Rated for Div. 2) {1175} | PROGRAMMING | Editorial | 2200 | |
| 1990 | The Number of Subpermutations | brute force data structures divide and conquer hashing math | Statement | F | Educational Codeforces Round 66 (Rated for Div. 2) {1175} | PROGRAMMING | Editorial | 2600 | |
| 542 | Yet Another Partiton Problem | data structures divide and conquer dp geometry two pointers | Statement | G | Educational Codeforces Round 66 (Rated for Div. 2) {1175} | PROGRAMMING | Editorial | 2700 | |
| 17377 | Merge it! | math | Statement | B | Codeforces Round 565 (Div. 3) {1176} | PROGRAMMING | 67598 | 1100 | |
| 14393 | Lose it! | dp greedy implementation | Statement | C | Codeforces Round 565 (Div. 3) {1176} | PROGRAMMING | 67598 | 1300 | |
| 11554 | Cover it! | dfs and similar ds graphs shortest paths trees | Statement | E | Codeforces Round 565 (Div. 3) {1176} | PROGRAMMING | 67598 | 1700 | |
| 5371 | Recover it! | dfs and similar graphs greedy number theory sortings | Statement | D | Codeforces Round 565 (Div. 3) {1176} | PROGRAMMING | 67598 | 1900 | |
| 2081 | Destroy it! | dp implementation sortings | Statement | F | Codeforces Round 565 (Div. 3) {1176} | PROGRAMMING | 67598 | 2500 | |
| 23247 | Divide it! | brute force greedy implementation | Statement | A | Codeforces Round 565 (Div. 3) {1176} | PROGRAMMING | 67598 | 800 | |
| 5847 | Digits Sequence (Easy Edition) | implementation | Statement | A | Testing Round 15 (Unrated) {1177} | PROGRAMMING | 1100 | ||
| 2629 | Digits Sequence (Hard Edition) | binary search divide and conquer implementation | Statement | B | Testing Round 15 (Unrated) {1177} | PROGRAMMING | 1800 | ||
| 10539 | Prime Minister | greedy | Statement | A | Codeforces Global Round 4 {1178} | PROGRAMMING | E | 1100 | |
| 16036 | WOW Factor | dp strings | Statement | B | Codeforces Global Round 4 {1178} | PROGRAMMING | E | 1300 | |
| 12158 | Tiles | combinatorics greedy math | Statement | C | Codeforces Global Round 4 {1178} | PROGRAMMING | E | 1300 | |
| 7500 | Prime Graph | constructive algorithms greedy math number theory | Statement | D | Codeforces Global Round 4 {1178} | PROGRAMMING | E | 1600 | |
| 4358 | Archaeology | brute force constructive algorithms greedy strings | Statement | E | Codeforces Global Round 4 {1178} | PROGRAMMING | E | 1900 | |
| 2145 | Short Colorful Strip | combinatorics dfs and similar dp | Statement | F1 | Codeforces Global Round 4 {1178} | PROGRAMMING | E | 2200 | |
| 921 | Long Colorful Strip | dp | Statement | F2 | Codeforces Global Round 4 {1178} | PROGRAMMING | E | 2600 | |
| 522 | The Awesomest Vertex | data structures dfs and similar | Statement | G | Codeforces Global Round 4 {1178} | PROGRAMMING | E | 2900 | |
| 258 | Stock Exchange | binary search flows graphs | Statement | H | Codeforces Global Round 4 {1178} | PROGRAMMING | E | 3500 | |
| 10786 | Valeriy and Deque | data structures implementation | Statement | A | Codeforces Round 569 (Div. 1) {1179} | PROGRAMMING | Editorial of Round #569 | 1500 | |
| 4415 | Tolik and His Uncle | constructive algorithms | Statement | B | Codeforces Round 569 (Div. 1) {1179} | PROGRAMMING | Editorial of Round #569 | 1800 | |
| 2120 | Serge and Dining Room | binary search data structures graph matchings greedy implementation math trees | Statement | C | Codeforces Round 569 (Div. 1) {1179} | PROGRAMMING | Editorial of Round #569 | 2400 | |
| 925 | Fedor Runs for President | data structures dp trees | Statement | D | Codeforces Round 569 (Div. 1) {1179} | PROGRAMMING | Editorial of Round #569 | 2600 | |
| 181 | Alesya and Discrete Math | divide and conquer interactive | Statement | E | Codeforces Round 569 (Div. 1) {1179} | PROGRAMMING | Editorial of Round #569 | 3200 | |
| 9678 | Nick and Array | greedy implementation | Statement | B | Codeforces Round 569 (Div. 2) {1180} | PROGRAMMING | Editorial of Round #569 | 1500 | |
| 25661 | Alex and a Rhombus | dp implementation math | Statement | A | Codeforces Round 569 (Div. 2) {1180} | PROGRAMMING | Editorial of Round #569 | 800 | |
| 13863 | Chunga-Changa | greedy math | Statement | A | Codeforces Round 567 (Div. 2) {1181} | PROGRAMMING | Editorial of Codeforces Round #567 (based on All-Russian olympiad in the name of Keldysh) | 1000 | |
| 6359 | Split a Number | greedy implementation strings | Statement | B | Codeforces Round 567 (Div. 2) {1181} | PROGRAMMING | Editorial of Codeforces Round #567 (based on All-Russian olympiad in the name of Keldysh) | 1500 | |
| 3173 | Flag | brute force combinatorics dp implementation | Statement | C | Codeforces Round 567 (Div. 2) {1181} | PROGRAMMING | Editorial of Codeforces Round #567 (based on All-Russian olympiad in the name of Keldysh) | 1900 | |
| 2463 | Irrigation | binary search data structures implementation sortings trees two pointers | Statement | D | Codeforces Round 567 (Div. 2) {1181} | PROGRAMMING | Editorial of Codeforces Round #567 (based on All-Russian olympiad in the name of Keldysh) | 2100 | |
| 500 | A Story of One Country (Easy) | brute force divide and conquer sortings | Statement | E1 | Codeforces Round 567 (Div. 2) {1181} | PROGRAMMING | Editorial of Codeforces Round #567 (based on All-Russian olympiad in the name of Keldysh) | 2600 | |
| 301 | A Story of One Country (Hard) | brute force greedy sortings | Statement | E2 | Codeforces Round 567 (Div. 2) {1181} | PROGRAMMING | Editorial of Codeforces Round #567 (based on All-Russian olympiad in the name of Keldysh) | 3000 | |
| 32029 | Filling Shapes | dp math | Statement | A | Codeforces Round 566 (Div. 2) {1182} | PROGRAMMING | 67614 | 1000 | |
| 11245 | Plus from Picture | dfs and similar implementation strings | Statement | B | Codeforces Round 566 (Div. 2) {1182} | PROGRAMMING | 67614 | 1300 | |
| 4445 | Beautiful Lyrics | data structures greedy strings | Statement | C | Codeforces Round 566 (Div. 2) {1182} | PROGRAMMING | 67614 | 1700 | |
| 2892 | Product Oriented Recurrence | dp math matrices number theory | Statement | E | Codeforces Round 566 (Div. 2) {1182} | PROGRAMMING | 67614 | 2200 | |
| 871 | Complete Mirror | constructive algorithms dfs and similar dp hashing implementation trees | Statement | D | Codeforces Round 566 (Div. 2) {1182} | PROGRAMMING | 67614 | 2500 | |
| 349 | Maximum Sine | binary search data structures number theory | Statement | F | Codeforces Round 566 (Div. 2) {1182} | PROGRAMMING | 67614 | 2900 | |
| 18680 | Equalize Prices | math | Statement | B | Codeforces Round 570 (Div. 3) {1183} | PROGRAMMING | Tutorial | 1000 | |
| 14190 | Computer Game | binary search math | Statement | C | Codeforces Round 570 (Div. 3) {1183} | PROGRAMMING | Tutorial | 1400 | |
| 15081 | Candy Box (easy version) | greedy sortings | Statement | D | Codeforces Round 570 (Div. 3) {1183} | PROGRAMMING | Tutorial | 1400 | |
| 4938 | Subsequences (easy version) | dp graphs implementation shortest paths | Statement | E | Codeforces Round 570 (Div. 3) {1183} | PROGRAMMING | Tutorial | 2000 | |
| 2409 | Candy Box (hard version) | greedy implementation sortings | Statement | G | Codeforces Round 570 (Div. 3) {1183} | PROGRAMMING | Tutorial | 2100 | |
| 3237 | Subsequences (hard version) | dp strings | Statement | H | Codeforces Round 570 (Div. 3) {1183} | PROGRAMMING | Tutorial | 2200 | |
| 2063 | Topforces Strikes Back | brute force math sortings | Statement | F | Codeforces Round 570 (Div. 3) {1183} | PROGRAMMING | Tutorial | 2400 | |
| 25300 | Nearest Interesting Number | implementation | Statement | A | Codeforces Round 570 (Div. 3) {1183} | PROGRAMMING | Tutorial | 900 | |
| 6052 | Heidi Learns Hashing (Easy) | brute force math number theory | Statement | A1 | Helvetic Coding Contest 2019 online mirror (teams allowed, unrated) {1184} | PROGRAMMING | helvetic-coding-contest-2019-editorial.pdf | 1200 | |
| 5476 | The Doctor Meets Vader (Easy) | binary search sortings | Statement | B1 | Helvetic Coding Contest 2019 online mirror (teams allowed, unrated) {1184} | PROGRAMMING | helvetic-coding-contest-2019-editorial.pdf | 1400 | |
| 2584 | Parallel Universes (Easy) | implementation | Statement | D1 | Helvetic Coding Contest 2019 online mirror (teams allowed, unrated) {1184} | PROGRAMMING | helvetic-coding-contest-2019-editorial.pdf | 1600 | |
| 2393 | Heidi and the Turing Test (Easy) | implementation | Statement | C1 | Helvetic Coding Contest 2019 online mirror (teams allowed, unrated) {1184} | PROGRAMMING | helvetic-coding-contest-2019-editorial.pdf | 1700 | |
| 1660 | Daleks' Invasion (easy) | graphs trees | Statement | E1 | Helvetic Coding Contest 2019 online mirror (teams allowed, unrated) {1184} | PROGRAMMING | helvetic-coding-contest-2019-editorial.pdf | 2000 | |
| 1007 | Heidi Learns Hashing (Medium) | brute force number theory | Statement | A2 | Helvetic Coding Contest 2019 online mirror (teams allowed, unrated) {1184} | PROGRAMMING | helvetic-coding-contest-2019-editorial.pdf | 2100 | |
| 965 | Daleks' Invasion (medium) | dfs and similar graphs shortest paths trees | Statement | E2 | Helvetic Coding Contest 2019 online mirror (teams allowed, unrated) {1184} | PROGRAMMING | helvetic-coding-contest-2019-editorial.pdf | 2200 | |
| 603 | The Doctor Meets Vader (Medium) | flows graph matchings graphs shortest paths sortings | Statement | B2 | Helvetic Coding Contest 2019 online mirror (teams allowed, unrated) {1184} | PROGRAMMING | helvetic-coding-contest-2019-editorial.pdf | 2300 | |
| 635 | Heidi and the Turing Test (Medium) | data structures | Statement | C2 | Helvetic Coding Contest 2019 online mirror (teams allowed, unrated) {1184} | PROGRAMMING | helvetic-coding-contest-2019-editorial.pdf | 2300 |