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 ... 34 35 36 37 38 ... 43 44 45 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 231 | Good Graph | bitmasks graph matchings graphs implementation | Statement | F | Codeforces Round 880 (Div. 1) {1835} | PROGRAMMING | 3000.0 | Codeforces Round 880 Editorial | |
| 658 | Doctor's Brown Hypothesis | dfs and similar graphs math number theory | Statement | D | Codeforces Round 880 (Div. 1) {1835} | PROGRAMMING | 1750.0 | Codeforces Round 880 Editorial | |
| 21407 | Destroyer | sortings | Statement | A | Codeforces Round 880 (Div. 2) {1836} | PROGRAMMING | 750.0 | Codeforces Round 880 Editorial | |
| 13580 | Astrophysicists | greedy math | Statement | B | Codeforces Round 880 (Div. 2) {1836} | PROGRAMMING | 1000.0 | Codeforces Round 880 Editorial | |
| 2515 | Playoff Fixing | combinatorics trees | Statement | E | Educational Codeforces Round 149 (Rated for Div. 2) {1837} | PROGRAMMING | 116752 | ||
| 54494 | Grasshopper on a Line | constructive algorithms math | Statement | A | Educational Codeforces Round 149 (Rated for Div. 2) {1837} | PROGRAMMING | 116752 | ||
| 2659 | Editorial for Two | binary search data structures greedy implementation | Statement | F | Educational Codeforces Round 149 (Rated for Div. 2) {1837} | PROGRAMMING | 116752 | ||
| 49835 | Comparison String | greedy | Statement | B | Educational Codeforces Round 149 (Rated for Div. 2) {1837} | PROGRAMMING | 116752 | ||
| 21882 | Bracket Coloring | constructive algorithms data structures greedy | Statement | D | Educational Codeforces Round 149 (Rated for Div. 2) {1837} | PROGRAMMING | 116752 | ||
| 24554 | Best Binary String | constructive algorithms greedy | Statement | C | Educational Codeforces Round 149 (Rated for Div. 2) {1837} | PROGRAMMING | 116752 | ||
| 379 | Stuck Conveyor | binary search interactive | Statement | F | Codeforces Round 877 (Div. 2) {1838} | PROGRAMMING | 3000.0 | Codeforces Round #877 (Div. 2) Editorial | |
| 17277 | No Prime Differences | constructive algorithms math number theory | Statement | C | Codeforces Round 877 (Div. 2) {1838} | PROGRAMMING | 1250.0 | Codeforces Round #877 (Div. 2) Editorial | |
| 17794 | Minimize Permutation Subarrays | constructive algorithms greedy math | Statement | B | Codeforces Round 877 (Div. 2) {1838} | PROGRAMMING | 1000.0 | Codeforces Round #877 (Div. 2) Editorial | |
| 1850 | Count Supersequences | combinatorics dp math | Statement | E | Codeforces Round 877 (Div. 2) {1838} | PROGRAMMING | 2250.0 | Codeforces Round #877 (Div. 2) Editorial | |
| 3699 | Bracket Walk | constructive algorithms data structures implementation sortings strings | Statement | D | Codeforces Round 877 (Div. 2) {1838} | PROGRAMMING | 1750.0 | Codeforces Round #877 (Div. 2) Editorial | |
| 22681 | Blackboard List | math | Statement | A | Codeforces Round 877 (Div. 2) {1838} | PROGRAMMING | 500.0 | Codeforces Round #877 (Div. 2) Editorial | |
| 18324 | The Good Array | greedy math | Statement | A | Codeforces Round 876 (Div. 2) {1839} | PROGRAMMING | 500.0 | Codeforces Round #876 (Div. 2) Editorial | |
| 16539 | Lamps | data structures greedy sortings two pointers | Statement | B | Codeforces Round 876 (Div. 2) {1839} | PROGRAMMING | 1000.0 | Codeforces Round #876 (Div. 2) Editorial | |
| 13429 | Insert Zero and Invert Prefix | constructive algorithms greedy | Statement | C | Codeforces Round 876 (Div. 2) {1839} | PROGRAMMING | 1500.0 | Codeforces Round #876 (Div. 2) Editorial | |
| 1535 | Decreasing Game | constructive algorithms dp greedy interactive | Statement | E | Codeforces Round 876 (Div. 2) {1839} | PROGRAMMING | 2750.0 | Codeforces Round #876 (Div. 2) Editorial | |
| 2690 | Ball Sorting | data structures dp sortings | Statement | D | Codeforces Round 876 (Div. 2) {1839} | PROGRAMMING | 2250.0 | Codeforces Round #876 (Div. 2) Editorial | |
| 16264 | Wooden Toy Festival | binary search greedy sortings | Statement | D | Codeforces Round 878 (Div. 3) {1840} | PROGRAMMING | Codeforces Round #878 (Div.3) Editorial | ||
| 47363 | Ski Resort | combinatorics math two pointers | Statement | C | Codeforces Round 878 (Div. 3) {1840} | PROGRAMMING | Codeforces Round #878 (Div.3) Editorial | ||
| 2107 | Railguns | dfs and similar dp graphs implementation | Statement | F | Codeforces Round 878 (Div. 3) {1840} | PROGRAMMING | Codeforces Round #878 (Div.3) Editorial | ||
| 1182 | In Search of Truth (Hard Version) | constructive algorithms interactive math probabilities | Statement | G2 | Codeforces Round 878 (Div. 3) {1840} | PROGRAMMING | Codeforces Round #878 (Div.3) Editorial | ||
| 2788 | In Search of Truth (Easy Version) | brute force constructive algorithms interactive math probabilities | Statement | G1 | Codeforces Round 878 (Div. 3) {1840} | PROGRAMMING | Codeforces Round #878 (Div.3) Editorial | ||
| 37999 | Cipher Shifer | implementation strings two pointers | Statement | A | Codeforces Round 878 (Div. 3) {1840} | PROGRAMMING | Codeforces Round #878 (Div.3) Editorial | ||
| 9288 | Character Blocking | data structures implementation | Statement | E | Codeforces Round 878 (Div. 3) {1840} | PROGRAMMING | Codeforces Round #878 (Div.3) Editorial | ||
| 24701 | Binary Cafe | bitmasks combinatorics math | Statement | B | Codeforces Round 878 (Div. 3) {1840} | PROGRAMMING | Codeforces Round #878 (Div.3) Editorial | ||
| 9049 | Ranom Numbers | brute force dp greedy math strings | Statement | C | Educational Codeforces Round 150 (Rated for Div. 2) {1841} | PROGRAMMING | 117262 | ||
| 5278 | Pairs of Segments | data structures dp greedy sortings | Statement | D | Educational Codeforces Round 150 (Rated for Div. 2) {1841} | PROGRAMMING | 117262 | ||
| 607 | Monocarp and a Strategic Game | dp geometry sortings | Statement | F | Educational Codeforces Round 150 (Rated for Div. 2) {1841} | PROGRAMMING | 117262 | ||
| 24071 | Keep it Beautiful | implementation strings | Statement | B | Educational Codeforces Round 150 (Rated for Div. 2) {1841} | PROGRAMMING | 117262 | ||
| 25978 | Game with Board | constructive algorithms games | Statement | A | Educational Codeforces Round 150 (Rated for Div. 2) {1841} | PROGRAMMING | 117262 | ||
| 2426 | Fill the Matrix | data structures greedy math | Statement | E | Educational Codeforces Round 150 (Rated for Div. 2) {1841} | PROGRAMMING | 117262 | ||
| 20781 | Tenzing and Tsondu | games math | Statement | A | CodeTON Round 5 (Div. 1 + Div. 2, Rated, Prizes!) {1842} | PROGRAMMING | 250.0 | CodeTON Round 5 Editorial | |
| 1827 | Tenzing and Triangle | data structures dp greedy | Statement | E | CodeTON Round 5 (Div. 1 + Div. 2, Rated, Prizes!) {1842} | PROGRAMMING | 2000.0 | CodeTON Round 5 Editorial | |
| 1805 | Tenzing and Tree | brute force dfs and similar greedy trees | Statement | F | CodeTON Round 5 (Div. 1 + Div. 2, Rated, Prizes!) {1842} | PROGRAMMING | 2500.0 | CodeTON Round 5 Editorial | |
| 850 | Tenzing and Random Real Numbers | 2-sat bitmasks dp probabilities | Statement | H | CodeTON Round 5 (Div. 1 + Div. 2, Rated, Prizes!) {1842} | PROGRAMMING | 3750.0 | CodeTON Round 5 Editorial | |
| 1571 | Tenzing and Random Operations | combinatorics dp math probabilities | Statement | G | CodeTON Round 5 (Div. 1 + Div. 2, Rated, Prizes!) {1842} | PROGRAMMING | 3000.0 | CodeTON Round 5 Editorial | |
| 169 | Tenzing and Necklace | divide and conquer dp greedy | Statement | I | CodeTON Round 5 (Div. 1 + Div. 2, Rated, Prizes!) {1842} | PROGRAMMING | 5000.0 | CodeTON Round 5 Editorial | |
| 4727 | Tenzing and His Animal Friends | brute force constructive algorithms graphs greedy shortest paths | Statement | D | CodeTON Round 5 (Div. 1 + Div. 2, Rated, Prizes!) {1842} | PROGRAMMING | 1500.0 | CodeTON Round 5 Editorial | |
| 25428 | Tenzing and Books | bitmasks greedy math | Statement | B | CodeTON Round 5 (Div. 1 + Div. 2, Rated, Prizes!) {1842} | PROGRAMMING | 500.0 | CodeTON Round 5 Editorial | |
| 16438 | Tenzing and Balls | dp greedy | Statement | C | CodeTON Round 5 (Div. 1 + Div. 2, Rated, Prizes!) {1842} | PROGRAMMING | 1000.0 | CodeTON Round 5 Editorial | |
| 17737 | Tracking Segments | binary search | Statement | E | Codeforces Round 881 (Div. 3) {1843} | PROGRAMMING | Codeforces Round #881 (Div. 3) Editorial | ||
| 39383 | Sum in Binary Tree | bitmasks math trees | Statement | C | Codeforces Round 881 (Div. 3) {1843} | PROGRAMMING | Codeforces Round #881 (Div. 3) Editorial | ||
| 37283 | Sasha and Array Coloring | greedy sortings | Statement | A | Codeforces Round 881 (Div. 3) {1843} | PROGRAMMING | Codeforces Round #881 (Div. 3) Editorial | ||
| 6335 | Omsk Metro (simple version) | data structures dfs and similar dp greedy math trees | Statement | F1 | Codeforces Round 881 (Div. 3) {1843} | PROGRAMMING | Codeforces Round #881 (Div. 3) Editorial | ||
| 2110 | Omsk Metro (hard version) | data structures dfs and similar divide and conquer dp implementation math trees | Statement | F2 | Codeforces Round 881 (Div. 3) {1843} | PROGRAMMING | Codeforces Round #881 (Div. 3) Editorial | ||
| 32063 | Long Long | greedy math | Statement | B | Codeforces Round 881 (Div. 3) {1843} | PROGRAMMING | Codeforces Round #881 (Div. 3) Editorial | ||
| 21625 | Apple Tree | combinatorics dfs and similar dp trees | Statement | D | Codeforces Round 881 (Div. 3) {1843} | PROGRAMMING | Codeforces Round #881 (Div. 3) Editorial | ||
| 1175 | Tree Weights | bitmasks constructive algorithms data structures dfs and similar math matrices number theory trees | Statement | G | Codeforces Round 884 (Div. 1 + Div. 2) {1844} | PROGRAMMING | 3500.0 | Codeforces Round #884 (Div. 1 + Div. 2) Editorial | |
| 25943 | Subtraction Game | constructive algorithms games math | Statement | A | Codeforces Round 884 (Div. 1 + Div. 2) {1844} | PROGRAMMING | 500.0 | Codeforces Round #884 (Div. 1 + Div. 2) Editorial | |
| 13825 | Row Major | constructive algorithms math number theory strings | Statement | D | Codeforces Round 884 (Div. 1 + Div. 2) {1844} | PROGRAMMING | 1500.0 | Codeforces Round #884 (Div. 1 + Div. 2) Editorial | |
| 20235 | Permutations & Primes | constructive algorithms greedy math | Statement | B | Codeforces Round 884 (Div. 1 + Div. 2) {1844} | PROGRAMMING | 1000.0 | Codeforces Round #884 (Div. 1 + Div. 2) Editorial | |
| 17843 | Particles | constructive algorithms greedy implementation math | Statement | C | Codeforces Round 884 (Div. 1 + Div. 2) {1844} | PROGRAMMING | 1250.0 | Codeforces Round #884 (Div. 1 + Div. 2) Editorial | |
| 282 | Multiple of Three Cycles | combinatorics dp dsu math | Statement | H | Codeforces Round 884 (Div. 1 + Div. 2) {1844} | PROGRAMMING | 4000.0 | Codeforces Round #884 (Div. 1 + Div. 2) Editorial | |
| 477 | Min Cost Permutation (Hard Version) | binary search data structures graphs greedy sortings | Statement | F2 | Codeforces Round 884 (Div. 1 + Div. 2) {1844} | PROGRAMMING | 1000.0 | Codeforces Round #884 (Div. 1 + Div. 2) Editorial | |
| 904 | Min Cost Permutation (Easy Version) | greedy | Statement | F1 | Codeforces Round 884 (Div. 1 + Div. 2) {1844} | PROGRAMMING | 2000.0 | Codeforces Round #884 (Div. 1 + Div. 2) Editorial | |
| 2152 | Great Grids | constructive algorithms dfs and similar dsu graphs math | Statement | E | Codeforces Round 884 (Div. 1 + Div. 2) {1844} | PROGRAMMING | 2000.0 | Codeforces Round #884 (Div. 1 + Div. 2) Editorial | |
| 431 | Swimmers in the Pool | fft math number theory | Statement | F | Educational Codeforces Round 151 (Rated for Div. 2) {1845} | PROGRAMMING | 117791 | ||
| 16759 | Strong Password | binary search dp greedy strings | Statement | C | Educational Codeforces Round 151 (Rated for Div. 2) {1845} | PROGRAMMING | 117791 | ||
| 8994 | Rating System | brute force data structures dp greedy implementation math | Statement | D | Educational Codeforces Round 151 (Rated for Div. 2) {1845} | PROGRAMMING | 117791 | ||
| 47032 | Forbidden Integer | implementation math | Statement | A | Educational Codeforces Round 151 (Rated for Div. 2) {1845} | PROGRAMMING | 117791 | ||
| 23632 | Come Together | geometry implementation math | Statement | B | Educational Codeforces Round 151 (Rated for Div. 2) {1845} | PROGRAMMING | 117791 | ||
| 1593 | Boxes and Balls | dp implementation math | Statement | E | Educational Codeforces Round 151 (Rated for Div. 2) {1845} | PROGRAMMING | 117791 | ||
| 28896 | Rudolph and Tic-Tac-Toe | brute force implementation strings | Statement | B | Codeforces Round 883 (Div. 3) {1846} | PROGRAMMING | |||
| 3712 | Rudolph and Mimic | constructive algorithms greedy implementation interactive | Statement | F | Codeforces Round 883 (Div. 3) {1846} | PROGRAMMING | |||
| 34746 | Rudolph and Cut the Rope | implementation math | Statement | A | Codeforces Round 883 (Div. 3) {1846} | PROGRAMMING | |||
| 22413 | Rudolph and Christmas Tree | constructive algorithms geometry math | Statement | D | Codeforces Round 883 (Div. 3) {1846} | PROGRAMMING | |||
| 21457 | Rudolf and the Another Competition | constructive algorithms greedy implementation sortings | Statement | C | Codeforces Round 883 (Div. 3) {1846} | PROGRAMMING | |||
| 25098 | Rudolf and Snowflakes (simple version) | binary search brute force implementation math | Statement | E1 | Codeforces Round 883 (Div. 3) {1846} | PROGRAMMING | |||
| 8492 | Rudolf and Snowflakes (hard version) | binary search brute force implementation math | Statement | E2 | Codeforces Round 883 (Div. 3) {1846} | PROGRAMMING | |||
| 5638 | Rudolf and CodeVid-23 | bitmasks dp graphs greedy shortest paths | Statement | G | Codeforces Round 883 (Div. 3) {1846} | PROGRAMMING | |||
| 14737 | Vampiric Powers, anyone? | bitmasks brute force data structures dp greedy | Statement | C | Codeforces Round 882 (Div. 2) {1847} | PROGRAMMING | 1500.0 | Tutorial | |
| 371 | Triangle Platinum? | implementation interactive | Statement | E | Codeforces Round 882 (Div. 2) {1847} | PROGRAMMING | 2750.0 | Tutorial | |
| 22896 | The Man who became a God | greedy sortings | Statement | A | Codeforces Round 882 (Div. 2) {1847} | PROGRAMMING | 500.0 | Tutorial | |
| 1027 | The Boss's Identity | binary search bitmasks data structures dfs and similar greedy math sortings | Statement | F | Codeforces Round 882 (Div. 2) {1847} | PROGRAMMING | 3000.0 | Tutorial | |
| 4258 | Professor Higashikata | brute force data structures dsu greedy implementation sortings | Statement | D | Codeforces Round 882 (Div. 2) {1847} | PROGRAMMING | 2000.0 | Tutorial | |
| 22267 | Hamon Odyssey | bitmasks greedy implementation | Statement | B | Codeforces Round 882 (Div. 2) {1847} | PROGRAMMING | 1000.0 | Tutorial | |
| 2031 | Vika and Wiki | binary search bitmasks combinatorics math | Statement | F | Codeforces Round 885 (Div. 2) {1848} | PROGRAMMING | 2750.0 | Codeforces Round #885 (Div.2) Editorial | |
| 24284 | Vika and the Bridge | binary search data structures greedy implementation math sortings | Statement | B | Codeforces Round 885 (Div. 2) {1848} | PROGRAMMING | 1000.0 | Codeforces Round #885 (Div.2) Editorial | |
| 925 | Vika and Stone Skipping | brute force math number theory | Statement | E | Codeforces Round 885 (Div. 2) {1848} | PROGRAMMING | 2250.0 | Codeforces Round #885 (Div.2) Editorial | |
| 7157 | Vika and Price Tags | greedy math number theory | Statement | C | Codeforces Round 885 (Div. 2) {1848} | PROGRAMMING | 1500.0 | Codeforces Round #885 (Div.2) Editorial | |
| 18396 | Vika and Her Friends | constructive algorithms games math | Statement | A | Codeforces Round 885 (Div. 2) {1848} | PROGRAMMING | 500.0 | Codeforces Round #885 (Div.2) Editorial | |
| 2975 | Vika and Bonuses | binary search brute force math ternary search | Statement | D | Codeforces Round 885 (Div. 2) {1848} | PROGRAMMING | 2000.0 | Codeforces Round #885 (Div.2) Editorial | |
| 878 | XOR Partition | binary search bitmasks data structures divide and conquer greedy trees | Statement | F | Educational Codeforces Round 152 (Rated for Div. 2) {1849} | PROGRAMMING | 118752 | ||
| 32092 | Morning Sandwich | implementation math | Statement | A | Educational Codeforces Round 152 (Rated for Div. 2) {1849} | PROGRAMMING | 118752 | ||
| 44140 | Monsters | greedy sortings | Statement | B | Educational Codeforces Round 152 (Rated for Div. 2) {1849} | PROGRAMMING | 118752 | ||
| 2178 | Max to the Right of Min | binary search data structures divide and conquer dsu two pointers | Statement | E | Educational Codeforces Round 152 (Rated for Div. 2) {1849} | PROGRAMMING | 118752 | ||
| 12510 | Binary String Copying | binary search brute force data structures hashing strings | Statement | C | Educational Codeforces Round 152 (Rated for Div. 2) {1849} | PROGRAMMING | 118752 | ||
| 10296 | Array Painting | brute force constructive algorithms dp greedy | Statement | D | Educational Codeforces Round 152 (Rated for Div. 2) {1849} | PROGRAMMING | 118752 | ||
| 53418 | Word on the Paper | implementation strings | Statement | C | Codeforces Round 886 (Div. 4) {1850} | PROGRAMMING | Codeforces Round #886 (Div. 4) Editorial | ||
| 24531 | We Were Both Children | brute force implementation math number theory | Statement | F | Codeforces Round 886 (Div. 4) {1850} | PROGRAMMING | Codeforces Round #886 (Div. 4) Editorial | ||
| 73927 | To My Critics | implementation sortings | Statement | A | Codeforces Round 886 (Div. 4) {1850} | PROGRAMMING | Codeforces Round #886 (Div. 4) Editorial | ||
| 9955 | The Third Letter | dfs and similar graphs greedy implementation | Statement | H | Codeforces Round 886 (Div. 4) {1850} | PROGRAMMING | Codeforces Round #886 (Div. 4) Editorial | ||
| 15403 | The Morning Star | combinatorics data structures geometry implementation math sortings | Statement | G | Codeforces Round 886 (Div. 4) {1850} | PROGRAMMING | Codeforces Round #886 (Div. 4) Editorial | ||
| 50291 | Ten Words of Wisdom | implementation sortings | Statement | B | Codeforces Round 886 (Div. 4) {1850} | PROGRAMMING | Codeforces Round #886 (Div. 4) Editorial | ||
| 34851 | Cardboard for Pictures | binary search geometry implementation math | Statement | E | Codeforces Round 886 (Div. 4) {1850} | PROGRAMMING | Codeforces Round #886 (Div. 4) Editorial | ||
| 60480 | Balanced Round | brute force greedy implementation sortings | Statement | D | Codeforces Round 886 (Div. 4) {1850} | PROGRAMMING | Codeforces Round #886 (Div. 4) Editorial | ||
| 4028 | Vlad and the Mountains | data structures dsu graphs implementation sortings trees two pointers | Statement | G | Codeforces Round 888 (Div. 3) {1851} | PROGRAMMING | 118667 | ||
| 25852 | Tiles Comeback | greedy implementation | Statement | C | Codeforces Round 888 (Div. 3) {1851} | PROGRAMMING | 118667 | ||
| 17290 | Prefix Permutation Sums | implementation math | Statement | D | Codeforces Round 888 (Div. 3) {1851} | PROGRAMMING | 118667 | ||
| 32435 | Parity Sort | sortings two pointers | Statement | B | Codeforces Round 888 (Div. 3) {1851} | PROGRAMMING | 118667 | ||
| 13257 | Nastya and Potions | dfs and similar dp graphs greedy shortest paths sortings | Statement | E | Codeforces Round 888 (Div. 3) {1851} | PROGRAMMING | 118667 | ||
| 7379 | Lisa and the Martians | bitmasks data structures greedy math sortings strings trees | Statement | F | Codeforces Round 888 (Div. 3) {1851} | PROGRAMMING | 118667 | ||
| 31483 | Escalator Conversations | brute force constructive algorithms implementation math | Statement | A | Codeforces Round 888 (Div. 3) {1851} | PROGRAMMING | 118667 | ||
| 225 | Rivalries | constructive algorithms data structures | Statement | E | Codeforces Round 887 (Div. 1) {1852} | PROGRAMMING | 2250.0 | Codeforces Round 887 (Div 1, Div 2) Tutorial | |
| 146 | Panda Meetups | data structures dp flows | Statement | F | Codeforces Round 887 (Div. 1) {1852} | PROGRAMMING | 3000.0 | Codeforces Round 887 (Div 1, Div 2) Tutorial | |
| 9213 | Ntarsis' Set | binary search implementation math two pointers | Statement | A | Codeforces Round 887 (Div. 1) {1852} | PROGRAMMING | 500.0 | Codeforces Round 887 (Div 1, Div 2) Tutorial | |
| 601 | Miriany and Matchstick | constructive algorithms dp greedy | Statement | D | Codeforces Round 887 (Div. 1) {1852} | PROGRAMMING | 2000.0 | Codeforces Round 887 (Div 1, Div 2) Tutorial | |
| 2090 | Ina of the Mountain | data structures dp greedy math | Statement | C | Codeforces Round 887 (Div. 1) {1852} | PROGRAMMING | 1250.0 | Codeforces Round 887 (Div 1, Div 2) Tutorial | |
| 5452 | Imbalanced Arrays | constructive algorithms greedy sortings two pointers | Statement | B | Codeforces Round 887 (Div. 1) {1852} | PROGRAMMING | 750.0 | Codeforces Round 887 (Div 1, Div 2) Tutorial | |
| 19706 | Fibonaccharsis | binary search brute force math | Statement | B | Codeforces Round 887 (Div. 2) {1853} | PROGRAMMING | 1000.0 | Codeforces Round 887 (Div 1, Div 2) Tutorial | |
| 55722 | Desorting | brute force greedy | Statement | A | Codeforces Round 887 (Div. 2) {1853} | PROGRAMMING | 500.0 | Codeforces Round 887 (Div 1, Div 2) Tutorial | |
| 651 | Michael and Hotel | interactive trees | Statement | D | Codeforces Round 889 (Div. 1) {1854} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round 889 (Div. 1 + Div. 2) | |
| 140 | Mark and Spaceship | dp | Statement | F | Codeforces Round 889 (Div. 1) {1854} | PROGRAMMING | 3250.0 | Editorial of Codeforces Round 889 (Div. 1 + Div. 2) | |
| 524 | Game Bundles | constructive algorithms | Statement | E | Codeforces Round 889 (Div. 1) {1854} | PROGRAMMING | 2750.0 | Editorial of Codeforces Round 889 (Div. 1 + Div. 2) | |
| 1780 | Expected Destruction | dp math probabilities | Statement | C | Codeforces Round 889 (Div. 1) {1854} | PROGRAMMING | 1500.0 | Editorial of Codeforces Round 889 (Div. 1 + Div. 2) | |
| 4217 | Earn or Unlock | bitmasks brute force dp | Statement | B | Codeforces Round 889 (Div. 1) {1854} | PROGRAMMING | 1500.0 | Editorial of Codeforces Round 889 (Div. 1 + Div. 2) | |
| 7847 | Dual (Hard Version) | constructive algorithms math | Statement | A2 | Codeforces Round 889 (Div. 1) {1854} | PROGRAMMING | 750.0 | Editorial of Codeforces Round 889 (Div. 1 + Div. 2) | |
| 15867 | Dual (Easy Version) | constructive algorithms math | Statement | A1 | Codeforces Round 889 (Div. 1) {1854} | PROGRAMMING | 750.0 | Editorial of Codeforces Round 889 (Div. 1 + Div. 2) | |
| 44695 | Longest Divisors Interval | brute force combinatorics greedy math number theory | Statement | B | Codeforces Round 889 (Div. 2) {1855} | PROGRAMMING | 1000.0 | Editorial of Codeforces Round 889 (Div. 1 + Div. 2) | |
| 29906 | Dalton the Teacher | math | Statement | A | Codeforces Round 889 (Div. 2) {1855} | PROGRAMMING | 500.0 | Editorial of Codeforces Round 889 (Div. 1 + Div. 2) | |
| 18236 | To Become Max | binary search brute force data structures dp | Statement | C | Codeforces Round 890 (Div. 2) supported by Constructor Institute {1856} | PROGRAMMING | 1250.0 | Codeforces Round #890 (Div. 2) Editorial | |
| 28114 | Tales of a Sort | binary search implementation | Statement | A | Codeforces Round 890 (Div. 2) supported by Constructor Institute {1856} | PROGRAMMING | 500.0 | Codeforces Round #890 (Div. 2) Editorial | |
| 1749 | PermuTree (hard version) | bitmasks dp implementation trees | Statement | E2 | Codeforces Round 890 (Div. 2) supported by Constructor Institute {1856} | PROGRAMMING | 1500.0 | Codeforces Round #890 (Div. 2) Editorial | |
| 6417 | PermuTree (easy version) | dfs and similar dp trees | Statement | E1 | Codeforces Round 890 (Div. 2) supported by Constructor Institute {1856} | PROGRAMMING | 1500.0 | Codeforces Round #890 (Div. 2) Editorial | |
| 3759 | More Wrong | divide and conquer interactive | Statement | D | Codeforces Round 890 (Div. 2) supported by Constructor Institute {1856} | PROGRAMMING | 2000.0 | Codeforces Round #890 (Div. 2) Editorial | |
| 27396 | Good Arrays | constructive algorithms implementation math | Statement | B | Codeforces Round 890 (Div. 2) supported by Constructor Institute {1856} | PROGRAMMING | 750.0 | Codeforces Round #890 (Div. 2) Editorial | |
| 14303 | Sum and Product | data structures math | Statement | F | Codeforces Round 891 (Div. 3) {1857} | PROGRAMMING | 119134 | ||
| 29192 | Strong Vertices | math sortings trees | Statement | D | Codeforces Round 891 (Div. 3) {1857} | PROGRAMMING | 119134 | ||
| 14802 | Power of Points | math sortings | Statement | E | Codeforces Round 891 (Div. 3) {1857} | PROGRAMMING | 119134 | ||
| 24699 | Maximum Rounding | greedy implementation math | Statement | B | Codeforces Round 891 (Div. 3) {1857} | PROGRAMMING | 119134 | ||
| 5464 | Counting Graphs | combinatorics divide and conquer dsu graphs greedy sortings | Statement | G | Codeforces Round 891 (Div. 3) {1857} | PROGRAMMING | 119134 | ||
| 41551 | Assembly via Minimums | greedy sortings | Statement | C | Codeforces Round 891 (Div. 3) {1857} | PROGRAMMING | 119134 | ||
| 78428 | Array Coloring | greedy math | Statement | A | Codeforces Round 891 (Div. 3) {1857} | PROGRAMMING | 119134 | ||
| 25501 | Yet Another Permutation Problem | constructive algorithms math number theory | Statement | C | Codeforces Round 893 (Div. 2) {1858} | PROGRAMMING | 1500.0 | Codeforces Round #893 (Div. 2) Editorial | 1000 |
| 13010 | The Walkway | brute force greedy implementation math number theory | Statement | B | Codeforces Round 893 (Div. 2) {1858} | PROGRAMMING | 1250.0 | Codeforces Round #893 (Div. 2) Editorial | 1500 |
| 3188 | Trees and Segments | binary search brute force constructive algorithms data structures dp greedy two pointers | Statement | D | Codeforces Round 893 (Div. 2) {1858} | PROGRAMMING | 2000.0 | Codeforces Round #893 (Div. 2) Editorial | 2200 |
| 1539 | Rollbacks (Easy Version) | brute force data structures dfs and similar trees | Statement | E1 | Codeforces Round 893 (Div. 2) {1858} | PROGRAMMING | 1750.0 | Codeforces Round #893 (Div. 2) Editorial | 2500 |
| 1263 | Rollbacks (Hard Version) | bitmasks data structures interactive trees | Statement | E2 | Codeforces Round 893 (Div. 2) {1858} | PROGRAMMING | 1000.0 | Codeforces Round #893 (Div. 2) Editorial | 2600 |
| 65867 | Buttons | games greedy math | Statement | A | Codeforces Round 893 (Div. 2) {1858} | PROGRAMMING | 500.0 | Codeforces Round #893 (Div. 2) Editorial | 800 |
| 54100 | United We Stand | constructive algorithms graphs math | Statement | A | Codeforces Round 892 (Div. 2) {1859} | PROGRAMMING | 500.0 | Video solutions from Geothermal. | |
| 520 | Teleportation in Byteland | data structures divide and conquer graphs shortest paths trees | Statement | F | Codeforces Round 892 (Div. 2) {1859} | PROGRAMMING | 3000.0 | Video solutions from Geothermal. | |
| 43702 | Olya and Game with Arrays | constructive algorithms greedy math sortings | Statement | B | Codeforces Round 892 (Div. 2) {1859} | PROGRAMMING | 1000.0 | Video solutions from Geothermal. | |
| 2112 | Maximum Monogonosity | brute force dp math | Statement | E | Codeforces Round 892 (Div. 2) {1859} | PROGRAMMING | 2250.0 | Video solutions from Geothermal. | |
| 18634 | Another Permutation Problem | brute force dp greedy math | Statement | C | Codeforces Round 892 (Div. 2) {1859} | PROGRAMMING | 1250.0 | Video solutions from Geothermal. | |
| 7985 | Andrey and Escape from Capygrad | binary search data structures dp dsu greedy sortings two pointers | Statement | D | Codeforces Round 892 (Div. 2) {1859} | PROGRAMMING | 1750.0 | Video solutions from Geothermal. | |
| 23548 | Not a Substring | constructive algorithms dp strings | Statement | A | Educational Codeforces Round 153 (Rated for Div. 2) {1860} | PROGRAMMING | Educational Codeforces Round 153 Editorial | ||
| 15540 | Game on Permutation | data structures games greedy | Statement | C | Educational Codeforces Round 153 (Rated for Div. 2) {1860} | PROGRAMMING | Educational Codeforces Round 153 Editorial | ||
| 1803 | Fast Travel Text Editor | dfs and similar graphs shortest paths | Statement | E | Educational Codeforces Round 153 (Rated for Div. 2) {1860} | PROGRAMMING | Educational Codeforces Round 153 Editorial | ||
| 18850 | Fancy Coins | binary search brute force greedy math | Statement | B | Educational Codeforces Round 153 (Rated for Div. 2) {1860} | PROGRAMMING | Educational Codeforces Round 153 Editorial | ||
| 319 | Evaluate RBS | data structures geometry sortings | Statement | F | Educational Codeforces Round 153 (Rated for Div. 2) {1860} | PROGRAMMING | Educational Codeforces Round 153 Editorial | ||
| 3591 | Balanced String | bitmasks constructive algorithms dp | Statement | D | Educational Codeforces Round 153 (Rated for Div. 2) {1860} | PROGRAMMING | Educational Codeforces Round 153 Editorial | ||
| 23981 | Two Binary Strings | constructive algorithms dfs and similar greedy | Statement | B | Educational Codeforces Round 154 (Rated for Div. 2) {1861} | PROGRAMMING | Educational Codeforces Round 154 Editorial | ||
| 7941 | Sorting By Multiplication | dp greedy math | Statement | D | Educational Codeforces Round 154 (Rated for Div. 2) {1861} | PROGRAMMING | Educational Codeforces Round 154 Editorial | ||
| 12296 | Queries for the Array | data structures dfs and similar implementation strings trees | Statement | C | Educational Codeforces Round 154 (Rated for Div. 2) {1861} | PROGRAMMING | Educational Codeforces Round 154 Editorial | ||
| 25914 | Prime Deletion | constructive algorithms implementation | Statement | A | Educational Codeforces Round 154 (Rated for Div. 2) {1861} | PROGRAMMING | Educational Codeforces Round 154 Editorial | ||
| 2033 | Non-Intersecting Subpermutations | combinatorics dp | Statement | E | Educational Codeforces Round 154 (Rated for Div. 2) {1861} | PROGRAMMING | Educational Codeforces Round 154 Editorial | ||
| 297 | Four Suits | Statement | F | Educational Codeforces Round 154 (Rated for Div. 2) {1861} | PROGRAMMING | Educational Codeforces Round 154 Editorial | |||
| 3437 | The Great Equalizer | data structures math sortings | Statement | G | Codeforces Round 894 (Div. 3) {1862} | PROGRAMMING | Tutorial | ||
| 54652 | Sequence Game | constructive algorithms | Statement | B | Codeforces Round 894 (Div. 3) {1862} | PROGRAMMING | Tutorial | ||
| 7586 | Magic Will Save the World | binary search bitmasks brute force dp | Statement | F | Codeforces Round 894 (Div. 3) {1862} | PROGRAMMING | Tutorial | ||
| 12762 | Kolya and Movie Theatre | constructive algorithms data structures greedy | Statement | E | Codeforces Round 894 (Div. 3) {1862} | PROGRAMMING | Tutorial | ||
| 19788 | Ice Cream Balls | binary search combinatorics constructive algorithms math | Statement | D | Codeforces Round 894 (Div. 3) {1862} | PROGRAMMING | Tutorial | ||
| 36221 | Gift Carpet | greedy implementation strings | Statement | A | Codeforces Round 894 (Div. 3) {1862} | PROGRAMMING | Tutorial | ||
| 23040 | Flower City Fence | implementation | Statement | C | Codeforces Round 894 (Div. 3) {1862} | PROGRAMMING | Tutorial | ||
| 10757 | Two-Colored Dominoes | constructive algorithms greedy | Statement | D | Pinely Round 2 (Div. 1 + Div. 2) {1863} | PROGRAMMING | 1250.0 | ||
| 824 | Swaps | combinatorics graphs | Statement | G | Pinely Round 2 (Div. 1 + Div. 2) {1863} | PROGRAMMING | 2750.0 | ||
| 16801 | Split Sort | greedy math sortings | Statement | B | Pinely Round 2 (Div. 1 + Div. 2) {1863} | PROGRAMMING | 750.0 | ||
| 3183 | Speedrun | brute force data structures dfs and similar dp graphs sortings | Statement | E | Pinely Round 2 (Div. 1 + Div. 2) {1863} | PROGRAMMING | 1750.0 | ||
| 127 | Redundant Routes | constructive algorithms dp trees | Statement | I | Pinely Round 2 (Div. 1 + Div. 2) {1863} | PROGRAMMING | 4000.0 | ||
| 15519 | MEX Repetition | implementation | Statement | C | Pinely Round 2 (Div. 1 + Div. 2) {1863} | PROGRAMMING | 1000.0 | ||
| 112 | Goldberg Machine 3 | dp trees | Statement | H | Pinely Round 2 (Div. 1 + Div. 2) {1863} | PROGRAMMING | 3500.0 | ||
| 1347 | Divide, XOR, and Conquer | bitmasks dp | Statement | F | Pinely Round 2 (Div. 1 + Div. 2) {1863} | PROGRAMMING | 2500.0 | ||
| 18866 | Channel | greedy implementation | Statement | A | Pinely Round 2 (Div. 1 + Div. 2) {1863} | PROGRAMMING | 500.0 | ||
| 16590 | Swap and Reverse | greedy sortings strings | Statement | B | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) {1864} | PROGRAMMING | 1000.0 | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) Editorial | |
| 7627 | Matrix Cascade | brute force constructive algorithms dp greedy | Statement | D | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) {1864} | PROGRAMMING | 1500.0 | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) Editorial | |
| 315 | Magic Square | combinatorics constructive algorithms | Statement | G | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) {1864} | PROGRAMMING | 3000.0 | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) Editorial | |
| 21412 | Increasing and Decreasing | constructive algorithms implementation math | Statement | A | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) {1864} | PROGRAMMING | 500.0 | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) Editorial | |
| 3038 | Guess Game | bitmasks combinatorics constructive algorithms data structures games math probabilities strings trees | Statement | E | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) {1864} | PROGRAMMING | 2000.0 | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) Editorial | |
| 106 | Future Dominators | graphs greedy | Statement | I | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) {1864} | PROGRAMMING | 4250.0 | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) Editorial | |
| 1639 | Exotic Queries | brute force data structures implementation sortings | Statement | F | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) {1864} | PROGRAMMING | 2500.0 | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) Editorial | |
| 15271 | Divisor Chain | bitmasks constructive algorithms math number theory | Statement | C | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) {1864} | PROGRAMMING | 1250.0 | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) Editorial | |
| 493 | Asterism Stream | dp math matrices probabilities | Statement | H | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) {1864} | PROGRAMMING | 3500.0 | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) Editorial | |
| 969 | Mighty Rock Tower | combinatorics dp math probabilities | Statement | M | COMPFEST 15 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1866} | PROGRAMMING | COMPFEST 15 Preliminary — Editorial | ||
| 876 | Lihmuf Balling | brute force math | Statement | L | COMPFEST 15 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1866} | PROGRAMMING | COMPFEST 15 Preliminary — Editorial | ||
| 559 | Keen Tree Calculation | binary search dp geometry trees | Statement | K | COMPFEST 15 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1866} | PROGRAMMING | COMPFEST 15 Preliminary — Editorial | ||
| 440 | Jackets and Packets | dp | Statement | J | COMPFEST 15 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1866} | PROGRAMMING | COMPFEST 15 Preliminary — Editorial | ||
| 926 | Imagination Castle | dp games two pointers | Statement | I | COMPFEST 15 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1866} | PROGRAMMING | COMPFEST 15 Preliminary — Editorial | ||
| 1900 | Happy Sets | combinatorics | Statement | H | COMPFEST 15 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1866} | PROGRAMMING | COMPFEST 15 Preliminary — Editorial | ||
| 2169 | Grouped Carriages | binary search data structures greedy | Statement | G | COMPFEST 15 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1866} | PROGRAMMING | COMPFEST 15 Preliminary — Editorial | ||
| 155 | Freak Joker Process | binary search data structures sortings | Statement | F | COMPFEST 15 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1866} | PROGRAMMING | COMPFEST 15 Preliminary — Editorial | ||
| 531 | Elevators of Tamem | dp | Statement | E | COMPFEST 15 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1866} | PROGRAMMING | COMPFEST 15 Preliminary — Editorial | ||
| 1561 | Digital Wallet | dp greedy | Statement | D | COMPFEST 15 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1866} | PROGRAMMING | COMPFEST 15 Preliminary — Editorial | ||
| 3424 | Completely Searching for Inversions | dfs and similar dp graphs | Statement | C | COMPFEST 15 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1866} | PROGRAMMING | COMPFEST 15 Preliminary — Editorial | ||
| 9165 | Battling with Numbers | combinatorics math number theory | Statement | B | COMPFEST 15 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1866} | PROGRAMMING | COMPFEST 15 Preliminary — Editorial | ||
| 50899 | Ambitious Kid | math | Statement | A | COMPFEST 15 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1866} | PROGRAMMING | COMPFEST 15 Preliminary — Editorial | ||
| 18618 | XOR Palindromes | bitmasks constructive algorithms strings | Statement | B | Codeforces Round 897 (Div. 2) {1867} | PROGRAMMING | 1000.0 | ||
| 12662 | Salyg1n and the MEX Game | constructive algorithms data structures games greedy interactive | Statement | C | Codeforces Round 897 (Div. 2) {1867} | PROGRAMMING | 1250.0 | ||
| 4324 | Salyg1n and Array (simple version) | constructive algorithms interactive math | Statement | E1 | Codeforces Round 897 (Div. 2) {1867} | PROGRAMMING | 2000.0 | ||
| 3748 | Salyg1n and Array (hard version) | constructive algorithms interactive math | Statement | E2 | Codeforces Round 897 (Div. 2) {1867} | PROGRAMMING | 1000.0 | ||
| 508 | Most Different Tree | brute force constructive algorithms dfs and similar greedy hashing | Statement | F | Codeforces Round 897 (Div. 2) {1867} | PROGRAMMING | 4000.0 | ||
| 21137 | green_gold_dog, array and permutation | constructive algorithms sortings | Statement | A | Codeforces Round 897 (Div. 2) {1867} | PROGRAMMING | 500.0 | ||
| 6869 | Cyclic Operations | constructive algorithms dfs and similar graphs greedy implementation | Statement | D | Codeforces Round 897 (Div. 2) {1867} | PROGRAMMING | 2000.0 | ||
| 1373 | Travel Plan | combinatorics divide and conquer dp math trees | Statement | C | Codeforces Round 896 (Div. 1) {1868} | PROGRAMMING | 1000.0 | Codeforces Round 896 (Div. 1, Div. 2) Editorial | |
| 111 | Min-Sum-Max | dp greedy | Statement | E | Codeforces Round 896 (Div. 1) {1868} | PROGRAMMING | 2500.0 | Codeforces Round 896 (Div. 1, Div. 2) Editorial | |
| 96 | LIS? | data structures greedy implementation | Statement | F | Codeforces Round 896 (Div. 1) {1868} | PROGRAMMING | 3000.0 | Codeforces Round 896 (Div. 1, Div. 2) Editorial | |
| 374 | Flower-like Pseudotree | constructive algorithms graphs implementation trees | Statement | D | Codeforces Round 896 (Div. 1) {1868} | PROGRAMMING | 1750.0 | Codeforces Round 896 (Div. 1, Div. 2) Editorial | |
| 13602 | Fill in the Matrix | constructive algorithms implementation | Statement | A | Codeforces Round 896 (Div. 1) {1868} | PROGRAMMING | 500.0 | Codeforces Round 896 (Div. 1, Div. 2) Editorial | |
| 2744 | Candy Party (Hard Version) | bitmasks constructive algorithms dp graphs greedy implementation math | Statement | B2 | Codeforces Round 896 (Div. 1) {1868} | PROGRAMMING | 750.0 | Codeforces Round 896 (Div. 1, Div. 2) Editorial | |
| 8312 | Candy Party (Easy Version) | bitmasks constructive algorithms graphs greedy implementation math | Statement | B1 | Codeforces Round 896 (Div. 1) {1868} | PROGRAMMING | 500.0 | Codeforces Round 896 (Div. 1, Div. 2) Editorial | |
| 39836 | Make It Zero | constructive algorithms | Statement | A | Codeforces Round 896 (Div. 2) {1869} | PROGRAMMING | 500.0 | Codeforces Round 896 (Div. 1, Div. 2) Editorial | |
| 25586 | 2D Traveling | geometry math shortest paths | Statement | B | Codeforces Round 896 (Div. 2) {1869} | PROGRAMMING | 750.0 | Codeforces Round 896 (Div. 1, Div. 2) Editorial | |
| 121 | Standard Graph Problem | data structures graphs greedy trees | Statement | H | CodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!) {1870} | PROGRAMMING | 4000.0 | CodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 8022 | Prefix Purchase | binary search data structures greedy | Statement | D | CodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!) {1870} | PROGRAMMING | 1750.0 | CodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 20221 | MEXanized Array | constructive algorithms greedy math | Statement | A | CodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!) {1870} | PROGRAMMING | 500.0 | CodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 394 | MEXanization | Statement | G | CodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!) {1870} | PROGRAMMING | 3250.0 | CodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | ||
| 552 | Lazy Numbers | binary search math | Statement | F | CodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!) {1870} | PROGRAMMING | 3250.0 | CodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 16072 | Friendly Arrays | bitmasks greedy math | Statement | B | CodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!) {1870} | PROGRAMMING | 750.0 | CodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 13092 | Colorful Table | binary search data structures dp implementation math sortings two pointers | Statement | C | CodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!) {1870} | PROGRAMMING | 1500.0 | CodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 2944 | Another MEX Problem | bitmasks dp graphs shortest paths | Statement | E | CodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!) {1870} | PROGRAMMING | 2750.0 | CodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 43105 | Two Vessels | greedy math | Statement | A | Codeforces Round 895 (Div. 3) {1872} | PROGRAMMING | Codeforces Round 895 (Div. 3) Editorial | ||
| 30456 | The Corridor or There and Back Again | implementation | Statement | B | Codeforces Round 895 (Div. 3) {1872} | PROGRAMMING | Codeforces Round 895 (Div. 3) Editorial | ||
| 7524 | Selling a Menagerie | dfs and similar dsu graphs implementation math | Statement | F | Codeforces Round 895 (Div. 3) {1872} | PROGRAMMING | Codeforces Round 895 (Div. 3) Editorial | ||
| 5016 | Replace With Product | brute force math two pointers | Statement | G | Codeforces Round 895 (Div. 3) {1872} | PROGRAMMING | Codeforces Round 895 (Div. 3) Editorial | ||
| 38616 | Plus Minus Permutation | math | Statement | D | Codeforces Round 895 (Div. 3) {1872} | PROGRAMMING | Codeforces Round 895 (Div. 3) Editorial | ||
| 26342 | Non-coprime Split | math number theory | Statement | C | Codeforces Round 895 (Div. 3) {1872} | PROGRAMMING | Codeforces Round 895 (Div. 3) Editorial | ||
| 21267 | Data Structures Fan | bitmasks data structures | Statement | E | Codeforces Round 895 (Div. 3) {1872} | PROGRAMMING | Codeforces Round 895 (Div. 3) Editorial | ||
| 69520 | Target Practice | implementation math | Statement | C | Codeforces Round 898 (Div. 4) {1873} | PROGRAMMING | 120634 | ||
| 71097 | Short Sort | brute force implementation | Statement | A | Codeforces Round 898 (Div. 4) {1873} | PROGRAMMING | 120634 | ||
| 19659 | Money Trees | greedy greedy greedy math two pointers | Statement | F | Codeforces Round 898 (Div. 4) {1873} | PROGRAMMING | 120634 | ||
| 9481 | Mad City | dfs and similar dsu graphs shortest paths | Statement | H | Codeforces Round 898 (Div. 4) {1873} | PROGRAMMING | 120634 | ||
| 62452 | Good Kid | brute force brute force brute force greedy math | Statement | B | Codeforces Round 898 (Div. 4) {1873} | PROGRAMMING | 120634 | ||
| 43201 | Building an Aquarium | binary search sortings | Statement | E | Codeforces Round 898 (Div. 4) {1873} | PROGRAMMING | 120634 | ||
| 16788 | ABBC or BACB | greedy | Statement | G | Codeforces Round 898 (Div. 4) {1873} | PROGRAMMING | 120634 | ||
| 42907 | 1D Eraser | greedy implementation | Statement | D | Codeforces Round 898 (Div. 4) {1873} | PROGRAMMING | 120634 | ||
| 439 | Jellyfish and OEIS | dp | Statement | F | Codeforces Round 901 (Div. 1) {1874} | PROGRAMMING | 4000.0 | Codeforces Round 901 (Div. 1, Div. 2) Editorial | |
| 930 | Jellyfish and Miku | dp math probabilities | Statement | D | Codeforces Round 901 (Div. 1) {1874} | PROGRAMMING | 2250.0 | Codeforces Round 901 (Div. 1, Div. 2) Editorial | |
| 1391 | Jellyfish and Math | bitmasks dp graphs shortest paths | Statement | B | Codeforces Round 901 (Div. 1) {1874} | PROGRAMMING | 1250.0 | Codeforces Round 901 (Div. 1, Div. 2) Editorial | |
| 131 | Jellyfish and Inscryption | dp | Statement | G | Codeforces Round 901 (Div. 1) {1874} | PROGRAMMING | 5000.0 | Codeforces Round 901 (Div. 1, Div. 2) Editorial | |
| 573 | Jellyfish and Hack | dp math | Statement | E | Codeforces Round 901 (Div. 1) {1874} | PROGRAMMING | 3000.0 | Codeforces Round 901 (Div. 1, Div. 2) Editorial | |
| 19355 | Jellyfish and Game | brute force greedy implementation | Statement | A | Codeforces Round 901 (Div. 1) {1874} | PROGRAMMING | 500.0 | Codeforces Round 901 (Div. 1, Div. 2) Editorial | |
| 2174 | Jellyfish and EVA | dp graphs greedy math probabilities | Statement | C | Codeforces Round 901 (Div. 1) {1874} | PROGRAMMING | 1500.0 | Codeforces Round 901 (Div. 1, Div. 2) Editorial | |
| 46714 | Jellyfish and Undertale | greedy | Statement | A | Codeforces Round 901 (Div. 2) {1875} | PROGRAMMING | 500.0 | Codeforces Round 901 (Div. 1, Div. 2) Editorial | |
| 11373 | Jellyfish and Mex | dp | Statement | D | Codeforces Round 901 (Div. 2) {1875} | PROGRAMMING | 1250.0 | Codeforces Round 901 (Div. 1, Div. 2) Editorial | |
| 13860 | Jellyfish and Green Apple | bitmasks greedy math number theory | Statement | C | Codeforces Round 901 (Div. 2) {1875} | PROGRAMMING | 1000.0 | Codeforces Round 901 (Div. 1, Div. 2) Editorial | |
| 1049 | Lexichromatography | combinatorics dfs and similar dsu graphs two pointers | Statement | D | Codeforces Round 902 (Div. 1, based on COMPFEST 15 - Final Round) {1876} | PROGRAMMING | 1750.0 | Codeforces Round #902 (Div. 1, Div. 2, based on COMPFEST 15 — Final Round) Editorial | |
| 185 | Indefinite Clownfish | binary search graphs | Statement | F | Codeforces Round 902 (Div. 1, based on COMPFEST 15 - Final Round) {1876} | PROGRAMMING | 2750.0 | Codeforces Round #902 (Div. 1, Div. 2, based on COMPFEST 15 — Final Round) Editorial |