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 ... 84 85 86 87 88 ... 100 101 102 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 9683 | Triangle Coloring | combinatorics math | Statement | D | Educational Codeforces Round 143 (Rated for Div. 2) {1795} | PROGRAMMING | 112963 | ||
| 13248 | Tea Tasting | binary search data structures implementation | Statement | C | Educational Codeforces Round 143 (Rated for Div. 2) {1795} | PROGRAMMING | 112963 | ||
| 697 | Removal Sequences | bitmasks graphs | Statement | G | Educational Codeforces Round 143 (Rated for Div. 2) {1795} | PROGRAMMING | 112963 | ||
| 22470 | Ideal Point | geometry greedy | Statement | B | Educational Codeforces Round 143 (Rated for Div. 2) {1795} | PROGRAMMING | 112963 | ||
| 2107 | Explosions? | binary search data structures dp math | Statement | E | Educational Codeforces Round 143 (Rated for Div. 2) {1795} | PROGRAMMING | 112963 | ||
| 1146 | Blocking Chips | binary search dfs and similar dp greedy | Statement | F | Educational Codeforces Round 143 (Rated for Div. 2) {1795} | PROGRAMMING | 112963 | ||
| 18985 | Typical Interview Problem | implementation strings | Statement | A | Educational Codeforces Round 144 (Rated for Div. 2) {1796} | PROGRAMMING | Educational Codeforces Round 144 Editorial | ||
| 178 | Strange Triples | math | Statement | F | Educational Codeforces Round 144 (Rated for Div. 2) {1796} | PROGRAMMING | Educational Codeforces Round 144 Editorial | ||
| 4497 | Maximum Subarray | data structures dp greedy | Statement | D | Educational Codeforces Round 144 (Rated for Div. 2) {1796} | PROGRAMMING | Educational Codeforces Round 144 Editorial | ||
| 10771 | Maximum Set | binary search brute force combinatorics dp math | Statement | C | Educational Codeforces Round 144 (Rated for Div. 2) {1796} | PROGRAMMING | Educational Codeforces Round 144 Editorial | ||
| 786 | Colored Subgraphs | data structures dp greedy trees | Statement | E | Educational Codeforces Round 144 (Rated for Div. 2) {1796} | PROGRAMMING | Educational Codeforces Round 144 Editorial | ||
| 16886 | Asterisk-Minor Template | implementation strings | Statement | B | Educational Codeforces Round 144 (Rated for Div. 2) {1796} | PROGRAMMING | Educational Codeforces Round 144 Editorial | ||
| 4101 | Li Hua and Tree | brute force data structures dfs and similar dp implementation trees | Statement | D | Codeforces Round 864 (Div. 2) {1797} | PROGRAMMING | 1750.0 | Codeforces Round 864 (Div. 2) Editorial | |
| 16963 | Li Hua and Pattern | constructive algorithms greedy | Statement | B | Codeforces Round 864 (Div. 2) {1797} | PROGRAMMING | 1000.0 | Codeforces Round 864 (Div. 2) Editorial | |
| 370 | Li Hua and Path | data structures dfs and similar divide and conquer ds trees | Statement | F | Codeforces Round 864 (Div. 2) {1797} | PROGRAMMING | 3000.0 | Codeforces Round 864 (Div. 2) Editorial | |
| 17840 | Li Hua and Maze | constructive algorithms greedy | Statement | A | Codeforces Round 864 (Div. 2) {1797} | PROGRAMMING | 500.0 | Codeforces Round 864 (Div. 2) Editorial | |
| 7930 | Li Hua and Chess | brute force constructive algorithms greedy hashing interactive | Statement | C | Codeforces Round 864 (Div. 2) {1797} | PROGRAMMING | 1500.0 | Codeforces Round 864 (Div. 2) Editorial | |
| 1354 | Li Hua and Array | brute force data structures math number theory | Statement | E | Codeforces Round 864 (Div. 2) {1797} | PROGRAMMING | 2250.0 | Codeforces Round 864 (Div. 2) Editorial | |
| 17114 | Three Sevens | brute force data structures greedy implementation | Statement | B | Codeforces Round 860 (Div. 2) {1798} | PROGRAMMING | 750.0 | Editorial of Codeforces Round 860 (Div. 2) | 1000 |
| 10532 | Shocking Arrangement | constructive algorithms greedy math | Statement | D | Codeforces Round 860 (Div. 2) {1798} | PROGRAMMING | 1750.0 | Editorial of Codeforces Round 860 (Div. 2) | 1600 |
| 8414 | Candy Store | greedy math number theory | Statement | C | Codeforces Round 860 (Div. 2) {1798} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round 860 (Div. 2) | 1700 |
| 1662 | Multitest Generator | brute force dp | Statement | E | Codeforces Round 860 (Div. 2) {1798} | PROGRAMMING | 2250.0 | Editorial of Codeforces Round 860 (Div. 2) | 2300 |
| 522 | Gifts from Grandfather Ahmed | dp math number theory | Statement | F | Codeforces Round 860 (Div. 2) {1798} | PROGRAMMING | 3000.0 | Editorial of Codeforces Round 860 (Div. 2) | 2500 |
| 20298 | Showstopper | greedy implementation sortings | Statement | A | Codeforces Round 860 (Div. 2) {1798} | PROGRAMMING | 500.0 | Editorial of Codeforces Round 860 (Div. 2) | 800 |
| 299 | Tree Cutting | bitmasks dfs and similar dp | Statement | H | Codeforces Round 854 by cybercats (Div. 1 + Div. 2) {1799} | PROGRAMMING | 3500.0 | Codeforces Round #854 Editorial | |
| 11700 | Recent Actions | data structures greedy implementation math | Statement | A | Codeforces Round 854 by cybercats (Div. 1 + Div. 2) {1799} | PROGRAMMING | 500.0 | Codeforces Round #854 Editorial | |
| 2601 | Hot Start Up (hard version) | data structures dp | Statement | D2 | Codeforces Round 854 by cybercats (Div. 1 + Div. 2) {1799} | PROGRAMMING | 750.0 | Codeforces Round #854 Editorial | |
| 4776 | Hot Start Up (easy version) | dp | Statement | D1 | Codeforces Round 854 by cybercats (Div. 1 + Div. 2) {1799} | PROGRAMMING | 1500.0 | Codeforces Round #854 Editorial | |
| 866 | Halve or Subtract | brute force flows greedy sortings | Statement | F | Codeforces Round 854 by cybercats (Div. 1 + Div. 2) {1799} | PROGRAMMING | 2500.0 | Codeforces Round #854 Editorial | |
| 11635 | Equalize by Divide | brute force constructive algorithms greedy math | Statement | B | Codeforces Round 854 by cybercats (Div. 1 + Div. 2) {1799} | PROGRAMMING | 1000.0 | Codeforces Round #854 Editorial | |
| 6062 | Double Lexicographically Minimum | constructive algorithms greedy implementation strings | Statement | C | Codeforces Round 854 by cybercats (Div. 1 + Div. 2) {1799} | PROGRAMMING | 1500.0 | Codeforces Round #854 Editorial | |
| 815 | Count Voting | combinatorics dp math | Statement | G | Codeforces Round 854 by cybercats (Div. 1 + Div. 2) {1799} | PROGRAMMING | 3000.0 | Codeforces Round #854 Editorial | |
| 1248 | City Union | constructive algorithms dp geometry greedy implementation math | Statement | E | Codeforces Round 854 by cybercats (Div. 1 + Div. 2) {1799} | PROGRAMMING | 2250.0 | Codeforces Round #854 Editorial | |
| 13322 | Unforgivable Curse (hard version) | brute force constructive algorithms constructive algorithms ds graphs greedy | Statement | E2 | Codeforces Round 855 (Div. 3) {1800} | PROGRAMMING | Codeforces Round 855 (Div. 3) Editorial | ||
| 13256 | Unforgivable Curse (easy version) | brute force constructive algorithms ds graphs greedy | Statement | E1 | Codeforces Round 855 (Div. 3) {1800} | PROGRAMMING | Codeforces Round 855 (Div. 3) Editorial | ||
| 2173 | Symmetree | dfs and similar hashing trees | Statement | G | Codeforces Round 855 (Div. 3) {1800} | PROGRAMMING | Codeforces Round 855 (Div. 3) Editorial | ||
| 24779 | Remove Two Letters | data structures greedy hashing strings | Statement | D | Codeforces Round 855 (Div. 3) {1800} | PROGRAMMING | Codeforces Round 855 (Div. 3) Editorial | ||
| 23343 | Powering the Hero (hard version) | data structures greedy | Statement | C2 | Codeforces Round 855 (Div. 3) {1800} | PROGRAMMING | Codeforces Round 855 (Div. 3) Editorial | ||
| 24419 | Powering the Hero (easy version) | data structures greedy | Statement | C1 | Codeforces Round 855 (Div. 3) {1800} | PROGRAMMING | Codeforces Round 855 (Div. 3) Editorial | ||
| 32655 | Is It a Cat? | implementation strings | Statement | A | Codeforces Round 855 (Div. 3) {1800} | PROGRAMMING | Codeforces Round 855 (Div. 3) Editorial | ||
| 4025 | Dasha and Nightmares | bitmasks hashing meet-in-the-middle | Statement | F | Codeforces Round 855 (Div. 3) {1800} | PROGRAMMING | Codeforces Round 855 (Div. 3) Editorial | ||
| 25933 | Count the Number of Pairs | greedy strings | Statement | B | Codeforces Round 855 (Div. 3) {1800} | PROGRAMMING | Codeforces Round 855 (Div. 3) Editorial | ||
| 2344 | The way home | dp graphs greedy shortest paths sortings | Statement | D | Codeforces Round 857 (Div. 1) {1801} | PROGRAMMING | 1750.0 | Codeforces Round #857 Editorial | |
| 8836 | The Very Beautiful Blanket | bitmasks constructive algorithms | Statement | A | Codeforces Round 857 (Div. 1) {1801} | PROGRAMMING | 500.0 | Codeforces Round #857 Editorial | |
| 3587 | Music Festival | binary search data structures dp greedy sortings | Statement | C | Codeforces Round 857 (Div. 1) {1801} | PROGRAMMING | 1250.0 | Codeforces Round #857 Editorial | |
| 504 | Gasoline prices | data structures divide and conquer ds trees | Statement | E | Codeforces Round 857 (Div. 1) {1801} | PROGRAMMING | 2500.0 | Codeforces Round #857 Editorial | |
| 6520 | Buying gifts | data structures dp greedy sortings | Statement | B | Codeforces Round 857 (Div. 1) {1801} | PROGRAMMING | 1000.0 | Codeforces Round #857 Editorial | |
| 429 | A task for substrings | data structures string suffix structures strings | Statement | G | Codeforces Round 857 (Div. 1) {1801} | PROGRAMMING | 3500.0 | Codeforces Round #857 Editorial | |
| 612 | Another n-dimensional chocolate bar | dp number theory | Statement | F | Codeforces Round 857 (Div. 1) {1801} | PROGRAMMING | 3500.0 | Codeforces Round #857 Editorial | |
| 13608 | Settlement of Guinea Pigs | implementation math | Statement | B | Codeforces Round 857 (Div. 2) {1802} | PROGRAMMING | 750.0 | Codeforces Round #857 Editorial | |
| 16009 | Likes | greedy implementation | Statement | A | Codeforces Round 857 (Div. 2) {1802} | PROGRAMMING | 500.0 | Codeforces Round #857 Editorial | |
| 14477 | Vaccination | greedy implementation two pointers | Statement | B | Nebius Welcome Round (Div. 1 + Div. 2) {1804} | PROGRAMMING | 1000.0 | Nebius Welcome Round Editorial | |
| 1495 | Routing | bitmasks dp graphs | Statement | E | Nebius Welcome Round (Div. 1 + Div. 2) {1804} | PROGRAMMING | 2000.0 | Nebius Welcome Round Editorial | |
| 12500 | Pull Your Luck | brute force greedy math number theory | Statement | C | Nebius Welcome Round (Div. 1 + Div. 2) {1804} | PROGRAMMING | 1000.0 | Nebius Welcome Round Editorial | |
| 18084 | Lame King | greedy math | Statement | A | Nebius Welcome Round (Div. 1 + Div. 2) {1804} | PROGRAMMING | 500.0 | Nebius Welcome Round Editorial | |
| 208 | Flow Control | data structures implementation | Statement | G | Nebius Welcome Round (Div. 1 + Div. 2) {1804} | PROGRAMMING | 3500.0 | Nebius Welcome Round Editorial | |
| 190 | Code Lock | bitmasks dp | Statement | H | Nebius Welcome Round (Div. 1 + Div. 2) {1804} | PROGRAMMING | 3500.0 | Nebius Welcome Round Editorial | |
| 976 | Approximate Diameter | binary search divide and conquer graphs shortest paths | Statement | F | Nebius Welcome Round (Div. 1 + Div. 2) {1804} | PROGRAMMING | 2750.0 | Nebius Welcome Round Editorial | |
| 4742 | Accommodation | dp greedy | Statement | D | Nebius Welcome Round (Div. 1 + Div. 2) {1804} | PROGRAMMING | 1500.0 | Nebius Welcome Round Editorial | |
| 25464 | We Need the Zero | bitmasks brute force | Statement | A | Codeforces Round 862 (Div. 2) {1805} | PROGRAMMING | 500.0 | Editorial of Codeforces Round #862 (Div. 2) | |
| 18846 | The String Has a Target | greedy strings | Statement | B | Codeforces Round 862 (Div. 2) {1805} | PROGRAMMING | 750.0 | Editorial of Codeforces Round #862 (Div. 2) | |
| 1678 | There Should Be a Lot of Maximums | data structures dfs and similar ds graphs trees | Statement | E | Codeforces Round 862 (Div. 2) {1805} | PROGRAMMING | 2250.0 | Editorial of Codeforces Round #862 (Div. 2) | |
| 363 | Survival of the Weakest (hard version) | greedy sortings two pointers | Statement | F2 | Codeforces Round 862 (Div. 2) {1805} | PROGRAMMING | 1750.0 | Editorial of Codeforces Round #862 (Div. 2) | |
| 981 | Survival of the Weakest (easy version) | brute force math sortings | Statement | F1 | Codeforces Round 862 (Div. 2) {1805} | PROGRAMMING | 1750.0 | Editorial of Codeforces Round #862 (Div. 2) | |
| 12890 | Place for a Selfie | binary search geometry math sortings | Statement | C | Codeforces Round 862 (Div. 2) {1805} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round #862 (Div. 2) | |
| 6907 | A Wide, Wide Graph | dfs and similar dp ds greedy trees | Statement | D | Codeforces Round 862 (Div. 2) {1805} | PROGRAMMING | 1750.0 | Editorial of Codeforces Round #862 (Div. 2) | |
| 26720 | Walking Master | geometry greedy math | Statement | A | Codeforces Round 858 (Div. 2) {1806} | PROGRAMMING | 500.0 | Codeforces Round #858 (Div. 2) Editorial | |
| 2924 | Tree Master | brute force data structures dfs and similar hashing trees | Statement | E | Codeforces Round 858 (Div. 2) {1806} | PROGRAMMING | 2250.0 | Codeforces Round #858 (Div. 2) Editorial | |
| 7841 | Sequence Master | brute force constructive algorithms math | Statement | C | Codeforces Round 858 (Div. 2) {1806} | PROGRAMMING | 1750.0 | Codeforces Round #858 (Div. 2) Editorial | |
| 18293 | Mex Master | constructive algorithms greedy | Statement | B | Codeforces Round 858 (Div. 2) {1806} | PROGRAMMING | 1000.0 | Codeforces Round #858 (Div. 2) Editorial | |
| 304 | GCD Master (hard version) | greedy math sortings | Statement | F2 | Codeforces Round 858 (Div. 2) {1806} | PROGRAMMING | 1500.0 | Codeforces Round #858 (Div. 2) Editorial | |
| 364 | GCD Master (easy version) | greedy math number theory sortings | Statement | F1 | Codeforces Round 858 (Div. 2) {1806} | PROGRAMMING | 2500.0 | Codeforces Round #858 (Div. 2) Editorial | |
| 955 | DSU Master | combinatorics dp ds math | Statement | D | Codeforces Round 858 (Div. 2) {1806} | PROGRAMMING | 2000.0 | Codeforces Round #858 (Div. 2) Editorial | |
| 20370 | Subsequence Addition (Hard Version) | dp greedy implementation math sortings | Statement | G2 | Codeforces Round 859 (Div. 4) {1807} | PROGRAMMING | 114143 | ||
| 19664 | Subsequence Addition (Easy Version) | brute force dp greedy implementation sortings | Statement | G1 | Codeforces Round 859 (Div. 4) {1807} | PROGRAMMING | 114143 | ||
| 66379 | Plus or Minus | implementation | Statement | A | Codeforces Round 859 (Div. 4) {1807} | PROGRAMMING | 114143 | ||
| 35860 | Odd Queries | data structures implementation | Statement | D | Codeforces Round 859 (Div. 4) {1807} | PROGRAMMING | 114143 | ||
| 13762 | Interview | binary search implementation interactive | Statement | E | Codeforces Round 859 (Div. 4) {1807} | PROGRAMMING | 114143 | ||
| 43546 | Grab the Candies | greedy | Statement | B | Codeforces Round 859 (Div. 4) {1807} | PROGRAMMING | 114143 | ||
| 31279 | Find and Replace | greedy implementation strings | Statement | C | Codeforces Round 859 (Div. 4) {1807} | PROGRAMMING | 114143 | ||
| 6537 | Bouncy Ball | brute force brute force dfs and similar implementation | Statement | F | Codeforces Round 859 (Div. 4) {1807} | PROGRAMMING | 114143 | ||
| 18472 | Playing in a Casino | math sortings | Statement | B | Codeforces Round 861 (Div. 2) {1808} | PROGRAMMING | 1000.0 | Codeforces Round #861 (Div. 2) editorial | 1200 |
| 3919 | Unlucky Numbers | brute force greedy implementation | Statement | C | Codeforces Round 861 (Div. 2) {1808} | PROGRAMMING | 1500.0 | Codeforces Round #861 (Div. 2) editorial | 1900 |
| 2420 | Petya, Petya, Petr, and Palindromes | binary search data structures two pointers | Statement | D | Codeforces Round 861 (Div. 2) {1808} | PROGRAMMING | 1750.0 | Codeforces Round #861 (Div. 2) editorial | 2100 |
| 1387 | Minibuses on Venus (easy version) | brute force combinatorics dp | Statement | E1 | Codeforces Round 861 (Div. 2) {1808} | PROGRAMMING | 1750.0 | Codeforces Round #861 (Div. 2) editorial | 2200 |
| 711 | Minibuses on Venus (medium version) | combinatorics divide and conquer dp matrices | Statement | E2 | Codeforces Round 861 (Div. 2) {1808} | PROGRAMMING | 1000.0 | Codeforces Round #861 (Div. 2) editorial | 2500 |
| 455 | Minibuses on Venus (hard version) | brute force combinatorics dp math | Statement | E3 | Codeforces Round 861 (Div. 2) {1808} | PROGRAMMING | 750.0 | Codeforces Round #861 (Div. 2) editorial | 2800 |
| 18751 | Lucky Numbers | brute force implementation | Statement | A | Codeforces Round 861 (Div. 2) {1808} | PROGRAMMING | 750.0 | Codeforces Round #861 (Div. 2) editorial | 900 |
| 882 | Two Tanks | binary search dp implementation math | Statement | E | Educational Codeforces Round 145 (Rated for Div. 2) {1809} | PROGRAMMING | 114300 | ||
| 793 | Traveling in Berland | binary search data structures graphs greedy implementation | Statement | F | Educational Codeforces Round 145 (Rated for Div. 2) {1809} | PROGRAMMING | 114300 | ||
| 13275 | Sum on Subarrays | constructive algorithms greedy math | Statement | C | Educational Codeforces Round 145 (Rated for Div. 2) {1809} | PROGRAMMING | 114300 | ||
| 460 | Prediction | combinatorics data structures dp | Statement | G | Educational Codeforces Round 145 (Rated for Div. 2) {1809} | PROGRAMMING | 114300 | ||
| 20455 | Points on Plane | binary search greedy math | Statement | B | Educational Codeforces Round 145 (Rated for Div. 2) {1809} | PROGRAMMING | 114300 | ||
| 24220 | Garland | implementation | Statement | A | Educational Codeforces Round 145 (Rated for Div. 2) {1809} | PROGRAMMING | 114300 | ||
| 6495 | Binary String Sorting | binary search dp greedy | Statement | D | Educational Codeforces Round 145 (Rated for Div. 2) {1809} | PROGRAMMING | 114300 | ||
| 752 | The Maximum Prefix | dp | Statement | G | CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) {1810} | PROGRAMMING | 3000.0 | Editorial of CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) | |
| 587 | M-tree | data structures | Statement | F | CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) {1810} | PROGRAMMING | 2500.0 | Editorial of CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) | |
| 3322 | Monsters | brute force data structures dfs and similar ds graphs implementation trees | Statement | E | CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) {1810} | PROGRAMMING | 2000.0 | Editorial of CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) | |
| 14919 | Make It Permutation | brute force greedy sortings | Statement | C | CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) {1810} | PROGRAMMING | 1000.0 | Editorial of CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) | |
| 143 | Last Number | math | Statement | H | CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) {1810} | PROGRAMMING | 3500.0 | Editorial of CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) |