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 |
---|---|---|---|---|---|---|---|---|---|
707 | Наибольший подъем | constructive algorithms | Statement | A | Технокубок 2016 - Отборочный Раунд 1 {648} | PROGRAMMING | 500.0 | 900 | |
1299 | Любимые числа Поликарпа | constructive algorithms | Statement | A | Технокубок 2016 - Отборочный Раунд 2 {649} | PROGRAMMING | 500.0 | 1000 | |
538 | Этажи | constructive algorithms | Statement | B | Технокубок 2016 - Отборочный Раунд 2 {649} | PROGRAMMING | 1000.0 | 1400 | |
18389 | Sign Flipping | constructive algorithms | Statement | A | Codeforces Global Round 9 {1375} | PROGRAMMING | 500.0 | 79731 | |
16073 | Boboniu Plays Chess | constructive algorithms | Statement | B | Codeforces Round 664 (Div. 2) {1395} | PROGRAMMING | 750.0 | Codeforces Round #664 Editorial | 1100 |
21489 | Permutation Forgery | constructive algorithms | Statement | A | Codeforces Round 668 (Div. 2) {1405} | PROGRAMMING | 500.0 | Codeforces Round #668 Editorial | |
21668 | Array Cancellation | constructive algorithms | Statement | B | Codeforces Round 668 (Div. 2) {1405} | PROGRAMMING | 1000.0 | Codeforces Round #668 Editorial | |
12514 | Circle Coloring | constructive algorithms | Statement | A | Grakn Forces 2020 {1408} | PROGRAMMING | 500.0 | Grakn Forces -- Editorial | |
4192 | Huge Boxes of Animal Toys | constructive algorithms | Statement | H | 2020 ICPC, COMPFEST 12, Indonesia Multi-Provincial Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1425} | PROGRAMMING | Tutorial | 1300 | |
19287 | Specific Tastes of Andre | constructive algorithms | Statement | A | Codeforces Round 682 (Div. 2) {1438} | PROGRAMMING | 500.0 | Codeforces Round #682 (Div. 2) Editorial | |
5535 | Errich-Tac-Toe (Easy Version) | constructive algorithms | Statement | C1 | Codeforces Global Round 12 {1450} | PROGRAMMING | 1000.0 | Codeforces Global Round 12 Editorial | |
26525 | Strange Functions | constructive algorithms | Statement | A | Educational Codeforces Round 99 (Rated for Div. 2) {1455} | PROGRAMMING | 85186 | ||
19537 | Find The Array | constructive algorithms | Statement | B | Educational Codeforces Round 100 (Rated for Div. 2) {1463} | PROGRAMMING | Educational Codeforces Round 100 Editorial | ||
12729 | No More Inversions | constructive algorithms | Statement | C | Educational Codeforces Round 102 (Rated for Div. 2) {1473} | PROGRAMMING | Educational Codeforces Round 102 Editorial | ||
1511 | Math | constructive algorithms | Statement | F | April Fools Day Contest 2021 {1505} | PROGRAMMING | tutorial | ||
26067 | Average Height | constructive algorithms | Statement | A | Codeforces Round 715 (Div. 2) {1509} | PROGRAMMING | 500.0 | Codeforces Round #715 Editorial | |
31964 | Not Adjacent Matrix | constructive algorithms | Statement | C | Codeforces Round 719 (Div. 3) {1520} | PROGRAMMING | Editorial | ||
12120 | Lord of the Values | constructive algorithms | Statement | B | Deltix Round, Spring 2021 (open for everyone, rated, Div. 1 + Div. 2) {1523} | PROGRAMMING | 1000.0 | Deltix Round, Spring 2021. Editorial | 1100 |
144 | What a Reversal | constructive algorithms | Statement | G | Codeforces Round 733 (Div. 1 + Div. 2, based on VK Cup 2021 - Elimination (Engine)) {1530} | PROGRAMMING | 3750.0 | Codeforces Round #733 Editorial (all problems) | |
18925 | Chess Tournament | constructive algorithms | Statement | B | Educational Codeforces Round 113 (Rated for Div. 2) {1569} | PROGRAMMING | 94721 | ||
21936 | Regular Bracket Sequences | constructive algorithms | Statement | A | Educational Codeforces Round 114 (Rated for Div. 2) {1574} | PROGRAMMING | 95188 | ||
15691 | XOR Specia-LIS-t | constructive algorithms | Statement | B | Codeforces Round 752 (Div. 2) {1604} | PROGRAMMING | 1000.0 | Editorial of Codeforces Round #752 | 1100 |
18462 | Polycarp Recovers the Permutation | constructive algorithms | Statement | C | Codeforces Round 756 (Div. 3) {1611} | PROGRAMMING | Tutorial | 1000 | |
17294 | Special Permutation | constructive algorithms | Statement | B | Educational Codeforces Round 117 (Rated for Div. 2) {1612} | PROGRAMMING | 97164 | ||
23874 | Stable Arrangement of Rooks | constructive algorithms | Statement | A | Hello 2022 {1621} | PROGRAMMING | 500.0 | ||
29056 | Equidistant Letters | constructive algorithms | Statement | A | Educational Codeforces Round 121 (Rated for Div. 2) {1626} | PROGRAMMING | 99136 | ||
3561 | Bottle Arrangements | constructive algorithms | Statement | M | SWERC 2021-2022 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1662} | PROGRAMMING | 102042 | ||
1284 | Cross-Language Program | constructive algorithms | Statement | H | April Fools Day Contest 2022 {1663} | PROGRAMMING | April Fools Day Contest 2022 Editorial | ||
35070 | Round Down the Price | constructive algorithms | Statement | A | Codeforces Round 805 (Div. 3) {1702} | PROGRAMMING | 104763 | ||
25250 | Perfect Permutation | constructive algorithms | Statement | A | Codeforces Round 810 (Div. 2) {1711} | PROGRAMMING | 500.0 | Codeforces Round #810 Editorial | |
15863 | Bright, Nice, Brilliant | constructive algorithms | Statement | B | Codeforces Round 822 (Div. 2) {1734} | PROGRAMMING | 750.0 | Codeforces Round #822 (Div.2) Editorial | |
23126 | BAN BAN | constructive algorithms | Statement | B | Codeforces Round 832 (Div. 2) {1747} | PROGRAMMING | 1000.0 | Codeforces Round #832 (Div. 2) Editorial | |
21409 | XOR = Average | constructive algorithms | Statement | B | Codeforces Round 836 (Div. 2) {1758} | PROGRAMMING | 1000.0 | Codeforces Round #836 (Div. 2) Editorial | |
19470 | Koxia and Permutation | constructive algorithms | Statement | B | Good Bye 2022: 2023 is NEAR {1770} | PROGRAMMING | 750.0 | Good Bye 2022 -- Editorial | |
106 | Koxia, Mahiru and Winter Festival | constructive algorithms | Statement | H | Good Bye 2022: 2023 is NEAR {1770} | PROGRAMMING | 4000.0 | Good Bye 2022 -- Editorial | |
1438 | King's Puzzle | constructive algorithms | Statement | K | 2022-2023 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1773} | PROGRAMMING | 1900 | ||
4183 | Football | constructive algorithms | Statement | F | 2022-2023 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1773} | PROGRAMMING | 800 | ||
135 | Maximum Permutation | constructive algorithms | Statement | H | Polynomial Round 2022 (Div. 1 + Div. 2, Rated, Prizes!) {1774} | PROGRAMMING | 4000.0 | Polynomial Round 2022 (Div. 1 + Div. 2) Editorial | |
17849 | Matrix of Differences | constructive algorithms | Statement | B | Educational Codeforces Round 141 (Rated for Div. 2) {1783} | PROGRAMMING | Educational Codeforces Round 141 Editorial | ||
3358 | Letter Exchange | constructive algorithms constructive algorithms | Statement | B | VK Cup 2022 - Финальный раунд (Engine) {1784} | PROGRAMMING | 1250.0 | Codeforces Round #850 Editorial | |
15123 | Indivisible | constructive algorithms | Statement | B | Codeforces Round 869 (Div. 2) {1818} | PROGRAMMING | 1000.0 | Codeforces Round #869 (Div.1, Div.2) Editorial | |
27635 | Twin Permutations | constructive algorithms | Statement | A | Codeforces Round 875 (Div. 2) {1831} | PROGRAMMING | 500.0 | Codeforces Round #875 (Div.1 + Div. 2) Editorial | |
432 | Game Bundles | constructive algorithms | Statement | E | Codeforces Round 889 (Div. 1) {1854} | PROGRAMMING | 2750.0 | Editorial of Codeforces Round 889 (Div. 1 + Div. 2) | |
32982 | Sequence Game | constructive algorithms | Statement | B | Codeforces Round 894 (Div. 3) {1862} | PROGRAMMING | Tutorial | ||
22330 | Make It Zero | constructive algorithms | Statement | A | Codeforces Round 896 (Div. 2) {1869} | PROGRAMMING | 500.0 | Codeforces Round 896 (Div. 1, Div. 2) Editorial | |
297 | Two Permutations (Hard Version) | constructive algorithms | Statement | E2 | Codeforces Round 899 (Div. 2) {1882} | PROGRAMMING | 2000.0 | Codeforces Round 899 (Div. 2) Editorial | |
174 | Minimum Segments | constructive algorithms | Statement | F | Codeforces Round 905 (Div. 1) {1887} | PROGRAMMING | 2750.0 | Codeforces Round #905 (Div. 1, Div. 2, Div. 3) Editorial | |
27757 | Doremy's Paint 3 | constructive algorithms | Statement | A | Codeforces Round 906 (Div. 2) {1890} | PROGRAMMING | 500.0 | Codeforces Round 906 Editorial | |
16070 | Two Out of Three | constructive algorithms | Statement | B | Codeforces Round 908 (Div. 2) {1894} | PROGRAMMING | 750.0 | Codeforces Round 908 (Div. 1, Div, 2) Editorial | |
21275 | Binary Imbalance | constructive algorithms | Statement | A | Educational Codeforces Round 159 (Rated for Div. 2) {1902} | PROGRAMMING | Educational Codeforces Round 159 Editorial | ||
549 | Palindromic Parentheses | constructive algorithms | Statement | L | 2023-2024 ICPC, Asia Jakarta Regional Contest (Online Mirror, Unrated, ICPC Rules, Teams Preferred) {1906} | PROGRAMMING | problem_analysis.pdf | ||
56 | Cactus Transformation | constructive algorithms | Statement | C | 2023-2024 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1912} | PROGRAMMING | 3300 | ||
18668 | Informatics in MAC | constructive algorithms | Statement | B | Codeforces Round 932 (Div. 2) {1935} | PROGRAMMING | 1000.0 | Codeforces Round #932 (Div. 2) Editorial | |
406 | Funny or Scary? | constructive algorithms | Statement | D | European Championship 2024 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1949} | PROGRAMMING | European Championship 2024 (EUC) Editorial | ||
431 | Missing Subarray Sum | constructive algorithms | Statement | D | Codeforces Round 941 (Div. 1) {1965} | PROGRAMMING | 2000.0 | Codeforces Round #941 (Div. 1, Div. 2) Editorial | 2900 |
10461 | Cells Arrangement | constructive algorithms | Statement | E | Codeforces Round 943 (Div. 3) {1968} | PROGRAMMING | 129096 | 1600 | |
1156 | Exact Neighbours (Easy) | constructive algorithms | Statement | B1 | Helvetic Coding Contest 2024 online mirror (teams allowed, unrated) {1970} | PROGRAMMING | Helvetic Coding Contest 2024 Editorial | 1900 | |
819 | Exact Neighbours (Medium) | constructive algorithms | Statement | B2 | Helvetic Coding Contest 2024 online mirror (teams allowed, unrated) {1970} | PROGRAMMING | Helvetic Coding Contest 2024 Editorial | 2100 | |
490 | Exact Neighbours (Hard) | constructive algorithms | Statement | B3 | Helvetic Coding Contest 2024 online mirror (teams allowed, unrated) {1970} | PROGRAMMING | Helvetic Coding Contest 2024 Editorial | 2300 | |
21155 | Strange Splitting | constructive algorithms | Statement | A | Codeforces Global Round 26 {1984} | PROGRAMMING | 500.0 | Codeforces Global Round 26 Editorial | |
20600 | Make Three Regions | constructive algorithms | Statement | B | Educational Codeforces Round 168 (Rated for Div. 2) {1997} | PROGRAMMING | Video Tutorial | ||
53 | Peak Productivity Forces | constructive algorithms | Statement | H | Codeforces Global Round 27 {2035} | PROGRAMMING | 4500.0 |