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 ... 32 33 34 35 36 ... 44 45 46 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 5512 | Wish I Knew How to Sort | dp math probabilities | Statement | C | Codeforces Round 829 (Div. 1) {1753} | PROGRAMMING | 1750.0 | Tutorial | 2000 |
| 2188 | The Beach | graphs shortest paths | Statement | D | Codeforces Round 829 (Div. 1) {1753} | PROGRAMMING | 2000.0 | Tutorial | 2400 |
| 457 | N Machines | binary search brute force greedy | Statement | E | Codeforces Round 829 (Div. 1) {1753} | PROGRAMMING | 2500.0 | Tutorial | 3300 |
| 257 | Minecraft Series | brute force two pointers | Statement | F | Codeforces Round 829 (Div. 1) {1753} | PROGRAMMING | 3000.0 | Tutorial | 3500 |
| 25001 | Technical Support | Statement | A | Codeforces Round 829 (Div. 2) {1754} | PROGRAMMING | 500.0 | Tutorial | 800 | |
| 19785 | Kevin and Permutation | constructive algorithms constructive algorithms math | Statement | B | Codeforces Round 829 (Div. 2) {1754} | PROGRAMMING | 1000.0 | Tutorial | 800 |
| 24305 | XOR = Average | constructive algorithms | Statement | B | Codeforces Round 836 (Div. 2) {1758} | PROGRAMMING | 1000.0 | Codeforces Round #836 (Div. 2) Editorial | |
| 1082 | Tick, Tock | 2-sat combinatorics dfs and similar dsu graphs | Statement | E | Codeforces Round 836 (Div. 2) {1758} | PROGRAMMING | 2250.0 | Codeforces Round #836 (Div. 2) Editorial | |
| 27208 | SSeeeeiinngg DDoouubbllee | constructive algorithms strings | Statement | A | Codeforces Round 836 (Div. 2) {1758} | PROGRAMMING | 500.0 | Codeforces Round #836 (Div. 2) Editorial | |
| 8792 | Range = √Sum | binary search brute force constructive algorithms math two pointers | Statement | D | Codeforces Round 836 (Div. 2) {1758} | PROGRAMMING | 1750.0 | Codeforces Round #836 (Div. 2) Editorial | |
| 254 | Decent Division | data structures | Statement | F | Codeforces Round 836 (Div. 2) {1758} | PROGRAMMING | 3000.0 | Codeforces Round #836 (Div. 2) Editorial | |
| 15406 | Almost All Multiples | greedy number theory | Statement | C | Codeforces Round 836 (Div. 2) {1758} | PROGRAMMING | 1500.0 | Codeforces Round #836 (Div. 2) Editorial | |
| 33050 | Yes-Yes? | implementation strings | Statement | A | Codeforces Round 834 (Div. 3) {1759} | PROGRAMMING | 109254 | ||
| 19656 | Thermostat | greedy math shortest paths | Statement | C | Codeforces Round 834 (Div. 3) {1759} | PROGRAMMING | 109254 | ||
| 12748 | The Humanoid | brute force dp sortings | Statement | E | Codeforces Round 834 (Div. 3) {1759} | PROGRAMMING | 109254 | ||
| 5695 | Restore the Permutation | binary search data structures greedy math | Statement | G | Codeforces Round 834 (Div. 3) {1759} | PROGRAMMING | 109254 | ||
| 21887 | Make It Round | brute force number theory | Statement | D | Codeforces Round 834 (Div. 3) {1759} | PROGRAMMING | 109254 | ||
| 23826 | Lost Permutation | math | Statement | B | Codeforces Round 834 (Div. 3) {1759} | PROGRAMMING | 109254 | ||
| 4577 | All Possible Digits | binary search data structures greedy math number theory | Statement | F | Codeforces Round 834 (Div. 3) {1759} | PROGRAMMING | 109254 | ||
| 11000 | SlavicG's Favorite Problem | bitmasks brute force constructive algorithms data structures dfs and similar graphs greedy | Statement | G | Codeforces Round 835 (Div. 4) {1760} | PROGRAMMING | 109348 | ||
| 15476 | Quests | binary search greedy sortings | Statement | F | Codeforces Round 835 (Div. 4) {1760} | PROGRAMMING | 109348 | ||
| 83086 | Medium Number | implementation sortings | Statement | A | Codeforces Round 835 (Div. 4) {1760} | PROGRAMMING | 109348 | ||
| 27570 | Challenging Valleys | implementation | Statement | D | Codeforces Round 835 (Div. 4) {1760} | PROGRAMMING | 109348 | ||
| 23316 | Binary Inversions | data structures greedy math | Statement | E | Codeforces Round 835 (Div. 4) {1760} | PROGRAMMING | 109348 | ||
| 54557 | Atilla's Favorite Problem | greedy implementation strings | Statement | B | Codeforces Round 835 (Div. 4) {1760} | PROGRAMMING | 109348 | ||
| 44976 | Advantage | data structures data structures implementation implementation | Statement | C | Codeforces Round 835 (Div. 4) {1760} | PROGRAMMING | 109348 | ||
| 41415 | Two Permutations | brute force constructive algorithms | Statement | A | Pinely Round 1 (Div. 1 + Div. 2) {1761} | PROGRAMMING | 500.0 | Pinely Round 1 (Div. 1 + Div. 2) Editorial | |
| 10841 | Set Construction | constructive algorithms dfs and similar graphs greedy | Statement | C | Pinely Round 1 (Div. 1 + Div. 2) {1761} | PROGRAMMING | 1250.0 | Pinely Round 1 (Div. 1 + Div. 2) Editorial | |
| 2220 | Make It Connected | constructive algorithms graphs greedy | Statement | E | Pinely Round 1 (Div. 1 + Div. 2) {1761} | PROGRAMMING | 1750.0 | Pinely Round 1 (Div. 1 + Div. 2) Editorial | |
| 14870 | Elimination of a Ring | constructive algorithms greedy implementation | Statement | B | Pinely Round 1 (Div. 1 + Div. 2) {1761} | PROGRAMMING | 1000.0 | Pinely Round 1 (Div. 1 + Div. 2) Editorial | |
| 156 | Centroid Guess | interactive probabilities trees | Statement | G | Pinely Round 1 (Div. 1 + Div. 2) {1761} | PROGRAMMING | 3500.0 | Pinely Round 1 (Div. 1 + Div. 2) Editorial | |
| 2892 | Carry Bit | bitmasks brute force combinatorics dp math | Statement | D | Pinely Round 1 (Div. 1 + Div. 2) {1761} | PROGRAMMING | 1750.0 | Pinely Round 1 (Div. 1 + Div. 2) Editorial | |
| 112 | Anti-median (Hard Version) | combinatorics dp math | Statement | F2 | Pinely Round 1 (Div. 1 + Div. 2) {1761} | PROGRAMMING | 2000.0 | Pinely Round 1 (Div. 1 + Div. 2) Editorial | |
| 346 | Anti-median (Easy Version) | dp math | Statement | F1 | Pinely Round 1 (Div. 1 + Div. 2) {1761} | PROGRAMMING | 2500.0 | Pinely Round 1 (Div. 1 + Div. 2) Editorial | |
| 160 | Unequal Adjacent Elements | constructive algorithms sortings | Statement | G | Codeforces Round 838 (Div. 2) {1762} | PROGRAMMING | 3500.0 | Codeforces Round #838 (Div. 2) Editorial | |
| 984 | Tree Sum | combinatorics trees | Statement | E | Codeforces Round 838 (Div. 2) {1762} | PROGRAMMING | 2500.0 | Codeforces Round #838 (Div. 2) Editorial | |
| 18798 | Make Array Good | constructive algorithms implementation number theory sortings | Statement | B | Codeforces Round 838 (Div. 2) {1762} | PROGRAMMING | 1000.0 | Codeforces Round #838 (Div. 2) Editorial | |
| 924 | Good Pairs | binary search data structures dp | Statement | F | Codeforces Round 838 (Div. 2) {1762} | PROGRAMMING | 2750.0 | Codeforces Round #838 (Div. 2) Editorial | |
| 4602 | GCD Queries | interactive number theory | Statement | D | Codeforces Round 838 (Div. 2) {1762} | PROGRAMMING | 2000.0 | Codeforces Round #838 (Div. 2) Editorial | |
| 20770 | Divide and Conquer | greedy math number theory | Statement | A | Codeforces Round 838 (Div. 2) {1762} | PROGRAMMING | 500.0 | Codeforces Round #838 (Div. 2) Editorial | |
| 10254 | Binary Strings are Fun | combinatorics dp | Statement | C | Codeforces Round 838 (Div. 2) {1762} | PROGRAMMING | 1750.0 | Codeforces Round #838 (Div. 2) Editorial | |
| 2418 | Valid Bitonic Permutations | combinatorics dp implementation math | Statement | D | Codeforces Round 840 (Div. 2) and Enigma 2022 - Cybros LNMIIT {1763} | PROGRAMMING | 2000.0 | Codeforces Round #840 (Div. 2) and Enigma 2022 — Cybros LNMIIT Editorial | |
| 2272 | Node Pairs | dp graphs math | Statement | E | Codeforces Round 840 (Div. 2) and Enigma 2022 - Cybros LNMIIT {1763} | PROGRAMMING | 2000.0 | Codeforces Round #840 (Div. 2) and Enigma 2022 — Cybros LNMIIT Editorial | |
| 16703 | Incinerate | binary search brute force data structures sortings | Statement | B | Codeforces Round 840 (Div. 2) and Enigma 2022 - Cybros LNMIIT {1763} | PROGRAMMING | 1000.0 | Codeforces Round #840 (Div. 2) and Enigma 2022 — Cybros LNMIIT Editorial | |
| 948 | Edge Queries | data structures dp graphs | Statement | F | Codeforces Round 840 (Div. 2) and Enigma 2022 - Cybros LNMIIT {1763} | PROGRAMMING | 3000.0 | Codeforces Round #840 (Div. 2) and Enigma 2022 — Cybros LNMIIT Editorial | |
| 7998 | Another Array Problem | brute force constructive algorithms greedy | Statement | C | Codeforces Round 840 (Div. 2) and Enigma 2022 - Cybros LNMIIT {1763} | PROGRAMMING | 1500.0 | Codeforces Round #840 (Div. 2) and Enigma 2022 — Cybros LNMIIT Editorial | |
| 17190 | Absolute Maximization | bitmasks constructive algorithms greedy math | Statement | A | Codeforces Round 840 (Div. 2) and Enigma 2022 - Cybros LNMIIT {1763} | PROGRAMMING | 500.0 | Codeforces Round #840 (Div. 2) and Enigma 2022 — Cybros LNMIIT Editorial | |
| 18193 | Doremy's Perfect Math Class | number theory | Statement | B | Codeforces Global Round 24 {1764} | PROGRAMMING | 1000.0 | Codeforces Global Round 24 Editorial | |
| 762 | Doremy's Perfect DS Class (Medium Version) | binary search interactive | Statement | G2 | Codeforces Global Round 24 {1764} | PROGRAMMING | 500.0 | Codeforces Global Round 24 Editorial | |
| 635 | Doremy's Perfect DS Class (Hard Version) | binary search interactive | Statement | G3 | Codeforces Global Round 24 {1764} | PROGRAMMING | 500.0 | Codeforces Global Round 24 Editorial | |
| 818 | Doremy's Perfect DS Class (Easy Version) | binary search interactive | Statement | G1 | Codeforces Global Round 24 {1764} | PROGRAMMING | 2000.0 | Codeforces Global Round 24 Editorial | |
| 3245 | Doremy's Pegging Game | combinatorics geometry math | Statement | D | Codeforces Global Round 24 {1764} | PROGRAMMING | 1750.0 | Codeforces Global Round 24 Editorial | |
| 304 | Doremy's Paint 2 | data structures | Statement | H | Codeforces Global Round 24 {1764} | PROGRAMMING | 3500.0 | Codeforces Global Round 24 Editorial | |
| 17561 | Doremy's Paint | greedy | Statement | A | Codeforces Global Round 24 {1764} | PROGRAMMING | 500.0 | Codeforces Global Round 24 Editorial | |
| 1473 | Doremy's Number Line | binary search dp greedy sortings | Statement | E | Codeforces Global Round 24 {1764} | PROGRAMMING | 2250.0 | Codeforces Global Round 24 Editorial | |
| 1286 | Doremy's Experimental Tree | brute force constructive algorithms dfs and similar dsu sortings trees | Statement | F | Codeforces Global Round 24 {1764} | PROGRAMMING | 2250.0 | Codeforces Global Round 24 Editorial | |
| 10559 | Doremy's City Construction | constructive algorithms greedy math | Statement | C | Codeforces Global Round 24 {1764} | PROGRAMMING | 1500.0 | Codeforces Global Round 24 Editorial | |
| 35711 | Minimum LCM | math | Statement | M | 2022-2023 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Preferably Teams) {1765} | PROGRAMMING | 109642 | 1000 | |
| 12076 | Exchange | math | Statement | E | 2022-2023 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Preferably Teams) {1765} | PROGRAMMING | 109642 | 1000 | |
| 6907 | Torus Path | dp greedy math | Statement | K | 2022-2023 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Preferably Teams) {1765} | PROGRAMMING | 109642 | 1500 | |
| 6151 | Number Reduction | greedy | Statement | N | 2022-2023 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Preferably Teams) {1765} | PROGRAMMING | 109642 | 1500 | |
| 4990 | Watch the Videos | binary search constructive algorithms two pointers | Statement | D | 2022-2023 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Preferably Teams) {1765} | PROGRAMMING | 109642 | 1700 | |
| 1600 | Hospital Queue | binary search graphs greedy | Statement | H | 2022-2023 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Preferably Teams) {1765} | PROGRAMMING | 109642 | 2200 | |
| 802 | Chemistry Lab | dp geometry probabilities | Statement | F | 2022-2023 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Preferably Teams) {1765} | PROGRAMMING | 109642 | 2200 | |
| 701 | Project Manager | implementation | Statement | L | 2022-2023 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Preferably Teams) {1765} | PROGRAMMING | 109642 | 2400 | |
| 893 | Access Levels | flows graph matchings | Statement | A | 2022-2023 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Preferably Teams) {1765} | PROGRAMMING | 109642 | 2400 | |
| 499 | Guess the String | interactive | Statement | G | 2022-2023 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Preferably Teams) {1765} | PROGRAMMING | 109642 | 2600 | |
| 697 | Card Guessing | dp probabilities | Statement | C | 2022-2023 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Preferably Teams) {1765} | PROGRAMMING | 109642 | 2600 | |
| 312 | Infinite Chess | implementation shortest paths | Statement | I | 2022-2023 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Preferably Teams) {1765} | PROGRAMMING | 109642 | 2800 | |
| 401 | Hero to Zero | graph matchings | Statement | J | 2022-2023 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Preferably Teams) {1765} | PROGRAMMING | 109642 | 2900 | |
| 9983 | Broken Keyboard | greedy | Statement | B | 2022-2023 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Preferably Teams) {1765} | PROGRAMMING | 109642 | 800 | |
| 24177 | Notepad# | brute force greedy implementation | Statement | B | Educational Codeforces Round 139 (Rated for Div. 2) {1766} | PROGRAMMING | 110066 | ||
| 432 | MCF | flows | Statement | F | Educational Codeforces Round 139 (Rated for Div. 2) {1766} | PROGRAMMING | 110066 | ||
| 11032 | Lucky Chains | brute force dp greedy math number theory | Statement | D | Educational Codeforces Round 139 (Rated for Div. 2) {1766} | PROGRAMMING | 110066 | ||
| 15156 | Hamiltonian Wall | dfs and similar dp implementation | Statement | C | Educational Codeforces Round 139 (Rated for Div. 2) {1766} | PROGRAMMING | 110066 | ||
| 51333 | Extremely Round | implementation math | Statement | A | Educational Codeforces Round 139 (Rated for Div. 2) {1766} | PROGRAMMING | 110066 | ||
| 1555 | Decomposition | brute force divide and conquer dp matrices | Statement | E | Educational Codeforces Round 139 (Rated for Div. 2) {1766} | PROGRAMMING | 110066 | ||
| 470 | Two Subtrees | data structures trees | Statement | F | Educational Codeforces Round 140 (Rated for Div. 2) {1767} | PROGRAMMING | 110225 | ||
| 11397 | Playoff | combinatorics constructive algorithms dp graphs greedy | Statement | D | Educational Codeforces Round 140 (Rated for Div. 2) {1767} | PROGRAMMING | 110225 | ||
| 21696 | Cut the Triangle | geometry implementation | Statement | A | Educational Codeforces Round 140 (Rated for Div. 2) {1767} | PROGRAMMING | 110225 | ||
| 3197 | Count Binary Strings | Statement | C | Educational Codeforces Round 140 (Rated for Div. 2) {1767} | PROGRAMMING | 110225 | |||
| 22243 | Block Towers | greedy sortings | Statement | B | Educational Codeforces Round 140 (Rated for Div. 2) {1767} | PROGRAMMING | 110225 | ||
| 1342 | Algebra Flash | bitmasks brute force dp graphs meet-in-the-middle trees | Statement | E | Educational Codeforces Round 140 (Rated for Div. 2) {1767} | PROGRAMMING | 110225 | ||
| 1306 | Wonderful Jump | constructive algorithms dp | Statement | F | Codeforces Round 842 (Div. 2) {1768} | PROGRAMMING | 3250.0 | Codeforces Round #842 (Div. 2) Editorial | |
| 26022 | Quick Sort | greedy math | Statement | B | Codeforces Round 842 (Div. 2) {1768} | PROGRAMMING | 1000.0 | Codeforces Round #842 (Div. 2) Editorial | |
| 2381 | Partial Sorting | combinatorics fft math number theory | Statement | E | Codeforces Round 842 (Div. 2) {1768} | PROGRAMMING | 2250.0 | Codeforces Round #842 (Div. 2) Editorial | |
| 9383 | Lucky Permutation | dfs and similar dsu graphs greedy | Statement | D | Codeforces Round 842 (Div. 2) {1768} | PROGRAMMING | 1750.0 | Codeforces Round #842 (Div. 2) Editorial | |
| 31274 | Greatest Convex | greedy math number theory | Statement | A | Codeforces Round 842 (Div. 2) {1768} | PROGRAMMING | 500.0 | Codeforces Round #842 (Div. 2) Editorial | |
| 15891 | Elemental Decompress | constructive algorithms greedy implementation sortings | Statement | C | Codeforces Round 842 (Div. 2) {1768} | PROGRAMMING | 1500.0 | Codeforces Round #842 (Div. 2) Editorial | |
| 2181 | Узкая дорога | *special | Statement | A | VK Cup 2022 - Квалификация (Engine) {1769} | PROGRAMMING | |||
| 1095 | Подкрутка II | *special | Statement | C2 | VK Cup 2022 - Квалификация (Engine) {1769} | PROGRAMMING | |||
| 1128 | Подкрутка I | *special | Statement | C1 | VK Cup 2022 - Квалификация (Engine) {1769} | PROGRAMMING | |||
| 964 | Копирование файлов II | *special | Statement | B2 | VK Cup 2022 - Квалификация (Engine) {1769} | PROGRAMMING | |||
| 1635 | Копирование файлов I | *special | Statement | B1 | VK Cup 2022 - Квалификация (Engine) {1769} | PROGRAMMING | |||
| 130 | Игра в Девятку III | *special | Statement | D3 | VK Cup 2022 - Квалификация (Engine) {1769} | PROGRAMMING | |||
| 213 | Игра в Девятку II | *special | Statement | D2 | VK Cup 2022 - Квалификация (Engine) {1769} | PROGRAMMING | |||
| 424 | Игра в Девятку I | *special | Statement | D1 | VK Cup 2022 - Квалификация (Engine) {1769} | PROGRAMMING | |||
| 175 | Koxia, Mahiru and Winter Festival | constructive algorithms | Statement | H | Good Bye 2022: 2023 is NEAR {1770} | PROGRAMMING | 4000.0 | Good Bye 2022 -- Editorial | |
| 25529 | Koxia and Whiteboards | brute force greedy | Statement | A | Good Bye 2022: 2023 is NEAR {1770} | PROGRAMMING | 500.0 | Good Bye 2022 -- Editorial | |
| 1655 | Koxia and Tree | combinatorics dp math probabilities trees | Statement | E | Good Bye 2022: 2023 is NEAR {1770} | PROGRAMMING | 2000.0 | Good Bye 2022 -- Editorial | |
| 1105 | Koxia and Sequence | bitmasks combinatorics math | Statement | F | Good Bye 2022: 2023 is NEAR {1770} | PROGRAMMING | 2500.0 | Good Bye 2022 -- Editorial | |
| 21056 | Koxia and Permutation | constructive algorithms | Statement | B | Good Bye 2022: 2023 is NEAR {1770} | PROGRAMMING | 750.0 | Good Bye 2022 -- Editorial | |
| 9816 | Koxia and Number Theory | chinese remainder theorem math number theory | Statement | C | Good Bye 2022: 2023 is NEAR {1770} | PROGRAMMING | 1250.0 | Good Bye 2022 -- Editorial | |
| 4505 | Koxia and Game | data structures dfs and similar dsu games graph matchings graphs implementation | Statement | D | Good Bye 2022: 2023 is NEAR {1770} | PROGRAMMING | 1500.0 | Good Bye 2022 -- Editorial | |
| 197 | Koxia and Bracket | divide and conquer fft math | Statement | G | Good Bye 2022: 2023 is NEAR {1770} | PROGRAMMING | 3250.0 | Good Bye 2022 -- Editorial | |
| 12028 | Hossam and Trainees | math number theory | Statement | C | Codeforces Round 837 (Div. 2) {1771} | PROGRAMMING | 1750.0 | Codeforces Round #837 (Div. 2) Editorial | |
| 3321 | Hossam and (sub-)palindromic tree | brute force dfs and similar dp trees | Statement | D | Codeforces Round 837 (Div. 2) {1771} | PROGRAMMING | 2250.0 | Codeforces Round #837 (Div. 2) Editorial | |
| 1727 | Hossam and Range Minimum Query | binary search bitmasks data structures hashing probabilities strings trees | Statement | F | Codeforces Round 837 (Div. 2) {1771} | PROGRAMMING | 3500.0 | Codeforces Round #837 (Div. 2) Editorial | |
| 23017 | Hossam and Friends | binary search constructive algorithms dp two pointers | Statement | B | Codeforces Round 837 (Div. 2) {1771} | PROGRAMMING | 1000.0 | Codeforces Round #837 (Div. 2) Editorial | |
| 25742 | Hossam and Combinatorics | combinatorics math sortings | Statement | A | Codeforces Round 837 (Div. 2) {1771} | PROGRAMMING | 500.0 | Codeforces Round #837 (Div. 2) Editorial | |
| 859 | Hossam and a Letter | brute force dp implementation two pointers | Statement | E | Codeforces Round 837 (Div. 2) {1771} | PROGRAMMING | 2750.0 | Codeforces Round #837 (Div. 2) Editorial | |
| 7801 | Permutation Game | games | Statement | E | Codeforces Round 839 (Div. 3) {1772} | PROGRAMMING | 110313 | ||
| 33512 | Matrix Rotation | brute force | Statement | B | Codeforces Round 839 (Div. 3) {1772} | PROGRAMMING | 110313 | ||
| 1654 | Gaining Rating | binary search greedy math sortings | Statement | G | Codeforces Round 839 (Div. 3) {1772} | PROGRAMMING | 110313 | ||
| 26532 | Different Differences | greedy math | Statement | C | Codeforces Round 839 (Div. 3) {1772} | PROGRAMMING | 110313 | ||
| 2894 | Copy of a Copy of a Copy | constructive algorithms sortings | Statement | F | Codeforces Round 839 (Div. 3) {1772} | PROGRAMMING | 110313 | ||
| 19082 | Absolute Sorting | math | Statement | D | Codeforces Round 839 (Div. 3) {1772} | PROGRAMMING | 110313 | ||
| 62356 | A+B? | implementation | Statement | A | Codeforces Round 839 (Div. 3) {1772} | PROGRAMMING | 110313 | ||
| 6169 | Easy Assembly | sortings | Statement | E | 2022-2023 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1773} | PROGRAMMING | 1400 | ||
| 1701 | King's Puzzle | constructive algorithms | Statement | K | 2022-2023 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1773} | PROGRAMMING | 1900 | ||
| 1979 | Amazing Trick | constructive algorithms probabilities | Statement | A | 2022-2023 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1773} | PROGRAMMING | 1900 | ||
| 991 | BinCoin | divide and conquer hashing implementation probabilities trees | Statement | B | 2022-2023 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1773} | PROGRAMMING | 2200 | ||
| 592 | Interactive Factorial Guessing | brute force games implementation interactive | Statement | I | 2022-2023 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1773} | PROGRAMMING | 2500 | ||
| 510 | Hot and Cold | binary search interactive | Statement | H | 2022-2023 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1773} | PROGRAMMING | 2600 | ||
| 652 | Dominoes | flows graph matchings | Statement | D | 2022-2023 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1773} | PROGRAMMING | 2600 | ||
| 569 | Game of Questions | bitmasks dp math probabilities | Statement | G | 2022-2023 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1773} | PROGRAMMING | 2800 | ||
| 156 | Jumbled Trees | Statement | J | 2022-2023 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1773} | PROGRAMMING | 2900 | |||
| 131 | Lisa's Sequences | dp | Statement | L | 2022-2023 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1773} | PROGRAMMING | 3500 | ||
| 63 | Cactus Meets Torus | Statement | C | 2022-2023 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1773} | PROGRAMMING | 3500 | |||
| 4921 | Football | constructive algorithms | Statement | F | 2022-2023 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1773} | PROGRAMMING | 800 | ||
| 4036 | Two Chess Pieces | dfs and similar dp greedy trees | Statement | E | Polynomial Round 2022 (Div. 1 + Div. 2, Rated, Prizes!) {1774} | PROGRAMMING | 2000.0 | Polynomial Round 2022 (Div. 1 + Div. 2) Editorial | |
| 710 | Segment Covering | brute force combinatorics constructive algorithms data structures trees | Statement | G | Polynomial Round 2022 (Div. 1 + Div. 2, Rated, Prizes!) {1774} | PROGRAMMING | 3250.0 | Polynomial Round 2022 (Div. 1 + Div. 2) Editorial | |
| 9461 | Same Count One | brute force constructive algorithms implementation two pointers | Statement | D | Polynomial Round 2022 (Div. 1 + Div. 2, Rated, Prizes!) {1774} | PROGRAMMING | 1500.0 | Polynomial Round 2022 (Div. 1 + Div. 2) Editorial | |
| 162 | Maximum Permutation | constructive algorithms | Statement | H | Polynomial Round 2022 (Div. 1 + Div. 2, Rated, Prizes!) {1774} | PROGRAMMING | 4000.0 | Polynomial Round 2022 (Div. 1 + Div. 2) Editorial | |
| 939 | Magician and Pigs (Hard Version) | brute force data structures | Statement | F2 | Polynomial Round 2022 (Div. 1 + Div. 2, Rated, Prizes!) {1774} | PROGRAMMING | 1000.0 | Polynomial Round 2022 (Div. 1 + Div. 2) Editorial | |
| 1311 | Magician and Pigs (Easy Version) | brute force implementation | Statement | F1 | Polynomial Round 2022 (Div. 1 + Div. 2, Rated, Prizes!) {1774} | PROGRAMMING | 1500.0 | Polynomial Round 2022 (Div. 1 + Div. 2) Editorial | |
| 13393 | Ice and Fire | constructive algorithms dp greedy | Statement | C | Polynomial Round 2022 (Div. 1 + Div. 2, Rated, Prizes!) {1774} | PROGRAMMING | 1500.0 | Polynomial Round 2022 (Div. 1 + Div. 2) Editorial | |
| 14196 | Coloring | constructive algorithms greedy | Statement | B | Polynomial Round 2022 (Div. 1 + Div. 2, Rated, Prizes!) {1774} | PROGRAMMING | 1000.0 | Polynomial Round 2022 (Div. 1 + Div. 2) Editorial | |
| 23743 | Add Plus Minus Sign | constructive algorithms math | Statement | A | Polynomial Round 2022 (Div. 1 + Div. 2, Rated, Prizes!) {1774} | PROGRAMMING | 500.0 | Polynomial Round 2022 (Div. 1 + Div. 2) Editorial | |
| 3987 | The Human Equation | data structures dp dsu greedy | Statement | E | Codeforces Round 843 (Div. 2) {1775} | PROGRAMMING | 2250.0 | Codeforces Round #843 (Div. 2) Editorial | |
| 925 | Laboratory on Pluto | brute force combinatorics dp fft greedy math | Statement | F | Codeforces Round 843 (Div. 2) {1775} | PROGRAMMING | 3000.0 | Codeforces Round #843 (Div. 2) Editorial | |
| 15121 | Interesting Sequence | binary search bitmasks math | Statement | C | Codeforces Round 843 (Div. 2) {1775} | PROGRAMMING | 1500.0 | Codeforces Round #843 (Div. 2) Editorial | |
| 20090 | Gardener and the Capybaras (hard version) | constructive algorithms greedy strings | Statement | A2 | Codeforces Round 843 (Div. 2) {1775} | PROGRAMMING | 500.0 | Codeforces Round #843 (Div. 2) Editorial | |
| 20501 | Gardener and the Capybaras (easy version) | brute force implementation strings | Statement | A1 | Codeforces Round 843 (Div. 2) {1775} | PROGRAMMING | 500.0 | Codeforces Round #843 (Div. 2) Editorial | |
| 22356 | Gardener and the Array | bitmasks constructive algorithms | Statement | B | Codeforces Round 843 (Div. 2) {1775} | PROGRAMMING | 1000.0 | Codeforces Round #843 (Div. 2) Editorial | |
| 9106 | Friendly Spiders | dfs and similar graphs math number theory shortest paths | Statement | D | Codeforces Round 843 (Div. 2) {1775} | PROGRAMMING | 2000.0 | Codeforces Round #843 (Div. 2) Editorial | |
| 8107 | Walking Boy | greedy | Statement | A | SWERC 2022-2023 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1776} | PROGRAMMING | |||
| 1598 | Vittorio Plays with LEGO Bricks | dp | Statement | B | SWERC 2022-2023 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1776} | PROGRAMMING | |||
| 221 | Uniform Chemistry | dp math | Statement | K | SWERC 2022-2023 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1776} | PROGRAMMING | |||
| 4280 | Train Splitting | constructive algorithms graphs greedy | Statement | F | SWERC 2022-2023 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1776} | PROGRAMMING | |||
| 648 | Teamwork | greedy | Statement | D | SWERC 2022-2023 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1776} | PROGRAMMING | |||
| 943 | Spinach Pizza | games geometry greedy interactive | Statement | I | SWERC 2022-2023 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1776} | PROGRAMMING | |||
| 519 | Parmigiana With Seafood | trees | Statement | M | SWERC 2022-2023 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1776} | PROGRAMMING | |||
| 1007 | Library game | games greedy interactive sortings | Statement | C | SWERC 2022-2023 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1776} | PROGRAMMING | |||
| 931 | Italian Data Centers | graphs | Statement | J | SWERC 2022-2023 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1776} | PROGRAMMING | |||
| 119 | Crossing the Railways | data structures dp | Statement | E | SWERC 2022-2023 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1776} | PROGRAMMING | |||
| 108 | Count Permutations | math | Statement | N | SWERC 2022-2023 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1776} | PROGRAMMING | |||
| 12777 | Controllers | binary search math | Statement | L | SWERC 2022-2023 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1776} | PROGRAMMING | |||
| 7674 | Beppa and SwerChat | two pointers | Statement | H | SWERC 2022-2023 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1776} | PROGRAMMING | |||
| 2468 | Another Wine Tasting Event | combinatorics constructive algorithms strings | Statement | G | SWERC 2022-2023 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1776} | PROGRAMMING | |||
| 4972 | Score of a Tree | bitmasks combinatorics dfs and similar dp probabilities trees | Statement | D | Codeforces Round 845 (Div. 2) and ByteRace 2023 {1777} | PROGRAMMING | 2000.0 | Codeforces Round #845 (Div. 2) and ByteRace 2023 Editorial | |
| 13090 | Quiz Master | math sortings two pointers | Statement | C | Codeforces Round 845 (Div. 2) and ByteRace 2023 {1777} | PROGRAMMING | 1500.0 | Codeforces Round #845 (Div. 2) and ByteRace 2023 Editorial | |
| 48911 | Everybody Likes Good Arrays! | greedy math | Statement | A | Codeforces Round 845 (Div. 2) and ByteRace 2023 {1777} | PROGRAMMING | 500.0 | Codeforces Round #845 (Div. 2) and ByteRace 2023 Editorial | |
| 19463 | Emordnilap | greedy math | Statement | B | Codeforces Round 845 (Div. 2) and ByteRace 2023 {1777} | PROGRAMMING | 1000.0 | Codeforces Round #845 (Div. 2) and ByteRace 2023 Editorial | |
| 2480 | Edge Reverse | binary search dfs and similar dsu graphs | Statement | E | Codeforces Round 845 (Div. 2) and ByteRace 2023 {1777} | PROGRAMMING | 2250.0 | Codeforces Round #845 (Div. 2) and ByteRace 2023 Editorial | |
| 1486 | Comfortably Numb | binary search bitmasks data structures divide and conquer dsu strings trees two pointers | Statement | F | Codeforces Round 845 (Div. 2) and ByteRace 2023 {1777} | PROGRAMMING | 2750.0 | Codeforces Round #845 (Div. 2) and ByteRace 2023 Editorial | |
| 1199 | The Tree Has Fallen! | bitmasks dfs and similar math trees | Statement | E | Codeforces Round 848 (Div. 2) {1778} | PROGRAMMING | 2250.0 | Codeforces Round #848 (Div. 2) Editorial | |
| 14657 | The Forbidden Permutation | greedy math | Statement | B | Codeforces Round 848 (Div. 2) {1778} | PROGRAMMING | 1000.0 | Codeforces Round #848 (Div. 2) Editorial | |
| 981 | Maximizing Root | dfs and similar dp graphs math trees | Statement | F | Codeforces Round 848 (Div. 2) {1778} | PROGRAMMING | 2750.0 | Codeforces Round #848 (Div. 2) Editorial | |
| 25888 | Flip Flop Sum | greedy implementation | Statement | A | Codeforces Round 848 (Div. 2) {1778} | PROGRAMMING | 500.0 | Codeforces Round #848 (Div. 2) Editorial | |
| 3600 | Flexible String Revisit | combinatorics dp math probabilities | Statement | D | Codeforces Round 848 (Div. 2) {1778} | PROGRAMMING | 1750.0 | Codeforces Round #848 (Div. 2) Editorial | |
| 11795 | Flexible String | bitmasks brute force strings | Statement | C | Codeforces Round 848 (Div. 2) {1778} | PROGRAMMING | 1250.0 | Codeforces Round #848 (Div. 2) Editorial | |
| 1469 | Xorcerer's Stones | constructive algorithms dp trees | Statement | F | Hello 2023 {1779} | PROGRAMMING | 2250.0 | ||
| 455 | The Game of the Century | constructive algorithms graphs shortest paths | Statement | G | Hello 2023 {1779} | PROGRAMMING | 2750.0 | ||
| 176 | Olympic Team Building | brute force meet-in-the-middle | Statement | H | Hello 2023 {1779} | PROGRAMMING | 4000.0 | ||
| 25243 | MKnez's ConstructiveForces Task | constructive algorithms math | Statement | B | Hello 2023 {1779} | PROGRAMMING | 750.0 | ||
| 14838 | Least Prefix Sum | data structures greedy | Statement | C | Hello 2023 {1779} | PROGRAMMING | 1250.0 | ||
| 24156 | Hall of Fame | constructive algorithms greedy math strings | Statement | A | Hello 2023 {1779} | PROGRAMMING | 500.0 | ||
| 9189 | Boris and His Amazing Haircut | constructive algorithms data structures dp dsu greedy | Statement | D | Hello 2023 {1779} | PROGRAMMING | 1500.0 | ||
| 2108 | Anya's Simultaneous Exhibition | constructive algorithms data structures graphs greedy interactive sortings | Statement | E | Hello 2023 {1779} | PROGRAMMING | 2250.0 | ||
| 2002 | Three Chairs | bitmasks brute force combinatorics data structures number theory sortings | Statement | F | Codeforces Round 846 (Div. 2) {1780} | PROGRAMMING | 2000.0 | 111841 | |
| 1981 | Josuke and Complete Graph | binary search brute force data structures number theory | Statement | E | Codeforces Round 846 (Div. 2) {1780} | PROGRAMMING | 1750.0 | 111841 | |
| 22810 | Hayato and School | constructive algorithms greedy | Statement | A | Codeforces Round 846 (Div. 2) {1780} | PROGRAMMING | 500.0 | 111841 | |
| 27912 | GCD Partition | brute force greedy math number theory | Statement | B | Codeforces Round 846 (Div. 2) {1780} | PROGRAMMING | 1000.0 | 111841 | |
| 1064 | Delicious Dessert | math number theory string suffix structures strings | Statement | G | Codeforces Round 846 (Div. 2) {1780} | PROGRAMMING | 2500.0 | 111841 | |
| 5964 | Bit Guessing Game | binary search bitmasks interactive | Statement | D | Codeforces Round 846 (Div. 2) {1780} | PROGRAMMING | 1500.0 | 111841 | |
| 138 | Window Signals (hard version) | Statement | H2 | VK Cup 2022 - Отборочный раунд (Engine) {1781} | PROGRAMMING | 1500.0 | Tutorial | ||
| 439 | Window Signals (easy version) | Statement | H1 | VK Cup 2022 - Отборочный раунд (Engine) {1781} | PROGRAMMING | 3750.0 | Tutorial | ||
| 1467 | Rectangle Shrinking | binary search data structures greedy implementation two pointers | Statement | E | VK Cup 2022 - Отборочный раунд (Engine) {1781} | PROGRAMMING | 2750.0 | Tutorial | |
| 16146 | Parallel Projection | math | Statement | A | VK Cup 2022 - Отборочный раунд (Engine) {1781} | PROGRAMMING | 500.0 | Tutorial | |
| 6400 | Many Perfect Squares | brute force math number theory | Statement | D | VK Cup 2022 - Отборочный раунд (Engine) {1781} | PROGRAMMING | 2000.0 | Tutorial | |
| 15059 | Going to the Cinema | binary search math sortings two pointers | Statement | B | VK Cup 2022 - Отборочный раунд (Engine) {1781} | PROGRAMMING | 1000.0 | Tutorial | |
| 11163 | Equal Frequencies | greedy implementation | Statement | C | VK Cup 2022 - Отборочный раунд (Engine) {1781} | PROGRAMMING | 1500.0 | Tutorial | |
| 317 | Diverse Coloring | trees | Statement | G | VK Cup 2022 - Отборочный раунд (Engine) {1781} | PROGRAMMING | 3500.0 | Tutorial | |
| 1390 | Bracket Insertion | brute force combinatorics constructive algorithms dp math trees | Statement | F | VK Cup 2022 - Отборочный раунд (Engine) {1781} | PROGRAMMING | 3250.0 | Tutorial | |
| 11120 | Yet Another Tournament | binary search greedy sortings | Statement | C | Educational Codeforces Round 141 (Rated for Div. 2) {1783} | PROGRAMMING | Educational Codeforces Round 141 Editorial | ||
| 652 | Weighed Tree Radius | data structures divide and conquer trees | Statement | G | Educational Codeforces Round 141 (Rated for Div. 2) {1783} | PROGRAMMING | Educational Codeforces Round 141 Editorial | ||
| 19535 | Matrix of Differences | constructive algorithms | Statement | B | Educational Codeforces Round 141 (Rated for Div. 2) {1783} | PROGRAMMING | Educational Codeforces Round 141 Editorial | ||
| 53998 | Make it Beautiful | constructive algorithms sortings | Statement | A | Educational Codeforces Round 141 (Rated for Div. 2) {1783} | PROGRAMMING | Educational Codeforces Round 141 Editorial | ||
| 2546 | Game of the Year | brute force math number theory | Statement | E | Educational Codeforces Round 141 (Rated for Div. 2) {1783} | PROGRAMMING | Educational Codeforces Round 141 Editorial | ||
| 1470 | Double Sort II | dfs and similar flows graphs greedy | Statement | F | Educational Codeforces Round 141 (Rated for Div. 2) {1783} | PROGRAMMING | Educational Codeforces Round 141 Editorial | ||
| 5409 | Different Arrays | brute force dp | Statement | D | Educational Codeforces Round 141 (Rated for Div. 2) {1783} | PROGRAMMING | Educational Codeforces Round 141 Editorial | ||
| 1423 | Wooden Spoon | combinatorics dp | Statement | D | VK Cup 2022 - Финальный раунд (Engine) {1784} | PROGRAMMING | 2000.0 | Codeforces Round #850 Editorial | |
| 2005 | Monsters (hard version) | data structures | Statement | C | VK Cup 2022 - Финальный раунд (Engine) {1784} | PROGRAMMING | 1750.0 | Codeforces Round #850 Editorial | |
| 17425 | Monsters (easy version) | greedy | Statement | A | VK Cup 2022 - Финальный раунд (Engine) {1784} | PROGRAMMING | 500.0 | Codeforces Round #850 Editorial | |
| 407 | Minimums or Medians | Statement | F | VK Cup 2022 - Финальный раунд (Engine) {1784} | PROGRAMMING | 4000.0 | Codeforces Round #850 Editorial | ||
| 3703 | Letter Exchange | constructive algorithms constructive algorithms | Statement | B | VK Cup 2022 - Финальный раунд (Engine) {1784} | PROGRAMMING | 1250.0 | Codeforces Round #850 Editorial | |
| 511 | Infinite Game | combinatorics dp games probabilities | Statement | E | VK Cup 2022 - Финальный раунд (Engine) {1784} | PROGRAMMING | 3000.0 | Codeforces Round #850 Editorial | |
| 14880 | Non-alternating Deck (easy version) | implementation | Statement | A1 | Codeforces Round 850 (Div. 2, based on VK Cup 2022 - Final Round) {1786} | PROGRAMMING | 500.0 | Codeforces Round #850 Editorial | |
| 9906 | Cake Assembly Line | brute force sortings | Statement | B | Codeforces Round 850 (Div. 2, based on VK Cup 2022 - Final Round) {1786} | PROGRAMMING | 1000.0 | Codeforces Round #850 Editorial | |
| 12264 | Alternating Deck (hard version) | implementation | Statement | A2 | Codeforces Round 850 (Div. 2, based on VK Cup 2022 - Final Round) {1786} | PROGRAMMING | 500.0 | Codeforces Round #850 Editorial | |
| 426 | Treasure Hunt | divide and conquer two pointers | Statement | I | TypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!) {1787} | PROGRAMMING | 3750.0 | TypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 2813 | The Harmonization of XOR | bitmasks constructive algorithms greedy math | Statement | E | TypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!) {1787} | PROGRAMMING | 2250.0 | TypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 8496 | Remove the Bracket | dp greedy math | Statement | C | TypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!) {1787} | PROGRAMMING | 1750.0 | TypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 15216 | Number Factorization | greedy math number theory | Statement | B | TypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!) {1787} | PROGRAMMING | 1000.0 | TypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 852 | Inverse Transformation | constructive algorithms implementation math | Statement | F | TypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!) {1787} | PROGRAMMING | 2500.0 | TypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 3876 | Game on Axis | combinatorics dsu graphs implementation | Statement | D | TypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!) {1787} | PROGRAMMING | 2000.0 | TypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 20567 | Exponential Equation | constructive algorithms math | Statement | A | TypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!) {1787} | PROGRAMMING | 500.0 | TypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 639 | Colorful Tree Again | data structures | Statement | G | TypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!) {1787} | PROGRAMMING | 3250.0 | TypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 349 | Codeforces Scoreboard | data structures dp ternary search | Statement | H | TypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!) {1787} | PROGRAMMING | 3500.0 | TypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 1243 | XOR, Tree, and Queries | constructive algorithms dfs and similar dsu graphs trees | Statement | F | Codeforces Round 851 (Div. 2) {1788} | PROGRAMMING | 3000.0 | Codeforces Round #851 (Div. 2) Editorial | |
| 3497 | Sum Over Zero | data structures dp | Statement | E | Codeforces Round 851 (Div. 2) {1788} | PROGRAMMING | 2500.0 | Codeforces Round #851 (Div. 2) Editorial | |
| 22726 | Sum of Two Numbers | constructive algorithms greedy implementation math | Statement | B | Codeforces Round 851 (Div. 2) {1788} | PROGRAMMING | 1000.0 | Codeforces Round #851 (Div. 2) Editorial | |
| 58595 | One and Two | brute force math | Statement | A | Codeforces Round 851 (Div. 2) {1788} | PROGRAMMING | 500.0 | Codeforces Round #851 (Div. 2) Editorial | |
| 4806 | Moving Dots | binary search brute force combinatorics dp math two pointers | Statement | D | Codeforces Round 851 (Div. 2) {1788} | PROGRAMMING | 2250.0 | Codeforces Round #851 (Div. 2) Editorial | |
| 19738 | Matching Numbers | constructive algorithms greedy math | Statement | C | Codeforces Round 851 (Div. 2) {1788} | PROGRAMMING | 1500.0 | Codeforces Round #851 (Div. 2) Editorial | |
| 10110 | Serval and Toxel's Arrays | combinatorics implementation math | Statement | C | Codeforces Round 853 (Div. 2) {1789} | PROGRAMMING | 1250.0 | Codeforces Round #853 (Div. 2) Editorial | |
| 1975 | Serval and Shift-Shift-Shift | bitmasks brute force constructive algorithms implementation | Statement | D | Codeforces Round 853 (Div. 2) {1789} | PROGRAMMING | 1750.0 | Codeforces Round #853 (Div. 2) Editorial | |
| 1010 | Serval and Music Game | brute force combinatorics implementation math number theory | Statement | E | Codeforces Round 853 (Div. 2) {1789} | PROGRAMMING | 2000.0 | Codeforces Round #853 (Div. 2) Editorial | |
| 37301 | Serval and Mocha's Array | brute force math number theory | Statement | A | Codeforces Round 853 (Div. 2) {1789} | PROGRAMMING | 500.0 | Codeforces Round #853 (Div. 2) Editorial | |
| 17760 | Serval and Inversion Magic | implementation strings | Statement | B | Codeforces Round 853 (Div. 2) {1789} | PROGRAMMING | 1000.0 | Codeforces Round #853 (Div. 2) Editorial | |
| 1033 | Serval and Brain Power | brute force dp dp greedy implementation | Statement | F | Codeforces Round 853 (Div. 2) {1789} | PROGRAMMING | 2750.0 | Codeforces Round #853 (Div. 2) Editorial | |
| 17658 | Vlad and a Pair of Numbers | bitmasks constructive algorithms | Statement | E | Codeforces Round 847 (Div. 3) {1790} | PROGRAMMING | 111948 | ||
| 1357 | Tokens on Graph | constructive algorithms dfs and similar graphs shortest paths | Statement | G | Codeforces Round 847 (Div. 3) {1790} | PROGRAMMING | 111948 | ||
| 4206 | Timofey and Black-White Tree | brute force dfs and similar divide and conquer graphs greedy math shortest paths trees | Statement | F | Codeforces Round 847 (Div. 3) {1790} | PROGRAMMING | 111948 | ||
| 29228 | Taisia and Dice | greedy greedy math | Statement | B | Codeforces Round 847 (Div. 3) {1790} | PROGRAMMING | 111948 | ||
| 27273 | Premutation | brute force implementation math | Statement | C | Codeforces Round 847 (Div. 3) {1790} | PROGRAMMING | 111948 | ||
| 41549 | Polycarp and the Day of Pi | implementation math strings | Statement | A | Codeforces Round 847 (Div. 3) {1790} | PROGRAMMING | 111948 | ||
| 34397 | Matryoshkas | data structures greedy sortings | Statement | D | Codeforces Round 847 (Div. 3) {1790} | PROGRAMMING | 111948 | ||
| 6212 | Teleporters (Hard Version) | binary search greedy sortings | Statement | G2 | Codeforces Round 849 (Div. 4) {1791} | PROGRAMMING | 112282 | ||
| 36590 | Teleporters (Easy Version) | greedy sortings | Statement | G1 | Codeforces Round 849 (Div. 4) {1791} | PROGRAMMING | 112282 | ||
| 15992 | Range Update Point Query | binary search brute force data structures | Statement | F | Codeforces Round 849 (Div. 4) {1791} | PROGRAMMING | 112282 | ||
| 80913 | Prepend and Append | implementation two pointers | Statement | C | Codeforces Round 849 (Div. 4) {1791} | PROGRAMMING | 112282 | ||
| 44250 | Negatives and Positives | greedy sortings | Statement | E | Codeforces Round 849 (Div. 4) {1791} | PROGRAMMING | 112282 | ||
| 53837 | Following Directions | geometry implementation | Statement | B | Codeforces Round 849 (Div. 4) {1791} | PROGRAMMING | 112282 | ||
| 53754 | Distinct Split | brute force greedy strings | Statement | D | Codeforces Round 849 (Div. 4) {1791} | PROGRAMMING | 112282 | ||
| 83912 | Codeforces Checking | implementation strings | Statement | A | Codeforces Round 849 (Div. 4) {1791} | PROGRAMMING | 112282 | ||
| 24595 | Stand-up Comedian | greedy math | Statement | B | Educational Codeforces Round 142 (Rated for Div. 2) {1792} | PROGRAMMING | 111835 | ||
| 17209 | Min Max Sort | binary search brute force greedy math | Statement | C | Educational Codeforces Round 142 (Rated for Div. 2) {1792} | PROGRAMMING | 111835 | ||
| 575 | Graph Coloring (hard version) | brute force fft | Statement | F2 | Educational Codeforces Round 142 (Rated for Div. 2) {1792} | PROGRAMMING | 111835 |