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 ... 55 56 57 58 59 ... 100 101 102 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 13914 | Everyone is a Winner! | binary search math meet-in-the-middle number theory | Statement | C | Codeforces Round 603 (Div. 2) {1263} | PROGRAMMING | Разбор Codeforces Round #603 (Div. 2) | 1400 | |
| 14371 | Secret Passwords | dfs and similar ds graphs | Statement | D | Codeforces Round 603 (Div. 2) {1263} | PROGRAMMING | Разбор Codeforces Round #603 (Div. 2) | 1500 | |
| 2820 | Editor | data structures implementation | Statement | E | Codeforces Round 603 (Div. 2) {1263} | PROGRAMMING | Разбор Codeforces Round #603 (Div. 2) | 2000 | |
| 899 | Economic Difficulties | data structures dfs and similar dp flows graphs trees | Statement | F | Codeforces Round 603 (Div. 2) {1263} | PROGRAMMING | Разбор Codeforces Round #603 (Div. 2) | 2500 | |
| 10182 | Beautiful Regional Contest | greedy implementation | Statement | A | Codeforces Round 604 (Div. 1) {1264} | PROGRAMMING | 71995 | 1500 | |
| 5871 | Beautiful Sequence | brute force constructive algorithms greedy | Statement | B | Codeforces Round 604 (Div. 1) {1264} | PROGRAMMING | 71995 | 1900 | |
| 1208 | Beautiful Mirrors with queries | data structures probabilities | Statement | C | Codeforces Round 604 (Div. 1) {1264} | PROGRAMMING | 71995 | 2400 | |
| 1325 | Beautiful Bracket Sequence (easy version) | combinatorics dp probabilities | Statement | D1 | Codeforces Round 604 (Div. 1) {1264} | PROGRAMMING | 71995 | 2600 | |
| 821 | Beautiful League | constructive algorithms flows graph matchings | Statement | E | Codeforces Round 604 (Div. 1) {1264} | PROGRAMMING | 71995 | 2700 | |
| 1042 | Beautiful Bracket Sequence (hard version) | combinatorics probabilities | Statement | D2 | Codeforces Round 604 (Div. 1) {1264} | PROGRAMMING | 71995 | 3000 | |
| 960 | Beautiful Fibonacci Problem | constructive algorithms number theory | Statement | F | Codeforces Round 604 (Div. 1) {1264} | PROGRAMMING | 71995 | 3600 | |
| 15273 | Beautiful String | constructive algorithms greedy | Statement | A | Codeforces Round 604 (Div. 2) {1265} | PROGRAMMING | Codeforces Round #604 Editorial | 1000 | |
| 12828 | Beautiful Numbers | data structures implementation math two pointers | Statement | B | Codeforces Round 604 (Div. 2) {1265} | PROGRAMMING | Codeforces Round #604 Editorial | 1300 | |
| 3845 | Beautiful Mirrors | data structures dp math probabilities | Statement | E | Codeforces Round 604 (Div. 2) {1265} | PROGRAMMING | Codeforces Round #604 Editorial | 2100 | |
| 15364 | Dice Tower | constructive algorithms math | Statement | B | Codeforces Global Round 6 {1266} | PROGRAMMING | Codeforces Global Round 6 Editorial | 1000 | |
| 16187 | Competitive Programmer | chinese remainder theorem math | Statement | A | Codeforces Global Round 6 {1266} | PROGRAMMING | Codeforces Global Round 6 Editorial | 1000 | |
| 9772 | Diverse Matrix | constructive algorithms greedy math number theory | Statement | C | Codeforces Global Round 6 {1266} | PROGRAMMING | Codeforces Global Round 6 Editorial | 1400 | |
| 3673 | Decreasing Debts | constructive algorithms data structures graphs greedy implementation math two pointers | Statement | D | Codeforces Global Round 6 {1266} | PROGRAMMING | Codeforces Global Round 6 Editorial | 2000 | |
| 2263 | Spaceship Solitaire | data structures greedy implementation | Statement | E | Codeforces Global Round 6 {1266} | PROGRAMMING | Codeforces Global Round 6 Editorial | 2100 | |
| 350 | Almost Same Distance | dfs and similar graphs | Statement | F | Codeforces Global Round 6 {1266} | PROGRAMMING | Codeforces Global Round 6 Editorial | 2900 | |
| 123 | Permutation Concatenation | string suffix structures | Statement | G | Codeforces Global Round 6 {1266} | PROGRAMMING | Codeforces Global Round 6 Editorial | 3300 | |
| 104 | Red-Blue Graph | dp graphs math matrices meet-in-the-middle | Statement | H | Codeforces Global Round 6 {1266} | PROGRAMMING | Codeforces Global Round 6 Editorial | 3400 | |
| 4141 | Balls of Buma | Statement | B | 2019-2020 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1267} | PROGRAMMING | nerc-2019-tutorial.pdf | 1300 | ||
| 3347 | Elections | greedy | Statement | E | 2019-2020 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1267} | PROGRAMMING | nerc-2019-tutorial.pdf | 1700 | |
| 3168 | Lexicography | constructive algorithms strings | Statement | L | 2019-2020 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1267} | PROGRAMMING | nerc-2019-tutorial.pdf | 1800 | |
| 2916 | Just Arrange the Icons | greedy implementation math | Statement | J | 2019-2020 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1267} | PROGRAMMING | nerc-2019-tutorial.pdf | 1900 | |
| 1997 | Key Storage | combinatorics math | Statement | K | 2019-2020 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1267} | PROGRAMMING | nerc-2019-tutorial.pdf | 2200 | |
| 1025 | Apprentice Learning Trajectory | Statement | A | 2019-2020 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1267} | PROGRAMMING | 2500 | |||
| 926 | Intriguing Selection | brute force constructive algorithms implementation interactive sortings | Statement | I | 2019-2020 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1267} | PROGRAMMING | nerc-2019-tutorial.pdf | 2700 | |
| 683 | Foolprüf Security | graphs | Statement | F | 2019-2020 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1267} | PROGRAMMING | 2800 | ||
| 685 | Game Relics | math probabilities | Statement | G | 2019-2020 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1267} | PROGRAMMING | nerc-2019-tutorial.pdf | 3100 | |
| 232 | DevOps Best Practices | constructive algorithms | Statement | D | 2019-2020 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1267} | PROGRAMMING | nerc-2019-tutorial.pdf | 3200 | |
| 384 | Cactus Revenge | constructive algorithms | Statement | C | 2019-2020 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1267} | PROGRAMMING | 3400 | ||
| 158 | Help BerLine | constructive algorithms | Statement | H | 2019-2020 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1267} | PROGRAMMING | nerc-2019-tutorial.pdf | 3500 | |
| 8721 | Long Beautiful Integer | constructive algorithms greedy implementation strings | Statement | A | Codeforces Round 609 (Div. 1) {1268} | PROGRAMMING | Codeforces Round #609 — Editorial | 1700 | |
| 6043 | Domino for Young | dp greedy math | Statement | B | Codeforces Round 609 (Div. 1) {1268} | PROGRAMMING | Codeforces Round #609 — Editorial | 2000 | |
| 1776 | K Integers | binary search data structures | Statement | C | Codeforces Round 609 (Div. 1) {1268} | PROGRAMMING | Codeforces Round #609 — Editorial | 2300 | |
| 541 | Invertation in Tournament | brute force divide and conquer graphs math | Statement | D | Codeforces Round 609 (Div. 1) {1268} | PROGRAMMING | Codeforces Round #609 — Editorial | 3100 | |
| 270 | Happy Cactus | dp | Statement | E | Codeforces Round 609 (Div. 1) {1268} | PROGRAMMING | Codeforces Round #609 — Editorial | 3400 | |
| 9251 | Modulo Equality | brute force sortings | Statement | B | Codeforces Round 609 (Div. 2) {1269} | PROGRAMMING | Codeforces Round #609 — Editorial | 1500 | |
| 22168 | Equation | brute force math | Statement | A | Codeforces Round 609 (Div. 2) {1269} | PROGRAMMING | Codeforces Round #609 — Editorial | 800 | |
| 16530 | Interesting Subarray | constructive algorithms greedy math | Statement | B | Good Bye 2019 {1270} | PROGRAMMING | Разбор Goodbye 2019 | 1300 | |
| 14291 | Make Good | bitmasks constructive algorithms math | Statement | C | Good Bye 2019 {1270} | PROGRAMMING | Разбор Goodbye 2019 | 1500 | |
| 4715 | Strange Device | constructive algorithms interactive math sortings | Statement | D | Good Bye 2019 {1270} | PROGRAMMING | Разбор Goodbye 2019 | 1900 | |
| 2414 | Divide Points | constructive algorithms geometry math | Statement | E | Good Bye 2019 {1270} | PROGRAMMING | Разбор Goodbye 2019 | 2300 | |
| 1157 | Awesome Substrings | math strings | Statement | F | Good Bye 2019 {1270} | PROGRAMMING | Разбор Goodbye 2019 | 2600 | |
| 2365 | Subset with Zero Sum | constructive algorithms dfs and similar graphs math | Statement | G | Good Bye 2019 {1270} | PROGRAMMING | Разбор Goodbye 2019 | 2700 | |
| 813 | Number of Components | data structures | Statement | H | Good Bye 2019 {1270} | PROGRAMMING | Разбор Goodbye 2019 | 3200 | |
| 244 | Xor on Figures | constructive algorithms fft math | Statement | I | Good Bye 2019 {1270} | PROGRAMMING | Разбор Goodbye 2019 | 3400 | |
| 17121 | Card Game | games greedy math | Statement | A | Good Bye 2019 {1270} | PROGRAMMING | Разбор Goodbye 2019 | 700 | |
| 10651 | Shawarma Tent | brute force geometry greedy implementation | Statement | C | Codeforces Round 608 (Div. 2) {1271} | PROGRAMMING | 72247 | 1300 | |
| 11440 | Blocks | greedy math | Statement | B | Codeforces Round 608 (Div. 2) {1271} | PROGRAMMING | 72247 | 1300 | |
| 3142 | Portals | data structures dp greedy implementation sortings | Statement | D | Codeforces Round 608 (Div. 2) {1271} | PROGRAMMING | 72247 | 2100 | |
| 3490 | Common Number | binary search combinatorics dp math | Statement | E | Codeforces Round 608 (Div. 2) {1271} | PROGRAMMING | 72247 | 2100 | |
| 203 | Divide The Students | brute force | Statement | F | Codeforces Round 608 (Div. 2) {1271} | PROGRAMMING | 72247 | 3000 | |
| 15044 | Suits | brute force greedy math | Statement | A | Codeforces Round 608 (Div. 2) {1271} | PROGRAMMING | 72247 | 900 | |
| 27302 | Yet Another Broken Keyboard | combinatorics dp implementation | Statement | C | Codeforces Round 605 (Div. 3) {1272} | PROGRAMMING | Codeforces Round #605 (Div. 3) Editorial | 1100 | |
| 14049 | Snow Walking Robot | constructive algorithms greedy implementation | Statement | B | Codeforces Round 605 (Div. 3) {1272} | PROGRAMMING | Codeforces Round #605 (Div. 3) Editorial | 1200 | |
| 17035 | Remove One Element | brute force dp | Statement | D | Codeforces Round 605 (Div. 3) {1272} | PROGRAMMING | Codeforces Round #605 (Div. 3) Editorial | 1500 | |
| 6529 | Nearest Opposite Parity | dfs and similar graphs shortest paths | Statement | E | Codeforces Round 605 (Div. 3) {1272} | PROGRAMMING | Codeforces Round #605 (Div. 3) Editorial | 2000 | |
| 2012 | Two Bracket Sequences | dp strings two pointers | Statement | F | Codeforces Round 605 (Div. 3) {1272} | PROGRAMMING | Codeforces Round #605 (Div. 3) Editorial | 2400 | |
| 20994 | Three Friends | brute force greedy math sortings | Statement | A | Codeforces Round 605 (Div. 3) {1272} | PROGRAMMING | Codeforces Round #605 (Div. 3) Editorial | 900 | |
| 92 | Шардирование постов | *special binary search interactive | Statement | F | VK Cup 2019 - Квалификация (Engine) {1275} | PROGRAMMING | 3000.0 | ||
| 888 | Скрытый друг | *special | Statement | A | VK Cup 2019 - Квалификация (Engine) {1275} | PROGRAMMING | 250.0 | ||
| 56 | Контрольная сумма | *special | Statement | E3 | VK Cup 2019 - Квалификация (Engine) {1275} | PROGRAMMING | 1000.0 | ||
| 130 | Контрольная сумма | *special | Statement | E2 | VK Cup 2019 - Квалификация (Engine) {1275} | PROGRAMMING | 1000.0 | ||
| 254 | Контрольная сумма | *special | Statement | E1 | VK Cup 2019 - Квалификация (Engine) {1275} | PROGRAMMING | 1000.0 | ||
| 422 | Storage2 | *special | Statement | D | VK Cup 2019 - Квалификация (Engine) {1275} | PROGRAMMING | 2000.0 | ||
| 669 | #define Задача B ... | *special | Statement | C | VK Cup 2019 - Квалификация (Engine) {1275} | PROGRAMMING | 1000.0 | ||
| 823 | Code Review | *special | Statement | B | VK Cup 2019 - Квалификация (Engine) {1275} | PROGRAMMING | 250.0 | ||
| 12431 | As Simple as One and Two | dp greedy | Statement | A | Codeforces Round 606 (Div. 1, based on Technocup 2020 Elimination Round 4) {1276} | PROGRAMMING | Technocup 2020 — Elimination Round 4 + Codeforces Round 606: Editorial | 1300 | |
| 5124 | Two Fairs | combinatorics dfs and similar ds graphs | Statement | B | Codeforces Round 606 (Div. 1, based on Technocup 2020 Elimination Round 4) {1276} | PROGRAMMING | Technocup 2020 — Elimination Round 4 + Codeforces Round 606: Editorial | 1900 | |
| 1686 | Beautiful Rectangle | brute force combinatorics constructive algorithms data structures greedy math | Statement | C | Codeforces Round 606 (Div. 1, based on Technocup 2020 Elimination Round 4) {1276} | PROGRAMMING | Technocup 2020 — Elimination Round 4 + Codeforces Round 606: Editorial | 2300 | |
| 585 | Tree Elimination | dp trees | Statement | D | Codeforces Round 606 (Div. 1, based on Technocup 2020 Elimination Round 4) {1276} | PROGRAMMING | Technocup 2020 — Elimination Round 4 + Codeforces Round 606: Editorial | 2600 | |
| 353 | Asterisk Substrings | string suffix structures | Statement | F | Codeforces Round 606 (Div. 1, based on Technocup 2020 Elimination Round 4) {1276} | PROGRAMMING | Technocup 2020 — Elimination Round 4 + Codeforces Round 606: Editorial | 3300 | |
| 97 | Four Stones | constructive algorithms | Statement | E | Codeforces Round 606 (Div. 1, based on Technocup 2020 Elimination Round 4) {1276} | PROGRAMMING | Technocup 2020 — Elimination Round 4 + Codeforces Round 606: Editorial | 3400 | |
| 13490 | Happy Birthday, Polycarp! | implementation | Statement | A | Codeforces Round 606 (Div. 2, based on Technocup 2020 Elimination Round 4) {1277} | PROGRAMMING | Technocup 2020 — Elimination Round 4 + Codeforces Round 606: Editorial | 1000 | |
| 15533 | Make Them Odd | greedy number theory | Statement | B | Codeforces Round 606 (Div. 2, based on Technocup 2020 Elimination Round 4) {1277} | PROGRAMMING | Technocup 2020 — Elimination Round 4 + Codeforces Round 606: Editorial | 1200 | |
| 3149 | Let's Play the Words? | data structures hashing implementation math | Statement | D | Codeforces Round 606 (Div. 2, based on Technocup 2020 Elimination Round 4) {1277} | PROGRAMMING | Technocup 2020 — Elimination Round 4 + Codeforces Round 606: Editorial | 1800 | |
| 17078 | Shuffle Hashing | brute force implementation strings | Statement | A | Educational Codeforces Round 78 (Rated for Div. 2) {1278} | PROGRAMMING | Educational Codeforces Round 78 Editorial | 1000 | |
| 13478 | A and B | greedy math | Statement | B | Educational Codeforces Round 78 (Rated for Div. 2) {1278} | PROGRAMMING | Educational Codeforces Round 78 Editorial | 1500 | |
| 8144 | Berry Jam | data structures dp greedy implementation | Statement | C | Educational Codeforces Round 78 (Rated for Div. 2) {1278} | PROGRAMMING | Educational Codeforces Round 78 Editorial | 1600 | |
| 4092 | Segment Tree | data structures ds graphs trees | Statement | D | Educational Codeforces Round 78 (Rated for Div. 2) {1278} | PROGRAMMING | Educational Codeforces Round 78 Editorial | 2100 | |
| 1940 | Tests for problem D | constructive algorithms dfs and similar divide and conquer trees | Statement | E | Educational Codeforces Round 78 (Rated for Div. 2) {1278} | PROGRAMMING | Educational Codeforces Round 78 Editorial | 2200 | |
| 1951 | Cards | combinatorics dp math number theory probabilities | Statement | F | Educational Codeforces Round 78 (Rated for Div. 2) {1278} | PROGRAMMING | Educational Codeforces Round 78 Editorial | 2600 | |
| 17070 | New Year Garland | math | Statement | A | Educational Codeforces Round 79 (Rated for Div. 2) {1279} | PROGRAMMING | Educational Codeforces Round 79 Editorial | 1000 | |
| 13798 | Verse For Santa | binary search brute force implementation | Statement | B | Educational Codeforces Round 79 (Rated for Div. 2) {1279} | PROGRAMMING | Educational Codeforces Round 79 Editorial | 1300 | |
| 11831 | Stack of Presents | data structures implementation | Statement | C | Educational Codeforces Round 79 (Rated for Div. 2) {1279} | PROGRAMMING | Educational Codeforces Round 79 Editorial | 1400 | |
| 6489 | Santa's Bot | combinatorics math probabilities | Statement | D | Educational Codeforces Round 79 (Rated for Div. 2) {1279} | PROGRAMMING | Educational Codeforces Round 79 Editorial | 1700 | |
| 389 | New Year Permutations | combinatorics dp | Statement | E | Educational Codeforces Round 79 (Rated for Div. 2) {1279} | PROGRAMMING | Educational Codeforces Round 79 Editorial | 2700 | |
| 925 | New Year and Handle Change | binary search dp | Statement | F | Educational Codeforces Round 79 (Rated for Div. 2) {1279} | PROGRAMMING | Educational Codeforces Round 79 Editorial | 2800 | |
| 5507 | Cut and Paste | implementation math | Statement | A | Codeforces Round 607 (Div. 1) {1280} | PROGRAMMING | Codeforces Round #607 Editorial | 1700 | |
| 4051 | Beingawesomeism | implementation math | Statement | B | Codeforces Round 607 (Div. 1) {1280} | PROGRAMMING | Codeforces Round #607 Editorial | 1800 | |
| 2753 | Jeremy Bearimy | dfs and similar graphs greedy trees | Statement | C | Codeforces Round 607 (Div. 1) {1280} | PROGRAMMING | Codeforces Round #607 Editorial | 2000 | |
| 1039 | Miss Punyverse | dp greedy trees | Statement | D | Codeforces Round 607 (Div. 1) {1280} | PROGRAMMING | Codeforces Round #607 Editorial | 2700 | |
| 206 | Kirchhoff's Current Loss | math | Statement | E | Codeforces Round 607 (Div. 1) {1280} | PROGRAMMING | Codeforces Round #607 Editorial | 2900 | |
| 66 | Intergalactic Sliding Puzzle | combinatorics constructive algorithms math | Statement | F | Codeforces Round 607 (Div. 1) {1280} | PROGRAMMING | Codeforces Round #607 Editorial | 3400 | |
| 8384 | Azamon Web Services | greedy | Statement | B | Codeforces Round 607 (Div. 2) {1281} | PROGRAMMING | Codeforces Round #607 Editorial | 1500 | |
| 18079 | Suffix Three | implementation | Statement | A | Codeforces Round 607 (Div. 2) {1281} | PROGRAMMING | Codeforces Round #607 Editorial | 600 | |
| 11609 | K for the Price of One (Easy Version) | dp greedy sortings | Statement | B1 | Codeforces Round 610 (Div. 2) {1282} | PROGRAMMING | 72461 | 1400 |