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 ... 7 8 9 10 11 ... 13 14 15 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 372 | Two Sorts | binary search math | Statement | F | Codeforces Round 751 (Div. 1) {1601} | PROGRAMMING | 3000.0 | 95865 | 3400 |
| 405 | October 18, 2017 | combinatorics dp implementation math | Statement | F | Codeforces Round 752 (Div. 1) {1603} | PROGRAMMING | 3750.0 | Editorial of Codeforces Round #752 | |
| 17982 | Di-visible Confusion | constructive algorithms math number theory | Statement | A | Codeforces Round 752 (Div. 1) {1603} | PROGRAMMING | 750.0 | Editorial of Codeforces Round #752 | 1300 |
| 15267 | Moderate Modular Mode | constructive algorithms math number theory | Statement | B | Codeforces Round 752 (Div. 1) {1603} | PROGRAMMING | 1000.0 | Editorial of Codeforces Round #752 | 1600 |
| 2351 | Extreme Extension | dp greedy math number theory | Statement | C | Codeforces Round 752 (Div. 1) {1603} | PROGRAMMING | 1750.0 | Editorial of Codeforces Round #752 | 2300 |
| 1221 | Array Equalizer | binary search implementation math number theory sortings | Statement | E | Codeforces Round 754 (Div. 2) {1605} | PROGRAMMING | 2500.0 | tutorial | 2400 |
| 438 | PalindORme | combinatorics dp | Statement | F | Codeforces Round 754 (Div. 2) {1605} | PROGRAMMING | 3500.0 | tutorial | 2900 |
| 21745 | A.M. Deviation | math number theory | Statement | A | Codeforces Round 754 (Div. 2) {1605} | PROGRAMMING | 500.0 | tutorial | 800 |
| 19712 | Update Files | implementation math | Statement | B | Educational Codeforces Round 116 (Rated for Div. 2) {1606} | PROGRAMMING | 96454 | ||
| 18298 | Blue-Red Permutation | greedy math sortings | Statement | D | Codeforces Round 753 (Div. 3) {1607} | PROGRAMMING | Codeforces Round #753 (Div. 3) Editorial | ||
| 42883 | Odd Grasshopper | math | Statement | B | Codeforces Round 753 (Div. 3) {1607} | PROGRAMMING | Codeforces Round #753 (Div. 3) Editorial | ||
| 1629 | Dominoes | combinatorics fft graphs math | Statement | D | Codeforces Round 758 (Div.1 + Div. 2) {1608} | PROGRAMMING | 1500.0 | Editorial of Codeforces Round #758 (Div.1 + Div. 2) | |
| 20409 | Find Array | constructive algorithms math | Statement | A | Codeforces Round 758 (Div.1 + Div. 2) {1608} | PROGRAMMING | 250.0 | Editorial of Codeforces Round #758 (Div.1 + Div. 2) | |
| 676 | A Stroll Around the Matrix | data structures greedy math | Statement | G | Deltix Round, Autumn 2021 (open for everyone, rated, Div. 1 + Div. 2) {1609} | PROGRAMMING | 3250.0 | Deltix Round, Autumn 2021. Editorial | 3000 |
| 19140 | Divide and Multiply | greedy implementation math number theory | Statement | A | Deltix Round, Autumn 2021 (open for everyone, rated, Div. 1 + Div. 2) {1609} | PROGRAMMING | 500.0 | Deltix Round, Autumn 2021. Editorial | 900 |
| 2130 | 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 | |
| 3148 | Not Quite Lee | combinatorics math number theory | Statement | D | Codeforces Global Round 17 {1610} | PROGRAMMING | 2250.0 | Codeforces Global Round 17 Editorial | |
| 17195 | Anti Light's Cell Guessing | constructive algorithms implementation math | Statement | A | Codeforces Global Round 17 {1610} | PROGRAMMING | 500.0 | Codeforces Global Round 17 Editorial | |
| 32252 | Team Composition: Programmers and Mathematicians | binary search constructive algorithms math | Statement | B | Codeforces Round 756 (Div. 3) {1611} | PROGRAMMING | Tutorial | 800 | |
| 33671 | Make Even | constructive algorithms math | Statement | A | Codeforces Round 756 (Div. 3) {1611} | PROGRAMMING | Tutorial | 800 | |
| 27978 | Chat Ban | binary search math | Statement | C | Educational Codeforces Round 117 (Rated for Div. 2) {1612} | PROGRAMMING | 97164 | ||
| 2935 | Messages | greedy math probabilities sortings | Statement | E | Educational Codeforces Round 117 (Rated for Div. 2) {1612} | PROGRAMMING | 97164 | ||
| 10431 | X-Magic Pair | math number theory | Statement | D | Educational Codeforces Round 117 (Rated for Div. 2) {1612} | PROGRAMMING | 97164 | ||
| 11493 | Divan and bitwise operations | bitmasks combinatorics constructive algorithms dp math | Statement | C | Codeforces Round 757 (Div. 2) {1614} | PROGRAMMING | 1500.0 | Tutorial | 1500 |
| 18190 | And It's Non-Zero | bitmasks greedy math | Statement | B | Codeforces Global Round 18 {1615} | PROGRAMMING | 1000.0 | Global Round 18 Editorial | |
| 9295 | Menorah | brute force graphs greedy math | Statement | C | Codeforces Global Round 18 {1615} | PROGRAMMING | 1750.0 | Global Round 18 Editorial | |
| 1203 | LEGOndary Grandmaster | combinatorics dp math | Statement | F | Codeforces Global Round 18 {1615} | PROGRAMMING | 3000.0 | Global Round 18 Editorial | |
| 1773 | Purple Crayon | dp games greedy math trees | Statement | E | Codeforces Global Round 18 {1615} | PROGRAMMING | 2750.0 | Global Round 18 Editorial | |
| 21728 | Closing The Gap | greedy math | Statement | A | Codeforces Global Round 18 {1615} | PROGRAMMING | 250.0 | Global Round 18 Editorial | |
| 13311 | Representative Edges | brute force geometry implementation math | Statement | C | Good Bye 2021: 2022 is NEAR {1616} | PROGRAMMING | 1500.0 | Good Bye 2021 -- Editorial | 1500 |
| 5720 | Keep the Average High | dp greedy math | Statement | D | Good Bye 2021: 2022 is NEAR {1616} | PROGRAMMING | 2000.0 | Good Bye 2021 -- Editorial | 2000 |
| 787 | Tricolor Triangles | graphs math matrices | Statement | F | Good Bye 2021: 2022 is NEAR {1616} | PROGRAMMING | 3000.0 | Good Bye 2021 -- Editorial | 2900 |
| 1389 | Keep XOR Low | bitmasks combinatorics divide and conquer dp math | Statement | H | Good Bye 2021: 2022 is NEAR {1616} | PROGRAMMING | 4000.0 | Good Bye 2021 -- Editorial | 3000 |
| 27439 | 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) | |
| 1081 | Christmas Chocolates | dfs and similar dp games graphs implementation math number theory shortest paths trees | Statement | E | Codeforces Round 761 (Div. 2) {1617} | PROGRAMMING | 3000.0 | Editorial for Codeforces Round #761 (Div. 2) | |
| 16150 | Paprika and Permutation | greedy math | Statement | C | Codeforces Round 761 (Div. 2) {1617} | PROGRAMMING | 1500.0 | Editorial for Codeforces Round #761 (Div. 2) | |
| 2005 | Trader Problem | binary search data structures dsu greedy math sortings | Statement | G | Codeforces Round 760 (Div. 3) {1618} | PROGRAMMING | Codeforces Round #760 (Div. 3) Editorial | ||
| 4821 | Reverse | bitmasks implementation math strings | Statement | F | Codeforces Round 760 (Div. 3) {1618} | PROGRAMMING | Codeforces Round #760 (Div. 3) Editorial | ||
| 7860 | Singers' Tour | constructive algorithms math | Statement | E | Codeforces Round 760 (Div. 3) {1618} | PROGRAMMING | Codeforces Round #760 (Div. 3) Editorial | ||
| 21159 | Array and Operations | dp greedy math | Statement | D | Codeforces Round 760 (Div. 3) {1618} | PROGRAMMING | Codeforces Round #760 (Div. 3) Editorial | ||
| 34838 | Polycarp and Sums of Subsequences | math | Statement | A | Codeforces Round 760 (Div. 3) {1618} | PROGRAMMING | Codeforces Round #760 (Div. 3) Editorial | ||
| 34860 | Paint the Array | math | Statement | C | Codeforces Round 760 (Div. 3) {1618} | PROGRAMMING | Codeforces Round #760 (Div. 3) Editorial | ||
| 10385 | MEX and Increments | constructive algorithms data structures dp greedy math sortings | Statement | E | Codeforces Round 762 (Div. 3) {1619} | PROGRAMMING | Tutorial | ||
| 2399 | Let's Play the Hat? | constructive algorithms math | Statement | F | Codeforces Round 762 (Div. 3) {1619} | PROGRAMMING | Tutorial | ||
| 33451 | Squares and Cubes | implementation math | Statement | B | Codeforces Round 762 (Div. 3) {1619} | PROGRAMMING | Tutorial | ||
| 7366 | BA-String | bitmasks brute force dp greedy implementation math shortest paths | Statement | C | Educational Codeforces Round 119 (Rated for Div. 2) {1620} | PROGRAMMING | 98061 | ||
| 1218 | Subsequences Galore | bitmasks combinatorics dp math | Statement | G | Educational Codeforces Round 119 (Rated for Div. 2) {1620} | PROGRAMMING | 98061 | ||
| 34132 | Triangles on a Rectangle | geometry greedy math | Statement | B | Educational Codeforces Round 119 (Rated for Div. 2) {1620} | PROGRAMMING | 98061 | ||
| 4446 | The Winter Hike | constructive algorithms greedy math | Statement | D | Hello 2022 {1621} | PROGRAMMING | 1750.0 | ||
| 7576 | Hidden Permutations | dfs and similar interactive math | Statement | C | Hello 2022 {1621} | PROGRAMMING | 1500.0 | ||
| 2297 | Math Test | bitmasks brute force greedy | Statement | E | Educational Codeforces Round 120 (Rated for Div. 2) {1622} | PROGRAMMING | Educational Codeforces Round 120 Editorial | ||
| 4984 | Shuffle | combinatorics math two pointers | Statement | D | Educational Codeforces Round 120 (Rated for Div. 2) {1622} | PROGRAMMING | Educational Codeforces Round 120 Editorial | ||
| 32354 | Construct a Rectangle | math | Statement | A | Educational Codeforces Round 120 (Rated for Div. 2) {1622} | PROGRAMMING | Educational Codeforces Round 120 Editorial | ||
| 20847 | Robot Cleaner | brute force implementation math | Statement | A | Codeforces Round 763 (Div. 2) {1623} | PROGRAMMING | 500.0 | Codeforces Round #763 (Div. 2) Editorial | |
| 1504 | Robot Cleaner Revisit | dp implementation math probabilities | Statement | D | Codeforces Round 763 (Div. 2) {1623} | PROGRAMMING | 2500.0 | Codeforces Round #763 (Div. 2) Editorial | |
| 19448 | Palindromes Coloring | binary search greedy sortings strings | Statement | D | Codeforces Round 764 (Div. 3) {1624} | PROGRAMMING | Codeforces Round #764 (Div. 3) Editorial | ||
| 27193 | Division by Two and Permutation | constructive algorithms flows graph matchings greedy math | Statement | C | Codeforces Round 764 (Div. 3) {1624} | PROGRAMMING | Codeforces Round #764 (Div. 3) Editorial | ||
| 56868 | Make AP | implementation math | Statement | B | Codeforces Round 764 (Div. 3) {1624} | PROGRAMMING | Codeforces Round #764 (Div. 3) Editorial | ||
| 61355 | Plus One on the Subset | math | Statement | A | Codeforces Round 764 (Div. 3) {1624} | PROGRAMMING | Codeforces Round #764 (Div. 3) Editorial | ||
| 18398 | Ancient Civilization | bitmasks greedy math | Statement | A | Codeforces Round 765 (Div. 2) {1625} | PROGRAMMING | 500.0 | Editorial of Codeforces Round #765 (Div. 2) | |
| 936 | A Random Code Problem | combinatorics dp math number theory | Statement | F | Educational Codeforces Round 121 (Rated for Div. 2) {1626} | PROGRAMMING | 99136 | ||
| 9601 | Not Adding | dp math number theory | Statement | D | Codeforces Round 766 (Div. 2) {1627} | PROGRAMMING | 1750.0 | Codeforces Round #766 (Div. 2) Editorial | |
| 17256 | Meximum Array | brute force constructive algorithms greedy math | Statement | A | Codeforces Round 767 (Div. 1) {1628} | PROGRAMMING | 500.0 | 99276 | |
| 3711 | Grid Xor | constructive algorithms greedy implementation interactive math | Statement | C | Codeforces Round 767 (Div. 1) {1628} | PROGRAMMING | 1250.0 | 99276 | |
| 25559 | GCD Arrays | greedy math number theory | Statement | B | Codeforces Round 767 (Div. 2) {1629} | PROGRAMMING | 750.0 | Editorial of Codeforces Round #767 | |
| 14265 | 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 | |
| 5469 | New Year Concert | binary search data structures dp greedy math number theory two pointers | Statement | D | Codeforces Round 769 (Div. 2) {1632} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round #769 | |
| 1822 | Spanning Tree Queries | binary search data structures dsu graphs implementation math sortings | Statement | E | Educational Codeforces Round 122 (Rated for Div. 2) {1633} | PROGRAMMING | 99539 | ||
| 21449 | Kill the Monster | brute force math | Statement | C | Educational Codeforces Round 122 (Rated for Div. 2) {1633} | PROGRAMMING | 99539 | ||
| 23648 | Fortune Telling | bitmasks math | Statement | B | Codeforces Round 770 (Div. 2) {1634} | PROGRAMMING | 1250.0 | Codeforces Round #770 (Div. 2) editorial | |
| 2002 | Fibonacci Additions | brute force hashing math | Statement | F | Codeforces Round 770 (Div. 2) {1634} | PROGRAMMING | 3000.0 | Codeforces Round #770 (Div. 2) editorial | |
| 19173 | OKEA | constructive algorithms math | Statement | C | Codeforces Round 770 (Div. 2) {1634} | PROGRAMMING | 1500.0 | Codeforces Round #770 (Div. 2) editorial | |
| 7159 | Infinite Set | dp math matrices number theory strings | Statement | D | Codeforces Round 772 (Div. 2) {1635} | PROGRAMMING | 2250.0 | Codeforces Round #772 Editorial | |
| 15516 | MEX and Array | brute force dp greedy math | Statement | B | Codeforces Global Round 19 {1637} | PROGRAMMING | 1000.0 | Tutorial | |
| 670 | Birthday | constructive algorithms math | Statement | G | Codeforces Global Round 19 {1637} | PROGRAMMING | 4000.0 | Tutorial | |
| 641 | Minimize Inversions Number | data structures math sortings | Statement | H | Codeforces Global Round 19 {1637} | PROGRAMMING | 4000.0 | Tutorial | |
| 9141 | Yet Another Minimization Problem | dp math | Statement | D | Codeforces Global Round 19 {1637} | PROGRAMMING | 2000.0 | Tutorial | |
| 22789 | Odd Swap Sort | data structures math sortings | Statement | B | Codeforces Round 771 (Div. 2) {1638} | PROGRAMMING | 750.0 | Codeforces Round #771 Editorial | |
| 16138 | Inversion Graph | dsu graphs math | Statement | C | Codeforces Round 771 (Div. 2) {1638} | PROGRAMMING | 1250.0 | Codeforces Round #771 Editorial | |
| 22235 | Reverse | greedy math | Statement | A | Codeforces Round 771 (Div. 2) {1638} | PROGRAMMING | 500.0 | Codeforces Round #771 Editorial | |
| 3525 | Expand the Path | brute force combinatorics implementation math | Statement | E | Educational Codeforces Round 123 (Rated for Div. 2) {1644} | PROGRAMMING | 100227 | ||
| 532 | Basis | combinatorics fft math number theory | Statement | F | Educational Codeforces Round 123 (Rated for Div. 2) {1644} | PROGRAMMING | 100227 | ||
| 7971 | Cross Coloring | implementation math | Statement | D | Educational Codeforces Round 123 (Rated for Div. 2) {1644} | PROGRAMMING | 100227 | ||
| 20853 | 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 |
| 2832 | 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 |
| 25508 | Square Counting | math | Statement | A | Codeforces Round 774 (Div. 2) {1646} | PROGRAMMING | 750.0 | Codeforces Round #774 (Div. 2) Editorial | 800 |
| 17271 | Madoka and the Elegant Gift | brute force graphs implementation | Statement | B | Codeforces Round 777 (Div. 2) {1647} | PROGRAMMING | 1250.0 | Codeforces Round #777 Editorial | |
| 5741 | Madoka and the Best School in Russia | dp math number theory | Statement | D | Codeforces Round 777 (Div. 2) {1647} | PROGRAMMING | 2000.0 | Codeforces Round #777 Editorial | |
| 23563 | Madoka and Math Dad | implementation math | Statement | A | Codeforces Round 777 (Div. 2) {1647} | PROGRAMMING | 500.0 | Codeforces Round #777 Editorial | |
| 7428 | 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 | |
| 20180 | Weird Sum | combinatorics data structures geometry math matrices sortings | Statement | A | Codeforces Round 775 (Div. 1, based on Moscow Open Olympiad in Informatics) {1648} | PROGRAMMING | 500.0 | Codeforces Round #775 Editorial | |
| 4503 | Rescheduling the Exam | binary search data structures greedy implementation math sortings | Statement | E | Codeforces Round 776 (Div. 3) {1650} | PROGRAMMING | 100712 | ||
| 15363 | Twist the Permutation | brute force constructive algorithms math | Statement | D | Codeforces Round 776 (Div. 3) {1650} | PROGRAMMING | 100712 | ||
| 30310 | DIV + MOD | math | Statement | B | Codeforces Round 776 (Div. 3) {1650} | PROGRAMMING | 100712 | ||
| 531 | 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 | ||
| 675 | Sum of Matchings | dfs and similar greedy implementation math | Statement | E | Educational Codeforces Round 124 (Rated for Div. 2) {1651} | PROGRAMMING | Educational Codeforces Round 124 Editorial | ||
| 3102 | Potion Brewing Class | dfs and similar implementation math number theory trees | Statement | D | Codeforces Round 778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) {1654} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round #778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) | 2100 |
| 2387 | 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 |
| 112 | Three Minimums | combinatorics fft math | Statement | H | Codeforces Round 778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) {1654} | PROGRAMMING | 4000.0 | Editorial of Codeforces Round #778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) | 3500 |
| 1295 | Parametric MST | binary search graphs greedy math ternary search | Statement | F | CodeTON Round 1 (Div. 1 + Div. 2, Rated, Prizes!) {1656} | PROGRAMMING | 3000.0 | Tutorial | |
| 28890 | Subtract Operation | constructive algorithms data structures math two pointers | Statement | B | CodeTON Round 1 (Div. 1 + Div. 2, Rated, Prizes!) {1656} | PROGRAMMING | 1000.0 | Tutorial | |
| 7658 | K-good | constructive algorithms games math number theory | Statement | D | CodeTON Round 1 (Div. 1 + Div. 2, Rated, Prizes!) {1656} | PROGRAMMING | 2000.0 | Tutorial | |
| 554 | Cycle Palindrome | constructive algorithms math | Statement | G | CodeTON Round 1 (Div. 1 + Div. 2, Rated, Prizes!) {1656} | PROGRAMMING | 3250.0 | Tutorial | |
| 20533 | Good Pairs | constructive algorithms math sortings | Statement | A | CodeTON Round 1 (Div. 1 + Div. 2, Rated, Prizes!) {1656} | PROGRAMMING | 500.0 | Tutorial | |
| 842 | Equal LCM Subsets | math number theory | Statement | H | CodeTON Round 1 (Div. 1 + Div. 2, Rated, Prizes!) {1656} | PROGRAMMING | 3750.0 | Tutorial | |
| 21255 | Make Equal With Mod | math number theory sortings | Statement | C | CodeTON Round 1 (Div. 1 + Div. 2, Rated, Prizes!) {1656} | PROGRAMMING | 1500.0 | Tutorial | |
| 5390 | For Gamers. By Gamers. | binary search dp math sortings two pointers | Statement | D | Educational Codeforces Round 125 (Rated for Div. 2) {1657} | PROGRAMMING | 101161 | ||
| 2591 | Star MST | combinatorics dp math | Statement | E | Educational Codeforces Round 125 (Rated for Div. 2) {1657} | PROGRAMMING | 101161 | ||
| 25049 | Integer Moves | math | Statement | A | Educational Codeforces Round 125 (Rated for Div. 2) {1657} | PROGRAMMING | 101161 | ||
| 3230 | 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 | |
| 10112 | 388535 (Easy Version) | bitmasks data structures math | Statement | D1 | Codeforces Round 779 (Div. 2) {1658} | PROGRAMMING | 1250.0 | Codeforces Round #779 (Div. 2) Editorial | |
| 1013 | 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 | |
| 19714 | Marin and Anti-coprime Permutation | combinatorics math | Statement | B | Codeforces Round 779 (Div. 2) {1658} | PROGRAMMING | 1000.0 | Codeforces Round #779 (Div. 2) Editorial | |
| 20960 | Marin and Photoshoot | constructive algorithms math | Statement | A | Codeforces Round 779 (Div. 2) {1658} | PROGRAMMING | 500.0 | Codeforces Round #779 (Div. 2) Editorial | |
| 10016 | Shinju and the Lost Permutation | constructive algorithms math | Statement | C | Codeforces Round 779 (Div. 2) {1658} | PROGRAMMING | 1750.0 | Codeforces Round #779 (Div. 2) Editorial | |
| 1260 | Gojou and Matrix Game | data structures dp games math number theory sortings | Statement | E | Codeforces Round 779 (Div. 2) {1658} | PROGRAMMING | 2500.0 | Codeforces Round #779 (Div. 2) Editorial | |
| 2035 | 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 | |
| 4504 | Reverse Sort Sum | constructive algorithms data structures greedy implementation math two pointers | Statement | D | Codeforces Round 782 (Div. 2) {1659} | PROGRAMMING | 2000.0 | Codeforces Round #782 (Div. 2) Editorial | |
| 34050 | Red Versus Blue | constructive algorithms greedy implementation math | Statement | A | Codeforces Round 782 (Div. 2) {1659} | PROGRAMMING | 500.0 | Codeforces Round #782 (Div. 2) Editorial | |
| 16175 | Line Empire | dp greedy implementation math | Statement | C | Codeforces Round 782 (Div. 2) {1659} | PROGRAMMING | 1500.0 | Codeforces Round #782 (Div. 2) Editorial | |
| 12150 | Maximum Product Strikes Back | binary search implementation math | Statement | D | Codeforces Round 780 (Div. 3) {1660} | PROGRAMMING | Codeforces Round #780 (Div. 3) Editorial | ||
| 8040 | Promising String (easy version) | brute force implementation math strings | Statement | F1 | Codeforces Round 780 (Div. 3) {1660} | PROGRAMMING | Codeforces Round #780 (Div. 3) Editorial | ||
| 3233 | Promising String (hard version) | data structures implementation math strings | Statement | F2 | Codeforces Round 780 (Div. 3) {1660} | PROGRAMMING | Codeforces Round #780 (Div. 3) Editorial | ||
| 39603 | Vasya and Coins | math | Statement | A | Codeforces Round 780 (Div. 3) {1660} | PROGRAMMING | Codeforces Round #780 (Div. 3) Editorial | ||
| 30036 | Vlad and Candies | math | Statement | B | Codeforces Round 780 (Div. 3) {1660} | PROGRAMMING | Codeforces Round #780 (Div. 3) Editorial | ||
| 10830 | Water the Trees | binary search greedy math | Statement | C | Educational Codeforces Round 126 (Rated for Div. 2) {1661} | PROGRAMMING | Educational Codeforces Round 126 Editorial | ||
| 923 | Teleporters | binary search greedy math | Statement | F | Educational Codeforces Round 126 (Rated for Div. 2) {1661} | PROGRAMMING | Educational Codeforces Round 126 Editorial | ||
| 19511 | Array Balancing | greedy math | Statement | A | Educational Codeforces Round 126 (Rated for Div. 2) {1661} | PROGRAMMING | Educational Codeforces Round 126 Editorial | ||
| 187 | Round Table | math | Statement | E | SWERC 2021-2022 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1662} | PROGRAMMING | 102042 | ||
| 3440 | Boundary | math | Statement | H | SWERC 2021-2022 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1662} | PROGRAMMING | 102042 | ||
| 973 | Drone Photo | math sortings | Statement | N | SWERC 2021-2022 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1662} | PROGRAMMING | 102042 | ||
| 3589 | Mike's Sequence | math | Statement | B | April Fools Day Contest 2022 {1663} | PROGRAMMING | April Fools Day Contest 2022 Editorial | ||
| 4813 | GCD Guess | bitmasks chinese remainder theorem constructive algorithms interactive math number theory | Statement | D | Codeforces Round 781 (Div. 2) {1665} | PROGRAMMING | 1500.0 | Codeforces Round #781 (Div. 2) Editorial | |
| 26789 | GCD vs LCM | constructive algorithms math | Statement | A | Codeforces Round 781 (Div. 2) {1665} | PROGRAMMING | 500.0 | Codeforces Round #781 (Div. 2) Editorial | |
| 1799 | 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) | ||
| 154 | Global Warming | geometry math | Statement | G | 2021-2022 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1666} | PROGRAMMING | |||
| 93 | Heroes of Might | math | Statement | H | 2021-2022 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1666} | PROGRAMMING | |||
| 15812 | Make it Increasing | brute force greedy math | Statement | A | Codeforces Round 783 (Div. 1) {1667} | PROGRAMMING | 250.0 | Codeforces Round #783 Editorial | 1300 |
| 2179 | Half Queen Cover | constructive algorithms math | Statement | C | Codeforces Round 783 (Div. 1) {1667} | PROGRAMMING | 1500.0 | Codeforces Round #783 Editorial | 2400 |
| 958 | Centroid Probabilities | combinatorics dp fft math | Statement | E | Codeforces Round 783 (Div. 1) {1667} | PROGRAMMING | 2750.0 | Codeforces Round #783 Editorial | 3000 |
| 16865 | Direction Change | implementation math | Statement | A | Codeforces Round 783 (Div. 2) {1668} | PROGRAMMING | 500.0 | Codeforces Round #783 Editorial | 800 |
| 18028 | Social Distance | greedy math sortings | Statement | B | Codeforces Round 783 (Div. 2) {1668} | PROGRAMMING | 500.0 | Codeforces Round #783 Editorial | 900 |
| 21900 | 2-Letter Strings | data structures math strings | Statement | E | Codeforces Round 784 (Div. 4) {1669} | PROGRAMMING | 102101 | 1200 | |
| 31760 | Maximal AND | bitmasks greedy math | Statement | H | Codeforces Round 784 (Div. 4) {1669} | PROGRAMMING | 102101 | 1300 | |
| 42567 | Odd/Even Increments | greedy greedy implementation math | Statement | C | Codeforces Round 784 (Div. 4) {1669} | PROGRAMMING | 102101 | 800 | |
| 92842 | Division? | implementation | Statement | A | Codeforces Round 784 (Div. 4) {1669} | PROGRAMMING | 102101 | 800 | |
| 11208 | Where is the Pizza? | data structures dfs and similar dsu graphs implementation math | Statement | C | Codeforces Round 788 (Div. 2) {1670} | PROGRAMMING | 1750.0 | Tutorial | 1400 |
| 5745 | Very Suspicious | binary search brute force geometry implementation math | Statement | D | Codeforces Round 788 (Div. 2) {1670} | PROGRAMMING | 2250.0 | Tutorial | 1700 |
| 27574 | Dolce Vita | binary search brute force greedy math | Statement | C | Educational Codeforces Round 127 (Rated for Div. 2) {1671} | PROGRAMMING | 102181 | ||
| 519 | Permutation Counting | brute force combinatorics dp fft math | Statement | F | Educational Codeforces Round 127 (Rated for Div. 2) {1671} | PROGRAMMING | 102181 | ||
| 19931 | Consecutive Points Segment | brute force math sortings | Statement | B | Educational Codeforces Round 127 (Rated for Div. 2) {1671} | PROGRAMMING | 102181 | ||
| 697 | Cross Xor | graphs math | Statement | G | Codeforces Global Round 20 {1672} | PROGRAMMING | 2750.0 | Global Round 20 Editorial | 3200 |
| 16917 | Log Chopping | constructive algorithms games implementation math | Statement | A | Codeforces Global Round 20 {1672} | PROGRAMMING | 250.0 | Global Round 20 Editorial | 800 |
| 1000 | Anti-Theft Road Planning | bitmasks constructive algorithms divide and conquer greedy interactive math | Statement | F | Codeforces Round 785 (Div. 2) {1673} | PROGRAMMING | 3250.0 | Codeforces Round #785 (Div. 2) Editorial | |
| 3653 | Lost Arithmetic Progression | combinatorics implementation math number theory | Statement | D | Codeforces Round 785 (Div. 2) {1673} | PROGRAMMING | 2000.0 | Codeforces Round #785 (Div. 2) Editorial | |
| 854 | Power or XOR? | combinatorics math number theory | Statement | E | Codeforces Round 785 (Div. 2) {1673} | PROGRAMMING | 2750.0 | Codeforces Round #785 (Div. 2) Editorial | |
| 19326 | Palindrome Basis | dp math number theory | Statement | C | Codeforces Round 785 (Div. 2) {1673} | PROGRAMMING | 1500.0 | Codeforces Round #785 (Div. 2) Editorial | |
| 7864 | Breaking the Wall | binary search brute force constructive algorithms greedy math | Statement | E | Codeforces Round 786 (Div. 3) {1674} | PROGRAMMING | 102482 | ||
| 30032 | Dictionary | combinatorics math | Statement | B | Codeforces Round 786 (Div. 3) {1674} | PROGRAMMING | 102482 | ||
| 28182 | Number Transformation | constructive algorithms math | Statement | A | Codeforces Round 786 (Div. 3) {1674} | PROGRAMMING | 102482 | ||
| 2995 | Remove Directed Edges | dfs and similar dp graphs | Statement | G | Codeforces Round 786 (Div. 3) {1674} | PROGRAMMING | 102482 | ||
| 37267 | Food for Animals | math | Statement | A | Codeforces Round 787 (Div. 3) {1675} | PROGRAMMING | 102550 | ||
| 35620 | 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 | ||
| 62618 | Equal Candies | greedy math sortings | Statement | B | Codeforces Round 790 (Div. 4) {1676} | PROGRAMMING | Codeforces Round #790 (Div. 4) Editorial | ||
| 1518 | Tokitsukaze and Permutations | dp math | Statement | D | Codeforces Round 789 (Div. 1) {1677} | PROGRAMMING | 2000.0 | Tutorial | |
| 180 | Tokitsukaze and Gems | dp math | Statement | F | Codeforces Round 789 (Div. 1) {1677} | PROGRAMMING | 3500.0 | Tutorial | |
| 4602 | Tokitsukaze and Meeting | implementation math | Statement | B | Codeforces Round 789 (Div. 1) {1677} | PROGRAMMING | 1250.0 | Tutorial | |
| 824 | Formalism for Formalism | bitmasks dp math | Statement | F | Codeforces Round 791 (Div. 2) {1679} | PROGRAMMING | 3000.0 | Codeforces Round #791 (Div. 2) Editorial | |
| 44232 | AvtoBus | brute force greedy math number theory | Statement | A | Codeforces Round 791 (Div. 2) {1679} | PROGRAMMING | 500.0 | Codeforces Round #791 (Div. 2) Editorial | |
| 1413 | Dog Walking | brute force greedy math | Statement | D | Educational Codeforces Round 128 (Rated for Div. 2) {1680} | PROGRAMMING | 102852 | ||
| 22463 | Minimums and Maximums | math | Statement | A | Educational Codeforces Round 128 (Rated for Div. 2) {1680} | PROGRAMMING | 102852 | ||
| 21176 | Card Trick | implementation math | Statement | B | Educational Codeforces Round 129 (Rated for Div. 2) {1681} | PROGRAMMING | 103163 | 800 | |
| 787 | Unordered Swaps | constructive algorithms dfs and similar graphs greedy math sortings | Statement | E | Codeforces Round 793 (Div. 2) {1682} | PROGRAMMING | 2500.0 | Codeforces Round #793 (Div. 2) Editorial | |
| 16719 | LIS or Reverse LIS? | constructive algorithms greedy implementation math | Statement | C | Codeforces Round 793 (Div. 2) {1682} | PROGRAMMING | 1500.0 | Codeforces Round #793 (Div. 2) Editorial | |
| 874 | Euclid Guess | constructive algorithms flows graph matchings math number theory | Statement | G | Codeforces Round 792 (Div. 1 + Div. 2) {1684} | PROGRAMMING | 2500.0 | Codeforces Round #792 (Div. 1 + Div. 2) Editorial | 2800 |
| 312 | Hard Cut | constructive algorithms divide and conquer math | Statement | H | Codeforces Round 792 (Div. 1 + Div. 2) {1684} | PROGRAMMING | 3250.0 | Codeforces Round #792 (Div. 1 + Div. 2) Editorial | 3400 |
| 25092 | Digit Minimization | constructive algorithms games math | Statement | A | Codeforces Round 792 (Div. 1 + Div. 2) {1684} | PROGRAMMING | 500.0 | Codeforces Round #792 (Div. 1 + Div. 2) Editorial | 800 |
| 21965 | Z mod X = C | constructive algorithms math | Statement | B | Codeforces Round 792 (Div. 1 + Div. 2) {1684} | PROGRAMMING | 750.0 | Codeforces Round #792 (Div. 1 + Div. 2) Editorial | 800 |
| 1455 | Bring Balance | constructive algorithms greedy | Statement | C | Codeforces Round 794 (Div. 1) {1685} | PROGRAMMING | 1500.0 | 103198 | 2600 |
| 793 | Cute number | binary search brute force implementation math | Statement | D | Codeforces Round 796 (Div. 1) {1687} | PROGRAMMING | 1500.0 | Editorial of Codeforces Round 796 | |
| 330 | Become Big For Me | combinatorics constructive algorithms math number theory | Statement | E | Codeforces Round 796 (Div. 1) {1687} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round 796 | |
| 11552 | The Enchanted Forest | constructive algorithms greedy math | Statement | A | Codeforces Round 796 (Div. 1) {1687} | PROGRAMMING | 500.0 | Editorial of Codeforces Round 796 | |
| 113 | Koishi's Unconscious Permutation | fft math | Statement | F | Codeforces Round 796 (Div. 1) {1687} | PROGRAMMING | 3000.0 | Editorial of Codeforces Round 796 | |
| 8863 | Manipulating History | math strings | Statement | C | Codeforces Round 796 (Div. 2) {1688} | PROGRAMMING | 1250.0 | Tutorial | |
| 17266 | Price Maximization | binary search greedy math two pointers | Statement | E | Codeforces Round 797 (Div. 3) {1690} | PROGRAMMING | Codeforces Round #797 (Div. 3) Editorial | 1500 | |
| 9276 | Shifting String | graphs math number theory strings | Statement | F | Codeforces Round 797 (Div. 3) {1690} | PROGRAMMING | Codeforces Round #797 (Div. 3) Editorial | 1700 | |
| 17456 | 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) | |
| 1198 | K-Set Tree | combinatorics dfs and similar dp math trees | Statement | F | CodeCraft-22 and Codeforces Round 795 (Div. 2) {1691} | PROGRAMMING | 2750.0 | Editorial for CodeCraft-22 and Codeforces Round #795 (Div. 2) | |
| 32517 | Beat The Odds | constructive algorithms greedy math | Statement | A | CodeCraft-22 and Codeforces Round 795 (Div. 2) {1691} | PROGRAMMING | 500.0 | Editorial for CodeCraft-22 and Codeforces Round #795 (Div. 2) | |
| 28118 | 3SUM | brute force math | Statement | F | Codeforces Round 799 (Div. 4) {1692} | PROGRAMMING | Codeforces Round #799 (Div. 4) Editorial | ||
| 10097 | Gambling | data structures dp math | Statement | H | Codeforces Round 799 (Div. 4) {1692} | PROGRAMMING | Codeforces Round #799 (Div. 4) Editorial | ||
| 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 | |
| 5052 | Placing Jinas | combinatorics math | Statement | E | Codeforces Global Round 21 {1696} | PROGRAMMING | 2000.0 | Editorial of Codeforces Global Round 21 | |
| 12648 | Fixed Point Guessing | binary search constructive algorithms interactive | Statement | D | Codeforces Round 803 (Div. 2) {1698} | PROGRAMMING | 1500.0 | Codeforces Round #803 (Div. 2) Editorial | |
| 786 | Equal Reversal | constructive algorithms graphs math | Statement | F | Codeforces Round 803 (Div. 2) {1698} | PROGRAMMING | 2500.0 | Codeforces Round #803 (Div. 2) Editorial | |
| 398 | Long Binary String | math matrices meet-in-the-middle number theory | Statement | G | Codeforces Round 803 (Div. 2) {1698} | PROGRAMMING | 3250.0 | Codeforces Round #803 (Div. 2) Editorial | |
| 10865 | The Third Problem | combinatorics math two pointers | Statement | C | Codeforces Round 804 (Div. 2) {1699} | PROGRAMMING | 1500.0 | Codeforces Round #804 (Div. 2) Editorial | |
| 24940 | The Third Three Number Problem | constructive algorithms math | Statement | A | Codeforces Round 804 (Div. 2) {1699} | PROGRAMMING | 500.0 | Codeforces Round #804 (Div. 2) Editorial | |
| 1431 | Three Days Grace | dp math two pointers | Statement | E | Codeforces Round 804 (Div. 2) {1699} | PROGRAMMING | 2500.0 | Codeforces Round #804 (Div. 2) Editorial | |
| 20124 | Palindromic Numbers | constructive algorithms implementation math | Statement | B | Codeforces Round 802 (Div. 2) {1700} | PROGRAMMING | 1000.0 | 103978 | 1100 |
| 7192 | River Locks | binary search dp greedy math | Statement | D | Codeforces Round 802 (Div. 2) {1700} | PROGRAMMING | 1750.0 | 103978 | 1900 |
| 23767 | Optimal Path | dp greedy math | Statement | A | Codeforces Round 802 (Div. 2) {1700} | PROGRAMMING | 500.0 | 103978 | 800 |
| 6352 | Permutation Restoration | binary search data structures greedy math sortings | Statement | D | Educational Codeforces Round 131 (Rated for Div. 2) {1701} | PROGRAMMING | Educational Codeforces Round 131 Editorial | ||
| 1219 | Points | combinatorics data structures math matrices | Statement | F | Educational Codeforces Round 131 (Rated for Div. 2) {1701} | PROGRAMMING | Educational Codeforces Round 131 Editorial | ||
| 9619 | Equate Multisets | constructive algorithms data structures graph matchings greedy math number theory | Statement | F | Codeforces Round 805 (Div. 3) {1702} | PROGRAMMING | 104763 | ||
| 13100 | Good Key, Bad Key | bitmasks brute force dp greedy math | Statement | G | Codeforces Round 806 (Div. 4) {1703} | PROGRAMMING | 104786 | ||
| 29882 | Double Strings | brute force data structures strings | Statement | D | Codeforces Round 806 (Div. 4) {1703} | PROGRAMMING | 104786 | ||
| 400 | Game of AI (easy version) | combinatorics fft math | Statement | H1 | CodeTON Round 2 (Div. 1 + Div. 2, Rated, Prizes!) {1704} | PROGRAMMING | 2250.0 | CodeTON Round 2 Editorial | |
| 119 | Game of AI (hard version) | combinatorics fft math | Statement | H2 | CodeTON Round 2 (Div. 1 + Div. 2, Rated, Prizes!) {1704} | PROGRAMMING | 2750.0 | CodeTON Round 2 Editorial | |
| 186 | Mio and Lucky Array | constructive algorithms fft math strings | Statement | G | CodeTON Round 2 (Div. 1 + Div. 2, Rated, Prizes!) {1704} | PROGRAMMING | 3500.0 | CodeTON Round 2 Editorial | |
| 5430 | Magical Array | constructive algorithms hashing math | Statement | D | CodeTON Round 2 (Div. 1 + Div. 2, Rated, Prizes!) {1704} | PROGRAMMING | 1750.0 | CodeTON Round 2 Editorial | |
| 730 | Mark and the Online Exam | bitmasks constructive algorithms interactive math probabilities | Statement | F | Codeforces Round 807 (Div. 2) {1705} | PROGRAMMING | 3000.0 | Codeforces Round #807 (Div 2.) Editorial | |
| 7246 | Mark and Lightbulbs | combinatorics constructive algorithms math sortings | Statement | D | Codeforces Round 807 (Div. 2) {1705} | PROGRAMMING | 1750.0 | Codeforces Round #807 (Div 2.) Editorial | |
| 17643 | Making Towers | dp greedy math | Statement | B | Codeforces Round 809 (Div. 2) {1706} | PROGRAMMING | 1000.0 | Codeforces Round #809 Editorial | |
| 6492 | Difference Array | brute force implementation math sortings | Statement | B | Codeforces Round 808 (Div. 1) {1707} | PROGRAMMING | 750.0 | 104930 | |
| 1027 | Partial Virtual Trees | combinatorics dp math trees | Statement | D | Codeforces Round 808 (Div. 1) {1707} | PROGRAMMING | 1750.0 | 104930 | |
| 30374 | Difference of GCDs | constructive algorithms math | Statement | B | Codeforces Round 808 (Div. 2) {1708} | PROGRAMMING | 1000.0 | 104930 | |
| 22711 | Difference Operations | greedy math | Statement | A | Codeforces Round 808 (Div. 2) {1708} | PROGRAMMING | 500.0 | 104930 | |
| 31994 | Three Doors | brute force dfs and similar math | Statement | A | Educational Codeforces Round 132 (Rated for Div. 2) {1709} | PROGRAMMING | 105164 | ||
| 730 | Multiset of Strings | dp fft flows graphs greedy math | Statement | F | Educational Codeforces Round 132 (Rated for Div. 2) {1709} | PROGRAMMING | 105164 | ||
| 2847 | Rain | brute force data structures math | Statement | B | Codeforces Round 810 (Div. 1) {1710} | PROGRAMMING | 1000.0 | Codeforces Round #810 Editorial | |
| 2551 | 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 | |
| 1694 | LCM Sum (hard version) | combinatorics data structures math number theory two pointers | Statement | E2 | Codeforces Round 813 (Div. 2) {1712} | PROGRAMMING | 750.0 | Codeforces Round #813 (Div. 2) Editorial | |
| 19051 | Build Permutation | constructive algorithms dp math | Statement | C | Codeforces Round 812 (Div. 2) {1713} | PROGRAMMING | 1750.0 | Codeforces Round #812 (Div. 2) Editorial | 1200 |
| 789 | Lost Array | bitmasks combinatorics constructive algorithms dp math | Statement | F | Codeforces Round 812 (Div. 2) {1713} | PROGRAMMING | 3000.0 | Codeforces Round #812 (Div. 2) Editorial | 2900 |
| 25129 | Add Modulo 10 | brute force math number theory | Statement | E | Codeforces Round 811 (Div. 3) {1714} | PROGRAMMING | Codeforces Round #811 (Div. 3) Editorial | ||
| 33631 | Everyone Loves to Sleep | implementation math | Statement | A | Codeforces Round 811 (Div. 3) {1714} | PROGRAMMING | Codeforces Round #811 (Div. 3) Editorial | ||
| 608 | Crop Squares | constructive algorithms geometry interactive math | Statement | F | Codeforces Round 816 (Div. 2) {1715} | PROGRAMMING | 3000.0 | Codeforces Round #816 (Div. 2) editorial | |
| 24497 | Crossmarket | constructive algorithms greedy math | Statement | A | Codeforces Round 816 (Div. 2) {1715} | PROGRAMMING | 500.0 | Codeforces Round #816 (Div. 2) editorial | |
| 36579 | Beautiful Array | constructive algorithms greedy math | Statement | B | Codeforces Round 816 (Div. 2) {1715} | PROGRAMMING | 1000.0 | Codeforces Round #816 (Div. 2) editorial | |
| 6309 | Chip Move | brute force dp math | Statement | D | Educational Codeforces Round 133 (Rated for Div. 2) {1716} | PROGRAMMING | 105653 | ||
| 1483 | Bags with Balls | combinatorics math number theory | Statement | F | Educational Codeforces Round 133 (Rated for Div. 2) {1716} | PROGRAMMING | 105653 | ||
| 22130 | Permutation Chain | constructive algorithms math | Statement | B | Educational Codeforces Round 133 (Rated for Div. 2) {1716} | PROGRAMMING | 105653 | ||
| 36424 | 2-3 Moves | greedy math | Statement | A | Educational Codeforces Round 133 (Rated for Div. 2) {1716} | PROGRAMMING | 105653 | ||
| 16043 | Madoka and Formal Statement | greedy math | Statement | C | Codeforces Round 818 (Div. 2) {1717} | PROGRAMMING | 1500.0 | Codeforces Round #818 (Div. 2) Editorial. | 1300 |
| 4952 | Madoka and The Corruption Scheme | combinatorics math | Statement | D | Codeforces Round 818 (Div. 2) {1717} | PROGRAMMING | 2000.0 | Codeforces Round #818 (Div. 2) Editorial. | 1900 |
| 3618 | 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 |
| 21236 | Madoka and Strange Thoughts | math number theory | Statement | A | Codeforces Round 818 (Div. 2) {1717} | PROGRAMMING | 500.0 | Codeforces Round #818 (Div. 2) Editorial. | 800 |
| 3573 | 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 | |
| 1898 | 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 | |
| 255 | Impressionism | constructive algorithms graphs implementation math | Statement | E | Codeforces Round 814 (Div. 1) {1718} | PROGRAMMING | 2250.0 | Codeforces Round #814 (Div. 1, Div. 2) Editorial | |
| 6007 | Burenka and Traditions (hard version) | data structures dp greedy math two pointers | Statement | A2 | Codeforces Round 814 (Div. 1) {1718} | PROGRAMMING | 500.0 | Codeforces Round #814 (Div. 1, Div. 2) Editorial | |
| 275 | Burenka, an Array and Queries | data structures math number theory | Statement | F | Codeforces Round 814 (Div. 1) {1718} | PROGRAMMING | 2750.0 | Codeforces Round #814 (Div. 1, Div. 2) Editorial | |
| 6509 | Burenka and Traditions (easy version) | dp greedy math | Statement | A1 | Codeforces Round 814 (Div. 1) {1718} | PROGRAMMING | 500.0 | Codeforces Round #814 (Div. 1, Div. 2) Editorial | |
| 451 | Permutation for Burenka | greedy math trees | Statement | D | Codeforces Round 814 (Div. 1) {1718} | PROGRAMMING | 2250.0 | Codeforces Round #814 (Div. 1, Div. 2) Editorial | |
| 19230 | Mathematical Circus | constructive algorithms math | Statement | B | Codeforces Round 814 (Div. 2) {1719} | PROGRAMMING | 1000.0 | Codeforces Round #814 (Div. 1, Div. 2) Editorial | |
| 26941 | Chip Game | games math | Statement | A | Codeforces Round 814 (Div. 2) {1719} | PROGRAMMING | 500.0 | Codeforces Round #814 (Div. 1, Div. 2) Editorial | |
| 1002 | Misha and Paintings | constructive algorithms math | Statement | E | Codeforces Round 815 (Div. 2) {1720} | PROGRAMMING | 2750.0 | Codeforces Round #815 (Div. 2) Editorial | |
| 22555 | Interesting Sum | data structures greedy math | Statement | B | Codeforces Round 815 (Div. 2) {1720} | PROGRAMMING | 1000.0 | Codeforces Round #815 (Div. 2) Editorial | |
| 24646 | Burenka Plays with Fractions | math number theory | Statement | A | Codeforces Round 815 (Div. 2) {1720} | PROGRAMMING | 500.0 | Codeforces Round #815 (Div. 2) Editorial |