Review the problem statement from Codeforces (link will open a new tab). When you've matched your problem, go to the solutions.
Get exact match for tags using this format, eg: [u'brute force', 'dp']
< 1 2 3 ... 82 83 84 85 86 ... 100 101 102 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 420 | 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 | |
| 417 | 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 | |
| 220 | 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 | |
| 220 | 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 | |
| 9204 | 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 | |
| 21636 | Notepad# | brute force greedy implementation | Statement | B | Educational Codeforces Round 139 (Rated for Div. 2) {1766} | PROGRAMMING | 110066 | ||
| 294 | MCF | flows | Statement | F | Educational Codeforces Round 139 (Rated for Div. 2) {1766} | PROGRAMMING | 110066 | ||
| 9206 | Lucky Chains | brute force dp greedy math number theory | Statement | D | Educational Codeforces Round 139 (Rated for Div. 2) {1766} | PROGRAMMING | 110066 | ||
| 13911 | Hamiltonian Wall | dfs and similar dp implementation | Statement | C | Educational Codeforces Round 139 (Rated for Div. 2) {1766} | PROGRAMMING | 110066 | ||
| 28560 | Extremely Round | implementation math | Statement | A | Educational Codeforces Round 139 (Rated for Div. 2) {1766} | PROGRAMMING | 110066 | ||
| 1265 | Decomposition | brute force divide and conquer dp matrices | Statement | E | Educational Codeforces Round 139 (Rated for Div. 2) {1766} | PROGRAMMING | 110066 | ||
| 333 | Two Subtrees | data structures trees | Statement | F | Educational Codeforces Round 140 (Rated for Div. 2) {1767} | PROGRAMMING | 110225 | ||
| 10197 | Playoff | combinatorics constructive algorithms dp graphs greedy | Statement | D | Educational Codeforces Round 140 (Rated for Div. 2) {1767} | PROGRAMMING | 110225 | ||
| 20749 | Cut the Triangle | geometry implementation | Statement | A | Educational Codeforces Round 140 (Rated for Div. 2) {1767} | PROGRAMMING | 110225 | ||
| 2708 | Count Binary Strings | Statement | C | Educational Codeforces Round 140 (Rated for Div. 2) {1767} | PROGRAMMING | 110225 | |||
| 20693 | Block Towers | greedy sortings | Statement | B | Educational Codeforces Round 140 (Rated for Div. 2) {1767} | PROGRAMMING | 110225 | ||
| 995 | 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 | ||
| 909 | Wonderful Jump | constructive algorithms dp | Statement | F | Codeforces Round 842 (Div. 2) {1768} | PROGRAMMING | 3250.0 | Codeforces Round #842 (Div. 2) Editorial | |
| 23664 | Quick Sort | greedy math | Statement | B | Codeforces Round 842 (Div. 2) {1768} | PROGRAMMING | 1000.0 | Codeforces Round #842 (Div. 2) Editorial | |
| 1947 | Partial Sorting | combinatorics fft math number theory | Statement | E | Codeforces Round 842 (Div. 2) {1768} | PROGRAMMING | 2250.0 | Codeforces Round #842 (Div. 2) Editorial | |
| 7396 | Lucky Permutation | dfs and similar ds graphs greedy | Statement | D | Codeforces Round 842 (Div. 2) {1768} | PROGRAMMING | 1750.0 | Codeforces Round #842 (Div. 2) Editorial | |
| 29337 | Greatest Convex | greedy math number theory | Statement | A | Codeforces Round 842 (Div. 2) {1768} | PROGRAMMING | 500.0 | Codeforces Round #842 (Div. 2) Editorial | |
| 14524 | Elemental Decompress | constructive algorithms greedy implementation sortings | Statement | C | Codeforces Round 842 (Div. 2) {1768} | PROGRAMMING | 1500.0 | Codeforces Round #842 (Div. 2) Editorial | |
| 1995 | Узкая дорога | *special | Statement | A | VK Cup 2022 - Квалификация (Engine) {1769} | PROGRAMMING | |||
| 989 | Подкрутка II | *special | Statement | C2 | VK Cup 2022 - Квалификация (Engine) {1769} | PROGRAMMING | |||
| 991 | Подкрутка I | *special | Statement | C1 | VK Cup 2022 - Квалификация (Engine) {1769} | PROGRAMMING | |||
| 890 | Копирование файлов II | *special | Statement | B2 | VK Cup 2022 - Квалификация (Engine) {1769} | PROGRAMMING | |||
| 1396 | Копирование файлов I | *special | Statement | B1 | VK Cup 2022 - Квалификация (Engine) {1769} | PROGRAMMING | |||
| 120 | Игра в Девятку III | *special | Statement | D3 | VK Cup 2022 - Квалификация (Engine) {1769} | PROGRAMMING | |||
| 198 | Игра в Девятку II | *special | Statement | D2 | VK Cup 2022 - Квалификация (Engine) {1769} | PROGRAMMING | |||
| 387 | Игра в Девятку I | *special | Statement | D1 | VK Cup 2022 - Квалификация (Engine) {1769} | PROGRAMMING | |||
| 125 | Koxia, Mahiru and Winter Festival | constructive algorithms | Statement | H | Good Bye 2022: 2023 is NEAR {1770} | PROGRAMMING | 4000.0 | Good Bye 2022 -- Editorial | |
| 23990 | Koxia and Whiteboards | brute force greedy | Statement | A | Good Bye 2022: 2023 is NEAR {1770} | PROGRAMMING | 500.0 | Good Bye 2022 -- Editorial | |
| 1404 | Koxia and Tree | combinatorics dp math probabilities trees | Statement | E | Good Bye 2022: 2023 is NEAR {1770} | PROGRAMMING | 2000.0 | Good Bye 2022 -- Editorial | |
| 728 | Koxia and Sequence | bitmasks combinatorics math | Statement | F | Good Bye 2022: 2023 is NEAR {1770} | PROGRAMMING | 2500.0 | Good Bye 2022 -- Editorial | |
| 19797 | Koxia and Permutation | constructive algorithms | Statement | B | Good Bye 2022: 2023 is NEAR {1770} | PROGRAMMING | 750.0 | Good Bye 2022 -- Editorial | |
| 8796 | 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 | |
| 3960 | Koxia and Game | data structures dfs and similar ds games graph matchings graphs implementation | Statement | D | Good Bye 2022: 2023 is NEAR {1770} | PROGRAMMING | 1500.0 | Good Bye 2022 -- Editorial | |
| 162 | Koxia and Bracket | divide and conquer fft math | Statement | G | Good Bye 2022: 2023 is NEAR {1770} | PROGRAMMING | 3250.0 | Good Bye 2022 -- Editorial | |
| 10015 | Hossam and Trainees | math number theory | Statement | C | Codeforces Round 837 (Div. 2) {1771} | PROGRAMMING | 1750.0 | Codeforces Round #837 (Div. 2) Editorial | |
| 2865 | 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 | |
| 1220 | 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 | |
| 15326 | 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 | |
| 23377 | Hossam and Combinatorics | combinatorics math sortings | Statement | A | Codeforces Round 837 (Div. 2) {1771} | PROGRAMMING | 500.0 | Codeforces Round #837 (Div. 2) Editorial | |
| 720 | 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 | |
| 6947 | Permutation Game | games | Statement | E | Codeforces Round 839 (Div. 3) {1772} | PROGRAMMING | 110313 | ||
| 29714 | Matrix Rotation | brute force | Statement | B | Codeforces Round 839 (Div. 3) {1772} | PROGRAMMING | 110313 | ||
| 1426 | Gaining Rating | binary search greedy math sortings | Statement | G | Codeforces Round 839 (Div. 3) {1772} | PROGRAMMING | 110313 | ||
| 24306 | Different Differences | greedy math | Statement | C | Codeforces Round 839 (Div. 3) {1772} | PROGRAMMING | 110313 | ||
| 2465 | Copy of a Copy of a Copy | constructive algorithms sortings | Statement | F | Codeforces Round 839 (Div. 3) {1772} | PROGRAMMING | 110313 | ||
| 16431 | Absolute Sorting | math | Statement | D | Codeforces Round 839 (Div. 3) {1772} | PROGRAMMING | 110313 | ||
| 50317 | A+B? | implementation | Statement | A | Codeforces Round 839 (Div. 3) {1772} | PROGRAMMING | 110313 | ||
| 5101 | Easy Assembly | sortings | Statement | E | 2022-2023 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1773} | PROGRAMMING | 1400 | ||
| 1498 | King's Puzzle | constructive algorithms | Statement | K | 2022-2023 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1773} | PROGRAMMING | 1900 | ||
| 1626 | Amazing Trick | constructive algorithms probabilities | Statement | A | 2022-2023 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1773} | PROGRAMMING | 1900 | ||
| 817 | 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 | ||
| 501 | 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 | ||
| 385 | 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 | ||
| 503 | Dominoes | flows graph matchings | Statement | D | 2022-2023 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1773} | PROGRAMMING | 2600 | ||
| 404 | 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 | ||
| 112 | Jumbled Trees | Statement | J | 2022-2023 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1773} | PROGRAMMING | 2900 | |||
| 47 | Lisa's Sequences | dp | Statement | L | 2022-2023 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1773} | PROGRAMMING | 3500 | ||
| 32 | Cactus Meets Torus | Statement | C | 2022-2023 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1773} | PROGRAMMING | 3500 | |||
| 4302 | Football | constructive algorithms | Statement | F | 2022-2023 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1773} | PROGRAMMING | 800 | ||
| 3589 | 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 | |
| 450 | 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 | |
| 8154 | 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 | |
| 137 | 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 | |
| 720 | 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 | |
| 1091 | 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 | |
| 12274 | 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 | |
| 12606 | 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 | |
| 22706 | 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 | |
| 3404 | The Human Equation | data structures dp ds greedy | Statement | E | Codeforces Round 843 (Div. 2) {1775} | PROGRAMMING | 2250.0 | Codeforces Round #843 (Div. 2) Editorial | |
| 783 | 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 | |
| 10964 | Interesting Sequence | binary search bitmasks math | Statement | C | Codeforces Round 843 (Div. 2) {1775} | PROGRAMMING | 1500.0 | Codeforces Round #843 (Div. 2) Editorial | |
| 19038 | 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 | |
| 19845 | 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 | |
| 14756 | Gardener and the Array | bitmasks constructive algorithms | Statement | B | Codeforces Round 843 (Div. 2) {1775} | PROGRAMMING | 1000.0 | Codeforces Round #843 (Div. 2) Editorial | |
| 6513 | 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 | |
| 7162 | Walking Boy | greedy | Statement | A | SWERC 2022-2023 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1776} | PROGRAMMING | |||
| 1395 | Vittorio Plays with LEGO Bricks | dp | Statement | B | SWERC 2022-2023 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1776} | PROGRAMMING | |||
| 69 | Uniform Chemistry | dp math | Statement | K | SWERC 2022-2023 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1776} | PROGRAMMING | |||
| 3579 | Train Splitting | constructive algorithms graphs greedy | Statement | F | SWERC 2022-2023 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1776} | PROGRAMMING | |||
| 380 | Teamwork | greedy | Statement | D | SWERC 2022-2023 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1776} | PROGRAMMING | |||
| 709 | Spinach Pizza | games geometry greedy interactive | Statement | I | SWERC 2022-2023 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1776} | PROGRAMMING | |||
| 380 | Parmigiana With Seafood | trees | Statement | M | SWERC 2022-2023 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1776} | PROGRAMMING | |||
| 831 | Library game | games greedy interactive sortings | Statement | C | SWERC 2022-2023 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1776} | PROGRAMMING | |||
| 708 | Italian Data Centers | graphs | Statement | J | SWERC 2022-2023 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1776} | PROGRAMMING | |||
| 75 | Crossing the Railways | data structures dp | Statement | E | SWERC 2022-2023 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1776} | PROGRAMMING | |||
| 86 | Count Permutations | math | Statement | N | SWERC 2022-2023 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1776} | PROGRAMMING | |||
| 6653 | Controllers | binary search math | Statement | L | SWERC 2022-2023 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1776} | PROGRAMMING | |||
| 6612 | Beppa and SwerChat | two pointers | Statement | H | SWERC 2022-2023 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1776} | PROGRAMMING | |||
| 2113 | Another Wine Tasting Event | combinatorics constructive algorithms strings | Statement | G | SWERC 2022-2023 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1776} | PROGRAMMING | |||
| 3634 | 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 | |
| 8997 | 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 | |
| 26485 | 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 | |
| 17860 | 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 | |
| 1926 | Edge Reverse | binary search dfs and similar ds graphs | Statement | E | Codeforces Round 845 (Div. 2) and ByteRace 2023 {1777} | PROGRAMMING | 2250.0 | Codeforces Round #845 (Div. 2) and ByteRace 2023 Editorial | |
| 1010 | Comfortably Numb | binary search bitmasks data structures divide and conquer ds 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 |