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 ... 11 12 13 14 15 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 20826 | Alice's Adventures in ''Chess'' | brute force implementation math strings | Statement | A | Codeforces Round 986 (Div. 2) {2028} | PROGRAMMING | 500.0 | Codeforces Round 986 (Div. 2) Editorial | |
| 2009 | Alice's Adventures in the Rabbit Hole | constructive algorithms dfs and similar dp greedy math probabilities trees | Statement | E | Codeforces Round 986 (Div. 2) {2028} | PROGRAMMING | 2000.0 | Codeforces Round 986 (Div. 2) Editorial | |
| 14360 | Set | binary search greedy math | Statement | A | Refact.ai Match 1 (Codeforces Round 985) {2029} | PROGRAMMING | 750.0 | Refact.ai Match 1 (Codeforces Round 985) Editorial | |
| 3630 | Common Generator | brute force constructive algorithms greedy math number theory | Statement | E | Refact.ai Match 1 (Codeforces Round 985) {2029} | PROGRAMMING | 2500.0 | Refact.ai Match 1 (Codeforces Round 985) Editorial | |
| 12032 | Replacement | games greedy strings | Statement | B | Refact.ai Match 1 (Codeforces Round 985) {2029} | PROGRAMMING | 1250.0 | Refact.ai Match 1 (Codeforces Round 985) Editorial | |
| 24161 | Minimise Oneness | brute force combinatorics constructive algorithms | Statement | B | Codeforces Round 979 (Div. 2) {2030} | PROGRAMMING | 500.0 | Codeforces Round 979 Editorial | |
| 2033 | MEXimize the Score | brute force combinatorics data structures dp math | Statement | E | Codeforces Round 979 (Div. 2) {2030} | PROGRAMMING | 2000.0 | Codeforces Round 979 Editorial | |
| 274 | The Destruction of the Universe (Easy Version) | combinatorics math | Statement | G1 | Codeforces Round 979 (Div. 2) {2030} | PROGRAMMING | 3000.0 | Codeforces Round 979 Editorial | |
| 213 | The Destruction of the Universe (Hard Version) | math | Statement | G2 | Codeforces Round 979 (Div. 2) {2030} | PROGRAMMING | 1500.0 | Codeforces Round 979 Editorial | |
| 16165 | Penchick and BBQ Buns | brute force constructive algorithms math number theory | Statement | C | Codeforces Round 987 (Div. 2) {2031} | PROGRAMMING | 1500.0 | Codeforces Round 987 (Div. 2) Editorial | |
| 21359 | Penchick and Modern Monument | dp greedy math two pointers | Statement | A | Codeforces Round 987 (Div. 2) {2031} | PROGRAMMING | 500.0 | Codeforces Round 987 (Div. 2) Editorial | |
| 16699 | Trinity | binary search math sortings two pointers | Statement | C | Codeforces Round 983 (Div. 2) {2032} | PROGRAMMING | 1250.0 | Codeforces Round 983 (Div. 2) Editorial | |
| 504 | Peanuts | combinatorics dp games math | Statement | F | Codeforces Round 983 (Div. 2) {2032} | PROGRAMMING | 3000.0 | Codeforces Round 983 (Div. 2) Editorial | |
| 1433 | Balanced | constructive algorithms data structures implementation math | Statement | E | Codeforces Round 983 (Div. 2) {2032} | PROGRAMMING | 2250.0 | Codeforces Round 983 (Div. 2) Editorial | |
| 21171 | Medians | constructive algorithms greedy hashing implementation math | Statement | B | Codeforces Round 983 (Div. 2) {2032} | PROGRAMMING | 750.0 | Codeforces Round 983 (Div. 2) Editorial | |
| 25016 | Circuit | greedy implementation math number theory | Statement | A | Codeforces Round 983 (Div. 2) {2032} | PROGRAMMING | 500.0 | Codeforces Round 983 (Div. 2) Editorial | |
| 14889 | Sakurako, Kosuke, and the Permutation | brute force data structures dfs and similar dsu fft greedy math | Statement | E | Codeforces Round 981 (Div. 3) {2033} | PROGRAMMING | 135520 | ||
| 7356 | Kosuke's Sloth | brute force math number theory | Statement | F | Codeforces Round 981 (Div. 3) {2033} | PROGRAMMING | 135520 | ||
| 41867 | Sakurako and Kosuke | constructive algorithms math | Statement | A | Codeforces Round 981 (Div. 3) {2033} | PROGRAMMING | 135520 | ||
| 18683 | Kousuke's Assignment | dp dsu greedy math | Statement | D | Codeforces Round 981 (Div. 3) {2033} | PROGRAMMING | 135520 | ||
| 18686 | King Keykhosrow's Mystery | brute force chinese remainder theorem math number theory | Statement | A | Rayan Programming Contest 2024 - Selection (Codeforces Round 989, Div. 1 + Div. 2) {2034} | PROGRAMMING | 500.0 | Rayan 2024 Selection Round Editorial | |
| 2067 | Permutations Harmony | brute force combinatorics constructive algorithms greedy hashing implementation math | Statement | E | Rayan Programming Contest 2024 - Selection (Codeforces Round 989, Div. 1 + Div. 2) {2034} | PROGRAMMING | 2000.0 | Rayan 2024 Selection Round Editorial | |
| 912 | Khayyam's Royal Decree (Easy Version) | combinatorics dp math | Statement | F1 | Rayan Programming Contest 2024 - Selection (Codeforces Round 989, Div. 1 + Div. 2) {2034} | PROGRAMMING | 2000.0 | Rayan 2024 Selection Round Editorial | |
| 614 | Khayyam's Royal Decree (Hard Version) | combinatorics dp math | Statement | F2 | Rayan Programming Contest 2024 - Selection (Codeforces Round 989, Div. 1 + Div. 2) {2034} | PROGRAMMING | 2000.0 | Rayan 2024 Selection Round Editorial | |
| 5959 | Yet Another Real Number Problem | binary search brute force data structures dp greedy implementation math two pointers | Statement | D | Codeforces Global Round 27 {2035} | PROGRAMMING | 1500.0 | Codeforces Global Round 27 Editorial | |
| 1994 | Monster | binary search brute force math | Statement | E | Codeforces Global Round 27 {2035} | PROGRAMMING | 2000.0 | Codeforces Global Round 27 Editorial | |
| 21056 | Everyone Loves Tres | constructive algorithms greedy math number theory | Statement | B | Codeforces Global Round 27 {2035} | PROGRAMMING | 500.0 | Codeforces Global Round 27 Editorial | |
| 18068 | Sliding | math | Statement | A | Codeforces Global Round 27 {2035} | PROGRAMMING | 250.0 | Codeforces Global Round 27 Editorial | |
| 3932 | Natlan Exploring | combinatorics dp math number theory | Statement | G | Codeforces Round 988 (Div. 3) {2037} | PROGRAMMING | Video Tutorial | ||
| 26219 | Superultra's Favorite Permutation | constructive algorithms greedy math number theory | Statement | C | Codeforces Round 988 (Div. 3) {2037} | PROGRAMMING | Video Tutorial | ||
| 7663 | Kachina's Favorite Binary String | greedy interactive two pointers | Statement | E | Codeforces Round 988 (Div. 3) {2037} | PROGRAMMING | Video Tutorial | ||
| 8420 | Bridge Renovation | brute force dp greedy math | Statement | L | 2024-2025 ICPC, NERC, Southern and Volga Russian Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2038} | PROGRAMMING | 1400 | ||
| 1988 | Make It Equal | binary search brute force greedy math | Statement | B | 2024-2025 ICPC, NERC, Southern and Volga Russian Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2038} | PROGRAMMING | 2100 | ||
| 1834 | Grid Walk | dp greedy math number theory | Statement | K | 2024-2025 ICPC, NERC, Southern and Volga Russian Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2038} | PROGRAMMING | 2100 | ||
| 499 | Alternative Platforms | combinatorics data structures fft math sortings | Statement | F | 2024-2025 ICPC, NERC, Southern and Volga Russian Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2038} | PROGRAMMING | 2500 | ||
| 160 | Barrels | data structures greedy math | Statement | E | 2024-2025 ICPC, NERC, Southern and Volga Russian Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2038} | PROGRAMMING | 2900 | ||
| 13915 | Shohag Loves XOR (Easy Version) | bitmasks brute force math number theory | Statement | C1 | CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!) {2039} | PROGRAMMING | 1000.0 | Editorial of CodeTON Round 9 (Div. 1 + Div. 2) | |
| 5124 | Shohag Loves XOR (Hard Version) | bitmasks brute force math number theory | Statement | C2 | CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!) {2039} | PROGRAMMING | 1500.0 | Editorial of CodeTON Round 9 (Div. 1 + Div. 2) | |
| 2431 | Shohag Loves Inversions | combinatorics constructive algorithms dp math | Statement | E | CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!) {2039} | PROGRAMMING | 2750.0 | Editorial of CodeTON Round 9 (Div. 1 + Div. 2) | |
| 535 | Shohag Loves Counting (Easy Version) | combinatorics dp math number theory | Statement | F1 | CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!) {2039} | PROGRAMMING | 2000.0 | Editorial of CodeTON Round 9 (Div. 1 + Div. 2) | |
| 7231 | Shohag Loves GCD | constructive algorithms greedy math number theory | Statement | D | CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!) {2039} | PROGRAMMING | 2000.0 | Editorial of CodeTON Round 9 (Div. 1 + Div. 2) | |
| 24779 | Game of Division | brute force games math | Statement | A | Codeforces Round 992 (Div. 2) {2040} | PROGRAMMING | 500.0 | Codeforces Round #992 (Div.2) Editorial | |
| 2815 | Control of Randomness | combinatorics dfs and similar graphs greedy math probabilities trees | Statement | E | Codeforces Round 992 (Div. 2) {2040} | PROGRAMMING | 2250.0 | Codeforces Round #992 (Div.2) Editorial | |
| 473 | Number of Cubes | combinatorics math number theory | Statement | F | Codeforces Round 992 (Div. 2) {2040} | PROGRAMMING | 2750.0 | Codeforces Round #992 (Div.2) Editorial | |
| 24691 | Paint a Strip | constructive algorithms greedy math | Statement | B | Codeforces Round 992 (Div. 2) {2040} | PROGRAMMING | 1000.0 | Codeforces Round #992 (Div.2) Editorial | |
| 11123 | Ordered Permutations | constructive algorithms greedy math | Statement | C | Codeforces Round 992 (Div. 2) {2040} | PROGRAMMING | 1500.0 | Codeforces Round #992 (Div.2) Editorial | |
| 7454 | Bowling Frame | binary search math | Statement | B | 2024 ICPC Asia Taichung Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2041} | PROGRAMMING | Problem Analysis and Hints (PDF) | ||
| 342 | Problem with Queries | binary search brute force data structures | Statement | G | Educational Codeforces Round 173 (Rated for Div. 2) {2043} | PROGRAMMING | Educational Codeforces Round 173 Editorial | ||
| 11578 | Sums on Segments | binary search brute force data structures dp greedy math | Statement | C | Educational Codeforces Round 173 (Rated for Div. 2) {2043} | PROGRAMMING | Educational Codeforces Round 173 Editorial | ||
| 27273 | Coin Transformation | brute force math | Statement | A | Educational Codeforces Round 173 (Rated for Div. 2) {2043} | PROGRAMMING | Educational Codeforces Round 173 Editorial | ||
| 7955 | Problem about GCD | brute force math number theory | Statement | D | Educational Codeforces Round 173 (Rated for Div. 2) {2043} | PROGRAMMING | Educational Codeforces Round 173 Editorial | ||
| 22259 | Digits | math number theory | Statement | B | Educational Codeforces Round 173 (Rated for Div. 2) {2043} | PROGRAMMING | Educational Codeforces Round 173 Editorial | ||
| 6481 | Easy Demon Problem | binary search brute force math number theory | Statement | F | Codeforces Round 993 (Div. 4) {2044} | PROGRAMMING | Codeforces Round 993 (Div. 4) Editorial | ||
| 18678 | Insane Problem | binary search greedy implementation math | Statement | E | Codeforces Round 993 (Div. 4) {2044} | PROGRAMMING | Codeforces Round 993 (Div. 4) Editorial | ||
| 63581 | Easy Problem | brute force math | Statement | A | Codeforces Round 993 (Div. 4) {2044} | PROGRAMMING | Codeforces Round 993 (Div. 4) Editorial | ||
| 24706 | Harder Problem | constructive algorithms greedy math | Statement | D | Codeforces Round 993 (Div. 4) {2044} | PROGRAMMING | Codeforces Round 993 (Div. 4) Editorial | ||
| 2710 | Hard Demon Problem | data structures dp implementation math | Statement | H | Codeforces Round 993 (Div. 4) {2044} | PROGRAMMING | Codeforces Round 993 (Div. 4) Editorial | ||
| 46443 | Hard Problem | greedy math | Statement | C | Codeforces Round 993 (Div. 4) {2044} | PROGRAMMING | Codeforces Round 993 (Div. 4) Editorial | ||
| 1805 | ICPC Square | math number theory | Statement | B | 2024-2025 ICPC Asia Jakarta Regional Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2045} | PROGRAMMING | raRzKDJLPHcUnqTcwvGznwEdKiDWjEkd.pdf | 2000 | |
| 177 | Grid Game 3-angle | games math | Statement | F | 2024-2025 ICPC Asia Jakarta Regional Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2045} | PROGRAMMING | raRzKDJLPHcUnqTcwvGznwEdKiDWjEkd.pdf | 3000 | |
| 238 | Cheops and a Contest (Easy Version) | constructive algorithms greedy | Statement | E1 | Codeforces Round 990 (Div. 1) {2046} | PROGRAMMING | 2000.0 | Разбор Codeforces Round 990 (Div. 2 + Div. 1) | |
| 18076 | Alyona and a Square Jigsaw Puzzle | implementation math | Statement | A | Codeforces Round 990 (Div. 2) {2047} | PROGRAMMING | 500.0 | Разбор Codeforces Round 990 (Div. 2 + Div. 1) | |
| 71 | Kevin and Puzzle (Hard Version) | bitmasks fft math | Statement | I2 | Codeforces Global Round 28 {2048} | PROGRAMMING | 3000.0 | Tutorial | |
| 1364 | Kevin and Math Class | brute force data structures divide and conquer dp math trees two pointers | Statement | F | Codeforces Global Round 28 {2048} | PROGRAMMING | 2000.0 | Tutorial | |
| 23080 | Kevin and Combination Lock | brute force implementation math number theory | Statement | A | Codeforces Global Round 28 {2048} | PROGRAMMING | 250.0 | Tutorial | |
| 776 | Kevin and Matrices | combinatorics math | Statement | G | Codeforces Global Round 28 {2048} | PROGRAMMING | 2250.0 | Tutorial | |
| 1646 | Broken Queries | binary search bitmasks interactive | Statement | E | Codeforces Round 994 (Div. 2) {2049} | PROGRAMMING | 2250.0 | Codeforces Round #994 (Div. 2) Editorial | |
| 25837 | Uninteresting Number | brute force dp math | Statement | C | Codeforces Round 991 (Div. 3) {2050} | PROGRAMMING | Разбор Codeforces Round 991 (Div. 3) | ||
| 27881 | Transfusion | brute force greedy math | Statement | B | Codeforces Round 991 (Div. 3) {2050} | PROGRAMMING | Разбор Codeforces Round 991 (Div. 3) | ||
| 19582 | Digital string maximization | brute force greedy math strings | Statement | D | Codeforces Round 991 (Div. 3) {2050} | PROGRAMMING | Разбор Codeforces Round 991 (Div. 3) | ||
| 11543 | Maximum modulo equality | data structures math number theory | Statement | F | Codeforces Round 991 (Div. 3) {2050} | PROGRAMMING | Разбор Codeforces Round 991 (Div. 3) | ||
| 40890 | Journey | binary search math | Statement | B | Codeforces Round 995 (Div. 3) {2051} | PROGRAMMING | 137623 | ||
| 4102 | Joker | greedy math | Statement | F | Codeforces Round 995 (Div. 3) {2051} | PROGRAMMING | 137623 | ||
| 1555 | Expression Correction | Statement | E | 2024-2025 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2052} | PROGRAMMING | ||||
| 69 | Cactus without Bridges | constructive algorithms math | Statement | C | 2024-2025 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2052} | PROGRAMMING | |||
| 409 | Managing Cluster | dp graphs math trees | Statement | M | 2024-2025 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2052} | PROGRAMMING | |||
| 7857 | Refined Product Optimality | binary search data structures greedy implementation math schedules sortings | Statement | D | Good Bye 2024: 2025 is NEAR {2053} | PROGRAMMING | 1750.0 | Good Bye 2024: 2025 is NEAR Editorial | |
| 12661 | Bewitching Stargazer | bitmasks divide and conquer dp math | Statement | C | Good Bye 2024: 2025 is NEAR {2053} | PROGRAMMING | 1250.0 | Good Bye 2024: 2025 is NEAR Editorial | |
| 111 | Affectionate Arrays (Hard Version) | data structures dp graphs greedy math shortest paths two pointers | Statement | I2 | Good Bye 2024: 2025 is NEAR {2053} | PROGRAMMING | 2000.0 | Good Bye 2024: 2025 is NEAR Editorial | |
| 21425 | Tender Carpenter | dp geometry implementation math | Statement | A | Good Bye 2024: 2025 is NEAR {2053} | PROGRAMMING | 500.0 | Good Bye 2024: 2025 is NEAR Editorial | |
| 91 | Cosmic Divide | brute force geometry hashing math strings | Statement | F | Codeforces Round 996 (Div. 2) {2055} | PROGRAMMING | 3500.0 | Codeforces Round 996 (Div. 2) Editorial | |
| 17697 | The Trail | constructive algorithms greedy math | Statement | C | Codeforces Round 996 (Div. 2) {2055} | PROGRAMMING | 1500.0 | Codeforces Round 996 (Div. 2) Editorial | |
| 464 | Xor of Median (Easy Version) | bitmasks combinatorics dp math | Statement | F1 | Codeforces Round 997 (Div. 2) {2056} | PROGRAMMING | 2750.0 | Codeforces Round #997 (Div. 2) Editorial | |
| 1068 | Nested Segments | combinatorics dp math trees | Statement | E | Codeforces Round 997 (Div. 2) {2056} | PROGRAMMING | 2250.0 | Codeforces Round #997 (Div. 2) Editorial | |
| 19895 | Palindromic Subsequences | constructive algorithms math | Statement | C | Codeforces Round 997 (Div. 2) {2056} | PROGRAMMING | 1500.0 | Codeforces Round #997 (Div. 2) Editorial | |
| 18276 | Find the Permutation | dfs and similar graphs implementation sortings | Statement | B | Codeforces Round 997 (Div. 2) {2056} | PROGRAMMING | 1250.0 | Codeforces Round #997 (Div. 2) Editorial | |
| 27014 | Shape Perimeter | math | Statement | A | Codeforces Round 997 (Div. 2) {2056} | PROGRAMMING | 500.0 | Codeforces Round #997 (Div. 2) Editorial | |
| 2712 | Another Exercise on Graphs (Easy Version) | binary search brute force dp graphs shortest paths | Statement | E1 | Hello 2025 {2057} | PROGRAMMING | 1000.0 | ||
| 14210 | Trip to the Olympiad | bitmasks constructive algorithms greedy math | Statement | C | Hello 2025 {2057} | PROGRAMMING | 1500.0 | ||
| 811 | Secret Message | constructive algorithms math | Statement | G | Hello 2025 {2057} | PROGRAMMING | 3750.0 | ||
| 190 | Coffee Break | data structures greedy greedy math | Statement | H | Hello 2025 {2057} | PROGRAMMING | 4500.0 | ||
| 5580 | Gifts Order | data structures greedy math | Statement | D | Hello 2025 {2057} | PROGRAMMING | 2250.0 | ||
| 12909 | Customer Service | brute force constructive algorithms graph matchings greedy math sortings | Statement | C | Codeforces Round 1002 (Div. 2) {2059} | PROGRAMMING | 1500.0 | 139094 | |
| 19232 | Cost of the Array | brute force constructive algorithms greedy math | Statement | B | Codeforces Round 1002 (Div. 2) {2059} | PROGRAMMING | 1000.0 | 139094 | |
| 33103 | Game of Mathletes | games greedy sortings two pointers | Statement | C | Codeforces Round 998 (Div. 3) {2060} | PROGRAMMING | Codeforces Round 998 (Div. 3) Editorial | ||
| 2319 | Kevin and Binary String (Easy Version) | binary search brute force data structures dp greedy implementation strings two pointers | Statement | F1 | IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2) {2061} | PROGRAMMING | 2000.0 | IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2) Editorial | |
| 15040 | Kevin and Geometry | brute force constructive algorithms data structures geometry greedy implementation math two pointers | Statement | B | IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2) {2061} | PROGRAMMING | 1000.0 | IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2) Editorial | |
| 11142 | Kevin and Numbers | brute force data structures greedy implementation math | Statement | D | IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2) {2061} | PROGRAMMING | 1500.0 | IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2) Editorial | |
| 22547 | Kevin and Arithmetic | constructive algorithms greedy math | Statement | A | IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2) {2061} | PROGRAMMING | 500.0 | IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2) Editorial | |
| 156 | Kevin and Binary String (Hard Version) | data structures dp | Statement | F2 | IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2) {2061} | PROGRAMMING | 2000.0 | IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2) Editorial | |
| 641 | Traveling Salescat | dp geometry greedy math sortings | Statement | F | Ethflow Round 1 (Codeforces Round 1001, Div. 1 + Div. 2) {2062} | PROGRAMMING | 3500.0 | Ethflow Round 1 (Codeforces Round 1001, Div. 1 + Div. 2) Editorial | |
| 28648 | String | greedy strings | Statement | A | Ethflow Round 1 (Codeforces Round 1001, Div. 1 + Div. 2) {2062} | PROGRAMMING | 500.0 | Ethflow Round 1 (Codeforces Round 1001, Div. 1 + Div. 2) Editorial | |
| 5201 | Game With Triangles | binary search data structures dp greedy math ternary search two pointers | Statement | D | Codeforces Round 1000 (Div. 2) {2063} | PROGRAMMING | 2250.0 | Codeforces Round 1000 (Div. 2) — Editorial | |
| 1585 | Counting Is Not Fun (Easy Version) | combinatorics data structures dfs and similar dsu implementation math | Statement | F1 | Codeforces Round 1000 (Div. 2) {2063} | PROGRAMMING | 1750.0 | Codeforces Round 1000 (Div. 2) — Editorial | |
| 955 | Counting Is Not Fun (Hard Version) | combinatorics data structures dfs and similar dsu trees | Statement | F2 | Codeforces Round 1000 (Div. 2) {2063} | PROGRAMMING | 1500.0 | Codeforces Round 1000 (Div. 2) — Editorial | |
| 32445 | Minimal Coprime | math | Statement | A | Codeforces Round 1000 (Div. 2) {2063} | PROGRAMMING | 500.0 | Codeforces Round 1000 (Div. 2) — Editorial | |
| 6586 | Skibidus and Capping | divide and conquer math number theory | Statement | G | Codeforces Round 1003 (Div. 4) {2065} | PROGRAMMING | Video Tutorial | ||
| 2588 | Bitwise Slides | bitmasks combinatorics dp math | Statement | C | Codeforces Round 1004 (Div. 1) {2066} | PROGRAMMING | 1250.0 | 139415 | |
| 1526 | Club of Young Aircraft Builders (easy version) | combinatorics dp math | Statement | D1 | Codeforces Round 1004 (Div. 1) {2066} | PROGRAMMING | 750.0 | 139415 | |
| 671 | Club of Young Aircraft Builders (hard version) | combinatorics dp math | Statement | D2 | Codeforces Round 1004 (Div. 1) {2066} | PROGRAMMING | 1250.0 | 139415 | |
| 80 | Curse | constructive algorithms dp math | Statement | F | Codeforces Round 1004 (Div. 1) {2066} | PROGRAMMING | 3000.0 | 139415 | |
| 13111 | Devyatkino | brute force dp greedy math | Statement | C | Codeforces Round 1004 (Div. 2) {2067} | PROGRAMMING | 1250.0 | ||
| 26047 | Adjacent Digit Sums | constructive algorithms math | Statement | A | Codeforces Round 1004 (Div. 2) {2067} | PROGRAMMING | 500.0 | ||
| 20109 | Robot Program | brute force implementation math | Statement | B | Educational Codeforces Round 175 (Rated for Div. 2) {2070} | PROGRAMMING | Video Tutorial | ||
| 26794 | FizzBuzz Remixed | brute force math | Statement | A | Educational Codeforces Round 175 (Rated for Div. 2) {2070} | PROGRAMMING | Video Tutorial | ||
| 1922 | Game with Binary String | data structures divide and conquer games greedy math | Statement | E | Educational Codeforces Round 175 (Rated for Div. 2) {2070} | PROGRAMMING | Video Tutorial | ||
| 1136 | Infinite Sequence (Hard Version) | bitmasks constructive algorithms data structures dp implementation math | Statement | D2 | Codeforces Round 1007 (Div. 2) {2071} | PROGRAMMING | 1250.0 | Codeforces Round 1007 (Div. 2) Editorial | |
| 6905 | Infinite Sequence (Easy Version) | bitmasks dp math | Statement | D1 | Codeforces Round 1007 (Div. 2) {2071} | PROGRAMMING | 1750.0 | Codeforces Round 1007 (Div. 2) Editorial | |
| 21393 | Perfecto | brute force constructive algorithms greedy math probabilities | Statement | B | Codeforces Round 1007 (Div. 2) {2071} | PROGRAMMING | 1000.0 | Codeforces Round 1007 (Div. 2) Editorial | |
| 28258 | The Play Never Ends | math number theory | Statement | A | Codeforces Round 1007 (Div. 2) {2071} | PROGRAMMING | 500.0 | Codeforces Round 1007 (Div. 2) Editorial | |
| 12738 | Do You Love Your Hero and His Two-Hit Multi-Target Attacks? | binary search constructive algorithms geometry greedy math | Statement | E | Codeforces Round 1006 (Div. 3) {2072} | PROGRAMMING | Codeforces Round 1006 (Div. 3) Editorial | ||
| 8759 | Goodbye, Banker Life | bitmasks combinatorics constructive algorithms math number theory | Statement | F | Codeforces Round 1006 (Div. 3) {2072} | PROGRAMMING | Codeforces Round 1006 (Div. 3) Editorial | ||
| 18112 | For Wizards, the Exam Is Easy, but I Couldn't Handle It | brute force greedy implementation | Statement | D | Codeforces Round 1006 (Div. 3) {2072} | PROGRAMMING | Codeforces Round 1006 (Div. 3) Editorial | ||
| 2208 | I've Been Flipping Numbers for 300 Years and Calculated the Sum | brute force math number theory | Statement | G | Codeforces Round 1006 (Div. 3) {2072} | PROGRAMMING | Codeforces Round 1006 (Div. 3) Editorial | ||
| 41386 | New World, New Me, New Array | greedy greedy implementation math | Statement | A | Codeforces Round 1006 (Div. 3) {2072} | PROGRAMMING | Codeforces Round 1006 (Div. 3) Editorial | ||
| 2541 | Counting Necessary Nodes | bitmasks divide and conquer implementation math | Statement | F | Codeforces Round 1009 (Div. 3) {2074} | PROGRAMMING | Codeforces Round 1009 (Div. 3) — Editorial | ||
| 6905 | Empty Triangle | geometry interactive probabilities | Statement | E | Codeforces Round 1009 (Div. 3) {2074} | PROGRAMMING | Codeforces Round 1009 (Div. 3) — Editorial | ||
| 35526 | The Third Side | greedy math | Statement | B | Codeforces Round 1009 (Div. 3) {2074} | PROGRAMMING | Codeforces Round 1009 (Div. 3) — Editorial | ||
| 14880 | Two Colors | binary search data structures dp math | Statement | C | Educational Codeforces Round 176 (Rated for Div. 2) {2075} | PROGRAMMING | Educational Codeforces Round 176 Editorial | ||
| 6077 | Equalization | bitmasks brute force dp greedy math | Statement | D | Educational Codeforces Round 176 (Rated for Div. 2) {2075} | PROGRAMMING | Educational Codeforces Round 176 Editorial | ||
| 28225 | To Zero | greedy math | Statement | A | Educational Codeforces Round 176 (Rated for Div. 2) {2075} | PROGRAMMING | Educational Codeforces Round 176 Editorial | ||
| 278 | AND x OR | bitmasks constructive algorithms dp | Statement | F | Codeforces Round 1008 (Div. 1) {2077} | PROGRAMMING | 2500.0 | Codeforces Round 1008 (Div. 1, Div. 2) Editorial | |
| 3802 | Finding OR Sum | bitmasks constructive algorithms implementation interactive math | Statement | B | Codeforces Round 1008 (Div. 1) {2077} | PROGRAMMING | 1000.0 | Codeforces Round 1008 (Div. 1, Div. 2) Editorial | |
| 397 | Maximum Polygon | brute force data structures implementation math | Statement | D | Codeforces Round 1008 (Div. 1) {2077} | PROGRAMMING | 2250.0 | Codeforces Round 1008 (Div. 1, Div. 2) Editorial | |
| 640 | Another Folding Strip | combinatorics data structures divide and conquer dp math sortings | Statement | E | Codeforces Round 1008 (Div. 1) {2077} | PROGRAMMING | 2250.0 | Codeforces Round 1008 (Div. 1, Div. 2) Editorial | |
| 2449 | Binary Subsequence Value Sum | combinatorics dp fft implementation math | Statement | C | Codeforces Round 1008 (Div. 1) {2077} | PROGRAMMING | 1500.0 | Codeforces Round 1008 (Div. 1, Div. 2) Editorial | |
| 15061 | Breach of Faith | constructive algorithms greedy math sortings | Statement | A | Codeforces Round 1008 (Div. 1) {2077} | PROGRAMMING | 500.0 | Codeforces Round 1008 (Div. 1, Div. 2) Editorial | |
| 18708 | Vicious Labyrinth | constructive algorithms graphs greedy implementation math | Statement | B | Codeforces Round 1008 (Div. 2) {2078} | PROGRAMMING | 750.0 | Codeforces Round 1008 (Div. 1, Div. 2) Editorial | |
| 6764 | Scammy Game Ad | dp greedy math | Statement | D | Codeforces Round 1008 (Div. 2) {2078} | PROGRAMMING | 1750.0 | Codeforces Round 1008 (Div. 1, Div. 2) Editorial | |
| 23557 | Final Verdict | greedy math | Statement | A | Codeforces Round 1008 (Div. 2) {2078} | PROGRAMMING | 500.0 | Codeforces Round 1008 (Div. 1, Div. 2) Editorial | |
| 4341 | Math Division | bitmasks dp math probabilities | Statement | A | Codeforces Round 1010 (Div. 1, Unrated) {2081} | PROGRAMMING | 500.0 | Codeforces Round 1010 (Div. 1, Div. 2, based on Zhili Cup 2025) Editorial | |
| 1250 | MST in Modulo Graph | constructive algorithms dsu graphs greedy math number theory sortings | Statement | D | Codeforces Round 1010 (Div. 1, Unrated) {2081} | PROGRAMMING | 1750.0 | Codeforces Round 1010 (Div. 1, Div. 2, based on Zhili Cup 2025) Editorial | |
| 146 | Hot Matrix | constructive algorithms math | Statement | F | Codeforces Round 1010 (Div. 1, Unrated) {2081} | PROGRAMMING | 2500.0 | Codeforces Round 1010 (Div. 1, Div. 2, based on Zhili Cup 2025) Editorial | |
| 82 | Hard Formula | math | Statement | G1 | Codeforces Round 1010 (Div. 1, Unrated) {2081} | PROGRAMMING | 1500.0 | Codeforces Round 1010 (Div. 1, Div. 2, based on Zhili Cup 2025) Editorial | |
| 56 | Hard Formula (Hard Version) | math | Statement | G2 | Codeforces Round 1010 (Div. 1, Unrated) {2081} | PROGRAMMING | 1500.0 | Codeforces Round 1010 (Div. 1, Div. 2, based on Zhili Cup 2025) Editorial | |
| 9202 | Arcology On Permafrost | binary search brute force constructive algorithms greedy math | Statement | D | Teza Round 1 (Codeforces Round 1015, Div. 1 + Div. 2) {2084} | PROGRAMMING | 1750.0 | 141155 | |
| 1841 | Blossom | combinatorics fft math | Statement | E | Teza Round 1 (Codeforces Round 1015, Div. 1 + Div. 2) {2084} | PROGRAMMING | 2250.0 | 141155 | |
| 17620 | Max and Mod | constructive algorithms math | Statement | A | Teza Round 1 (Codeforces Round 1015, Div. 1 + Div. 2) {2084} | PROGRAMMING | 750.0 | 141155 | |
| 17214 | MIN = GCD | greedy math | Statement | B | Teza Round 1 (Codeforces Round 1015, Div. 1 + Div. 2) {2084} | PROGRAMMING | 1000.0 | 141155 | |
| 3242 | Serval and Modulo | brute force constructive algorithms math number theory | Statement | E | Codeforces Round 1011 (Div. 2) {2085} | PROGRAMMING | 2500.0 | Codeforces Round #1011 (Div. 2) Editorial | |
| 19463 | Large Array and Segments | binary search brute force dp greedy math | Statement | B | Educational Codeforces Round 177 (Rated for Div. 2) {2086} | PROGRAMMING | Educational Codeforces Round 177 Editorial | ||
| 1711 | Zebra-like Numbers | bitmasks brute force dfs and similar dp math | Statement | E | Educational Codeforces Round 177 (Rated for Div. 2) {2086} | PROGRAMMING | Educational Codeforces Round 177 Editorial | ||
| 8674 | Even String | combinatorics dp math strings | Statement | D | Educational Codeforces Round 177 (Rated for Div. 2) {2086} | PROGRAMMING | Educational Codeforces Round 177 Editorial | ||
| 34085 | Cloudberry Jam | math | Statement | A | Educational Codeforces Round 177 (Rated for Div. 2) {2086} | PROGRAMMING | Educational Codeforces Round 177 Editorial | ||
| 1348 | Canteen (Hard Version) | binary search data structures greedy math two pointers | Statement | B2 | Codeforces Round 1012 (Div. 1) {2089} | PROGRAMMING | 500.0 | Codeforces Round 1012 (Div.1, Div. 2, based on THUPC 2025 — Finals) Editorial | |
| 1498 | Key of Like (Easy Version) | dp math probabilities | Statement | C1 | Codeforces Round 1012 (Div. 1) {2089} | PROGRAMMING | 1000.0 | Codeforces Round 1012 (Div.1, Div. 2, based on THUPC 2025 — Finals) Editorial | |
| 271 | Key of Like (Hard Version) | dp math probabilities | Statement | C2 | Codeforces Round 1012 (Div. 1) {2089} | PROGRAMMING | 1250.0 | Codeforces Round 1012 (Div.1, Div. 2, based on THUPC 2025 — Finals) Editorial | |
| 21738 | Treasure Hunt | math number theory | Statement | A | Codeforces Round 1012 (Div. 2) {2090} | PROGRAMMING | 500.0 | Codeforces Round 1012 (Div.1, Div. 2, based on THUPC 2025 — Finals) Editorial | |
| 24201 | Place of the Olympiad | binary search greedy math | Statement | D | Codeforces Round 1013 (Div. 3) {2091} | PROGRAMMING | Codeforces Round 1013 (Div. 3) Editorial | ||
| 1651 | Gleb and Boating | brute force constructive algorithms data structures dp graphs greedy math shortest paths | Statement | G | Codeforces Round 1013 (Div. 3) {2091} | PROGRAMMING | Codeforces Round 1013 (Div. 3) Editorial | ||
| 20347 | Interesting Ratio | brute force math number theory two pointers | Statement | E | Codeforces Round 1013 (Div. 3) {2091} | PROGRAMMING | Codeforces Round 1013 (Div. 3) Editorial | ||
| 444 | Andryusha and CCB | brute force constructive algorithms greedy math number theory strings | Statement | F | Codeforces Round 1014 (Div. 2) {2092} | PROGRAMMING | 3000.0 | Codeforces Round #1014 (Div. 2) Editorial | |
| 3936 | She knows... | combinatorics constructive algorithms graphs math | Statement | E | Codeforces Round 1014 (Div. 2) {2092} | PROGRAMMING | 2250.0 | Codeforces Round #1014 (Div. 2) Editorial | |
| 23288 | Asuna and the Mosquitoes | constructive algorithms greedy math | Statement | C | Codeforces Round 1014 (Div. 2) {2092} | PROGRAMMING | 1250.0 | Codeforces Round #1014 (Div. 2) Editorial | |
| 28876 | Kamilka and the Sheep | greedy implementation math sortings | Statement | A | Codeforces Round 1014 (Div. 2) {2092} | PROGRAMMING | 500.0 | Codeforces Round #1014 (Div. 2) Editorial | |
| 25517 | Lady Bug | implementation math | Statement | B | Codeforces Round 1014 (Div. 2) {2092} | PROGRAMMING | 750.0 | Codeforces Round #1014 (Div. 2) Editorial | |
| 31733 | Expensive Number | greedy math | Statement | B | Codeforces Round 1016 (Div. 3) {2093} | PROGRAMMING | Codeforces Round 1016 (Div. 3) Editorial | ||
| 41697 | Ideal Generator | math | Statement | A | Codeforces Round 1016 (Div. 3) {2093} | PROGRAMMING | Codeforces Round 1016 (Div. 3) Editorial | ||
| 31802 | Simple Repetition | math number theory | Statement | C | Codeforces Round 1016 (Div. 3) {2093} | PROGRAMMING | Codeforces Round 1016 (Div. 3) Editorial | ||
| 3945 | La Vaca Saturno Saturnita | binary search brute force math number theory | Statement | H | Codeforces Round 1017 (Div. 4) {2094} | PROGRAMMING | Codeforces Round 1017 (Div. 4) Editorial | ||
| 8234 | Chimpanzini Bananini | data structures math | Statement | G | Codeforces Round 1017 (Div. 4) {2094} | PROGRAMMING | Codeforces Round 1017 (Div. 4) Editorial | ||
| 31437 | Brr Brrr Patapim | math | Statement | C | Codeforces Round 1017 (Div. 4) {2094} | PROGRAMMING | Codeforces Round 1017 (Div. 4) Editorial | ||
| 855 | Blurry Vision | *special fft math | Statement | H | April Fools Day Contest 2025 {2095} | PROGRAMMING | April Fools Day Contest 2025 Editorial | ||
| 857 | ⅓ оf а Рrоblеm | *special math | Statement | F | April Fools Day Contest 2025 {2095} | PROGRAMMING | April Fools Day Contest 2025 Editorial | ||
| 239 | Wonderful XOR Problem | bitmasks combinatorics dp fft math | Statement | H | Neowise Labs Contest 1 (Codeforces Round 1018, Div. 1 + Div. 2) {2096} | PROGRAMMING | 3500.0 | Neowise Labs Contest 1 (Codeforces Round 1018, Div. 1 + Div. 2) Editorial | |
| 5732 | Wonderful Lightbulbs | bitmasks math | Statement | D | Neowise Labs Contest 1 (Codeforces Round 1018, Div. 1 + Div. 2) {2096} | PROGRAMMING | 1750.0 | Neowise Labs Contest 1 (Codeforces Round 1018, Div. 1 + Div. 2) Editorial | |
| 17015 | Wonderful Gloves | greedy math sortings | Statement | B | Neowise Labs Contest 1 (Codeforces Round 1018, Div. 1 + Div. 2) {2096} | PROGRAMMING | 750.0 | Neowise Labs Contest 1 (Codeforces Round 1018, Div. 1 + Div. 2) Editorial | |
| 565 | Homework | bitmasks math matrices | Statement | D | Codeforces Round 1021 (Div. 1) {2097} | PROGRAMMING | 2000.0 | 142316 | |
| 1059 | Bermuda Triangle | chinese remainder theorem constructive algorithms geometry math number theory | Statement | C | Codeforces Round 1021 (Div. 1) {2097} | PROGRAMMING | 1500.0 | 142316 | |
| 2000 | Baggage Claim | combinatorics dsu graphs math trees | Statement | B | Codeforces Round 1021 (Div. 1) {2097} | PROGRAMMING | 1000.0 | 142316 | |
| 9008 | Sports Betting | math sortings | Statement | A | Codeforces Round 1021 (Div. 1) {2097} | PROGRAMMING | 500.0 | 142316 | |
| 8237 | Sasha and the Apartment Purchase | math sortings | Statement | B | Codeforces Round 1021 (Div. 2) {2098} | PROGRAMMING | 1250.0 | 142316 | |
| 3173 | Kia Bakes a Cake | data structures dp graphs greedy | Statement | E | Codeforces Round 1024 (Div. 1) {2101} | PROGRAMMING | 3250.0 | 142788 | |
| 22102 | Dinner Time | constructive algorithms math | Statement | A | Codeforces Round 1024 (Div. 2) {2102} | PROGRAMMING | 250.0 | 142788 | |
| 25280 | Common Multiple | brute force greedy math | Statement | A | Codeforces Round 1019 (Div. 2) {2103} | PROGRAMMING | 500.0 | 142149 | |
| 18115 | Binary Typewriter | greedy math | Statement | B | Codeforces Round 1019 (Div. 2) {2103} | PROGRAMMING | 1000.0 | 142149 | |
| 13786 | Array and GCD | binary search greedy math number theory | Statement | D | Educational Codeforces Round 178 (Rated for Div. 2) {2104} | PROGRAMMING | Educational Codeforces Round 178 Editorial | ||
| 754 | Numbers and Strings | brute force dfs and similar dp implementation math | Statement | F | Educational Codeforces Round 178 (Rated for Div. 2) {2104} | PROGRAMMING | Educational Codeforces Round 178 Editorial | ||
| 17848 | Card Game | brute force games greedy math | Statement | C | Educational Codeforces Round 178 (Rated for Div. 2) {2104} | PROGRAMMING | Educational Codeforces Round 178 Editorial | ||
| 26699 | Three Decks | math | Statement | A | Educational Codeforces Round 178 (Rated for Div. 2) {2104} | PROGRAMMING | Educational Codeforces Round 178 Editorial | ||
| 6157 | Wolf | binary search greedy math | Statement | E | Codeforces Round 1020 (Div. 3) {2106} | PROGRAMMING | Codeforces Round 1020 (Div. 3) Editorial | ||
| 37252 | Dr. TC | brute force math | Statement | A | Codeforces Round 1020 (Div. 3) {2106} | PROGRAMMING | Codeforces Round 1020 (Div. 3) Editorial | ||
| 29062 | St. Chroma | constructive algorithms greedy math | Statement | B | Codeforces Round 1020 (Div. 3) {2106} | PROGRAMMING | Codeforces Round 1020 (Div. 3) Editorial | ||
| 4608 | Goblin | dp dsu greedy math | Statement | F | Codeforces Round 1020 (Div. 3) {2106} | PROGRAMMING | Codeforces Round 1020 (Div. 3) Editorial | ||
| 26388 | Cherry Bomb | greedy math sortings | Statement | C | Codeforces Round 1020 (Div. 3) {2106} | PROGRAMMING | Codeforces Round 1020 (Div. 3) Editorial | ||
| 12583 | Maximum Subarray Sum | binary search constructive algorithms implementation math | Statement | C | Codeforces Round 1023 (Div. 2) {2107} | PROGRAMMING | 1500.0 | Codeforces Round 1023 (Div 2) Editorial | |
| 964 | Ain and Apple Tree | constructive algorithms greedy math trees | Statement | E | Codeforces Round 1023 (Div. 2) {2107} | PROGRAMMING | 2750.0 | Codeforces Round 1023 (Div 2) Editorial | |
| 20331 | Apples in Boxes | games greedy math | Statement | B | Codeforces Round 1023 (Div. 2) {2107} | PROGRAMMING | 750.0 | Codeforces Round 1023 (Div 2) Editorial | |
| 2486 | Needle in a Numstack | binary search brute force interactive math | Statement | D | Codeforces Round 1022 (Div. 2) {2108} | PROGRAMMING | 2250.0 | Codeforces Round 1022 Editorial | |
| 14986 | SUMdamental Decomposition | bitmasks constructive algorithms greedy implementation math | Statement | B | Codeforces Round 1022 (Div. 2) {2108} | PROGRAMMING | 1250.0 | Codeforces Round 1022 Editorial | |
| 22442 | Permutation Warm-Up | combinatorics greedy math number theory | Statement | A | Codeforces Round 1022 (Div. 2) {2108} | PROGRAMMING | 500.0 | Codeforces Round 1022 Editorial | |
| 290 | Penguin Steps | binary search dfs and similar flows graphs shortest paths | Statement | F | Codeforces Round 1025 (Div. 2) {2109} | PROGRAMMING | 3000.0 | Codeforces Round 1025 (Div. 2) Editorial | |
| 11896 | Hacking Numbers (Easy Version) | bitmasks constructive algorithms interactive math number theory | Statement | C1 | Codeforces Round 1025 (Div. 2) {2109} | PROGRAMMING | 1250.0 | Codeforces Round 1025 (Div. 2) Editorial | |
| 1881 | Binary String Wowee | combinatorics dp strings | Statement | E | Codeforces Round 1025 (Div. 2) {2109} | PROGRAMMING | 2500.0 | Codeforces Round 1025 (Div. 2) Editorial | |
| 8986 | Hacking Numbers (Medium Version) | constructive algorithms interactive math number theory | Statement | C2 | Codeforces Round 1025 (Div. 2) {2109} | PROGRAMMING | 750.0 | Codeforces Round 1025 (Div. 2) Editorial | |
| 3368 | Hacking Numbers (Hard Version) | constructive algorithms interactive math number theory | Statement | C3 | Codeforces Round 1025 (Div. 2) {2109} | PROGRAMMING | 500.0 | Codeforces Round 1025 (Div. 2) Editorial | |
| 1972 | Faculty | brute force math number theory | Statement | F | Codeforces Round 1026 (Div. 2) {2110} | PROGRAMMING | 3000.0 | Codeforces Round 1026 (Div. 2) Editorial | |
| 28355 | Down with Brackets | strings | Statement | B | Codeforces Round 1026 (Div. 2) {2110} | PROGRAMMING | 750.0 | Codeforces Round 1026 (Div. 2) Editorial | |
| 1464 | Puzzle | brute force constructive algorithms greedy math | Statement | F | Educational Codeforces Round 179 (Rated for Div. 2) {2111} | PROGRAMMING | Educational Codeforces Round 179 Editorial | ||
| 18351 | Fibonacci Cubes | brute force dp implementation math | Statement | B | Educational Codeforces Round 179 (Rated for Div. 2) {2111} | PROGRAMMING | Educational Codeforces Round 179 Editorial | ||
| 20947 | Energy Crystals | greedy implementation math | Statement | A | Educational Codeforces Round 179 (Rated for Div. 2) {2111} | PROGRAMMING | Educational Codeforces Round 179 Editorial | ||
| 3474 | Tree Colorings | combinatorics dp graphs math trees | Statement | E | Educational Codeforces Round 180 (Rated for Div. 2) {2112} | PROGRAMMING | Educational Codeforces Round 180 — Editorial | ||
| 29806 | Race | math | Statement | A | Educational Codeforces Round 180 (Rated for Div. 2) {2112} | PROGRAMMING | Educational Codeforces Round 180 — Editorial | ||
| 1003 | Two Arrays | constructive algorithms dfs and similar graphs math | Statement | F | Codeforces Round 1031 (Div. 2) {2113} | PROGRAMMING | 3000.0 | Codeforces Round #1031 Editorial | |
| 20794 | Shashliks | greedy math | Statement | A | Codeforces Round 1031 (Div. 2) {2113} | PROGRAMMING | 500.0 | Codeforces Round #1031 Editorial | |
| 15121 | Good Start | math | Statement | B | Codeforces Round 1031 (Div. 2) {2113} | PROGRAMMING | 750.0 | Codeforces Round #1031 Editorial | |
| 5673 | Small Operations | binary search bitmasks brute force dfs and similar dp math number theory sortings | Statement | F | Codeforces Round 1027 (Div. 3) {2114} | PROGRAMMING | 143268 | ||
| 44533 | Square Year | binary search brute force math | Statement | A | Codeforces Round 1027 (Div. 3) {2114} | PROGRAMMING | 143268 | ||
| 2106 | Build an Array | bitmasks dp math number theory | Statement | G | Codeforces Round 1027 (Div. 3) {2114} | PROGRAMMING | 143268 | ||
| 15097 | Come a Little Closer | brute force greedy implementation math | Statement | D | Codeforces Round 1027 (Div. 3) {2114} | PROGRAMMING | 143268 | ||
| 31267 | Not Quite a Palindromic String | greedy greedy math math | Statement | B | Codeforces Round 1027 (Div. 3) {2114} | PROGRAMMING | 143268 | ||
| 2934 | Gellyfish and Forget-Me-Not | bitmasks games math | Statement | D | Codeforces Round 1028 (Div. 1) {2115} | PROGRAMMING | 2250.0 | Codeforces Round 1028 (Div.1, Div.2) Editorial | |
| 17504 | Gellyfish and Flaming Peony | brute force constructive algorithms dp greedy math number theory shortest paths | Statement | A | Codeforces Round 1028 (Div. 1) {2115} | PROGRAMMING | 500.0 | Codeforces Round 1028 (Div.1, Div.2) Editorial | |
| 1982 | Gellyfish and Eternal Violet | combinatorics dp greedy math meet-in-the-middle probabilities | Statement | C | Codeforces Round 1028 (Div. 1) {2115} | PROGRAMMING | 1750.0 | Codeforces Round 1028 (Div.1, Div.2) Editorial | |
| 22919 | Retaliation | binary search math | Statement | D | Codeforces Round 1029 (Div. 3) {2117} | PROGRAMMING | Codeforces Round 1029 (Div. 3) Editorial | ||
| 2586 | Red Light, Green Light (Hard version) | binary search dfs and similar dp dsu graphs implementation number theory | Statement | D2 | Codeforces Round 1030 (Div. 2) {2118} | PROGRAMMING | 1000.0 | Codeforces Round 1030 (Div. 2) Editorial | |
| 19134 | Make It Beautiful | bitmasks greedy math | Statement | C | Codeforces Round 1030 (Div. 2) {2118} | PROGRAMMING | 1000.0 | Codeforces Round 1030 (Div. 2) Editorial | |
| 8686 | Red Light, Green Light (Easy version) | brute force dfs and similar dp graphs implementation | Statement | D1 | Codeforces Round 1030 (Div. 2) {2118} | PROGRAMMING | 1250.0 | Codeforces Round 1030 (Div. 2) Editorial | |
| 29535 | Equal Subsequences | constructive algorithms greedy | Statement | A | Codeforces Round 1030 (Div. 2) {2118} | PROGRAMMING | 500.0 | Codeforces Round 1030 (Div. 2) Editorial | |
| 16933 | A Good Problem | bitmasks constructive algorithms math | Statement | C | Codeforces Round 1035 (Div. 2) {2119} | PROGRAMMING | 1500.0 | Codeforces Round 1035 (Div. 2) Editorial | |
| 3582 | Token Removing | combinatorics dp math | Statement | D | Codeforces Round 1035 (Div. 2) {2119} | PROGRAMMING | 2250.0 | Codeforces Round 1035 (Div. 2) Editorial | |
| 18954 | Line Segments | geometry greedy math | Statement | B | Codeforces Round 1035 (Div. 2) {2119} | PROGRAMMING | 1000.0 | Codeforces Round 1035 (Div. 2) Editorial | |
| 27793 | Add or XOR | greedy math | Statement | A | Codeforces Round 1035 (Div. 2) {2119} | PROGRAMMING | 500.0 | Codeforces Round 1035 (Div. 2) Editorial | |
| 5996 | Matrix game | combinatorics math | Statement | D | Codeforces Round 1033 (Div. 2) and CodeNite 2025 {2120} | PROGRAMMING | 1750.0 | Codeforces Round 1033 (Div. 2) and CodeNite 2025 Editorial | |
| 13093 | Divine Tree | constructive algorithms greedy math sortings trees | Statement | C | Codeforces Round 1033 (Div. 2) and CodeNite 2025 {2120} | PROGRAMMING | 1250.0 | Codeforces Round 1033 (Div. 2) and CodeNite 2025 Editorial | |
| 20661 | Square of Rectangles | geometry math | Statement | A | Codeforces Round 1033 (Div. 2) and CodeNite 2025 {2120} | PROGRAMMING | 500.0 | Codeforces Round 1033 (Div. 2) and CodeNite 2025 Editorial | |
| 116 | Eulerian Line Graph | graphs greedy math | Statement | G | Codeforces Round 1033 (Div. 2) and CodeNite 2025 {2120} | PROGRAMMING | 4000.0 | Codeforces Round 1033 (Div. 2) and CodeNite 2025 Editorial | |
| 40062 | Letter Home | brute force math | Statement | A | Codeforces Round 1032 (Div. 3) {2121} | PROGRAMMING | Codeforces Round 1032 (Div. 3) Editorial | ||
| 5548 | Gangsta | data structures divide and conquer math sortings | Statement | G | Codeforces Round 1032 (Div. 3) {2121} | PROGRAMMING | Codeforces Round 1032 (Div. 3) Editorial | ||
| 3071 | Traffic Lights | brute force dp graphs shortest paths | Statement | D | Order Capital Round 1 (Codeforces Round 1038, Div. 1 + Div. 2) {2122} | PROGRAMMING | 2000.0 | Order Capital Round 1 (Codeforces Round 1038, Div. 1 + Div. 2) Editorial | |
| 2275 | Tree Parking | combinatorics math trees | Statement | G | Order Capital Round 1 (Codeforces Round 1038, Div. 1 + Div. 2) {2122} | PROGRAMMING | 4000.0 | Order Capital Round 1 (Codeforces Round 1038, Div. 1 + Div. 2) Editorial | |
| 10483 | Manhattan Pairs | constructive algorithms greedy math sortings | Statement | C | Order Capital Round 1 (Codeforces Round 1038, Div. 1 + Div. 2) {2122} | PROGRAMMING | 1500.0 | Order Capital Round 1 (Codeforces Round 1038, Div. 1 + Div. 2) Editorial | |
| 2935 | Greedy Grid Counting | dp greedy math | Statement | E | Order Capital Round 1 (Codeforces Round 1038, Div. 1 + Div. 2) {2122} | PROGRAMMING | 2500.0 | Order Capital Round 1 (Codeforces Round 1038, Div. 1 + Div. 2) Editorial | |
| 17628 | Pile Shuffling | greedy math | Statement | B | Order Capital Round 1 (Codeforces Round 1038, Div. 1 + Div. 2) {2122} | PROGRAMMING | 1000.0 | Order Capital Round 1 (Codeforces Round 1038, Div. 1 + Div. 2) Editorial | |
| 15446 | MEX Count | binary search data structures greedy sortings two pointers | Statement | E | Codeforces Round 1034 (Div. 3) {2123} | PROGRAMMING | Codeforces Round 1034 (Div. 3) Editorial | ||
| 3459 | Modular Sorting | brute force data structures math number theory | Statement | G | Codeforces Round 1034 (Div. 3) {2123} | PROGRAMMING | Codeforces Round 1034 (Div. 3) Editorial | ||
| 42598 | Blackboard Game | math | Statement | A | Codeforces Round 1034 (Div. 3) {2123} | PROGRAMMING | Codeforces Round 1034 (Div. 3) Editorial | ||
| 5691 | Make it Zero | constructive algorithms math | Statement | E | EPIC Institute of Technology Round Summer 2025 (Codeforces Round 1036, Div. 1 + Div. 2) {2124} | PROGRAMMING | 2000.0 | EPIC Institute of Technology Round Summer 2025 (Codeforces Round 1036, Div. 1 + Div. 2) Editorial | |
| 680 | Lexicographic Partition | constructive algorithms math trees | Statement | I | EPIC Institute of Technology Round Summer 2025 (Codeforces Round 1036, Div. 1 + Div. 2) {2124} | PROGRAMMING | 4750.0 | EPIC Institute of Technology Round Summer 2025 (Codeforces Round 1036, Div. 1 + Div. 2) Editorial | |
| 236 | Longest Good Subsequence | dp math | Statement | H | EPIC Institute of Technology Round Summer 2025 (Codeforces Round 1036, Div. 1 + Div. 2) {2124} | PROGRAMMING | 4750.0 | EPIC Institute of Technology Round Summer 2025 (Codeforces Round 1036, Div. 1 + Div. 2) Editorial |