Review the problem statement from Codeforces (link will open a new tab). When you've matched your problem, go to the solutions.
Search on plain tags, ratings, names, and problem text. Example: brute force or binary search
< 1 2 3 4 5 6 7 8 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 22241 | Binary Removals | brute force dp greedy implementation | Statement | B | Educational Codeforces Round 106 (Rated for Div. 2) {1499} | PROGRAMMING | Educational Codeforces Round 106 Editorial | ||
| 9703 | Going Home | brute force implementation math | Statement | A | Codeforces Round 707 (Div. 1, based on Moscow Open Olympiad in Informatics) {1500} | PROGRAMMING | 750.0 | Codeforces Round #707 Editorial | 1800 |
| 2394 | Two chandeliers | binary search brute force chinese remainder theorem math number theory | Statement | B | Codeforces Round 707 (Div. 1, based on Moscow Open Olympiad in Informatics) {1500} | PROGRAMMING | 750.0 | Codeforces Round #707 Editorial | 2200 |
| 4934 | Maximize the Remaining String | brute force data structures dp greedy strings two pointers | Statement | G | Codeforces Round 710 (Div. 3) {1506} | PROGRAMMING | Editorial | ||
| 38421 | Double-ended Strings | brute force dp hashing strings | Statement | C | Codeforces Round 710 (Div. 3) {1506} | PROGRAMMING | Editorial | ||
| 491 | Tree Calendar | brute force constructive algorithms dfs and similar sortings | Statement | E | Codeforces Round 715 (Div. 1) {1508} | PROGRAMMING | 2250.0 | Codeforces Round #715 Editorial | |
| 184 | Optimal Encoding | brute force data structures | Statement | F | Codeforces Round 715 (Div. 1) {1508} | PROGRAMMING | 4000.0 | Codeforces Round #715 Editorial | |
| 2157 | Digits | brute force dp math number theory | Statement | D | 2020-2021 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1510} | PROGRAMMING | nerc-2020-offline-tutorial.pdf | ||
| 6088 | King's Task | brute force graphs implementation | Statement | K | 2020-2021 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1510} | PROGRAMMING | nerc-2020-offline-tutorial.pdf | ||
| 995 | Chips on a Board | bitmasks brute force data structures games sortings | Statement | G | Educational Codeforces Round 107 (Rated for Div. 2) {1511} | PROGRAMMING | 89634 | ||
| 12623 | Min Cost String | brute force constructive algorithms dfs and similar graphs greedy | Statement | D | Educational Codeforces Round 107 (Rated for Div. 2) {1511} | PROGRAMMING | 89634 | ||
| 35159 | Yet Another Card Deck | brute force data structures implementation trees | Statement | C | Educational Codeforces Round 107 (Rated for Div. 2) {1511} | PROGRAMMING | 89634 | ||
| 9701 | Short Task | brute force dp math number theory | Statement | G | Codeforces Round 713 (Div. 3) {1512} | PROGRAMMING | Codeforces Round #713 (Div. 3) Editorial | ||
| 83573 | Spy Detected! | brute force implementation | Statement | A | Codeforces Round 713 (Div. 3) {1512} | PROGRAMMING | Codeforces Round #713 (Div. 3) Editorial | ||
| 1495 | Swapping Problem | brute force constructive algorithms data structures sortings | Statement | F | Divide by Zero 2021 and Codeforces Round 714 (Div. 2) {1513} | PROGRAMMING | 3500.0 | Divide by Zero 2021 and Codeforces Round #714 (Div. 2) Editorial | |
| 27178 | AGAGA XOOORRR | bitmasks brute force dp greedy | Statement | B | Codeforces Round 717 (Div. 2) {1516} | PROGRAMMING | 1000.0 | Codeforces round #717 editorial | |
| 18037 | Maximum Sum of Products | brute force dp implementation math ternary search two pointers | Statement | D | Educational Codeforces Round 108 (Rated for Div. 2) {1519} | PROGRAMMING | Educational Codeforces Round 108 Editorial | ||
| 23891 | Berland Regional | brute force greedy sortings two pointers | Statement | C | Educational Codeforces Round 108 (Rated for Div. 2) {1519} | PROGRAMMING | Educational Codeforces Round 108 Editorial | ||
| 59673 | Do Not Be Distracted! | brute force implementation | Statement | A | Codeforces Round 719 (Div. 3) {1520} | PROGRAMMING | Editorial | ||
| 50666 | Ordinary Numbers | brute force math number theory | Statement | B | Codeforces Round 719 (Div. 3) {1520} | PROGRAMMING | Editorial | ||
| 9225 | Compression and Expansion | brute force data structures greedy implementation trees | Statement | C | Deltix Round, Spring 2021 (open for everyone, rated, Div. 1 + Div. 2) {1523} | PROGRAMMING | 1500.0 | Deltix Round, Spring 2021. Editorial | 1600 |
| 2558 | Love-Hate | bitmasks brute force dp probabilities | Statement | D | Deltix Round, Spring 2021 (open for everyone, rated, Div. 1 + Div. 2) {1523} | PROGRAMMING | 2250.0 | Deltix Round, Spring 2021. Editorial | 2400 |
| 511 | Goblins And Gnomes | brute force dp graph matchings | Statement | F | Educational Codeforces Round 109 (Rated for Div. 2) {1525} | PROGRAMMING | 90793 | ||
| 11139 | Armchairs | brute force dp greedy | Statement | D | Educational Codeforces Round 109 (Rated for Div. 2) {1525} | PROGRAMMING | 90793 | ||
| 2868 | Kill Anton | brute force constructive algorithms data structures math strings | Statement | D | Codeforces Round 723 (Div. 2) {1526} | PROGRAMMING | 2250.0 | Codeforces Round #723 (Div. 2) Editorial | |
| 28334 | Potions (Easy Version) | brute force data structures dp greedy | Statement | C1 | Codeforces Round 723 (Div. 2) {1526} | PROGRAMMING | 750.0 | Codeforces Round #723 (Div. 2) Editorial | |
| 20211 | Parsa's Humongous Tree | brute force dfs and similar dp greedy trees | Statement | A | Codeforces Round 722 (Div. 1) {1528} | PROGRAMMING | 750.0 | Codeforces Round #722 Editorial | |
| 13360 | Colour the Flag | brute force implementation | Statement | A | Codeforces LATOKEN Round 1 (Div. 1 + Div. 2) {1534} | PROGRAMMING | 500.0 | Codeforces LATOKEN Round 1 (Div. 1 + Div. 2) Editorial | |
| 34651 | Array Reodering | brute force greedy math number theory sortings | Statement | B | Educational Codeforces Round 110 (Rated for Div. 2) {1535} | PROGRAMMING | 91481 | ||
| 58537 | Fair Playoff | brute force implementation | Statement | A | Educational Codeforces Round 110 (Rated for Div. 2) {1535} | PROGRAMMING | 91481 | ||
| 26819 | Prinzessin der Verurteilung | brute force strings | Statement | B | Codeforces Round 724 (Div. 2) {1536} | PROGRAMMING | 1000.0 | Codeforces Round #724 — Editorial | 1200 |
| 20895 | Omkar and Bad Story | brute force constructive algorithms | Statement | A | Codeforces Round 724 (Div. 2) {1536} | PROGRAMMING | 500.0 | Codeforces Round #724 — Editorial | 800 |
| 17146 | Erase and Extend (Easy Version) | binary search brute force dp greedy hashing string suffix structures strings | Statement | E1 | Codeforces Round 726 (Div. 2) {1537} | PROGRAMMING | 1250.0 | Codeforces Round #726 (Div.2) Editorial | |
| 3297 | Funny Substrings | brute force data structures hashing implementation strings | Statement | E | Codeforces Round 725 (Div. 3) {1538} | PROGRAMMING | Codeforces Round #725 (Div. 3) Editorial | ||
| 413 | Inverse Inversions | binary search brute force data structures | Statement | D | Codeforces Round 728 (Div. 1) {1540} | PROGRAMMING | 3000.0 | Tutorial | |
| 3098 | Tree Array | brute force combinatorics dp math probabilities trees | Statement | B | Codeforces Round 728 (Div. 1) {1540} | PROGRAMMING | 1250.0 | Tutorial | |
| 41071 | Pleasant Pairs | brute force math number theory | Statement | B | Codeforces Round 728 (Div. 2) {1541} | PROGRAMMING | 1000.0 | Tutorial | |
| 5694 | Need for Pink Slips | brute force dfs and similar implementation math probabilities | Statement | C | Codeforces Round 730 (Div. 2) {1543} | PROGRAMMING | 1500.0 | Codeforces Round #730 (Div. 2) Editorial | |
| 149 | AquaMoon and Potatoes | brute force data structures dp | Statement | F | Codeforces Round 732 (Div. 1) {1545} | PROGRAMMING | 4000.0 | Codeforces Round #732 Editorial | 3500 |
| 18645 | AquaMoon and Two Arrays | brute force greedy | Statement | A | Codeforces Round 732 (Div. 2) {1546} | PROGRAMMING | 500.0 | Codeforces Round #732 Editorial | 800 |
| 359 | Gregor and the Odd Cows (Hard) | brute force geometry math number theory | Statement | D2 | Codeforces Round 736 (Div. 1) {1548} | PROGRAMMING | 1000.0 | Codeforces Round 736 Editorial | |
| 17954 | Web of Lies | brute force graphs greedy | Statement | A | Codeforces Round 736 (Div. 1) {1548} | PROGRAMMING | 500.0 | Codeforces Round 736 Editorial | |
| 2112 | Excellent Arrays | brute force combinatorics constructive algorithms implementation math | Statement | D | Educational Codeforces Round 111 (Rated for Div. 2) {1550} | PROGRAMMING | Educational Codeforces Round 111 Editorial | ||
| 10962 | Manhattan Subarrays | brute force geometry greedy implementation | Statement | C | Educational Codeforces Round 111 (Rated for Div. 2) {1550} | PROGRAMMING | Educational Codeforces Round 111 Editorial | ||
| 4653 | Fixed Points | brute force dp | Statement | E | Codeforces Round 734 (Div. 3) {1551} | PROGRAMMING | Editorial for Codeforces Round #734 (Div.3) | ||
| 701 | A Serious Referee | bitmasks brute force dfs and similar sortings | Statement | G | Codeforces Global Round 15 {1552} | PROGRAMMING | 2500.0 | Editorial of Global Round 15 | |
| 3862 | Permutation Shift | brute force combinatorics constructive algorithms dfs and similar graphs math | Statement | E | Harbour.Space Scholarship Contest 2021-2022 (open for everyone, rated, Div. 1 + Div. 2) {1553} | PROGRAMMING | 1750.0 | Harbour.Space Scholarship Contest 2021-2022 (Div. 1 + Div. 2) Editorial | |
| 20128 | Penalty | brute force dp greedy | Statement | C | Harbour.Space Scholarship Contest 2021-2022 (open for everyone, rated, Div. 1 + Div. 2) {1553} | PROGRAMMING | 750.0 | Harbour.Space Scholarship Contest 2021-2022 (Div. 1 + Div. 2) Editorial | |
| 15624 | Reverse String | brute force dp hashing strings | Statement | B | Harbour.Space Scholarship Contest 2021-2022 (open for everyone, rated, Div. 1 + Div. 2) {1553} | PROGRAMMING | 500.0 | Harbour.Space Scholarship Contest 2021-2022 (Div. 1 + Div. 2) Editorial | |
| 13999 | Cobb | bitmasks brute force greedy math | Statement | B | Codeforces Round 735 (Div. 2) {1554} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round #735 (Div. 2) | 1700 |
| 17449 | Two Tables | brute force | Statement | B | Educational Codeforces Round 112 (Rated for Div. 2) {1555} | PROGRAMMING | 93389 | 1300 | |
| 24579 | Coin Rows | brute force constructive algorithms dp implementation | Statement | C | Educational Codeforces Round 112 (Rated for Div. 2) {1555} | PROGRAMMING | 93389 | 1300 | |
| 16224 | Say No to Palindromes | brute force dp strings | Statement | D | Educational Codeforces Round 112 (Rated for Div. 2) {1555} | PROGRAMMING | 93389 | 1600 | |
| 30668 | PizzaForces | brute force math | Statement | A | Educational Codeforces Round 112 (Rated for Div. 2) {1555} | PROGRAMMING | 93389 | 900 | |
| 6289 | Compressed Bracket Sequence | brute force implementation | Statement | C | Deltix Round, Summer 2021 (open for everyone, rated, Div. 1 + Div. 2) {1556} | PROGRAMMING | 1500.0 | 94384 | 1800 |
| 800 | Assiut Chess | brute force interactive probabilities two pointers | Statement | E | Codeforces Round 737 (Div. 2) {1557} | PROGRAMMING | 3000.0 | Codeforces Round #737 Editorial | |
| 29350 | Ezzat and Two Subsequences | brute force math | Statement | A | Codeforces Round 737 (Div. 2) {1557} | PROGRAMMING | 500.0 | Codeforces Round #737 Editorial | |
| 11539 | Charmed by the Game | brute force math | Statement | A | Codeforces Round 740 (Div. 1, based on VK Cup 2021 - Final (Engine)) {1558} | PROGRAMMING | 500.0 | Codeforces Round #740 Editorial | 1300 |
| 5390 | Up the Strip | brute force dp math number theory | Statement | B | Codeforces Round 740 (Div. 1, based on VK Cup 2021 - Final (Engine)) {1558} | PROGRAMMING | 1250.0 | Codeforces Round #740 Editorial | 1900 |
| 16657 | Mocha and Diana (Easy Version) | brute force constructive algorithms dsu graphs greedy trees | Statement | D1 | Codeforces Round 738 (Div. 2) {1559} | PROGRAMMING | 1500.0 | Tutorial (en) | 1400 |
| 3260 | Mocha and Diana (Hard Version) | brute force constructive algorithms dfs and similar dsu graphs greedy trees two pointers | Statement | D2 | Codeforces Round 738 (Div. 2) {1559} | PROGRAMMING | 1500.0 | Tutorial (en) | 2500 |
| 6857 | Nearest Beautiful Number (easy version) | binary search bitmasks brute force constructive algorithms dfs and similar greedy | Statement | F1 | Codeforces Round 739 (Div. 3) {1560} | PROGRAMMING | 94009 | 1900 | |
| 5129 | Nearest Beautiful Number (hard version) | bitmasks brute force constructive algorithms dfs and similar dp greedy | Statement | F2 | Codeforces Round 739 (Div. 3) {1560} | PROGRAMMING | 94009 | 2100 | |
| 6209 | Up the Strip (simplified version) | brute force data structures dp math number theory | Statement | D1 | Codeforces Round 740 (Div. 2, based on VK Cup 2021 - Final (Engine)) {1561} | PROGRAMMING | 1500.0 | Codeforces Round #740 Editorial | 1700 |
| 17268 | Simply Strange Sort | brute force implementation sortings | Statement | A | Codeforces Round 740 (Div. 2, based on VK Cup 2021 - Final (Engine)) {1561} | PROGRAMMING | 500.0 | Codeforces Round #740 Editorial | 800 |
| 20736 | Scenes From a Memory | brute force implementation math number theory | Statement | B | Codeforces Round 741 (Div. 2) {1562} | PROGRAMMING | 1000.0 | Editorial of Codeforces Round 741 (Div. 2) | |
| 918 | Playoff Restoration | bitmasks brute force hashing implementation meet-in-the-middle | Statement | E | Educational Codeforces Round 113 (Rated for Div. 2) {1569} | PROGRAMMING | 94721 | ||
| 530 | Palindromic Hamiltonian Path | brute force dp graphs | Statement | F | Educational Codeforces Round 113 (Rated for Div. 2) {1569} | PROGRAMMING | 94721 | ||
| 374 | Sweepstake | *special brute force constructive algorithms implementation math | Statement | D | Kotlin Heroes: Episode 8 {1571} | PROGRAMMING | Kotlin Heroes 8 Editorial | ||
| 2276 | Xor of 3 | brute force constructive algorithms greedy | Statement | B | Codeforces Round 743 (Div. 1) {1572} | PROGRAMMING | 1250.0 | Tutorial | 2500 |
| 2926 | Divisible by Twenty-Five | brute force dfs and similar dp | Statement | D | COMPFEST 13 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1575} | PROGRAMMING | COMPFEST 13 — Editorial | ||
| 4341 | Jeopardy of Dropped Balls | brute force dsu implementation | Statement | J | COMPFEST 13 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1575} | PROGRAMMING | COMPFEST 13 — Editorial | ||
| 5449 | Array Stabilization (AND version) | binary search brute force graphs greedy implementation math number theory shortest paths | Statement | F | Codeforces Round 744 (Div. 3) {1579} | PROGRAMMING | Codeforces Round #744 (Div. 3) Editorial | ||
| 11792 | Ticks | brute force dp greedy implementation | Statement | C | Codeforces Round 744 (Div. 3) {1579} | PROGRAMMING | Codeforces Round #744 (Div. 3) Editorial | ||
| 3954 | Portal | brute force dp greedy implementation | Statement | A | Codeforces Round 745 (Div. 1) {1580} | PROGRAMMING | 500.0 | Codeforces Round #745 Editorial | 1700 |
| 2397 | Train Maintenance | brute force data structures implementation | Statement | C | Codeforces Round 745 (Div. 1) {1580} | PROGRAMMING | 1750.0 | Codeforces Round #745 Editorial | 2200 |
| 126 | Railway Construction | brute force constructive algorithms data structures graphs shortest paths | Statement | E | Codeforces Round 745 (Div. 1) {1580} | PROGRAMMING | 3500.0 | Codeforces Round #745 Editorial | 3400 |
| 2202 | Korney Korneevich and XOR (hard version) | binary search brute force dp two pointers | Statement | F2 | Codeforces Round 750 (Div. 2) {1582} | PROGRAMMING | 1500.0 | Codeforces Round #750 (Div.2) Editorial | |
| 30857 | Make Them Equal | brute force greedy math strings | Statement | C | Codeforces Round 747 (Div. 2) {1594} | PROGRAMMING | 1500.0 | 95525 | 1200 |
| 1696 | Rubik's Cube Coloring (hard version) | brute force dp implementation math trees | Statement | E2 | Codeforces Round 747 (Div. 2) {1594} | PROGRAMMING | 1500.0 | 95525 | 2300 |
| 2586 | Staircases | brute force combinatorics data structures dfs and similar dp | Statement | E | Educational Codeforces Round 115 (Rated for Div. 2) {1598} | PROGRAMMING | 95890 | ||
| 17102 | Groups | brute force implementation | Statement | B | Educational Codeforces Round 115 (Rated for Div. 2) {1598} | PROGRAMMING | 95890 | ||
| 359 | Bob's Beautiful Array | bitmasks brute force greedy | Statement | J | Bubble Cup 14 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred, Div. 1) {1599} | PROGRAMMING | BubbleCup2021.pdf | ||
| 441 | Shortest path | brute force geometry math | Statement | G | Bubble Cup 14 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred, Div. 1) {1599} | PROGRAMMING | BubbleCup2021.pdf | ||
| 19200 | Dominant Character | brute force implementation strings | Statement | C | Codeforces Round 754 (Div. 2) {1605} | PROGRAMMING | 1500.0 | tutorial | 1400 |
| 27232 | Minimum Extraction | brute force sortings | Statement | C | Codeforces Round 753 (Div. 3) {1607} | PROGRAMMING | Codeforces Round #753 (Div. 3) Editorial | ||
| 2145 | AmShZ and G.O.A.T. | binary search brute force greedy math | Statement | E | Codeforces Global Round 17 {1610} | PROGRAMMING | 2500.0 | Codeforces Global Round 17 Editorial | |
| 18334 | Distance | brute force constructive algorithms | Statement | A | Educational Codeforces Round 117 (Rated for Div. 2) {1612} | PROGRAMMING | 97164 | ||
| 759 | Armor and Weapons | brute force dp greedy shortest paths | Statement | F | Educational Codeforces Round 117 (Rated for Div. 2) {1612} | PROGRAMMING | 97164 | ||
| 24764 | Divan and a Store | brute force constructive algorithms greedy | Statement | A | Codeforces Round 757 (Div. 2) {1614} | PROGRAMMING | 500.0 | Tutorial | 800 |
| 9305 | Menorah | brute force graphs greedy math | Statement | C | Codeforces Global Round 18 {1615} | PROGRAMMING | 1750.0 | Global Round 18 Editorial | |
| 13326 | Representative Edges | brute force geometry implementation math | Statement | C | Good Bye 2021: 2022 is NEAR {1616} | PROGRAMMING | 1500.0 | Good Bye 2021 -- Editorial | 1500 |
| 27484 | GCD Problem | brute force constructive algorithms math | Statement | B | Codeforces Round 761 (Div. 2) {1617} | PROGRAMMING | 1000.0 | Editorial for Codeforces Round #761 (Div. 2) | |
| 8759 | New Year's Problem | binary search brute force greedy sortings | Statement | D | Codeforces Round 762 (Div. 3) {1619} | PROGRAMMING | Tutorial | ||
| 1528 | Permutation and Queries | brute force data structures | Statement | H | Codeforces Round 762 (Div. 3) {1619} | PROGRAMMING | Tutorial | ||
| 4913 | Exact Change | binary search brute force constructive algorithms greedy | Statement | D | Educational Codeforces Round 119 (Rated for Div. 2) {1620} | PROGRAMMING | 98061 | ||
| 7367 | BA-String | bitmasks brute force dp greedy implementation math shortest paths | Statement | C | Educational Codeforces Round 119 (Rated for Div. 2) {1620} | PROGRAMMING | 98061 | ||
| 2306 | Math Test | bitmasks brute force greedy | Statement | E | Educational Codeforces Round 120 (Rated for Div. 2) {1622} | PROGRAMMING | Educational Codeforces Round 120 Editorial | ||
| 20856 | Robot Cleaner | brute force implementation math | Statement | A | Codeforces Round 763 (Div. 2) {1623} | PROGRAMMING | 500.0 | Codeforces Round #763 (Div. 2) Editorial | |
| 14767 | Game on Ranges | brute force implementation sortings | Statement | B | Codeforces Round 763 (Div. 2) {1623} | PROGRAMMING | 1000.0 | Codeforces Round #763 (Div. 2) Editorial | |
| 4701 | Masha-forgetful | brute force constructive algorithms dp hashing implementation strings | Statement | E | Codeforces Round 764 (Div. 3) {1624} | PROGRAMMING | Codeforces Round #764 (Div. 3) Editorial | ||
| 4446 | Martial Arts Tournament | binary search brute force greedy | Statement | D | Educational Codeforces Round 121 (Rated for Div. 2) {1626} | PROGRAMMING | 99136 | ||
| 17269 | Meximum Array | brute force constructive algorithms greedy math | Statement | A | Codeforces Round 767 (Div. 1) {1628} | PROGRAMMING | 500.0 | 99276 | |
| 14277 | Strange Test | binary search bitmasks brute force greedy math | Statement | C | Codeforces Round 769 (Div. 2) {1632} | PROGRAMMING | 1500.0 | Editorial of Codeforces Round #769 | |
| 36461 | Div. 7 | brute force | Statement | A | Educational Codeforces Round 122 (Rated for Div. 2) {1633} | PROGRAMMING | 99539 | ||
| 21467 | Kill the Monster | brute force math | Statement | C | Educational Codeforces Round 122 (Rated for Div. 2) {1633} | PROGRAMMING | 99539 | ||
| 2007 | Fibonacci Additions | brute force hashing math | Statement | F | Codeforces Round 770 (Div. 2) {1634} | PROGRAMMING | 3000.0 | Codeforces Round #770 (Div. 2) editorial | |
| 24744 | Reverse and Concatenate | brute force strings | Statement | A | Codeforces Round 770 (Div. 2) {1634} | PROGRAMMING | 500.0 | Codeforces Round #770 (Div. 2) editorial | |
| 3931 | Best Pair | binary search brute force | Statement | E | Codeforces Global Round 19 {1637} | PROGRAMMING | 2500.0 | Tutorial | |
| 15521 | MEX and Array | brute force dp greedy math | Statement | B | Codeforces Global Round 19 {1637} | PROGRAMMING | 1000.0 | Tutorial | |
| 1564 | Two Arrays | bitmasks brute force combinatorics hashing probabilities two pointers | Statement | D | Codeforces Round 773 (Div. 1) {1641} | PROGRAMMING | 1750.0 | Codeforces Round #773 editorial | |
| 19093 | Great Sequence | brute force greedy sortings | Statement | A | Codeforces Round 773 (Div. 1) {1641} | PROGRAMMING | 500.0 | Codeforces Round #773 editorial | |
| 3526 | Expand the Path | brute force combinatorics implementation math | Statement | E | Educational Codeforces Round 123 (Rated for Div. 2) {1644} | PROGRAMMING | 100227 | ||
| 21411 | Anti-Fibonacci Permutation | brute force constructive algorithms implementation | Statement | B | Educational Codeforces Round 123 (Rated for Div. 2) {1644} | PROGRAMMING | 100227 | ||
| 20958 | Factorials and Powers of Two | bitmasks brute force constructive algorithms math | Statement | C | Codeforces Round 774 (Div. 2) {1646} | PROGRAMMING | 1250.0 | Codeforces Round #774 (Div. 2) Editorial | 1500 |
| 2834 | Power Board | brute force math number theory | Statement | E | Codeforces Round 774 (Div. 2) {1646} | PROGRAMMING | 2500.0 | Codeforces Round #774 (Div. 2) Editorial | 2200 |
| 22967 | Quality vs Quantity | brute force constructive algorithms greedy sortings two pointers | Statement | B | Codeforces Round 774 (Div. 2) {1646} | PROGRAMMING | 1000.0 | Codeforces Round #774 (Div. 2) Editorial | 800 |
| 17278 | Madoka and the Elegant Gift | brute force graphs implementation | Statement | B | Codeforces Round 777 (Div. 2) {1647} | PROGRAMMING | 1250.0 | Codeforces Round #777 Editorial | |
| 7438 | Integral Array | brute force constructive algorithms data structures math | Statement | B | Codeforces Round 775 (Div. 1, based on Moscow Open Olympiad in Informatics) {1648} | PROGRAMMING | 1000.0 | Codeforces Round #775 Editorial | |
| 15373 | Twist the Permutation | brute force constructive algorithms math | Statement | D | Codeforces Round 776 (Div. 3) {1650} | PROGRAMMING | 100712 | ||
| 539 | Tower Defense | binary search brute force data structures | Statement | F | Educational Codeforces Round 124 (Rated for Div. 2) {1651} | PROGRAMMING | Educational Codeforces Round 124 Editorial | ||
| 11701 | Fault-tolerant Network | brute force data structures implementation | Statement | C | Educational Codeforces Round 124 (Rated for Div. 2) {1651} | PROGRAMMING | Educational Codeforces Round 124 Editorial | ||
| 2390 | Arithmetic Operations | brute force divide and conquer graphs math | Statement | E | Codeforces Round 778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) {1654} | PROGRAMMING | 2500.0 | Editorial of Codeforces Round #778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) | 2300 |
| 3235 | 388535 (Hard Version) | bitmasks brute force data structures math | Statement | D2 | Codeforces Round 779 (Div. 2) {1658} | PROGRAMMING | 750.0 | Codeforces Round #779 (Div. 2) Editorial | |
| 1014 | Juju and Binary String | brute force constructive algorithms math | Statement | F | Codeforces Round 779 (Div. 2) {1658} | PROGRAMMING | 3000.0 | Codeforces Round #779 (Div. 2) Editorial | |
| 2038 | AND-MEX Walk | bitmasks brute force data structures dfs and similar dsu graphs greedy | Statement | E | Codeforces Round 782 (Div. 2) {1659} | PROGRAMMING | 2250.0 | Codeforces Round #782 (Div. 2) Editorial | |
| 8049 | Promising String (easy version) | brute force implementation math strings | Statement | F1 | Codeforces Round 780 (Div. 3) {1660} | PROGRAMMING | Codeforces Round #780 (Div. 3) Editorial | ||
| 21295 | Getting Zero | brute force dfs and similar graphs greedy shortest paths | Statement | B | Educational Codeforces Round 126 (Rated for Div. 2) {1661} | PROGRAMMING | Educational Codeforces Round 126 Editorial | ||
| 3840 | Connect the Points | brute force constructive algorithms geometry | Statement | C | 2021-2022 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1666} | PROGRAMMING | Tutorial (PDF) | ||
| 1801 | Interactive Treasure Hunt | brute force interactive math | Statement | I | 2021-2022 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1666} | PROGRAMMING | Tutorial (PDF) | ||
| 15825 | Make it Increasing | brute force greedy math | Statement | A | Codeforces Round 783 (Div. 1) {1667} | PROGRAMMING | 250.0 | Codeforces Round #783 Editorial | 1300 |
| 13552 | Dorms War | brute force implementation strings | Statement | B | Codeforces Round 788 (Div. 2) {1670} | PROGRAMMING | 1000.0 | Tutorial | 1100 |
| 5749 | Very Suspicious | binary search brute force geometry implementation math | Statement | D | Codeforces Round 788 (Div. 2) {1670} | PROGRAMMING | 2250.0 | Tutorial | 1700 |
| 27717 | Dolce Vita | binary search brute force greedy math | Statement | C | Educational Codeforces Round 127 (Rated for Div. 2) {1671} | PROGRAMMING | 102181 | ||
| 521 | Permutation Counting | brute force combinatorics dp fft math | Statement | F | Educational Codeforces Round 127 (Rated for Div. 2) {1671} | PROGRAMMING | 102181 | ||
| 8585 | Insert a Progression | brute force constructive algorithms greedy | Statement | D | Educational Codeforces Round 127 (Rated for Div. 2) {1671} | PROGRAMMING | 102181 | ||
| 19944 | Consecutive Points Segment | brute force math sortings | Statement | B | Educational Codeforces Round 127 (Rated for Div. 2) {1671} | PROGRAMMING | 102181 | ||
| 23654 | A Perfectly Balanced String? | brute force greedy strings | Statement | B | Codeforces Round 785 (Div. 2) {1673} | PROGRAMMING | 750.0 | Codeforces Round #785 (Div. 2) Editorial | |
| 7878 | Breaking the Wall | binary search brute force constructive algorithms greedy math | Statement | E | Codeforces Round 786 (Div. 3) {1674} | PROGRAMMING | 102482 | ||
| 16690 | Maximum Crossings (Easy Version) | brute force | Statement | H1 | Codeforces Round 790 (Div. 4) {1676} | PROGRAMMING | Codeforces Round #790 (Div. 4) Editorial | ||
| 30054 | X-Sum | brute force greedy implementation | Statement | D | Codeforces Round 790 (Div. 4) {1676} | PROGRAMMING | Codeforces Round #790 (Div. 4) Editorial | ||
| 35692 | Most Similar Words | brute force greedy implementation implementation math strings | Statement | C | Codeforces Round 790 (Div. 4) {1676} | PROGRAMMING | Codeforces Round #790 (Div. 4) Editorial | ||
| 1464 | Typical Party in Dorm | bitmasks brute force combinatorics dp strings two pointers | Statement | E | Codeforces Round 791 (Div. 2) {1679} | PROGRAMMING | 2250.0 | Codeforces Round #791 (Div. 2) Editorial | |
| 44496 | AvtoBus | brute force greedy math number theory | Statement | A | Codeforces Round 791 (Div. 2) {1679} | PROGRAMMING | 500.0 | Codeforces Round #791 (Div. 2) Editorial | |
| 1415 | Dog Walking | brute force greedy math | Statement | D | Educational Codeforces Round 128 (Rated for Div. 2) {1680} | PROGRAMMING | 102852 | ||
| 10976 | Required Length | brute force dfs and similar dp hashing shortest paths | Statement | D | Educational Codeforces Round 129 (Rated for Div. 2) {1681} | PROGRAMMING | 103163 | 1700 | |
| 3714 | MEX vs DIFF | brute force constructive algorithms data structures greedy two pointers | Statement | E | Codeforces Round 792 (Div. 1 + Div. 2) {1684} | PROGRAMMING | 1750.0 | Codeforces Round #792 (Div. 1 + Div. 2) Editorial | 2100 |
| 794 | Cute number | binary search brute force implementation math | Statement | D | Codeforces Round 796 (Div. 1) {1687} | PROGRAMMING | 1500.0 | Editorial of Codeforces Round 796 | |
| 1752 | Sanae and Giant Robot | brute force constructive algorithms data structures dfs and similar dsu | Statement | C | Codeforces Round 796 (Div. 1) {1687} | PROGRAMMING | 1500.0 | Editorial of Codeforces Round 796 | |
| 23858 | Cirno's Perfect Bitmasks Classroom | bitmasks brute force constructive algorithms | Statement | A | Codeforces Round 796 (Div. 2) {1688} | PROGRAMMING | 500.0 | Tutorial | |
| 1429 | ANDfinity | bitmasks brute force constructive algorithms dfs and similar dsu graphs | Statement | E | Codeforces Round 798 (Div. 2) {1689} | PROGRAMMING | 2500.0 | Editorial for Codeforces Round #798 (Div. 2) | |
| 4831 | Lena and Matrix | brute force data structures dp shortest paths | Statement | D | Codeforces Round 798 (Div. 2) {1689} | PROGRAMMING | 1750.0 | Editorial for Codeforces Round #798 (Div. 2) | |
| 17864 | Lex String | brute force greedy implementation sortings two pointers | Statement | A | Codeforces Round 798 (Div. 2) {1689} | PROGRAMMING | 500.0 | Editorial for Codeforces Round #798 (Div. 2) | |
| 17477 | Sum of Substrings | brute force constructive algorithms greedy math strings | Statement | C | CodeCraft-22 and Codeforces Round 795 (Div. 2) {1691} | PROGRAMMING | 1250.0 | Editorial for CodeCraft-22 and Codeforces Round #795 (Div. 2) | |
| 22221 | The Clock | brute force implementation | Statement | D | Codeforces Round 799 (Div. 4) {1692} | PROGRAMMING | Codeforces Round #799 (Div. 4) Editorial | ||
| 28168 | 3SUM | brute force math | Statement | F | Codeforces Round 799 (Div. 4) {1692} | PROGRAMMING | Codeforces Round #799 (Div. 4) Editorial | ||
| 1180 | Decinc Dividing | brute force data structures divide and conquer dp greedy | Statement | D | Codeforces Round 800 (Div. 1) {1693} | PROGRAMMING | 2250.0 | Codeforces Round #800 Editorial | 2800 |
| 14734 | Zero Path | brute force data structures dp greedy shortest paths | Statement | C | Codeforces Round 801 (Div. 2) and EPIC Institute of Technology Round {1695} | PROGRAMMING | 1250.0 | Editorial for Codeforces Round #801 (Div. 2) and EPIC Institute of Technology Round | |
| 1175 | Tree Recovery | bitmasks brute force constructive algorithms dfs and similar dsu graphs trees | Statement | F | Codeforces Global Round 21 {1696} | PROGRAMMING | 2500.0 | Editorial of Codeforces Global Round 21 | |
| 221 | Maximum Product? | brute force combinatorics dp greedy math two pointers | Statement | H | Codeforces Global Round 21 {1696} | PROGRAMMING | 4000.0 | Editorial of Codeforces Global Round 21 | |
| 5094 | Guess The String | binary search brute force constructive algorithms dsu interactive | Statement | D | Educational Codeforces Round 130 (Rated for Div. 2) {1697} | PROGRAMMING | 103835 | ||
| 1494 | Coloring | brute force combinatorics constructive algorithms dfs and similar dp dsu graphs implementation | Statement | E | Educational Codeforces Round 130 (Rated for Div. 2) {1697} | PROGRAMMING | 103835 | ||
| 1886 | PermutationForces II | binary search brute force combinatorics constructive algorithms greedy sortings | Statement | E | Codeforces Round 803 (Div. 2) {1698} | PROGRAMMING | 2000.0 | Codeforces Round #803 (Div. 2) Editorial | |
| 33477 | XOR Mixup | bitmasks brute force | Statement | A | Codeforces Round 803 (Div. 2) {1698} | PROGRAMMING | 250.0 | Codeforces Round #803 (Div. 2) Editorial | |
| 19994 | 3SUM Closure | brute force data structures | Statement | C | Codeforces Round 803 (Div. 2) {1698} | PROGRAMMING | 1000.0 | Codeforces Round #803 (Div. 2) Editorial | |
| 1018 | Serega the Pirate | brute force constructive algorithms | Statement | E | Codeforces Round 802 (Div. 2) {1700} | PROGRAMMING | 2500.0 | 103978 | 2600 |
| 1426 | Text Editor | brute force dp greedy strings two pointers | Statement | E | Educational Codeforces Round 131 (Rated for Div. 2) {1701} | PROGRAMMING | Educational Codeforces Round 131 Editorial | ||
| 13122 | Good Key, Bad Key | bitmasks brute force dp greedy math | Statement | G | Codeforces Round 806 (Div. 4) {1703} | PROGRAMMING | 104786 | ||
| 29903 | Double Strings | brute force data structures strings | Statement | D | Codeforces Round 806 (Div. 4) {1703} | PROGRAMMING | 104786 | ||
| 2750 | Count Seconds | brute force constructive algorithms dp graphs | Statement | E | CodeTON Round 2 (Div. 1 + Div. 2, Rated, Prizes!) {1704} | PROGRAMMING | 2000.0 | CodeTON Round 2 Editorial | |
| 14714 | Mark and His Unfinished Essay | brute force implementation | Statement | C | Codeforces Round 807 (Div. 2) {1705} | PROGRAMMING | 1250.0 | Codeforces Round #807 (Div 2.) Editorial | |
| 7828 | Chopping Carrots (Easy Version) | binary search brute force constructive algorithms dp greedy number theory | Statement | D1 | Codeforces Round 809 (Div. 2) {1706} | PROGRAMMING | 1000.0 | Codeforces Round #809 Editorial | |
| 6497 | Difference Array | brute force implementation math sortings | Statement | B | Codeforces Round 808 (Div. 1) {1707} | PROGRAMMING | 750.0 | 104930 | |
| 32011 | Three Doors | brute force dfs and similar math | Statement | A | Educational Codeforces Round 132 (Rated for Div. 2) {1709} | PROGRAMMING | 105164 | ||
| 2850 | Rain | brute force data structures math | Statement | B | Codeforces Round 810 (Div. 1) {1710} | PROGRAMMING | 1000.0 | Codeforces Round #810 Editorial | |
| 14709 | Party | brute force graphs | Statement | B | Codeforces Round 810 (Div. 2) {1711} | PROGRAMMING | 1000.0 | Codeforces Round #810 Editorial | |
| 2554 | LCM Sum (easy version) | binary search brute force combinatorics math number theory two pointers | Statement | E1 | Codeforces Round 813 (Div. 2) {1712} | PROGRAMMING | 2000.0 | Codeforces Round #813 (Div. 2) Editorial | |
| 33816 | Minimum Varied Number | bitmasks brute force greedy | Statement | C | Codeforces Round 811 (Div. 3) {1714} | PROGRAMMING | Codeforces Round #811 (Div. 3) Editorial | ||
| 3774 | Build a Tree and That Is It | brute force constructive algorithms greedy implementation trees | Statement | F | Codeforces Round 811 (Div. 3) {1714} | PROGRAMMING | Codeforces Round #811 (Div. 3) Editorial | ||
| 25264 | Add Modulo 10 | brute force math number theory | Statement | E | Codeforces Round 811 (Div. 3) {1714} | PROGRAMMING | Codeforces Round #811 (Div. 3) Editorial | ||
| 10759 | Monoblock | brute force combinatorics data structures divide and conquer greedy implementation | Statement | C | Codeforces Round 816 (Div. 2) {1715} | PROGRAMMING | 1750.0 | Codeforces Round #816 (Div. 2) editorial | |
| 6318 | Chip Move | brute force dp math | Statement | D | Educational Codeforces Round 133 (Rated for Div. 2) {1716} | PROGRAMMING | 105653 | ||
| 3626 | Madoka and The Best University | brute force math number theory | Statement | E | Codeforces Round 818 (Div. 2) {1717} | PROGRAMMING | 2000.0 | Codeforces Round #818 (Div. 2) Editorial. | 2200 |
| 3577 | Fibonacci Strings | brute force data structures greedy implementation math number theory | Statement | B | Codeforces Round 814 (Div. 1) {1718} | PROGRAMMING | 1250.0 | Codeforces Round #814 (Div. 1, Div. 2) Editorial | |
| 1903 | Tonya and Burenka-179 | brute force data structures greedy math number theory | Statement | C | Codeforces Round 814 (Div. 1) {1718} | PROGRAMMING | 1250.0 | Codeforces Round #814 (Div. 1, Div. 2) Editorial | |
| 6824 | Xor-Subsequence (easy version) | bitmasks brute force dp strings trees | Statement | D1 | Codeforces Round 815 (Div. 2) {1720} | PROGRAMMING | 1500.0 | Codeforces Round #815 (Div. 2) Editorial | |
| 2701 | Prefix Function Queries | bitmasks brute force data structures hashing string suffix structures strings trees | Statement | E | Educational Codeforces Round 134 (Rated for Div. 2) {1721} | PROGRAMMING | 106416 | ||
| 7852 | Maximum AND | bitmasks brute force divide and conquer greedy math sortings | Statement | D | Educational Codeforces Round 134 (Rated for Div. 2) {1721} | PROGRAMMING | 106416 | ||
| 24065 | Deadly Laser | brute force implementation | Statement | B | Educational Codeforces Round 134 (Rated for Div. 2) {1721} | PROGRAMMING | 106416 | ||
| 13870 | Counting Rectangles | brute force data structures dp implementation | Statement | E | Codeforces Round 817 (Div. 4) {1722} | PROGRAMMING | 106478 | 1600 | |
| 4299 | Edge Split | brute force constructive algorithms dfs and similar graphs probabilities trees | Statement | D | Codeforces Round 819 (Div. 1 + Div. 2) and Grimoire of Code Annual Contest 2022 {1726} | PROGRAMMING | 2000.0 | Codeforces Round #819 (Div. 1 + Div. 2) and Grimoire of Code Annual Contest 2022 Editorial | |
| 2096 | Red-Black Pepper | binary search brute force greedy math number theory sortings ternary search | Statement | E | Educational Codeforces Round 135 (Rated for Div. 2) {1728} | PROGRAMMING | 106805 | ||
| 4620 | Kirei and the Linear Function | brute force math | Statement | F | Codeforces Round 820 (Div. 3) {1729} | PROGRAMMING | Codeforces Round #820 (Div. 3) Editorial | ||
| 8706 | Valiant's New Map | binary search brute force data structures dp two pointers | Statement | D | Codeforces Round 841 (Div. 2) and Divide by Zero 2022 {1731} | PROGRAMMING | 1500.0 | Codeforces Round #841 (Div. 2) and Divide By Zero 2022 Editorial | |
| 12702 | Even Subarrays | bitmasks brute force hashing math number theory | Statement | C | Codeforces Round 841 (Div. 2) and Divide by Zero 2022 {1731} | PROGRAMMING | 1500.0 | Codeforces Round #841 (Div. 2) and Divide By Zero 2022 Editorial | |
| 931 | Function Sum | brute force combinatorics dp fft math | Statement | F | Codeforces Round 841 (Div. 2) and Divide by Zero 2022 {1731} | PROGRAMMING | 2750.0 | Codeforces Round #841 (Div. 2) and Divide By Zero 2022 Editorial | |
| 17946 | Bestie | brute force constructive algorithms implementation math number theory | Statement | A | Codeforces Round 830 (Div. 2) {1732} | PROGRAMMING | 750.0 | 108327 | 1000 |
| 10101 | Balance (Easy version) | brute force data structures implementation | Statement | D1 | Codeforces Round 830 (Div. 2) {1732} | PROGRAMMING | 1250.0 | 108327 | 1500 |
| 3184 | Sheikh (Hard Version) | binary search bitmasks brute force greedy implementation two pointers | Statement | C2 | Codeforces Round 830 (Div. 2) {1732} | PROGRAMMING | 1000.0 | 108327 | 2100 |
| 1620 | Balance (Hard version) | brute force data structures | Statement | D2 | Codeforces Round 830 (Div. 2) {1732} | PROGRAMMING | 1250.0 | 108327 | 2400 |
| 7165 | Meta-set | brute force combinatorics data structures hashing math | Statement | D | Codeforces Round 824 (Div. 2) {1735} | PROGRAMMING | 1750.0 | Codeforces Round #824 — editorial | |
| 1998 | Kirill and Company | bitmasks brute force dp graphs shortest paths | Statement | G | Codeforces Round 826 (Div. 3) {1741} | PROGRAMMING | 107908 | ||
| 19640 | Minimize the Thickness | brute force greedy math two pointers | Statement | C | Codeforces Round 826 (Div. 3) {1741} | PROGRAMMING | 107908 | ||
| 13871 | Orray | bitmasks brute force greedy math | Statement | G | Codeforces Round 827 (Div. 4) {1742} | PROGRAMMING | 107962 | ||
| 36915 | Coprime | brute force greedy number theory | Statement | D | Codeforces Round 827 (Div. 4) {1742} | PROGRAMMING | 107962 | ||
| 8538 | Problem with Random Tests | brute force hashing probabilities | Statement | D | Educational Codeforces Round 137 (Rated for Div. 2) {1743} | PROGRAMMING | Educational Codeforces Round 137 Editorial | 1700 | |
| 13123 | Divisible Numbers (easy version) | brute force math number theory | Statement | E1 | Codeforces Round 828 (Div. 3) {1744} | PROGRAMMING | Codeforces Round #828 (Div. 3) Editorial | ||
| 7084 | Divisible Numbers (hard version) | brute force math number theory | Statement | E2 | Codeforces Round 828 (Div. 3) {1744} | PROGRAMMING | Codeforces Round #828 (Div. 3) Editorial | ||
| 3989 | MEX vs MED | brute force math two pointers | Statement | F | Codeforces Round 828 (Div. 3) {1744} | PROGRAMMING | Codeforces Round #828 (Div. 3) Editorial | ||
| 17028 | Diverse Substrings | brute force implementation strings | Statement | B | Codeforces Round 833 (Div. 2) {1748} | PROGRAMMING | 1000.0 | Codeforces Round #833 (Div. 2) Editorial | 1400 |
| 13377 | Zero-Sum Prefixes | brute force data structures dp greedy implementation | Statement | C | Codeforces Round 833 (Div. 2) {1748} | PROGRAMMING | 1500.0 | Codeforces Round #833 (Div. 2) Editorial | 1600 |
| 16884 | Maximum Substring | brute force greedy | Statement | B | CodeTON Round 3 (Div. 1 + Div. 2, Rated, Prizes!) {1750} | PROGRAMMING | 750.0 | CodeTON Round 3 (Div. 1 + Div. 2) Editorial | |
| 457 | N Machines | binary search brute force greedy | Statement | E | Codeforces Round 829 (Div. 1) {1753} | PROGRAMMING | 2500.0 | Tutorial | 3300 |
| 257 | Minecraft Series | brute force two pointers | Statement | F | Codeforces Round 829 (Div. 1) {1753} | PROGRAMMING | 3000.0 | Tutorial | 3500 |
| 8806 | Range = √Sum | binary search brute force constructive algorithms math two pointers | Statement | D | Codeforces Round 836 (Div. 2) {1758} | PROGRAMMING | 1750.0 | Codeforces Round #836 (Div. 2) Editorial | |
| 12766 | The Humanoid | brute force dp sortings | Statement | E | Codeforces Round 834 (Div. 3) {1759} | PROGRAMMING | 109254 | ||
| 21989 | Make It Round | brute force number theory | Statement | D | Codeforces Round 834 (Div. 3) {1759} | PROGRAMMING | 109254 | ||
| 11048 | SlavicG's Favorite Problem | bitmasks brute force constructive algorithms data structures dfs and similar graphs greedy | Statement | G | Codeforces Round 835 (Div. 4) {1760} | PROGRAMMING | 109348 | ||
| 2896 | Carry Bit | bitmasks brute force combinatorics dp math | Statement | D | Pinely Round 1 (Div. 1 + Div. 2) {1761} | PROGRAMMING | 1750.0 | Pinely Round 1 (Div. 1 + Div. 2) Editorial | |
| 41729 | Two Permutations | brute force constructive algorithms | Statement | A | Pinely Round 1 (Div. 1 + Div. 2) {1761} | PROGRAMMING | 500.0 | Pinely Round 1 (Div. 1 + Div. 2) Editorial | |
| 16714 | Incinerate | binary search brute force data structures sortings | Statement | B | Codeforces Round 840 (Div. 2) and Enigma 2022 - Cybros LNMIIT {1763} | PROGRAMMING | 1000.0 | Codeforces Round #840 (Div. 2) and Enigma 2022 — Cybros LNMIIT Editorial | |
| 8013 | Another Array Problem | brute force constructive algorithms greedy | Statement | C | Codeforces Round 840 (Div. 2) and Enigma 2022 - Cybros LNMIIT {1763} | PROGRAMMING | 1500.0 | Codeforces Round #840 (Div. 2) and Enigma 2022 — Cybros LNMIIT Editorial | |
| 1286 | Doremy's Experimental Tree | brute force constructive algorithms dfs and similar dsu sortings trees | Statement | F | Codeforces Global Round 24 {1764} | PROGRAMMING | 2250.0 | Codeforces Global Round 24 Editorial | |
| 1557 | Decomposition | brute force divide and conquer dp matrices | Statement | E | Educational Codeforces Round 139 (Rated for Div. 2) {1766} | PROGRAMMING | 110066 | ||
| 11054 | Lucky Chains | brute force dp greedy math number theory | Statement | D | Educational Codeforces Round 139 (Rated for Div. 2) {1766} | PROGRAMMING | 110066 | ||
| 24195 | Notepad# | brute force greedy implementation | Statement | B | Educational Codeforces Round 139 (Rated for Div. 2) {1766} | PROGRAMMING | 110066 | ||
| 1345 | Algebra Flash | bitmasks brute force dp graphs meet-in-the-middle trees | Statement | E | Educational Codeforces Round 140 (Rated for Div. 2) {1767} | PROGRAMMING | 110225 | ||
| 25543 | Koxia and Whiteboards | brute force greedy | Statement | A | Good Bye 2022: 2023 is NEAR {1770} | PROGRAMMING | 500.0 | Good Bye 2022 -- Editorial | |
| 3330 | Hossam and (sub-)palindromic tree | brute force dfs and similar dp trees | Statement | D | Codeforces Round 837 (Div. 2) {1771} | PROGRAMMING | 2250.0 | Codeforces Round #837 (Div. 2) Editorial | |
| 860 | Hossam and a Letter | brute force dp implementation two pointers | Statement | E | Codeforces Round 837 (Div. 2) {1771} | PROGRAMMING | 2750.0 | Codeforces Round #837 (Div. 2) Editorial | |
| 33575 | Matrix Rotation | brute force | Statement | B | Codeforces Round 839 (Div. 3) {1772} | PROGRAMMING | 110313 | ||
| 592 | Interactive Factorial Guessing | brute force games implementation interactive | Statement | I | 2022-2023 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1773} | PROGRAMMING | 2500 | ||
| 713 | Segment Covering | brute force combinatorics constructive algorithms data structures trees | Statement | G | Polynomial Round 2022 (Div. 1 + Div. 2, Rated, Prizes!) {1774} | PROGRAMMING | 3250.0 | Polynomial Round 2022 (Div. 1 + Div. 2) Editorial | |
| 9477 | Same Count One | brute force constructive algorithms implementation two pointers | Statement | D | Polynomial Round 2022 (Div. 1 + Div. 2, Rated, Prizes!) {1774} | PROGRAMMING | 1500.0 | Polynomial Round 2022 (Div. 1 + Div. 2) Editorial | |
| 944 | Magician and Pigs (Hard Version) | brute force data structures | Statement | F2 | Polynomial Round 2022 (Div. 1 + Div. 2, Rated, Prizes!) {1774} | PROGRAMMING | 1000.0 | Polynomial Round 2022 (Div. 1 + Div. 2) Editorial | |
| 1314 | Magician and Pigs (Easy Version) | brute force implementation | Statement | F1 | Polynomial Round 2022 (Div. 1 + Div. 2, Rated, Prizes!) {1774} | PROGRAMMING | 1500.0 | Polynomial Round 2022 (Div. 1 + Div. 2) Editorial | |
| 925 | Laboratory on Pluto | brute force combinatorics dp fft greedy math | Statement | F | Codeforces Round 843 (Div. 2) {1775} | PROGRAMMING | 3000.0 | Codeforces Round #843 (Div. 2) Editorial | |
| 20509 | Gardener and the Capybaras (easy version) | brute force implementation strings | Statement | A1 | Codeforces Round 843 (Div. 2) {1775} | PROGRAMMING | 500.0 | Codeforces Round #843 (Div. 2) Editorial | |
| 11864 | Flexible String | bitmasks brute force strings | Statement | C | Codeforces Round 848 (Div. 2) {1778} | PROGRAMMING | 1250.0 | Codeforces Round #848 (Div. 2) Editorial | |
| 176 | Olympic Team Building | brute force meet-in-the-middle | Statement | H | Hello 2023 {1779} | PROGRAMMING | 4000.0 | ||
| 1985 | Josuke and Complete Graph | binary search brute force data structures number theory | Statement | E | Codeforces Round 846 (Div. 2) {1780} | PROGRAMMING | 1750.0 | 111841 | |
| 2008 | Three Chairs | bitmasks brute force combinatorics data structures number theory sortings | Statement | F | Codeforces Round 846 (Div. 2) {1780} | PROGRAMMING | 2000.0 | 111841 | |
| 28059 | GCD Partition | brute force greedy math number theory | Statement | B | Codeforces Round 846 (Div. 2) {1780} | PROGRAMMING | 1000.0 | 111841 | |
| 1394 | Bracket Insertion | brute force combinatorics constructive algorithms dp math trees | Statement | F | VK Cup 2022 - Отборочный раунд (Engine) {1781} | PROGRAMMING | 3250.0 | Tutorial | |
| 6416 | Many Perfect Squares | brute force math number theory | Statement | D | VK Cup 2022 - Отборочный раунд (Engine) {1781} | PROGRAMMING | 2000.0 | Tutorial | |
| 5426 | Different Arrays | brute force dp | Statement | D | Educational Codeforces Round 141 (Rated for Div. 2) {1783} | PROGRAMMING | Educational Codeforces Round 141 Editorial | ||
| 2556 | Game of the Year | brute force math number theory | Statement | E | Educational Codeforces Round 141 (Rated for Div. 2) {1783} | PROGRAMMING | Educational Codeforces Round 141 Editorial | ||
| 9913 | Cake Assembly Line | brute force sortings | Statement | B | Codeforces Round 850 (Div. 2, based on VK Cup 2022 - Final Round) {1786} | PROGRAMMING | 1000.0 | Codeforces Round #850 Editorial | |
| 4815 | Moving Dots | binary search brute force combinatorics dp math two pointers | Statement | D | Codeforces Round 851 (Div. 2) {1788} | PROGRAMMING | 2250.0 | Codeforces Round #851 (Div. 2) Editorial | |
| 59059 | One and Two | brute force math | Statement | A | Codeforces Round 851 (Div. 2) {1788} | PROGRAMMING | 500.0 | Codeforces Round #851 (Div. 2) Editorial |