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']
Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 26292 | Before an Exam | constructive algorithms greedy | Statement | B | Codeforces Beta Round 4 (Div. 2 Only) {4} | PROGRAMMING | 1500 | ||
| 2857 | Unordered Subsequence | constructive algorithms greedy | Statement | C | Codeforces Beta Round 27 (Codeforces format, Div. 2) {27} | PROGRAMMING | Solution of ABC @ Round#27 | 2000 | |
| 2009 | 3-cycles | constructive algorithms graphs greedy | Statement | E | Codeforces Beta Round 40 (Div. 2) {41} | PROGRAMMING | Codeforces Beta Round #40 Mini-Tutorial | 1900 | |
| 584 | Triminoes | constructive algorithms greedy | Statement | J | School Team Contest 2 (Winter Computer School 2010/11) {44} | PROGRAMMING | 2000 | ||
| 558 | Director | constructive algorithms greedy | Statement | E | School Team Contest 3 (Winter Computer School 2010/11) {45} | PROGRAMMING | 2100 | ||
| 671 | Polycarp's Picture Gallery | constructive algorithms greedy | Statement | D | Yandex.Algorithm Open 2011: Qualification 1 {81} | PROGRAMMING | 2000 | ||
| 284 | Grocer's Problem | constructive algorithms graphs greedy | Statement | D | Codeforces Beta Round 75 (Div. 1 Only) {91} | PROGRAMMING | 2500 | ||
| 975 | Russian Roulette | constructive algorithms greedy | Statement | C | Codeforces Beta Round 80 (Div. 1 Only) {103} | PROGRAMMING | Tutorial | 1900 | |
| 956 | Hobbits' Party | constructive algorithms greedy | Statement | C | Codeforces Testing Round 2 {125} | PROGRAMMING | 1700 | ||
| 426 | Two progressions | constructive algorithms greedy | Statement | D | Codeforces Testing Round 2 {125} | PROGRAMMING | 2000 | ||
| 753 | E-reader Display | constructive algorithms greedy | Statement | C | Codeforces Beta Round 93 (Div. 1 Only) {126} | PROGRAMMING | Tutorial | 2200 | |
| 636 | Constants in the language of Shakespeare | constructive algorithms dp greedy | Statement | D | Codeforces Beta Round 96 (Div. 1) {132} | PROGRAMMING | Codeforces Beta Round #96: editorial | 2100 | |
| 482 | Swaps | constructive algorithms graphs greedy | Statement | C | Codeforces Testing Round 3 {134} | PROGRAMMING | 2200 | ||
| 1363 | Zero-One | constructive algorithms games greedy | Statement | C | Codeforces Beta Round 97 (Div. 1) {135} | PROGRAMMING | Codeforces Beta Round #97: editorial | 2000 | |
| 3190 | Terse princess | constructive algorithms greedy | Statement | C | Codeforces Round 105 (Div. 2) {148} | PROGRAMMING | Codeforces Round #105 (Div. 2): editorial | 1700 | |
| 796 | Trails and Glades | constructive algorithms ds graphs greedy | Statement | C | VK Cup 2012 Finals, Practice Session {209} | PROGRAMMING | 2400 | ||
| 12253 | Dice Tower | constructive algorithms greedy | Statement | A | Codeforces Round 139 (Div. 2) {225} | PROGRAMMING | 1200 | ||
| 999 | The table | constructive algorithms greedy | Statement | D | Codeforces Round 140 (Div. 1) {226} | PROGRAMMING | Codeforces Round #140 Editorial | 2100 | |
| 3681 | Magic, Wizardry and Wonders | constructive algorithms greedy | Statement | B | Codeforces Round 143 (Div. 2) {231} | PROGRAMMING | 1600 | ||
| 580 | Merging Two Decks | constructive algorithms greedy | Statement | H | Codeforces Round 145 (Div. 2, ACM-ICPC Rules) {234} | PROGRAMMING | 2100 | ||
| 2410 | Restoring Table | constructive algorithms greedy | Statement | D | CROC-MBTU 2012, Elimination Round (ACM-ICPC) {245} | PROGRAMMING | 1500 | ||
| 1703 | Flawed Flow | constructive algorithms flows graphs greedy | Statement | C | Codeforces Round 165 (Div. 1) {269} | PROGRAMMING | 2500 | ||
| 3591 | Fish Weight | constructive algorithms greedy | Statement | B | Codeforces Round 180 (Div. 1) {297} | PROGRAMMING | 1700 | ||
| 565 | Ilya and Two Numbers | constructive algorithms data structures ds greedy | Statement | E | Codeforces Round 186 (Div. 2) {313} | PROGRAMMING | Tutorial | 2300 | |
| 4706 | Purification | constructive algorithms greedy | Statement | A | Codeforces Round 192 (Div. 1) {329} | PROGRAMMING | 1500 | ||
| 565 | Three Swaps | constructive algorithms dfs and similar greedy | Statement | E | Codeforces Round 197 (Div. 2) {339} | PROGRAMMING | 2200 | ||
| 475 | Candies Game | constructive algorithms greedy | Statement | E | Codeforces Round 198 (Div. 1) {341} | PROGRAMMING | 2900 | ||
| 525 | Dominoes | constructive algorithms greedy | Statement | C | Codeforces Round 231 (Div. 2) {394} | PROGRAMMING | 1500.0 | ||
| 743 | Square Tiling | constructive algorithms greedy | Statement | E | Codeforces Round 246 (Div. 2) {432} | PROGRAMMING | Codeforces Round #246 (Div. 2) Editorial | 2700 | |
| 9830 | Diverse Permutation | constructive algorithms greedy | Statement | A | Codeforces Round 275 (Div. 1) {482} | PROGRAMMING | Codeforces Round #275 Editorial | 1300 | |
| 4513 | Anya and Ghosts | constructive algorithms greedy | Statement | C | Codeforces Round 288 (Div. 2) {508} | PROGRAMMING | 1600 | ||
| 2878 | Drazil and Tiles | constructive algorithms greedy | Statement | D | Codeforces Round 292 (Div. 2) {515} | PROGRAMMING | Codeforces Round #292 Editorial | 2100 | |
| 1513 | Looksery Party | constructive algorithms dfs and similar graphs greedy | Statement | B | Looksery Cup 2015 {549} | PROGRAMMING | 2300 | ||
| 278 | Replicating Processes | constructive algorithms greedy | Statement | B | VK Cup 2015 - Finals, online mirror {566} | PROGRAMMING | 2600 | ||
| 682 | CNF 2 | constructive algorithms dfs and similar graphs greedy | Statement | C | Codeforces Round 317 [AimFund Thanks-Round] (Div. 1) {571} | PROGRAMMING | 2600 | ||
| 652 | Walking! | constructive algorithms greedy | Statement | E | Codeforces Round 320 (Div. 1) [Bayan Thanks-Round] {578} | PROGRAMMING | 2500 | ||
| 7253 | Sorting Railway Cars | constructive algorithms greedy | Statement | A | Codeforces Round 335 (Div. 1) {605} | PROGRAMMING | Codeforces Round #335 Problem Analysis | 1600 | |
| 8215 | Heap Operations | constructive algorithms data structures greedy | Statement | C | Codeforces Round 357 (Div. 2) {681} | PROGRAMMING | 1600 | ||
| 2049 | One-Way Reform | constructive algorithms dfs and similar flows graphs greedy | Statement | E | Codeforces Round 375 (Div. 2) {723} | PROGRAMMING | 2300 | ||
| 1956 | T-shirts Distribution | constructive algorithms flows greedy | Statement | D | Technocup 2017 - Elimination Round 1 (Unofficially Open for Everyone, Rated for Div. 2) {727} | PROGRAMMING | 1800 | ||
| 8101 | Coupons and Discounts | constructive algorithms greedy | Statement | B | Codeforces Round 376 (Div. 2) {731} | PROGRAMMING | 1200 | ||
| 8070 | Alyona and mex | constructive algorithms greedy | Statement | A | Codeforces Round 381 (Div. 1) {739} | PROGRAMMING | 48582 | 1600 | |
| 1940 | Santa Claus and a Palindrome | constructive algorithms data structures greedy | Statement | D | Technocup 2017 - Elimination Round 3 {748} | PROGRAMMING | Codeforces Round 389 (Div.2) Editorial | 2000 | |
| 6981 | Bear and Different Names | constructive algorithms greedy | Statement | B | VK Cup 2017 - Round 1 {771} | PROGRAMMING | 1500 | ||
| 1854 | Ice cream coloring | constructive algorithms dfs and similar greedy | Statement | C | Codeforces Round 411 (Div. 1) {804} | PROGRAMMING | 2200 | ||
| 6232 | Buy Low Sell High | constructive algorithms data structures greedy | Statement | D | MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists) {865} | PROGRAMMING | MemSQL Start[c]UP 3.0 Round 2 Editorial | 2300 | |
| 389 | Berland Army | constructive algorithms graphs greedy | Statement | B | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {883} | PROGRAMMING | 2800 | ||
| 3053 | Gluttony | constructive algorithms greedy | Statement | B | Codeforces Round 446 (Div. 1) {891} | PROGRAMMING | Codeforces Round #446 Editorial | 2000 | |
| 4701 | Squares and not squares | constructive algorithms greedy | Statement | E | Codeforces Round 451 (Div. 2) {898} | PROGRAMMING | Codeforces Round #451 (Div.2) Editorial | 1600 | |
| 1107 | Byteland, Berland and Disputed Cities | constructive algorithms greedy | Statement | E | Educational Codeforces Round 42 (Rated for Div. 2) {962} | PROGRAMMING | Educational Codeforces Round 42 Editorial | 2200 | |
| 8481 | Walking Between Houses | constructive algorithms greedy | Statement | D | Codeforces Round 501 (Div. 3) {1015} | PROGRAMMING | 60949 | 1600 | |
| 6136 | The Phone Number | constructive algorithms greedy | Statement | C | Codeforces Round 502 (in memory of Leopoldo Taravilse, Div. 1 + Div. 2) {1017} | PROGRAMMING | Разбор (англ.) | 1600 | |
| 3669 | Tree Reconstruction | constructive algorithms data structures graphs greedy | Statement | E | Codeforces Round 509 (Div. 2) {1041} | PROGRAMMING | Codeforces Round #509 (Div. 2) Editorial | 1900 | |
| 843 | New Year and the Mallard Expedition | constructive algorithms greedy | Statement | F | Good Bye 2018 {1091} | PROGRAMMING | Editorial | 2600 | |
| 495 | Egor and an RPG game | constructive algorithms greedy | Statement | E | Hello 2019 {1097} | PROGRAMMING | 64310 | 3100 | |
| 15756 | Diverse Garland | constructive algorithms dp greedy | Statement | D | Codeforces Round 535 (Div. 3) {1108} | PROGRAMMING | 64751 | 1400 | |
| 3500 | Spanning Tree with One Fixed Degree | constructive algorithms dfs and similar ds graphs greedy | Statement | F2 | Codeforces Round 544 (Div. 3) {1133} | PROGRAMMING | Codeforces Round #544 (Div. 3) Editorial | 2200 | |
| 10513 | Equalize Them All | constructive algorithms greedy | Statement | D | Codeforces Round 550 (Div. 3) {1144} | PROGRAMMING | 66307 | 1400 | |
| 9179 | Serval and Toy Bricks | constructive algorithms greedy | Statement | B | Codeforces Round 551 (Div. 2) {1153} | PROGRAMMING | Editorial | 1200 | |
| 7123 | Bicolored RBS | constructive algorithms greedy | Statement | D | Educational Codeforces Round 65 (Rated for Div. 2) {1167} | PROGRAMMING | 67058 | 1500 | |
| 9208 | Nauuo and Chess | constructive algorithms greedy | Statement | B | Codeforces Round 564 (Div. 2) {1173} | PROGRAMMING | Codeforces Round #564 Editorial | 1100 | |
| 11476 | Swap Letters | constructive algorithms greedy | Statement | C | Codeforces Round 585 (Div. 2) {1215} | PROGRAMMING | Codeforces Round #585 Editorial | 1500 | |
| 12237 | Knights | constructive algorithms greedy | Statement | B | Educational Codeforces Round 73 (Rated for Div. 2) {1221} | PROGRAMMING | Разбор Educational Codeforces Round 73 | 1100 | |
| 6169 | Balanced Removals (Easier) | constructive algorithms geometry greedy | Statement | C1 | Codeforces Global Round 5 {1237} | PROGRAMMING | T | 1600 | |
| 14069 | Restricted RPS | constructive algorithms dp greedy | Statement | B | Codeforces Round 597 (Div. 2) {1245} | PROGRAMMING | Codeforces Round #597 (Div. 2) Editorial | 1200 | |
| 15473 | Beautiful String | constructive algorithms greedy | Statement | A | Codeforces Round 604 (Div. 2) {1265} | PROGRAMMING | Codeforces Round #604 Editorial | 1000 | |
| 2089 | Ehab's Last Theorem | constructive algorithms dfs and similar graphs greedy | Statement | F | Codeforces Round 628 (Div. 2) {1325} | PROGRAMMING | 2750.0 | 74235 | 2600 |
| 26089 | Phoenix and Beauty | constructive algorithms data structures greedy | Statement | B | Codeforces Round 638 (Div. 2) {1348} | PROGRAMMING | 1000.0 | Codeforces Round #638 (Div. 2) Editorial | 1400 |
| 106 | Slime and Hats | constructive algorithms dp greedy | Statement | E | Codeforces Round 641 (Div. 1) {1349} | PROGRAMMING | 2500.0 | Codeforces Round #641 Editorial | 3500 |
| 2273 | Ski Accidents | constructive algorithms dfs and similar greedy | Statement | E | Codeforces Global Round 8 {1368} | PROGRAMMING | 2500.0 | Codeforces Global Round 8: editorial |