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 ... 51 52 53 54 55 ... 100 101 102 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 592 | Daleks' Invasion (hard) | data structures ds graphs trees | Statement | E3 | Helvetic Coding Contest 2019 online mirror (teams allowed, unrated) {1184} | PROGRAMMING | helvetic-coding-contest-2019-editorial.pdf | 2500 | |
| 174 | The Doctor Meets Vader (Hard) | flows shortest paths | Statement | B3 | Helvetic Coding Contest 2019 online mirror (teams allowed, unrated) {1184} | PROGRAMMING | helvetic-coding-contest-2019-editorial.pdf | 2700 | |
| 140 | Heidi Learns Hashing (Hard) | fft math number theory | Statement | A3 | Helvetic Coding Contest 2019 online mirror (teams allowed, unrated) {1184} | PROGRAMMING | helvetic-coding-contest-2019-editorial.pdf | 3100 | |
| 41 | Heidi and the Turing Test (Hard) | Statement | C3 | Helvetic Coding Contest 2019 online mirror (teams allowed, unrated) {1184} | PROGRAMMING | helvetic-coding-contest-2019-editorial.pdf | 3200 | ||
| 109 | Parallel Universes (Hard) | math matrices | Statement | D2 | Helvetic Coding Contest 2019 online mirror (teams allowed, unrated) {1184} | PROGRAMMING | helvetic-coding-contest-2019-editorial.pdf | 3300 | |
| 11485 | Exam in BerSU (easy version) | greedy sortings | Statement | C1 | Codeforces Round 568 (Div. 2) {1185} | PROGRAMMING | Editorial for Codeforces Round #568 (Div. 2) | 1200 | |
| 13566 | Email from Polycarp | implementation strings | Statement | B | Codeforces Round 568 (Div. 2) {1185} | PROGRAMMING | Editorial for Codeforces Round #568 (Div. 2) | 1200 | |
| 6780 | Extra Element | implementation math | Statement | D | Codeforces Round 568 (Div. 2) {1185} | PROGRAMMING | Editorial for Codeforces Round #568 (Div. 2) | 1700 | |
| 7518 | Exam in BerSU (hard version) | brute force data structures greedy math | Statement | C2 | Codeforces Round 568 (Div. 2) {1185} | PROGRAMMING | Editorial for Codeforces Round #568 (Div. 2) | 1700 | |
| 2674 | Polycarp and Snakes | brute force implementation | Statement | E | Codeforces Round 568 (Div. 2) {1185} | PROGRAMMING | Editorial for Codeforces Round #568 (Div. 2) | 2000 | |
| 2911 | Playlist for Polycarp (easy version) | bitmasks combinatorics dp | Statement | G1 | Codeforces Round 568 (Div. 2) {1185} | PROGRAMMING | Editorial for Codeforces Round #568 (Div. 2) | 2100 | |
| 2067 | Two Pizzas | bitmasks brute force | Statement | F | Codeforces Round 568 (Div. 2) {1185} | PROGRAMMING | Editorial for Codeforces Round #568 (Div. 2) | 2200 | |
| 778 | Playlist for Polycarp (hard version) | combinatorics dp | Statement | G2 | Codeforces Round 568 (Div. 2) {1185} | PROGRAMMING | Editorial for Codeforces Round #568 (Div. 2) | 2800 | |
| 14996 | Ropewalkers | math | Statement | A | Codeforces Round 568 (Div. 2) {1185} | PROGRAMMING | Editorial for Codeforces Round #568 (Div. 2) | 900 | |
| 9024 | Vus the Cossack and Numbers | constructive algorithms greedy math | Statement | D | Codeforces Round 571 (Div. 2) {1186} | PROGRAMMING | E | 1600 | |
| 6189 | Vus the Cossack and Strings | implementation math | Statement | C | Codeforces Round 571 (Div. 2) {1186} | PROGRAMMING | E | 1800 | |
| 803 | Vus the Cossack and a Graph | dfs and similar graphs greedy implementation | Statement | F | Codeforces Round 571 (Div. 2) {1186} | PROGRAMMING | E | 2300 | |
| 639 | Vus the Cossack and a Field | divide and conquer implementation math | Statement | E | Codeforces Round 571 (Div. 2) {1186} | PROGRAMMING | E | 2500 | |
| 38411 | Vus the Cossack and a Contest | implementation | Statement | A | Codeforces Round 571 (Div. 2) {1186} | PROGRAMMING | E | 600 | |
| 12342 | Letters Shop | binary search implementation strings | Statement | B | Educational Codeforces Round 67 (Rated for Div. 2) {1187} | PROGRAMMING | Разбор Educational Codeforces Round 67 | 1300 | |
| 6420 | Vasya And Array | constructive algorithms greedy implementation | Statement | C | Educational Codeforces Round 67 (Rated for Div. 2) {1187} | PROGRAMMING | Разбор Educational Codeforces Round 67 | 1800 | |
| 8728 | Tree Painting | dfs and similar dp trees | Statement | E | Educational Codeforces Round 67 (Rated for Div. 2) {1187} | PROGRAMMING | Разбор Educational Codeforces Round 67 | 2000 | |
| 2688 | Subarray Sorting | data structures sortings | Statement | D | Educational Codeforces Round 67 (Rated for Div. 2) {1187} | PROGRAMMING | Разбор Educational Codeforces Round 67 | 2200 | |
| 599 | Gang Up | flows graphs | Statement | G | Educational Codeforces Round 67 (Rated for Div. 2) {1187} | PROGRAMMING | Разбор Educational Codeforces Round 67 | 2600 | |
| 903 | Expected Square Beauty | dp math probabilities | Statement | F | Educational Codeforces Round 67 (Rated for Div. 2) {1187} | PROGRAMMING | Разбор Educational Codeforces Round 67 | 2600 | |
| 14975 | Stickers and Toys | math | Statement | A | Educational Codeforces Round 67 (Rated for Div. 2) {1187} | PROGRAMMING | Разбор Educational Codeforces Round 67 | 900 | |
| 8528 | Add on a Tree | trees | Statement | A1 | Codeforces Round 572 (Div. 1) {1188} | PROGRAMMING | Editorial of Codeforces Round #572 | 1600 | |
| 4636 | Count Pairs | math matrices number theory two pointers | Statement | B | Codeforces Round 572 (Div. 1) {1188} | PROGRAMMING | Editorial of Codeforces Round #572 | 2200 | |
| 1252 | Add on a Tree: Revolution | constructive algorithms dfs and similar implementation trees | Statement | A2 | Codeforces Round 572 (Div. 1) {1188} | PROGRAMMING | Editorial of Codeforces Round #572 | 2500 | |
| 1851 | Array Beauty | dp | Statement | C | Codeforces Round 572 (Div. 1) {1188} | PROGRAMMING | Editorial of Codeforces Round #572 | 2700 | |
| 743 | Make Equal | dp | Statement | D | Codeforces Round 572 (Div. 1) {1188} | PROGRAMMING | Editorial of Codeforces Round #572 | 3000 | |
| 249 | Problem from Red Panda | combinatorics | Statement | E | Codeforces Round 572 (Div. 1) {1188} | PROGRAMMING | Editorial of Codeforces Round #572 | 3200 | |
| 14477 | Number Circle | greedy math sortings | Statement | B | Codeforces Round 572 (Div. 2) {1189} | PROGRAMMING | Editorial of Codeforces Round #572 | 1100 | |
| 10674 | Candies! | data structures dp implementation math | Statement | C | Codeforces Round 572 (Div. 2) {1189} | PROGRAMMING | Editorial of Codeforces Round #572 | 1400 | |
| 15416 | Keanu Reeves | strings | Statement | A | Codeforces Round 572 (Div. 2) {1189} | PROGRAMMING | Editorial of Codeforces Round #572 | 800 | |
| 9419 | Tokitsukaze and Discard Items | implementation two pointers | Statement | A | Codeforces Round 573 (Div. 1) {1190} | PROGRAMMING | E | 1500 | |
| 6512 | Tokitsukaze, CSL and Stone Game | games | Statement | B | Codeforces Round 573 (Div. 1) {1190} | PROGRAMMING | E | 1800 | |
| 2329 | Tokitsukaze and Strange Rectangle | data structures divide and conquer sortings two pointers | Statement | D | Codeforces Round 573 (Div. 1) {1190} | PROGRAMMING | E | 2200 | |
| 2048 | Tokitsukaze and Duel | brute force games greedy | Statement | C | Codeforces Round 573 (Div. 1) {1190} | PROGRAMMING | E | 2400 | |
| 229 | Tokitsukaze and Explosion | binary search greedy | Statement | E | Codeforces Round 573 (Div. 1) {1190} | PROGRAMMING | E | 3100 | |
| 94 | Tokitsukaze and Powers | number theory probabilities | Statement | F | Codeforces Round 573 (Div. 1) {1190} | PROGRAMMING | E | 3300 | |
| 9666 | Tokitsukaze and Mahjong | brute force implementation | Statement | B | Codeforces Round 573 (Div. 2) {1191} | PROGRAMMING | 68314 | 1200 | |
| 18301 | Tokitsukaze and Enhancement | brute force | Statement | A | Codeforces Round 573 (Div. 2) {1191} | PROGRAMMING | 68314 | 700 | |
| 1257 | Dynamic Diameter | *special data structures dfs and similar divide and conquer trees | Statement | B | CEOI 2019 day 1 online mirror (unrated, IOI format) {1192} | PROGRAMMING | E | ||
| 338 | Cubeword | *special brute force dp meet-in-the-middle | Statement | C | CEOI 2019 day 1 online mirror (unrated, IOI format) {1192} | PROGRAMMING | E | ||
| 63 | Building Skyscrapers | *special | Statement | A | CEOI 2019 day 1 online mirror (unrated, IOI format) {1192} | PROGRAMMING | E | ||
| 42 | Scissors and Tape | *special constructive algorithms geometry | Statement | C | CEOI 2019 day 2 online mirror (unrated, IOI format) {1193} | PROGRAMMING | T | ||
| 451 | Magic Tree | *special data structures dp trees | Statement | B | CEOI 2019 day 2 online mirror (unrated, IOI format) {1193} | PROGRAMMING | T | ||
| 296 | Amusement Park | *special dp math | Statement | A | CEOI 2019 day 2 online mirror (unrated, IOI format) {1193} | PROGRAMMING | T | ||
| 10370 | Yet Another Crosses Problem | implementation | Statement | B | Educational Codeforces Round 68 (Rated for Div. 2) {1194} | PROGRAMMING | Разбор Educational Codeforces Round 68 | 1300 | |
| 13363 | From S To T | implementation strings | Statement | C | Educational Codeforces Round 68 (Rated for Div. 2) {1194} | PROGRAMMING | Разбор Educational Codeforces Round 68 | 1300 | |
| 6650 | 1-2-K Game | games math | Statement | D | Educational Codeforces Round 68 (Rated for Div. 2) {1194} | PROGRAMMING | Разбор Educational Codeforces Round 68 | 1700 | |
| 1946 | Count The Rectangles | bitmasks brute force data structures geometry sortings | Statement | E | Educational Codeforces Round 68 (Rated for Div. 2) {1194} | PROGRAMMING | Разбор Educational Codeforces Round 68 | 2200 | |
| 1011 | Crossword Expert | combinatorics dp number theory probabilities two pointers | Statement | F | Educational Codeforces Round 68 (Rated for Div. 2) {1194} | PROGRAMMING | Разбор Educational Codeforces Round 68 | 2500 | |
| 265 | Another Meme Problem | dp | Statement | G | Educational Codeforces Round 68 (Rated for Div. 2) {1194} | PROGRAMMING | Разбор Educational Codeforces Round 68 | 3000 | |
| 16539 | Remove a Progression | math | Statement | A | Educational Codeforces Round 68 (Rated for Div. 2) {1194} | PROGRAMMING | Разбор Educational Codeforces Round 68 | 800 | |
| 20210 | Sport Mafia | binary search brute force math | Statement | B | Codeforces Round 574 (Div. 2) {1195} | PROGRAMMING | Разбор Codeforces Round #574 (Div. 2) | 1100 | |
| 13306 | Drinks Choosing | greedy math | Statement | A | Codeforces Round 574 (Div. 2) {1195} | PROGRAMMING | Разбор Codeforces Round #574 (Div. 2) | 1100 | |
| 27259 | Basketball Exercise | dp | Statement | C | Codeforces Round 574 (Div. 2) {1195} | PROGRAMMING | Разбор Codeforces Round #574 (Div. 2) | 1400 | |
| 7943 | Submarine in the Rybinsk Sea (easy edition) | combinatorics math number theory | Statement | D1 | Codeforces Round 574 (Div. 2) {1195} | PROGRAMMING | Разбор Codeforces Round #574 (Div. 2) | 1500 | |
| 4693 | Submarine in the Rybinsk Sea (hard edition) | combinatorics math number theory | Statement | D2 | Codeforces Round 574 (Div. 2) {1195} | PROGRAMMING | Разбор Codeforces Round #574 (Div. 2) | 1700 | |
| 3210 | OpenStreetMap | data structures two pointers | Statement | E | Codeforces Round 574 (Div. 2) {1195} | PROGRAMMING | Разбор Codeforces Round #574 (Div. 2) | 2100 | |
| 909 | Geometers Anonymous Club | data structures geometry math sortings | Statement | F | Codeforces Round 574 (Div. 2) {1195} | PROGRAMMING | Разбор Codeforces Round #574 (Div. 2) | 2700 | |
| 16846 | Odd Sum Segments | constructive algorithms math | Statement | B | Codeforces Round 575 (Div. 3) {1196} | PROGRAMMING | Editorial | 1200 | |
| 9433 | Robot Breakout | implementation | Statement | C | Codeforces Round 575 (Div. 3) {1196} | PROGRAMMING | Editorial | 1500 | |
| 10671 | RGB Substring (easy version) | implementation | Statement | D1 | Codeforces Round 575 (Div. 3) {1196} | PROGRAMMING | Editorial | 1500 | |
| 9870 | RGB Substring (hard version) | data structures dp implementation two pointers | Statement | D2 | Codeforces Round 575 (Div. 3) {1196} | PROGRAMMING | Editorial | 1600 | |
| 3777 | Connected Component on a Chessboard | constructive algorithms implementation | Statement | E | Codeforces Round 575 (Div. 3) {1196} | PROGRAMMING | Editorial | 1900 | |
| 2738 | K-th Path | brute force constructive algorithms shortest paths sortings | Statement | F | Codeforces Round 575 (Div. 3) {1196} | PROGRAMMING | Editorial | 2500 | |
| 27974 | Three Piles of Candies | brute force constructive algorithms math | Statement | A | Codeforces Round 575 (Div. 3) {1196} | PROGRAMMING | Editorial | 700 | |
| 13961 | Pillars | greedy implementation | Statement | B | Educational Codeforces Round 69 (Rated for Div. 2) {1197} | PROGRAMMING | E | 1000 | |
| 13630 | DIY Wooden Ladder | greedy math sortings | Statement | A | Educational Codeforces Round 69 (Rated for Div. 2) {1197} | PROGRAMMING | E | 1000 | |
| 14034 | Array Splitting | greedy sortings | Statement | C | Educational Codeforces Round 69 (Rated for Div. 2) {1197} | PROGRAMMING | E | 1400 | |
| 5475 | Yet Another Subarray Problem | dp greedy math | Statement | D | Educational Codeforces Round 69 (Rated for Div. 2) {1197} | PROGRAMMING | E | 1900 | |
| 1704 | Culture Code | binary search combinatorics data structures dp shortest paths sortings | Statement | E | Educational Codeforces Round 69 (Rated for Div. 2) {1197} | PROGRAMMING | E | 2300 | |
| 270 | Coloring Game | dp games matrices | Statement | F | Educational Codeforces Round 69 (Rated for Div. 2) {1197} | PROGRAMMING | E | 2500 | |
| 9571 | Welfare State | binary search brute force data structures sortings | Statement | B | Codeforces Round 576 (Div. 1) {1198} | PROGRAMMING | E | 1600 | |
| 9114 | MP3 | sortings two pointers | Statement | A | Codeforces Round 576 (Div. 1) {1198} | PROGRAMMING | E | 1700 | |
| 3634 | Matching vs Independent Set | constructive algorithms graphs greedy sortings | Statement | C | Codeforces Round 576 (Div. 1) {1198} | PROGRAMMING | E | 2200 | |
| 3367 | Rectangle Painting 1 | dp | Statement | D | Codeforces Round 576 (Div. 1) {1198} | PROGRAMMING | E | 2400 | |
| 1192 | Rectangle Painting 2 | flows graph matchings graphs | Statement | E | Codeforces Round 576 (Div. 1) {1198} | PROGRAMMING | E | 2500 | |
| 912 | GCD Groups 2 | greedy number theory probabilities | Statement | F | Codeforces Round 576 (Div. 1) {1198} | PROGRAMMING | E | 2900 | |
| 20904 | Water Lily | geometry math | Statement | B | Codeforces Round 576 (Div. 2) {1199} | PROGRAMMING | E | 1000 | |
| 15155 | City Day | implementation | Statement | A | Codeforces Round 576 (Div. 2) {1199} | PROGRAMMING | E | 1000 | |
| 20578 | Hotelier | brute force data structures implementation | Statement | A | Codeforces Round 578 (Div. 2) {1200} | PROGRAMMING | Codeforces Round #578 (Div. 2) Editorial | 1000 | |
| 14075 | Block Adventure | dp greedy | Statement | B | Codeforces Round 578 (Div. 2) {1200} | PROGRAMMING | Codeforces Round #578 (Div. 2) Editorial | 1300 | |
| 9947 | Round Corridor | math number theory | Statement | C | Codeforces Round 578 (Div. 2) {1200} | PROGRAMMING | Codeforces Round #578 (Div. 2) Editorial | 1500 | |
| 4189 | White Lines | brute force data structures dp implementation two pointers | Statement | D | Codeforces Round 578 (Div. 2) {1200} | PROGRAMMING | Codeforces Round #578 (Div. 2) Editorial | 1900 | |
| 7942 | Compress Words | brute force hashing implementation string suffix structures strings | Statement | E | Codeforces Round 578 (Div. 2) {1200} | PROGRAMMING | Codeforces Round #578 (Div. 2) Editorial | 2000 | |
| 1096 | Graph Traveler | brute force data structures dfs and similar dp graphs implementation math number theory | Statement | F | Codeforces Round 578 (Div. 2) {1200} | PROGRAMMING | Codeforces Round #578 (Div. 2) Editorial | 2500 | |
| 25092 | Maximum Median | binary search greedy math sortings | Statement | C | Codeforces Round 577 (Div. 2) {1201} | PROGRAMMING | Codeforces Round #577 (Div 2) Editorial | 1400 | |
| 19663 | Zero Array | greedy math | Statement | B | Codeforces Round 577 (Div. 2) {1201} | PROGRAMMING | Codeforces Round #577 (Div 2) Editorial | 1500 | |
| 2404 | Treasure Hunting | binary search dp greedy implementation | Statement | D | Codeforces Round 577 (Div. 2) {1201} | PROGRAMMING | Codeforces Round #577 (Div 2) Editorial | 2000 | |
| 132 | Knightmare (easy) | graphs interactive shortest paths | Statement | E1 | Codeforces Round 577 (Div. 2) {1201} | PROGRAMMING | Codeforces Round #577 (Div 2) Editorial | 2900 | |
| 148 | Knightmare (hard) | graphs interactive shortest paths | Statement | E2 | Codeforces Round 577 (Div. 2) {1201} | PROGRAMMING | Codeforces Round #577 (Div 2) Editorial | 3000 | |
| 15880 | Important Exam | implementation strings | Statement | A | Codeforces Round 577 (Div. 2) {1201} | PROGRAMMING | Codeforces Round #577 (Div 2) Editorial | 900 | |
| 9684 | You Are Given Two Binary Strings... | bitmasks greedy | Statement | A | Educational Codeforces Round 70 (Rated for Div. 2) {1202} | PROGRAMMING | 68972 | 1100 | |
| 4612 | You Are Given a Decimal String... | brute force dp shortest paths | Statement | B | Educational Codeforces Round 70 (Rated for Div. 2) {1202} | PROGRAMMING | 68972 | 1700 | |
| 5184 | Print a 1337-string... | combinatorics constructive algorithms math strings | Statement | D | Educational Codeforces Round 70 (Rated for Div. 2) {1202} | PROGRAMMING | 68972 | 1900 | |
| 2596 | You Are Given a WASD-string... | brute force data structures dp greedy implementation math strings | Statement | C | Educational Codeforces Round 70 (Rated for Div. 2) {1202} | PROGRAMMING | 68972 | 2100 |