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 ... 33 34 35 36 37 ... 44 45 46 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 1056 | Graph Coloring (easy version) | dp | Statement | F1 | Educational Codeforces Round 142 (Rated for Div. 2) {1792} | PROGRAMMING | 111835 | ||
| 31533 | GamingForces | greedy sortings | Statement | A | Educational Codeforces Round 142 (Rated for Div. 2) {1792} | PROGRAMMING | 111835 | ||
| 8438 | Fixed Prefix Permutations | binary search data structures math sortings strings | Statement | D | Educational Codeforces Round 142 (Rated for Div. 2) {1792} | PROGRAMMING | 111835 | ||
| 1643 | Divisors and Table | dp number theory shortest paths | Statement | E | Educational Codeforces Round 142 (Rated for Div. 2) {1792} | PROGRAMMING | 111835 | ||
| 18920 | Yet Another Promotion | greedy math | Statement | A | Codeforces Round 852 (Div. 2) {1793} | PROGRAMMING | 500.0 | Codeforces Round #852 Editorial | |
| 1380 | Velepin and Marketing | data structures dp greedy sortings | Statement | E | Codeforces Round 852 (Div. 2) {1793} | PROGRAMMING | 2500.0 | Codeforces Round #852 Editorial | |
| 1670 | Rebrending | brute force data structures dp implementation | Statement | F | Codeforces Round 852 (Div. 2) {1793} | PROGRAMMING | 3250.0 | Codeforces Round #852 Editorial | |
| 7267 | Moscow Gorillas | dp greedy implementation two pointers | Statement | D | Codeforces Round 852 (Div. 2) {1793} | PROGRAMMING | 1750.0 | Codeforces Round #852 Editorial | |
| 17277 | Fedya and Array | constructive algorithms math | Statement | B | Codeforces Round 852 (Div. 2) {1793} | PROGRAMMING | 1000.0 | Codeforces Round #852 Editorial | |
| 36076 | Dora and Search | constructive algorithms data structures two pointers | Statement | C | Codeforces Round 852 (Div. 2) {1793} | PROGRAMMING | 1250.0 | Codeforces Round #852 Editorial | |
| 23914 | Scoring Subsequences | binary search greedy math two pointers | Statement | C | Codeforces Round 856 (Div. 2) {1794} | PROGRAMMING | 1250.0 | Codeforces Round 856 (Div. 2) Editorial | |
| 19125 | Prefix and Suffix Array | constructive algorithms strings | Statement | A | Codeforces Round 856 (Div. 2) {1794} | PROGRAMMING | 750.0 | Codeforces Round 856 (Div. 2) Editorial | |
| 44201 | Not Dividing | constructive algorithms greedy math | Statement | B | Codeforces Round 856 (Div. 2) {1794} | PROGRAMMING | 1000.0 | Codeforces Round 856 (Div. 2) Editorial | |
| 1593 | Labeling the Tree with Distances | data structures dp hashing implementation trees | Statement | E | Codeforces Round 856 (Div. 2) {1794} | PROGRAMMING | 2750.0 | Codeforces Round 856 (Div. 2) Editorial | |
| 4676 | Counting Factorizations | combinatorics dp math number theory | Statement | D | Codeforces Round 856 (Div. 2) {1794} | PROGRAMMING | 2000.0 | Codeforces Round 856 (Div. 2) Editorial | |
| 24811 | Two Towers | brute force implementation strings | Statement | A | Educational Codeforces Round 143 (Rated for Div. 2) {1795} | PROGRAMMING | 112963 | ||
| 13997 | Triangle Coloring | combinatorics math | Statement | D | Educational Codeforces Round 143 (Rated for Div. 2) {1795} | PROGRAMMING | 112963 | ||
| 19323 | Tea Tasting | binary search data structures implementation | Statement | C | Educational Codeforces Round 143 (Rated for Div. 2) {1795} | PROGRAMMING | 112963 | ||
| 857 | Removal Sequences | bitmasks graphs | Statement | G | Educational Codeforces Round 143 (Rated for Div. 2) {1795} | PROGRAMMING | 112963 | ||
| 24455 | Ideal Point | geometry greedy | Statement | B | Educational Codeforces Round 143 (Rated for Div. 2) {1795} | PROGRAMMING | 112963 | ||
| 2463 | Explosions? | binary search data structures dp math | Statement | E | Educational Codeforces Round 143 (Rated for Div. 2) {1795} | PROGRAMMING | 112963 | ||
| 1438 | Blocking Chips | binary search dfs and similar dp greedy | Statement | F | Educational Codeforces Round 143 (Rated for Div. 2) {1795} | PROGRAMMING | 112963 | ||
| 19790 | Typical Interview Problem | implementation strings | Statement | A | Educational Codeforces Round 144 (Rated for Div. 2) {1796} | PROGRAMMING | Educational Codeforces Round 144 Editorial | ||
| 264 | Strange Triples | math | Statement | F | Educational Codeforces Round 144 (Rated for Div. 2) {1796} | PROGRAMMING | Educational Codeforces Round 144 Editorial | ||
| 5610 | Maximum Subarray | data structures dp greedy | Statement | D | Educational Codeforces Round 144 (Rated for Div. 2) {1796} | PROGRAMMING | Educational Codeforces Round 144 Editorial | ||
| 12435 | Maximum Set | binary search brute force combinatorics dp math | Statement | C | Educational Codeforces Round 144 (Rated for Div. 2) {1796} | PROGRAMMING | Educational Codeforces Round 144 Editorial | ||
| 1080 | Colored Subgraphs | data structures dp greedy trees | Statement | E | Educational Codeforces Round 144 (Rated for Div. 2) {1796} | PROGRAMMING | Educational Codeforces Round 144 Editorial | ||
| 18563 | Asterisk-Minor Template | implementation strings | Statement | B | Educational Codeforces Round 144 (Rated for Div. 2) {1796} | PROGRAMMING | Educational Codeforces Round 144 Editorial | ||
| 4730 | Li Hua and Tree | brute force data structures dfs and similar dp implementation trees | Statement | D | Codeforces Round 864 (Div. 2) {1797} | PROGRAMMING | 1750.0 | Codeforces Round 864 (Div. 2) Editorial | |
| 26777 | Li Hua and Pattern | constructive algorithms greedy | Statement | B | Codeforces Round 864 (Div. 2) {1797} | PROGRAMMING | 1000.0 | Codeforces Round 864 (Div. 2) Editorial | |
| 713 | Li Hua and Path | data structures dfs and similar divide and conquer dsu trees | Statement | F | Codeforces Round 864 (Div. 2) {1797} | PROGRAMMING | 3000.0 | Codeforces Round 864 (Div. 2) Editorial | |
| 19780 | Li Hua and Maze | constructive algorithms greedy | Statement | A | Codeforces Round 864 (Div. 2) {1797} | PROGRAMMING | 500.0 | Codeforces Round 864 (Div. 2) Editorial | |
| 9119 | Li Hua and Chess | brute force constructive algorithms greedy hashing interactive | Statement | C | Codeforces Round 864 (Div. 2) {1797} | PROGRAMMING | 1500.0 | Codeforces Round 864 (Div. 2) Editorial | |
| 1713 | Li Hua and Array | brute force data structures math number theory | Statement | E | Codeforces Round 864 (Div. 2) {1797} | PROGRAMMING | 2250.0 | Codeforces Round 864 (Div. 2) Editorial | |
| 19094 | Three Sevens | brute force data structures greedy implementation | Statement | B | Codeforces Round 860 (Div. 2) {1798} | PROGRAMMING | 750.0 | Editorial of Codeforces Round 860 (Div. 2) | 1000 |
| 15052 | Shocking Arrangement | constructive algorithms greedy math | Statement | D | Codeforces Round 860 (Div. 2) {1798} | PROGRAMMING | 1750.0 | Editorial of Codeforces Round 860 (Div. 2) | 1600 |
| 9605 | Candy Store | greedy math number theory | Statement | C | Codeforces Round 860 (Div. 2) {1798} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round 860 (Div. 2) | 1700 |
| 2124 | Multitest Generator | brute force dp | Statement | E | Codeforces Round 860 (Div. 2) {1798} | PROGRAMMING | 2250.0 | Editorial of Codeforces Round 860 (Div. 2) | 2300 |
| 697 | Gifts from Grandfather Ahmed | dp math number theory | Statement | F | Codeforces Round 860 (Div. 2) {1798} | PROGRAMMING | 3000.0 | Editorial of Codeforces Round 860 (Div. 2) | 2500 |
| 21178 | Showstopper | greedy implementation sortings | Statement | A | Codeforces Round 860 (Div. 2) {1798} | PROGRAMMING | 500.0 | Editorial of Codeforces Round 860 (Div. 2) | 800 |
| 522 | Tree Cutting | bitmasks dfs and similar dp | Statement | H | Codeforces Round 854 by cybercats (Div. 1 + Div. 2) {1799} | PROGRAMMING | 3500.0 | Codeforces Round #854 Editorial | |
| 12477 | Recent Actions | data structures greedy implementation math | Statement | A | Codeforces Round 854 by cybercats (Div. 1 + Div. 2) {1799} | PROGRAMMING | 500.0 | Codeforces Round #854 Editorial | |
| 3183 | Hot Start Up (hard version) | data structures dp | Statement | D2 | Codeforces Round 854 by cybercats (Div. 1 + Div. 2) {1799} | PROGRAMMING | 750.0 | Codeforces Round #854 Editorial | |
| 6108 | Hot Start Up (easy version) | dp | Statement | D1 | Codeforces Round 854 by cybercats (Div. 1 + Div. 2) {1799} | PROGRAMMING | 1500.0 | Codeforces Round #854 Editorial | |
| 1115 | Halve or Subtract | brute force flows greedy sortings | Statement | F | Codeforces Round 854 by cybercats (Div. 1 + Div. 2) {1799} | PROGRAMMING | 2500.0 | Codeforces Round #854 Editorial | |
| 12987 | Equalize by Divide | brute force constructive algorithms greedy math | Statement | B | Codeforces Round 854 by cybercats (Div. 1 + Div. 2) {1799} | PROGRAMMING | 1000.0 | Codeforces Round #854 Editorial | |
| 7059 | Double Lexicographically Minimum | constructive algorithms greedy implementation strings | Statement | C | Codeforces Round 854 by cybercats (Div. 1 + Div. 2) {1799} | PROGRAMMING | 1500.0 | Codeforces Round #854 Editorial | |
| 1126 | Count Voting | combinatorics dp math | Statement | G | Codeforces Round 854 by cybercats (Div. 1 + Div. 2) {1799} | PROGRAMMING | 3000.0 | Codeforces Round #854 Editorial | |
| 1443 | City Union | constructive algorithms dp geometry greedy implementation math | Statement | E | Codeforces Round 854 by cybercats (Div. 1 + Div. 2) {1799} | PROGRAMMING | 2250.0 | Codeforces Round #854 Editorial | |
| 15687 | Unforgivable Curse (hard version) | brute force constructive algorithms constructive algorithms dsu graphs greedy | Statement | E2 | Codeforces Round 855 (Div. 3) {1800} | PROGRAMMING | Codeforces Round 855 (Div. 3) Editorial | ||
| 16028 | Unforgivable Curse (easy version) | brute force constructive algorithms dsu graphs greedy | Statement | E1 | Codeforces Round 855 (Div. 3) {1800} | PROGRAMMING | Codeforces Round 855 (Div. 3) Editorial | ||
| 2662 | Symmetree | dfs and similar hashing trees | Statement | G | Codeforces Round 855 (Div. 3) {1800} | PROGRAMMING | Codeforces Round 855 (Div. 3) Editorial | ||
| 30407 | Remove Two Letters | data structures greedy hashing strings | Statement | D | Codeforces Round 855 (Div. 3) {1800} | PROGRAMMING | Codeforces Round 855 (Div. 3) Editorial | ||
| 28005 | Powering the Hero (hard version) | data structures greedy | Statement | C2 | Codeforces Round 855 (Div. 3) {1800} | PROGRAMMING | Codeforces Round 855 (Div. 3) Editorial | ||
| 27694 | Powering the Hero (easy version) | data structures greedy | Statement | C1 | Codeforces Round 855 (Div. 3) {1800} | PROGRAMMING | Codeforces Round 855 (Div. 3) Editorial | ||
| 37614 | Is It a Cat? | implementation strings | Statement | A | Codeforces Round 855 (Div. 3) {1800} | PROGRAMMING | Codeforces Round 855 (Div. 3) Editorial | ||
| 4910 | Dasha and Nightmares | bitmasks hashing meet-in-the-middle | Statement | F | Codeforces Round 855 (Div. 3) {1800} | PROGRAMMING | Codeforces Round 855 (Div. 3) Editorial | ||
| 29084 | Count the Number of Pairs | greedy strings | Statement | B | Codeforces Round 855 (Div. 3) {1800} | PROGRAMMING | Codeforces Round 855 (Div. 3) Editorial | ||
| 2980 | The way home | dp graphs greedy shortest paths sortings | Statement | D | Codeforces Round 857 (Div. 1) {1801} | PROGRAMMING | 1750.0 | Codeforces Round #857 Editorial | |
| 9919 | The Very Beautiful Blanket | bitmasks constructive algorithms | Statement | A | Codeforces Round 857 (Div. 1) {1801} | PROGRAMMING | 500.0 | Codeforces Round #857 Editorial | |
| 4205 | Music Festival | binary search data structures dp greedy sortings | Statement | C | Codeforces Round 857 (Div. 1) {1801} | PROGRAMMING | 1250.0 | Codeforces Round #857 Editorial | |
| 778 | Gasoline prices | data structures divide and conquer dsu trees | Statement | E | Codeforces Round 857 (Div. 1) {1801} | PROGRAMMING | 2500.0 | Codeforces Round #857 Editorial | |
| 7791 | Buying gifts | data structures dp greedy sortings | Statement | B | Codeforces Round 857 (Div. 1) {1801} | PROGRAMMING | 1000.0 | Codeforces Round #857 Editorial | |
| 752 | A task for substrings | data structures string suffix structures strings | Statement | G | Codeforces Round 857 (Div. 1) {1801} | PROGRAMMING | 3500.0 | Codeforces Round #857 Editorial | |
| 760 | Another n-dimensional chocolate bar | dp number theory | Statement | F | Codeforces Round 857 (Div. 1) {1801} | PROGRAMMING | 3500.0 | Codeforces Round #857 Editorial | |
| 14890 | Settlement of Guinea Pigs | implementation math | Statement | B | Codeforces Round 857 (Div. 2) {1802} | PROGRAMMING | 750.0 | Codeforces Round #857 Editorial | |
| 16792 | Likes | greedy implementation | Statement | A | Codeforces Round 857 (Div. 2) {1802} | PROGRAMMING | 500.0 | Codeforces Round #857 Editorial | |
| 15816 | Vaccination | greedy implementation two pointers | Statement | B | Nebius Welcome Round (Div. 1 + Div. 2) {1804} | PROGRAMMING | 1000.0 | Nebius Welcome Round Editorial | |
| 1757 | Routing | bitmasks dp graphs | Statement | E | Nebius Welcome Round (Div. 1 + Div. 2) {1804} | PROGRAMMING | 2000.0 | Nebius Welcome Round Editorial | |
| 14058 | Pull Your Luck | brute force greedy math number theory | Statement | C | Nebius Welcome Round (Div. 1 + Div. 2) {1804} | PROGRAMMING | 1000.0 | Nebius Welcome Round Editorial | |
| 18784 | Lame King | greedy math | Statement | A | Nebius Welcome Round (Div. 1 + Div. 2) {1804} | PROGRAMMING | 500.0 | Nebius Welcome Round Editorial | |
| 336 | Flow Control | data structures implementation | Statement | G | Nebius Welcome Round (Div. 1 + Div. 2) {1804} | PROGRAMMING | 3500.0 | Nebius Welcome Round Editorial | |
| 279 | Code Lock | bitmasks dp | Statement | H | Nebius Welcome Round (Div. 1 + Div. 2) {1804} | PROGRAMMING | 3500.0 | Nebius Welcome Round Editorial | |
| 1214 | Approximate Diameter | binary search divide and conquer graphs shortest paths | Statement | F | Nebius Welcome Round (Div. 1 + Div. 2) {1804} | PROGRAMMING | 2750.0 | Nebius Welcome Round Editorial | |
| 5365 | Accommodation | dp greedy | Statement | D | Nebius Welcome Round (Div. 1 + Div. 2) {1804} | PROGRAMMING | 1500.0 | Nebius Welcome Round Editorial | |
| 46644 | We Need the Zero | bitmasks brute force | Statement | A | Codeforces Round 862 (Div. 2) {1805} | PROGRAMMING | 500.0 | Editorial of Codeforces Round #862 (Div. 2) | |
| 20541 | The String Has a Target | greedy strings | Statement | B | Codeforces Round 862 (Div. 2) {1805} | PROGRAMMING | 750.0 | Editorial of Codeforces Round #862 (Div. 2) | |
| 1973 | There Should Be a Lot of Maximums | data structures dfs and similar dsu graphs trees | Statement | E | Codeforces Round 862 (Div. 2) {1805} | PROGRAMMING | 2250.0 | Editorial of Codeforces Round #862 (Div. 2) | |
| 541 | Survival of the Weakest (hard version) | greedy sortings two pointers | Statement | F2 | Codeforces Round 862 (Div. 2) {1805} | PROGRAMMING | 1750.0 | Editorial of Codeforces Round #862 (Div. 2) | |
| 1447 | Survival of the Weakest (easy version) | brute force math sortings | Statement | F1 | Codeforces Round 862 (Div. 2) {1805} | PROGRAMMING | 1750.0 | Editorial of Codeforces Round #862 (Div. 2) | |
| 14423 | Place for a Selfie | binary search geometry math sortings | Statement | C | Codeforces Round 862 (Div. 2) {1805} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round #862 (Div. 2) | |
| 9786 | A Wide, Wide Graph | dfs and similar dp dsu greedy trees | Statement | D | Codeforces Round 862 (Div. 2) {1805} | PROGRAMMING | 1750.0 | Editorial of Codeforces Round #862 (Div. 2) | |
| 48161 | Walking Master | geometry greedy math | Statement | A | Codeforces Round 858 (Div. 2) {1806} | PROGRAMMING | 500.0 | Codeforces Round #858 (Div. 2) Editorial | |
| 3544 | Tree Master | brute force data structures dfs and similar hashing trees | Statement | E | Codeforces Round 858 (Div. 2) {1806} | PROGRAMMING | 2250.0 | Codeforces Round #858 (Div. 2) Editorial | |
| 8812 | Sequence Master | brute force constructive algorithms math | Statement | C | Codeforces Round 858 (Div. 2) {1806} | PROGRAMMING | 1750.0 | Codeforces Round #858 (Div. 2) Editorial | |
| 20026 | Mex Master | constructive algorithms greedy | Statement | B | Codeforces Round 858 (Div. 2) {1806} | PROGRAMMING | 1000.0 | Codeforces Round #858 (Div. 2) Editorial | |
| 493 | GCD Master (hard version) | greedy math sortings | Statement | F2 | Codeforces Round 858 (Div. 2) {1806} | PROGRAMMING | 1500.0 | Codeforces Round #858 (Div. 2) Editorial | |
| 486 | GCD Master (easy version) | greedy math number theory sortings | Statement | F1 | Codeforces Round 858 (Div. 2) {1806} | PROGRAMMING | 2500.0 | Codeforces Round #858 (Div. 2) Editorial | |
| 1286 | DSU Master | combinatorics dp dsu math | Statement | D | Codeforces Round 858 (Div. 2) {1806} | PROGRAMMING | 2000.0 | Codeforces Round #858 (Div. 2) Editorial | |
| 29968 | Subsequence Addition (Hard Version) | dp greedy implementation math sortings | Statement | G2 | Codeforces Round 859 (Div. 4) {1807} | PROGRAMMING | 114143 | ||
| 22851 | Subsequence Addition (Easy Version) | brute force dp greedy implementation sortings | Statement | G1 | Codeforces Round 859 (Div. 4) {1807} | PROGRAMMING | 114143 | ||
| 88490 | Plus or Minus | implementation | Statement | A | Codeforces Round 859 (Div. 4) {1807} | PROGRAMMING | 114143 | ||
| 62702 | Odd Queries | data structures implementation | Statement | D | Codeforces Round 859 (Div. 4) {1807} | PROGRAMMING | 114143 | ||
| 17383 | Interview | binary search implementation interactive | Statement | E | Codeforces Round 859 (Div. 4) {1807} | PROGRAMMING | 114143 | ||
| 50447 | Grab the Candies | greedy | Statement | B | Codeforces Round 859 (Div. 4) {1807} | PROGRAMMING | 114143 | ||
| 34899 | Find and Replace | greedy implementation strings | Statement | C | Codeforces Round 859 (Div. 4) {1807} | PROGRAMMING | 114143 | ||
| 7470 | Bouncy Ball | brute force brute force dfs and similar implementation | Statement | F | Codeforces Round 859 (Div. 4) {1807} | PROGRAMMING | 114143 | ||
| 32695 | Playing in a Casino | math sortings | Statement | B | Codeforces Round 861 (Div. 2) {1808} | PROGRAMMING | 1000.0 | Codeforces Round #861 (Div. 2) editorial | 1200 |
| 4423 | Unlucky Numbers | brute force greedy implementation | Statement | C | Codeforces Round 861 (Div. 2) {1808} | PROGRAMMING | 1500.0 | Codeforces Round #861 (Div. 2) editorial | 1900 |
| 2823 | Petya, Petya, Petr, and Palindromes | binary search data structures two pointers | Statement | D | Codeforces Round 861 (Div. 2) {1808} | PROGRAMMING | 1750.0 | Codeforces Round #861 (Div. 2) editorial | 2100 |
| 1655 | Minibuses on Venus (easy version) | brute force combinatorics dp | Statement | E1 | Codeforces Round 861 (Div. 2) {1808} | PROGRAMMING | 1750.0 | Codeforces Round #861 (Div. 2) editorial | 2200 |
| 898 | Minibuses on Venus (medium version) | combinatorics divide and conquer dp matrices | Statement | E2 | Codeforces Round 861 (Div. 2) {1808} | PROGRAMMING | 1000.0 | Codeforces Round #861 (Div. 2) editorial | 2500 |
| 664 | Minibuses on Venus (hard version) | brute force combinatorics dp math | Statement | E3 | Codeforces Round 861 (Div. 2) {1808} | PROGRAMMING | 750.0 | Codeforces Round #861 (Div. 2) editorial | 2800 |
| 21104 | Lucky Numbers | brute force implementation | Statement | A | Codeforces Round 861 (Div. 2) {1808} | PROGRAMMING | 750.0 | Codeforces Round #861 (Div. 2) editorial | 900 |
| 1135 | Two Tanks | binary search dp implementation math | Statement | E | Educational Codeforces Round 145 (Rated for Div. 2) {1809} | PROGRAMMING | 114300 | ||
| 990 | Traveling in Berland | binary search data structures graphs greedy implementation | Statement | F | Educational Codeforces Round 145 (Rated for Div. 2) {1809} | PROGRAMMING | 114300 | ||
| 15522 | Sum on Subarrays | constructive algorithms greedy math | Statement | C | Educational Codeforces Round 145 (Rated for Div. 2) {1809} | PROGRAMMING | 114300 | ||
| 681 | Prediction | combinatorics data structures dp | Statement | G | Educational Codeforces Round 145 (Rated for Div. 2) {1809} | PROGRAMMING | 114300 | ||
| 22786 | Points on Plane | binary search greedy math | Statement | B | Educational Codeforces Round 145 (Rated for Div. 2) {1809} | PROGRAMMING | 114300 | ||
| 25357 | Garland | implementation | Statement | A | Educational Codeforces Round 145 (Rated for Div. 2) {1809} | PROGRAMMING | 114300 | ||
| 7456 | Binary String Sorting | binary search dp greedy | Statement | D | Educational Codeforces Round 145 (Rated for Div. 2) {1809} | PROGRAMMING | 114300 | ||
| 1384 | The Maximum Prefix | dp | Statement | G | CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) {1810} | PROGRAMMING | 3000.0 | Editorial of CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) | |
| 709 | M-tree | data structures | Statement | F | CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) {1810} | PROGRAMMING | 2500.0 | Editorial of CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) | |
| 4023 | Monsters | brute force data structures dfs and similar dsu graphs implementation trees | Statement | E | CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) {1810} | PROGRAMMING | 2000.0 | Editorial of CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) | |
| 16793 | Make It Permutation | brute force greedy sortings | Statement | C | CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) {1810} | PROGRAMMING | 1000.0 | Editorial of CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) | |
| 176 | Last Number | math | Statement | H | CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) {1810} | PROGRAMMING | 3500.0 | Editorial of CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) | |
| 8684 | Climbing the Tree | binary search math | Statement | D | CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) {1810} | PROGRAMMING | 1250.0 | Editorial of CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) | |
| 19042 | Candies | constructive algorithms math number theory | Statement | B | CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) {1810} | PROGRAMMING | 750.0 | Editorial of CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) | |
| 22073 | Beautiful Sequence | brute force greedy | Statement | A | CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) {1810} | PROGRAMMING | 500.0 | Editorial of CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) | |
| 2226 | Vlad and the Nice Paths (hard version) | binary search combinatorics data structures dp math two pointers | Statement | G2 | Codeforces Round 863 (Div. 3) {1811} | PROGRAMMING | 114788 | ||
| 2621 | Vlad and the Nice Paths (easy version) | combinatorics dp math | Statement | G1 | Codeforces Round 863 (Div. 3) {1811} | PROGRAMMING | 114788 | ||
| 8812 | Umka and a Long Flight | constructive algorithms implementation math | Statement | D | Codeforces Round 863 (Div. 3) {1811} | PROGRAMMING | 114788 | ||
| 22548 | Restore the Array | constructive algorithms greedy | Statement | C | Codeforces Round 863 (Div. 3) {1811} | PROGRAMMING | 114788 | ||
| 14798 | Living Sequence | binary search dp math number theory | Statement | E | Codeforces Round 863 (Div. 3) {1811} | PROGRAMMING | 114788 | ||
| 2286 | Is It Flower? | dfs and similar dsu graphs implementation | Statement | F | Codeforces Round 863 (Div. 3) {1811} | PROGRAMMING | 114788 | ||
| 35091 | Insert Digit | greedy math strings | Statement | A | Codeforces Round 863 (Div. 3) {1811} | PROGRAMMING | 114788 | ||
| 22622 | Conveyor Belts | math | Statement | B | Codeforces Round 863 (Div. 3) {1811} | PROGRAMMING | 114788 | ||
| 6089 | Was it Rated? | *special *special *special brute force implementation | Statement | B | April Fools Day Contest 2023 {1812} | PROGRAMMING | Editorial of April Fools Day Contest 2023 | ||
| 6319 | Unmysterious Language | *special interactive strings | Statement | J | April Fools Day Contest 2023 {1812} | PROGRAMMING | Editorial of April Fools Day Contest 2023 | ||
| 4958 | Trivial Conjecture | *special constructive algorithms math number theory | Statement | D | April Fools Day Contest 2023 {1812} | PROGRAMMING | Editorial of April Fools Day Contest 2023 | ||
| 4324 | Not a Geometry Problem | *special *special geometry | Statement | E | April Fools Day Contest 2023 {1812} | PROGRAMMING | Editorial of April Fools Day Contest 2023 | ||
| 293 | Mountain Climber | *special | Statement | I | April Fools Day Contest 2023 {1812} | PROGRAMMING | Editorial of April Fools Day Contest 2023 | ||
| 1339 | Factorization | *special number theory | Statement | F | April Fools Day Contest 2023 {1812} | PROGRAMMING | Editorial of April Fools Day Contest 2023 | ||
| 176 | Expected Twist | *special interactive | Statement | H | April Fools Day Contest 2023 {1812} | PROGRAMMING | Editorial of April Fools Day Contest 2023 | ||
| 1379 | Digits | *special | Statement | C | April Fools Day Contest 2023 {1812} | PROGRAMMING | Editorial of April Fools Day Contest 2023 | ||
| 630 | Colour Vision | *special implementation | Statement | G | April Fools Day Contest 2023 {1812} | PROGRAMMING | Editorial of April Fools Day Contest 2023 | ||
| 14380 | Are You a Robot? | *special *special *special expression parsing | Statement | A | April Fools Day Contest 2023 {1812} | PROGRAMMING | Editorial of April Fools Day Contest 2023 | ||
| 12680 | Search in Parallel | greedy math sortings | Statement | C | Educational Codeforces Round 146 (Rated for Div. 2) {1814} | PROGRAMMING | Educational Codeforces Round 146 Editorial | ||
| 11856 | Long Legs | brute force math | Statement | B | Educational Codeforces Round 146 (Rated for Div. 2) {1814} | PROGRAMMING | Educational Codeforces Round 146 Editorial | ||
| 1042 | Communication Towers | brute force divide and conquer dsu | Statement | F | Educational Codeforces Round 146 (Rated for Div. 2) {1814} | PROGRAMMING | Educational Codeforces Round 146 Editorial | ||
| 57019 | Coins | math | Statement | A | Educational Codeforces Round 146 (Rated for Div. 2) {1814} | PROGRAMMING | Educational Codeforces Round 146 Editorial | ||
| 1860 | Chain Chips | data structures dp | Statement | E | Educational Codeforces Round 146 (Rated for Div. 2) {1814} | PROGRAMMING | Educational Codeforces Round 146 Editorial | ||
| 1079 | Balancing Weapons | binary search brute force two pointers | Statement | D | Educational Codeforces Round 146 (Rated for Div. 2) {1814} | PROGRAMMING | Educational Codeforces Round 146 Editorial | ||
| 16252 | Ian and Array Sorting | greedy implementation math | Statement | A | Codeforces Round 865 (Div. 1) {1815} | PROGRAMMING | 500.0 | Editorial of Codeforces Round #865 | 1300 |
| 3710 | Sum Graph | constructive algorithms graphs implementation interactive math shortest paths trees | Statement | B | Codeforces Round 865 (Div. 1) {1815} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round #865 | 2000 |
| 2432 | Between | constructive algorithms dfs and similar graphs greedy shortest paths | Statement | C | Codeforces Round 865 (Div. 1) {1815} | PROGRAMMING | 1750.0 | Editorial of Codeforces Round #865 | 2200 |
| 1564 | XOR Counting | bitmasks combinatorics dp math | Statement | D | Codeforces Round 865 (Div. 1) {1815} | PROGRAMMING | 2500.0 | Editorial of Codeforces Round #865 | 2600 |
| 491 | Bosco and Particle | dp math number theory strings | Statement | E | Codeforces Round 865 (Div. 1) {1815} | PROGRAMMING | 3000.0 | Editorial of Codeforces Round #865 | 3100 |
| 326 | OH NO1 (-2-3-4) | constructive algorithms graphs math shortest paths | Statement | F | Codeforces Round 865 (Div. 1) {1815} | PROGRAMMING | 3500.0 | Editorial of Codeforces Round #865 | 3500 |
| 16878 | Grid Reconstruction | constructive algorithms greedy | Statement | B | Codeforces Round 865 (Div. 2) {1816} | PROGRAMMING | 1000.0 | Editorial of Codeforces Round #865 | 1000 |
| 18997 | Ian Visits Mary | constructive algorithms geometry | Statement | A | Codeforces Round 865 (Div. 2) {1816} | PROGRAMMING | 500.0 | Editorial of Codeforces Round #865 | 800 |
| 1056 | Toy Machine | constructive algorithms games implementation | Statement | D | Codeforces Round 869 (Div. 1) {1817} | PROGRAMMING | 2000.0 | Codeforces Round #869 (Div.1, Div.2) Editorial | |
| 1263 | Similar Polynomials | math | Statement | C | Codeforces Round 869 (Div. 1) {1817} | PROGRAMMING | 1250.0 | Codeforces Round #869 (Div.1, Div.2) Editorial | |
| 383 | Half-sum | divide and conquer greedy | Statement | E | Codeforces Round 869 (Div. 1) {1817} | PROGRAMMING | 2500.0 | Codeforces Round #869 (Div.1, Div.2) Editorial | |
| 5291 | Fish Graph | brute force constructive algorithms dfs and similar graphs trees | Statement | B | Codeforces Round 869 (Div. 1) {1817} | PROGRAMMING | 1000.0 | Codeforces Round #869 (Div.1, Div.2) Editorial | |
| 440 | Entangled Substrings | string suffix structures | Statement | F | Codeforces Round 869 (Div. 1) {1817} | PROGRAMMING | 3000.0 | Codeforces Round #869 (Div.1, Div.2) Editorial | |
| 12961 | Almost Increasing Subsequence | data structures greedy | Statement | A | Codeforces Round 869 (Div. 1) {1817} | PROGRAMMING | 500.0 | Codeforces Round #869 (Div.1, Div.2) Editorial | |
| 14656 | Politics | greedy implementation | Statement | A | Codeforces Round 869 (Div. 2) {1818} | PROGRAMMING | 500.0 | Codeforces Round #869 (Div.1, Div.2) Editorial | |
| 17340 | Indivisible | constructive algorithms | Statement | B | Codeforces Round 869 (Div. 2) {1818} | PROGRAMMING | 1000.0 | Codeforces Round #869 (Div.1, Div.2) Editorial | |
| 222 | Willy-nilly, Crack, Into Release! | data structures dp | Statement | F | Codeforces Round 866 (Div. 1) {1819} | PROGRAMMING | 3000.0 | Codeforces Round #866 (Div.1, Div.2, based on Lipetsk Team Olympiad) Editorial | |
| 1787 | The Fox and the Complete Tree Traversal | constructive algorithms dp games implementation math trees | Statement | C | Codeforces Round 866 (Div. 1) {1819} | PROGRAMMING | 1500.0 | Codeforces Round #866 (Div.1, Div.2, based on Lipetsk Team Olympiad) Editorial | |
| 4346 | The Butcher | greedy implementation sortings two pointers | Statement | B | Codeforces Round 866 (Div. 1) {1819} | PROGRAMMING | 1250.0 | Codeforces Round #866 (Div.1, Div.2, based on Lipetsk Team Olympiad) Editorial | |
| 387 | Roads in E City | interactive math probabilities trees | Statement | E | Codeforces Round 866 (Div. 1) {1819} | PROGRAMMING | 2750.0 | Codeforces Round #866 (Div.1, Div.2, based on Lipetsk Team Olympiad) Editorial | |
| 957 | Misha and Apples | data structures dp | Statement | D | Codeforces Round 866 (Div. 1) {1819} | PROGRAMMING | 2000.0 | Codeforces Round #866 (Div.1, Div.2, based on Lipetsk Team Olympiad) Editorial | |
| 14797 | Constructive Problem | brute force greedy implementation | Statement | A | Codeforces Round 866 (Div. 1) {1819} | PROGRAMMING | 750.0 | Codeforces Round #866 (Div.1, Div.2, based on Lipetsk Team Olympiad) Editorial | |
| 17793 | Yura's New Name | implementation strings | Statement | A | Codeforces Round 866 (Div. 2) {1820} | PROGRAMMING | 500.0 | Codeforces Round #866 (Div.1, Div.2, based on Lipetsk Team Olympiad) Editorial | |
| 25057 | JoJo's Incredible Adventures | math strings two pointers | Statement | B | Codeforces Round 866 (Div. 2) {1820} | PROGRAMMING | 1000.0 | Codeforces Round #866 (Div.1, Div.2, based on Lipetsk Team Olympiad) Editorial | |
| 1023 | Timber | combinatorics dp fft math | Statement | F | Educational Codeforces Round 147 (Rated for Div. 2) {1821} | PROGRAMMING | 115296 | ||
| 16500 | Tear It Apart | brute force implementation math strings | Statement | C | Educational Codeforces Round 147 (Rated for Div. 2) {1821} | PROGRAMMING | 115296 | ||
| 30806 | Sort the Subarray | brute force greedy | Statement | B | Educational Codeforces Round 147 (Rated for Div. 2) {1821} | PROGRAMMING | 115296 | ||
| 2777 | Rearrange Brackets | dp greedy math sortings | Statement | E | Educational Codeforces Round 147 (Rated for Div. 2) {1821} | PROGRAMMING | 115296 | ||
| 21418 | Matching | combinatorics math | Statement | A | Educational Codeforces Round 147 (Rated for Div. 2) {1821} | PROGRAMMING | 115296 | ||
| 5629 | Black Cells | binary search brute force greedy math | Statement | D | Educational Codeforces Round 147 (Rated for Div. 2) {1821} | PROGRAMMING | 115296 | ||
| 26253 | TubeTube Feed | brute force implementation sortings | Statement | A | Codeforces Round 867 (Div. 3) {1822} | PROGRAMMING | Codeforces Round #867 (Div. 3) Editorial | ||
| 19290 | Super-Permutation | constructive algorithms math | Statement | D | Codeforces Round 867 (Div. 3) {1822} | PROGRAMMING | Codeforces Round #867 (Div. 3) Editorial | ||
| 12635 | Making Anti-Palindromes | greedy math strings | Statement | E | Codeforces Round 867 (Div. 3) {1822} | PROGRAMMING | Codeforces Round #867 (Div. 3) Editorial | ||
| 3154 | Magic Triples (Hard Version) | brute force math number theory | Statement | G2 | Codeforces Round 867 (Div. 3) {1822} | PROGRAMMING | Codeforces Round #867 (Div. 3) Editorial | ||
| 10002 | Magic Triples (Easy Version) | brute force math number theory | Statement | G1 | Codeforces Round 867 (Div. 3) {1822} | PROGRAMMING | Codeforces Round #867 (Div. 3) Editorial | ||
| 26775 | Karina and Array | greedy math | Statement | B | Codeforces Round 867 (Div. 3) {1822} | PROGRAMMING | Codeforces Round #867 (Div. 3) Editorial | ||
| 7912 | Gardening Friends | brute force dfs and similar dp graphs trees | Statement | F | Codeforces Round 867 (Div. 3) {1822} | PROGRAMMING | Codeforces Round #867 (Div. 3) Editorial | ||
| 24993 | Bun Lover | math | Statement | C | Codeforces Round 867 (Div. 3) {1822} | PROGRAMMING | Codeforces Round #867 (Div. 3) Editorial | ||
| 4377 | Unique Palindromes | binary search constructive algorithms greedy math strings | Statement | D | Codeforces Round 868 (Div. 2) {1823} | PROGRAMMING | 2000.0 | 115465 | |
| 14030 | Strongly Composite | greedy math number theory | Statement | C | Codeforces Round 868 (Div. 2) {1823} | PROGRAMMING | 1250.0 | 115465 | |
| 18368 | Sort with Step | brute force math sortings | Statement | B | Codeforces Round 868 (Div. 2) {1823} | PROGRAMMING | 1000.0 | 115465 | |
| 1512 | Removing Graph | games graphs math | Statement | E | Codeforces Round 868 (Div. 2) {1823} | PROGRAMMING | 2000.0 | 115465 | |
| 1412 | Random Walk | dp graphs math probabilities trees | Statement | F | Codeforces Round 868 (Div. 2) {1823} | PROGRAMMING | 2500.0 | 115465 | |
| 17332 | A-characteristic | combinatorics constructive algorithms math | Statement | A | Codeforces Round 868 (Div. 2) {1823} | PROGRAMMING | 500.0 | 115465 | |
| 12702 | LuoTianyi and the Show | greedy implementation | Statement | A | Codeforces Round 872 (Div. 1) {1824} | PROGRAMMING | 500.0 | CodeForces Round 872(Div. 1&2) Editorial | 1400 |
| 6384 | LuoTianyi and the Floating Islands (Easy Version) | combinatorics math probabilities trees | Statement | B1 | Codeforces Round 872 (Div. 1) {1824} | PROGRAMMING | 500.0 | CodeForces Round 872(Div. 1&2) Editorial | 1800 |
| 3615 | LuoTianyi and the Floating Islands (Hard Version) | combinatorics dfs and similar math probabilities trees | Statement | B2 | Codeforces Round 872 (Div. 1) {1824} | PROGRAMMING | 750.0 | CodeForces Round 872(Div. 1&2) Editorial | 2300 |
| 1753 | LuoTianyi and XOR-Tree | data structures dfs and similar dp dsu greedy trees | Statement | C | Codeforces Round 872 (Div. 1) {1824} | PROGRAMMING | 1750.0 | CodeForces Round 872(Div. 1&2) Editorial | 2500 |
| 854 | LuoTianyi and the Function | data structures | Statement | D | Codeforces Round 872 (Div. 1) {1824} | PROGRAMMING | 2250.0 | CodeForces Round 872(Div. 1&2) Editorial | 3000 |
| 197 | LuoTianyi and Cartridge | data structures trees | Statement | E | Codeforces Round 872 (Div. 1) {1824} | PROGRAMMING | 3000.0 | CodeForces Round 872(Div. 1&2) Editorial | 3500 |
| 16362 | LuoTianyi and the Table | greedy math | Statement | B | Codeforces Round 872 (Div. 2) {1825} | PROGRAMMING | 1000.0 | CodeForces Round 872(Div. 1&2) Editorial | 1000 |
| 21015 | LuoTianyi and the Palindrome String | greedy strings | Statement | A | Codeforces Round 872 (Div. 2) {1825} | PROGRAMMING | 500.0 | CodeForces Round 872(Div. 1&2) Editorial | 800 |
| 30687 | Lunatic Never Content | math number theory | Statement | B | Codeforces Round 870 (Div. 2) {1826} | PROGRAMMING | 1000.0 | Codeforces Round #870 (Div. 2) Editorial | 1100 |
| 17579 | Trust Nobody | brute force greedy implementation sortings | Statement | A | Codeforces Round 870 (Div. 2) {1826} | PROGRAMMING | 500.0 | Codeforces Round #870 (Div. 2) Editorial | 1200 |
| 15960 | Dreaming of Freedom | greedy math number theory | Statement | C | Codeforces Round 870 (Div. 2) {1826} | PROGRAMMING | 1500.0 | Codeforces Round #870 (Div. 2) Editorial | 1300 |
| 16083 | Running Miles | brute force dp greedy | Statement | D | Codeforces Round 870 (Div. 2) {1826} | PROGRAMMING | 2000.0 | Codeforces Round #870 (Div. 2) Editorial | 1700 |
| 2023 | Walk the Runway | bitmasks brute force data structures dp graphs implementation sortings | Statement | E | Codeforces Round 870 (Div. 2) {1826} | PROGRAMMING | 2500.0 | Codeforces Round #870 (Div. 2) Editorial | 2400 |
| 492 | Fading into Fog | geometry interactive math probabilities | Statement | F | Codeforces Round 870 (Div. 2) {1826} | PROGRAMMING | 3000.0 | Codeforces Round #870 (Div. 2) Editorial | 2800 |
| 31325 | Counting Orders | combinatorics math sortings two pointers | Statement | A | Codeforces Round 873 (Div. 1) {1827} | PROGRAMMING | 500.0 | Codeforces Round #873 (Div. 1 & 2) Editorial | 1100 |
| 4661 | Range Sorting (Easy Version) | binary search dp dsu greedy trees two pointers | Statement | B1 | Codeforces Round 873 (Div. 1) {1827} | PROGRAMMING | 750.0 | Codeforces Round #873 (Div. 1 & 2) Editorial | 2000 |
| 2406 | Range Sorting (Hard Version) | binary search data structures dp greedy | Statement | B2 | Codeforces Round 873 (Div. 1) {1827} | PROGRAMMING | 750.0 | Codeforces Round #873 (Div. 1 & 2) Editorial | 2400 |
| 1791 | Palindrome Partition | binary search brute force data structures dp hashing strings | Statement | C | Codeforces Round 873 (Div. 1) {1827} | PROGRAMMING | 1500.0 | Codeforces Round #873 (Div. 1 & 2) Editorial | 2600 |
| 1045 | Two Centroids | data structures dfs and similar greedy trees | Statement | D | Codeforces Round 873 (Div. 1) {1827} | PROGRAMMING | 1750.0 | Codeforces Round #873 (Div. 1 & 2) Editorial | 2800 |
| 1198 | Bus Routes | binary search constructive algorithms dfs and similar greedy trees | Statement | E | Codeforces Round 873 (Div. 1) {1827} | PROGRAMMING | 2500.0 | Codeforces Round #873 (Div. 1 & 2) Editorial | 3400 |
| 141 | Copium Permutation | constructive algorithms data structures greedy | Statement | F | Codeforces Round 873 (Div. 1) {1827} | PROGRAMMING | 3500.0 | Codeforces Round #873 (Div. 1 & 2) Editorial | 3500 |
| 25577 | Divisible Array | constructive algorithms math | Statement | A | Codeforces Round 873 (Div. 2) {1828} | PROGRAMMING | 500.0 | Codeforces Round #873 (Div. 1 & 2) Editorial | 800 |
| 43217 | Permutation Swap | math number theory | Statement | B | Codeforces Round 873 (Div. 2) {1828} | PROGRAMMING | 1000.0 | Codeforces Round #873 (Div. 1 & 2) Editorial | 900 |
| 35386 | Gold Rush | brute force dfs and similar dp implementation | Statement | D | Codeforces Round 871 (Div. 4) {1829} | PROGRAMMING | Codeforces Round 871 (Div. 4) Editorial | 1000 | |
| 28042 | The Lakes | dfs and similar dsu graphs implementation | Statement | E | Codeforces Round 871 (Div. 4) {1829} | PROGRAMMING | Codeforces Round 871 (Div. 4) Editorial | 1100 | |
| 22563 | Forever Winter | dfs and similar graphs math | Statement | F | Codeforces Round 871 (Div. 4) {1829} | PROGRAMMING | Codeforces Round 871 (Div. 4) Editorial | 1300 | |
| 16248 | Hits Different | data structures dp implementation math | Statement | G | Codeforces Round 871 (Div. 4) {1829} | PROGRAMMING | Codeforces Round 871 (Div. 4) Editorial | 1600 | |
| 11459 | Don't Blame Me | bitmasks combinatorics dp math | Statement | H | Codeforces Round 871 (Div. 4) {1829} | PROGRAMMING | Codeforces Round 871 (Div. 4) Editorial | 1700 | |
| 33105 | Mr. Perfectly Fine | bitmasks greedy implementation | Statement | C | Codeforces Round 871 (Div. 4) {1829} | PROGRAMMING | Codeforces Round 871 (Div. 4) Editorial | 800 | |
| 73398 | Love Story | implementation strings | Statement | A | Codeforces Round 871 (Div. 4) {1829} | PROGRAMMING | Codeforces Round 871 (Div. 4) Editorial | 800 | |
| 85173 | Blank Space | implementation | Statement | B | Codeforces Round 871 (Div. 4) {1829} | PROGRAMMING | Codeforces Round 871 (Div. 4) Editorial | 800 | |
| 416 | The Third Grace | data structures dp | Statement | F | Codeforces Round 875 (Div. 1) {1830} | PROGRAMMING | 3500.0 | Codeforces Round #875 (Div.1 + Div. 2) Editorial | |
| 6019 | The BOSS Can Count Pairs | brute force data structures math | Statement | B | Codeforces Round 875 (Div. 1) {1830} | PROGRAMMING | 1000.0 | Codeforces Round #875 (Div.1 + Div. 2) Editorial | |
| 986 | Mex Tree | brute force dp trees | Statement | D | Codeforces Round 875 (Div. 1) {1830} | PROGRAMMING | 2250.0 | Codeforces Round #875 (Div.1 + Div. 2) Editorial | |
| 2353 | Hyperregular Bracket Strings | combinatorics hashing number theory sortings two pointers | Statement | C | Codeforces Round 875 (Div. 1) {1830} | PROGRAMMING | 1750.0 | Codeforces Round #875 (Div.1 + Div. 2) Editorial | |
| 21753 | Copil Copac Draws Trees | dfs and similar dp graphs trees | Statement | A | Codeforces Round 875 (Div. 1) {1830} | PROGRAMMING | 500.0 | Codeforces Round #875 (Div.1 + Div. 2) Editorial | |
| 352 | Bully Sort | data structures | Statement | E | Codeforces Round 875 (Div. 1) {1830} | PROGRAMMING | 3000.0 | Codeforces Round #875 (Div.1 + Div. 2) Editorial | |
| 50983 | Twin Permutations | constructive algorithms | Statement | A | Codeforces Round 875 (Div. 2) {1831} | PROGRAMMING | 500.0 | Codeforces Round #875 (Div.1 + Div. 2) Editorial | |
| 38723 | Array merging | constructive algorithms greedy | Statement | B | Codeforces Round 875 (Div. 2) {1831} | PROGRAMMING | 750.0 | Codeforces Round #875 (Div.1 + Div. 2) Editorial | |
| 39110 | Maximum Sum | brute force sortings two pointers | Statement | B | Educational Codeforces Round 148 (Rated for Div. 2) {1832} | PROGRAMMING | 116454 | 1100 | |
| 37565 | Contrast Value | greedy implementation | Statement | C | Educational Codeforces Round 148 (Rated for Div. 2) {1832} | PROGRAMMING | 116454 | 1200 | |
| 3474 | Red-Blue Operations (Easy Version) | binary search greedy implementation math | Statement | D1 | Educational Codeforces Round 148 (Rated for Div. 2) {1832} | PROGRAMMING | 116454 | 2100 | |
| 2649 | Combinatorics Problem | brute force combinatorics dp | Statement | E | Educational Codeforces Round 148 (Rated for Div. 2) {1832} | PROGRAMMING | 116454 | 2200 | |
| 2424 | Red-Blue Operations (Hard Version) | binary search constructive algorithms greedy implementation math | Statement | D2 | Educational Codeforces Round 148 (Rated for Div. 2) {1832} | PROGRAMMING | 116454 | 2400 | |
| 396 | Zombies | binary search dp | Statement | F | Educational Codeforces Round 148 (Rated for Div. 2) {1832} | PROGRAMMING | 116454 | 3200 | |
| 29538 | New Palindrome | strings | Statement | A | Educational Codeforces Round 148 (Rated for Div. 2) {1832} | PROGRAMMING | 116454 | 800 | |
| 28192 | Vlad Building Beautiful Array | greedy | Statement | C | Codeforces Round 874 (Div. 3) {1833} | PROGRAMMING | 116636 | ||
| 19837 | Round Dance | dsu graphs shortest paths | Statement | E | Codeforces Round 874 (Div. 3) {1833} | PROGRAMMING | 116636 | ||
| 30055 | Restore the Weather | greedy sortings | Statement | B | Codeforces Round 874 (Div. 3) {1833} | PROGRAMMING | 116636 | ||
| 35444 | Musical Puzzle | implementation | Statement | A | Codeforces Round 874 (Div. 3) {1833} | PROGRAMMING | 116636 | ||
| 6598 | Ksyusha and Chinchilla | dfs and similar dp dsu greedy implementation trees | Statement | G | Codeforces Round 874 (Div. 3) {1833} | PROGRAMMING | 116636 | ||
| 10750 | Ira and Flamenco | combinatorics data structures implementation sortings | Statement | F | Codeforces Round 874 (Div. 3) {1833} | PROGRAMMING | 116636 | ||
| 15320 | Flipper | brute force constructive algorithms | Statement | D | Codeforces Round 874 (Div. 3) {1833} | PROGRAMMING | 116636 | ||
| 50893 | Unit Array | greedy math | Statement | A | Codeforces Round 879 (Div. 2) {1834} | PROGRAMMING | 500.0 | Codeforces Round #879 Editorial | |
| 723 | Typewriter | data structures math | Statement | F | Codeforces Round 879 (Div. 2) {1834} | PROGRAMMING | 3000.0 | Codeforces Round #879 Editorial | |
| 5682 | Survey in Class | constructive algorithms data structures greedy implementation sortings | Statement | D | Codeforces Round 879 (Div. 2) {1834} | PROGRAMMING | 1750.0 | Codeforces Round #879 Editorial | |
| 2907 | MEX of LCM | binary search brute force data structures implementation math number theory two pointers | Statement | E | Codeforces Round 879 (Div. 2) {1834} | PROGRAMMING | 2500.0 | Codeforces Round #879 Editorial | |
| 17314 | Maximum Strength | greedy math | Statement | B | Codeforces Round 879 (Div. 2) {1834} | PROGRAMMING | 1000.0 | Codeforces Round #879 Editorial | |
| 15319 | Game with Reversing | games strings | Statement | C | Codeforces Round 879 (Div. 2) {1834} | PROGRAMMING | 1250.0 | Codeforces Round #879 Editorial | |
| 1210 | Twin Clusters | bitmasks math meet-in-the-middle probabilities | Statement | C | Codeforces Round 880 (Div. 1) {1835} | PROGRAMMING | 1500.0 | Codeforces Round 880 Editorial | |
| 356 | Old Mobile | dp math probabilities | Statement | E | Codeforces Round 880 (Div. 1) {1835} | PROGRAMMING | 2250.0 | Codeforces Round 880 Editorial | |
| 1145 | Lottery | binary search brute force greedy math sortings two pointers | Statement | B | Codeforces Round 880 (Div. 1) {1835} | PROGRAMMING | 1250.0 | Codeforces Round 880 Editorial | |
| 8910 | k-th equality | brute force implementation math | Statement | A | Codeforces Round 880 (Div. 1) {1835} | PROGRAMMING | 500.0 | Codeforces Round 880 Editorial |