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 ... 90 91 92 93 94 ... 100 101 102 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 36555 | Line Trip | math | Statement | A | Educational Codeforces Round 158 (Rated for Div. 2) {1901} | PROGRAMMING | Educational Codeforces Round 158 Editorial | ||
| 157 | Landscaping | binary search geometry | Statement | F | Educational Codeforces Round 158 (Rated for Div. 2) {1901} | PROGRAMMING | Educational Codeforces Round 158 Editorial | ||
| 1613 | Compressed Tree | dfs and similar dp graphs greedy trees | Statement | E | Educational Codeforces Round 158 (Rated for Div. 2) {1901} | PROGRAMMING | Educational Codeforces Round 158 Editorial | ||
| 15368 | Chip and Ribbon | greedy math | Statement | B | Educational Codeforces Round 158 (Rated for Div. 2) {1901} | PROGRAMMING | Educational Codeforces Round 158 Editorial | ||
| 12498 | Add, Divide and Floor | constructive algorithms greedy math | Statement | C | Educational Codeforces Round 158 (Rated for Div. 2) {1901} | PROGRAMMING | Educational Codeforces Round 158 Editorial | ||
| 1086 | Trees and XOR Queries Again | bitmasks data structures dfs and similar implementation math trees | Statement | F | Educational Codeforces Round 159 (Rated for Div. 2) {1902} | PROGRAMMING | Educational Codeforces Round 159 Editorial | ||
| 4308 | Robot Queries | binary search data structures geometry sortings | Statement | D | Educational Codeforces Round 159 (Rated for Div. 2) {1902} | PROGRAMMING | Educational Codeforces Round 159 Editorial | ||
| 14359 | Insert and Equalize | brute force constructive algorithms greedy math number theory | Statement | C | Educational Codeforces Round 159 (Rated for Div. 2) {1902} | PROGRAMMING | Educational Codeforces Round 159 Editorial | ||
| 14880 | Getting Points | binary search math | Statement | B | Educational Codeforces Round 159 (Rated for Div. 2) {1902} | PROGRAMMING | Educational Codeforces Round 159 Editorial | ||
| 4480 | Collapsing Strings | binary search data structures dfs and similar hashing strings trees | Statement | E | Educational Codeforces Round 159 (Rated for Div. 2) {1902} | PROGRAMMING | Educational Codeforces Round 159 Editorial | ||
| 21491 | Binary Imbalance | constructive algorithms | Statement | A | Educational Codeforces Round 159 (Rated for Div. 2) {1902} | PROGRAMMING | Educational Codeforces Round 159 Editorial | ||
| 12558 | Theofanis' Nightmare | constructive algorithms dp greedy | Statement | C | Codeforces Round 912 (Div. 2) {1903} | PROGRAMMING | 1500.0 | Codeforces Round #912 (Div. 2) Editorial | |
| 13243 | StORage room | bitmasks brute force constructive algorithms greedy | Statement | B | Codeforces Round 912 (Div. 2) {1903} | PROGRAMMING | 1000.0 | Codeforces Round #912 (Div. 2) Editorial | |
| 831 | Maximum And Queries (hard version) | bitmasks divide and conquer dp | Statement | D2 | Codeforces Round 912 (Div. 2) {1903} | PROGRAMMING | 2500.0 | Codeforces Round #912 (Div. 2) Editorial | |
| 6020 | Maximum And Queries (easy version) | binary search bitmasks brute force greedy | Statement | D1 | Codeforces Round 912 (Div. 2) {1903} | PROGRAMMING | 1500.0 | Codeforces Round #912 (Div. 2) Editorial | |
| 36843 | Halloumi Boxes | brute force greedy | Statement | A | Codeforces Round 912 (Div. 2) {1903} | PROGRAMMING | 500.0 | Codeforces Round #912 (Div. 2) Editorial | |
| 2118 | Geo Game | constructive algorithms dp games greedy interactive math | Statement | E | Codeforces Round 912 (Div. 2) {1903} | PROGRAMMING | 2250.0 | Codeforces Round #912 (Div. 2) Editorial | |
| 675 | Babysitting | 2-sat binary search data structures graphs | Statement | F | Codeforces Round 912 (Div. 2) {1903} | PROGRAMMING | 3500.0 | Codeforces Round #912 (Div. 2) Editorial | |
| 1057 | Tree Queries | binary search data structures dfs and similar implementation trees | Statement | E | Codeforces Round 914 (Div. 2) {1904} | PROGRAMMING | 2750.0 | Codeforces Round 914 (Div. 2) Editorial | |
| 4667 | Set To Max (Hard Version) | binary search constructive algorithms data structures ds greedy implementation sortings two pointers | Statement | D2 | Codeforces Round 914 (Div. 2) {1904} | PROGRAMMING | 750.0 | Codeforces Round 914 (Div. 2) Editorial | |
| 7166 | Set To Max (Easy Version) | brute force constructive algorithms greedy | Statement | D1 | Codeforces Round 914 (Div. 2) {1904} | PROGRAMMING | 1250.0 | Codeforces Round 914 (Div. 2) Editorial | |
| 22135 | Forked! | brute force | Statement | A | Codeforces Round 914 (Div. 2) {1904} | PROGRAMMING | 500.0 | Codeforces Round 914 (Div. 2) Editorial | |
| 16692 | Collecting Game | binary search dp greedy two pointers | Statement | B | Codeforces Round 914 (Div. 2) {1904} | PROGRAMMING | 750.0 | Codeforces Round 914 (Div. 2) Editorial | |
| 394 | Beautiful Tree | data structures dfs and similar graphs trees | Statement | F | Codeforces Round 914 (Div. 2) {1904} | PROGRAMMING | 3500.0 | Codeforces Round 914 (Div. 2) Editorial | |
| 14514 | Array Game | binary search brute force data structures sortings | Statement | C | Codeforces Round 914 (Div. 2) {1904} | PROGRAMMING | 1000.0 | Codeforces Round 914 (Div. 2) Editorial | |
| 1045 | One-X | combinatorics dp math | Statement | E | Codeforces Round 915 (Div. 2) {1905} | PROGRAMMING | 2250.0 | Codeforces Round 915 (Div. 2) Editorial | |
| 12767 | Largest Subsequence | data structures greedy strings | Statement | C | Codeforces Round 915 (Div. 2) {1905} | PROGRAMMING | 1500.0 | Codeforces Round 915 (Div. 2) Editorial | |
| 570 | Field Should Not Be Empty | brute force data structures divide and conquer | Statement | F | Codeforces Round 915 (Div. 2) {1905} | PROGRAMMING | 2250.0 | Codeforces Round 915 (Div. 2) Editorial | |
| 3993 | Cyclic MEX | binary search constructive algorithms data structures implementation math two pointers | Statement | D | Codeforces Round 915 (Div. 2) {1905} | PROGRAMMING | 2000.0 | Codeforces Round 915 (Div. 2) Editorial | |
| 23332 | Constructive Problems | math | Statement | A | Codeforces Round 915 (Div. 2) {1905} | PROGRAMMING | 500.0 | Codeforces Round 915 (Div. 2) Editorial | |
| 16898 | Begginer's Zelda | greedy trees | Statement | B | Codeforces Round 915 (Div. 2) {1905} | PROGRAMMING | 1000.0 | Codeforces Round 915 (Div. 2) Editorial | |
| 812 | Twin Friends | combinatorics dp | Statement | H | 2023-2024 ICPC, Asia Jakarta Regional Contest (Online Mirror, Unrated, ICPC Rules, Teams Preferred) {1906} | PROGRAMMING | problem_analysis.pdf | ||
| 2883 | Triangle Construction | greedy | Statement | M | 2023-2024 ICPC, Asia Jakarta Regional Contest (Online Mirror, Unrated, ICPC Rules, Teams Preferred) {1906} | PROGRAMMING | problem_analysis.pdf | ||
| 129 | Spaceship Exploration | binary search geometry | Statement | D | 2023-2024 ICPC, Asia Jakarta Regional Contest (Online Mirror, Unrated, ICPC Rules, Teams Preferred) {1906} | PROGRAMMING | problem_analysis.pdf | ||
| 596 | Palindromic Parentheses | constructive algorithms | Statement | L | 2023-2024 ICPC, Asia Jakarta Regional Contest (Online Mirror, Unrated, ICPC Rules, Teams Preferred) {1906} | PROGRAMMING | problem_analysis.pdf | ||
| 1686 | Merge Not Sort | constructive algorithms dp | Statement | E | 2023-2024 ICPC, Asia Jakarta Regional Contest (Online Mirror, Unrated, ICPC Rules, Teams Preferred) {1906} | PROGRAMMING | problem_analysis.pdf | ||
| 1267 | Maximize The Value | data structures | Statement | F | 2023-2024 ICPC, Asia Jakarta Regional Contest (Online Mirror, Unrated, ICPC Rules, Teams Preferred) {1906} | PROGRAMMING | problem_analysis.pdf | ||
| 221 | Grid Game 2 | games number theory | Statement | G | 2023-2024 ICPC, Asia Jakarta Regional Contest (Online Mirror, Unrated, ICPC Rules, Teams Preferred) {1906} | PROGRAMMING | problem_analysis.pdf | ||
| 4710 | Easy As ABC | brute force | Statement | A | 2023-2024 ICPC, Asia Jakarta Regional Contest (Online Mirror, Unrated, ICPC Rules, Teams Preferred) {1906} | PROGRAMMING | problem_analysis.pdf | ||
| 332 | Deck-Building Game | divide and conquer math | Statement | K | 2023-2024 ICPC, Asia Jakarta Regional Contest (Online Mirror, Unrated, ICPC Rules, Teams Preferred) {1906} | PROGRAMMING | problem_analysis.pdf | ||
| 203 | Cursed Game | interactive | Statement | C | 2023-2024 ICPC, Asia Jakarta Regional Contest (Online Mirror, Unrated, ICPC Rules, Teams Preferred) {1906} | PROGRAMMING | problem_analysis.pdf | ||
| 856 | Count BFS Graph | combinatorics dp | Statement | J | 2023-2024 ICPC, Asia Jakarta Regional Contest (Online Mirror, Unrated, ICPC Rules, Teams Preferred) {1906} | PROGRAMMING | problem_analysis.pdf | ||
| 169 | Contingency Plan 2 | Statement | I | 2023-2024 ICPC, Asia Jakarta Regional Contest (Online Mirror, Unrated, ICPC Rules, Teams Preferred) {1906} | PROGRAMMING | problem_analysis.pdf | |||
| 627 | Button Pressing | bitmasks constructive algorithms hashing | Statement | B | 2023-2024 ICPC, Asia Jakarta Regional Contest (Online Mirror, Unrated, ICPC Rules, Teams Preferred) {1906} | PROGRAMMING | problem_analysis.pdf | ||
| 26594 | YetnotherrokenKeoard | data structures implementation strings | Statement | B | Codeforces Round 913 (Div. 3) {1907} | PROGRAMMING | Codeforces Round 913 (Div. 3) Editorial | ||
| 5104 | Shift and Reverse | greedy sortings | Statement | F | Codeforces Round 913 (Div. 3) {1907} | PROGRAMMING | Codeforces Round 913 (Div. 3) Editorial | ||
| 37588 | Rook | implementation | Statement | A | Codeforces Round 913 (Div. 3) {1907} | PROGRAMMING | Codeforces Round 913 (Div. 3) Editorial | ||
| 20797 | Removal of Unattractive Pairs | constructive algorithms greedy math strings | Statement | C | Codeforces Round 913 (Div. 3) {1907} | PROGRAMMING | Codeforces Round 913 (Div. 3) Editorial | ||
| 2015 | Lights | constructive algorithms dfs and similar graphs greedy implementation | Statement | G | Codeforces Round 913 (Div. 3) {1907} | PROGRAMMING | Codeforces Round 913 (Div. 3) Editorial | ||
| 15445 | Jumping Through Segments | binary search constructive algorithms | Statement | D | Codeforces Round 913 (Div. 3) {1907} | PROGRAMMING | Codeforces Round 913 (Div. 3) Editorial | ||
| 11000 | Good Triples | brute force combinatorics number theory | Statement | E | Codeforces Round 913 (Div. 3) {1907} | PROGRAMMING | Codeforces Round 913 (Div. 3) Editorial | ||
| 4575 | Split Plus K | greedy math number theory | Statement | D | Pinely Round 3 (Div. 1 + Div. 2) {1909} | PROGRAMMING | 2000.0 | Editorial of Pinely Round 3 (Div. 1 + Div. 2) | |
| 991 | Small Permutation Problem (Hard Version) | combinatorics dp math | Statement | F2 | Pinely Round 3 (Div. 1 + Div. 2) {1909} | PROGRAMMING | 1500.0 | Editorial of Pinely Round 3 (Div. 1 + Div. 2) | |
| 1903 | Small Permutation Problem (Easy Version) | combinatorics dp math | Statement | F1 | Pinely Round 3 (Div. 1 + Div. 2) {1909} | PROGRAMMING | 1500.0 | Editorial of Pinely Round 3 (Div. 1 + Div. 2) | |
| 122 | Short Permutation Problem | combinatorics dp fft math | Statement | I | Pinely Round 3 (Div. 1 + Div. 2) {1909} | PROGRAMMING | 6000.0 | Editorial of Pinely Round 3 (Div. 1 + Div. 2) | |
| 430 | Pumping Lemma | hashing string suffix structures strings | Statement | G | Pinely Round 3 (Div. 1 + Div. 2) {1909} | PROGRAMMING | 4000.0 | Editorial of Pinely Round 3 (Div. 1 + Div. 2) | |
| 82 | Parallel Swaps Sort | constructive algorithms data structures | Statement | H | Pinely Round 3 (Div. 1 + Div. 2) {1909} | PROGRAMMING | 6000.0 | Editorial of Pinely Round 3 (Div. 1 + Div. 2) | |
| 1439 | Multiple Lamps | brute force constructive algorithms number theory | Statement | E | Pinely Round 3 (Div. 1 + Div. 2) {1909} | PROGRAMMING | 2500.0 | Editorial of Pinely Round 3 (Div. 1 + Div. 2) | |
| 18605 | Make Almost Equal With Mod | math number theory | Statement | B | Pinely Round 3 (Div. 1 + Div. 2) {1909} | PROGRAMMING | 1000.0 | Editorial of Pinely Round 3 (Div. 1 + Div. 2) | |
| 11626 | Heavy Intervals | constructive algorithms data structures ds greedy math sortings | Statement | C | Pinely Round 3 (Div. 1 + Div. 2) {1909} | PROGRAMMING | 1500.0 | Editorial of Pinely Round 3 (Div. 1 + Div. 2) | |
| 18131 | Distinct Buttons | implementation math | Statement | A | Pinely Round 3 (Div. 1 + Div. 2) {1909} | PROGRAMMING | 500.0 | Editorial of Pinely Round 3 (Div. 1 + Div. 2) | |
| 1826 | Username | *special implementation | Statement | A | Kotlin Heroes: Episode 9 (Unrated, T-Shirts + Prizes!) {1910} | PROGRAMMING | 123261 | ||
| 50 | Two Colors | *special | Statement | J | Kotlin Heroes: Episode 9 (Unrated, T-Shirts + Prizes!) {1910} | PROGRAMMING | 123261 | ||
| 95 | Sum of Digits of Sums | *special binary search data structures | Statement | H | Kotlin Heroes: Episode 9 (Unrated, T-Shirts + Prizes!) {1910} | PROGRAMMING | 123261 | ||
| 695 | Security Guard | *special greedy | Statement | B | Kotlin Heroes: Episode 9 (Unrated, T-Shirts + Prizes!) {1910} | PROGRAMMING | 123261 | ||
| 369 | Remove and Add | *special greedy | Statement | D | Kotlin Heroes: Episode 9 (Unrated, T-Shirts + Prizes!) {1910} | PROGRAMMING | 123261 | ||
| 64 | Pool Records | *special greedy | Statement | G | Kotlin Heroes: Episode 9 (Unrated, T-Shirts + Prizes!) {1910} | PROGRAMMING | 123261 | ||
| 659 | Poisonous Swamp | *special *special implementation implementation | Statement | C | Kotlin Heroes: Episode 9 (Unrated, T-Shirts + Prizes!) {1910} | PROGRAMMING | 123261 | ||
| 210 | Maximum Sum Subarrays | *special dp | Statement | E | Kotlin Heroes: Episode 9 (Unrated, T-Shirts + Prizes!) {1910} | PROGRAMMING | 123261 | ||
| 52 | Inverse Problem | *special combinatorics dp | Statement | I | Kotlin Heroes: Episode 9 (Unrated, T-Shirts + Prizes!) {1910} | PROGRAMMING | 123261 | ||
| 183 | Build Railway Stations | *special greedy trees | Statement | F | Kotlin Heroes: Episode 9 (Unrated, T-Shirts + Prizes!) {1910} | PROGRAMMING | 123261 | ||
| 2708 | Kim's Quest | bitmasks combinatorics dp | Statement | K | 2023-2024 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1912} | PROGRAMMING | Tutorials (PDF) | 1800 | |
| 2272 | Accumulator Apex | implementation sortings | Statement | A | 2023-2024 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1912} | PROGRAMMING | Tutorials (PDF) | 1800 | |
| 1612 | Divisibility Test | math | Statement | D | 2023-2024 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1912} | PROGRAMMING | Tutorials (PDF) | 1900 | |
| 1163 | Blueprint for Seating | combinatorics divide and conquer fft math | Statement | B | 2023-2024 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1912} | PROGRAMMING | Tutorials (PDF) | 2000 | |
| 1019 | Evaluate It and Back Again | constructive algorithms implementation math | Statement | E | 2023-2024 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1912} | PROGRAMMING | Tutorials (PDF) | 2200 | |
| 622 | Joy of Pokémon Observation | Statement | J | 2023-2024 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1912} | PROGRAMMING | 2300 | |||
| 471 | Hypercatapult Commute | graphs | Statement | H | 2023-2024 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1912} | PROGRAMMING | Tutorials (PDF) | 2400 | |
| 500 | Great City Saint Petersburg | data structures | Statement | G | 2023-2024 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1912} | PROGRAMMING | 2400 | ||
| 118 | Fugitive Frenzy | math probabilities | Statement | F | 2023-2024 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1912} | PROGRAMMING | Tutorials (PDF) | 3100 | |
| 57 | Innovative Washing Machine | geometry math two pointers | Statement | I | 2023-2024 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1912} | PROGRAMMING | 3300 | ||
| 56 | Cactus Transformation | constructive algorithms | Statement | C | 2023-2024 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1912} | PROGRAMMING | 3300 | ||
| 7342 | LOL Lovers | strings | Statement | L | 2023-2024 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1912} | PROGRAMMING | Tutorials (PDF) | 800 | |
| 29737 | Swap and Delete | strings | Statement | B | Educational Codeforces Round 160 (Rated for Div. 2) {1913} | PROGRAMMING | 123493 | ||
| 25624 | Rating Increase | implementation | Statement | A | Educational Codeforces Round 160 (Rated for Div. 2) {1913} | PROGRAMMING | 123493 | ||
| 340 | Palindromic Problem | binary search data structures hashing strings | Statement | F | Educational Codeforces Round 160 (Rated for Div. 2) {1913} | PROGRAMMING | 123493 | ||
| 1088 | Matrix Problem | flows graph matchings graphs | Statement | E | Educational Codeforces Round 160 (Rated for Div. 2) {1913} | PROGRAMMING | 123493 | ||
| 15513 | Game with Multiset | binary search bitmasks greedy | Statement | C | Educational Codeforces Round 160 (Rated for Div. 2) {1913} | PROGRAMMING | 123493 | ||
| 3333 | Array Collapse | data structures divide and conquer dp trees | Statement | D | Educational Codeforces Round 160 (Rated for Div. 2) {1913} | PROGRAMMING | 123493 | ||
| 23596 | Three Activities | brute force dp implementation sortings | Statement | D | Codeforces Round 916 (Div. 3) {1914} | PROGRAMMING | Codeforces Round 916 (Div. 3) Editorial | ||
| 25877 | Quests | greedy math | Statement | C | Codeforces Round 916 (Div. 3) {1914} | PROGRAMMING | Codeforces Round 916 (Div. 3) Editorial | ||
| 4278 | Programming Competition | dfs and similar greedy trees | Statement | F | Codeforces Round 916 (Div. 3) {1914} | PROGRAMMING | Codeforces Round 916 (Div. 3) Editorial | ||
| 32442 | Problemsolving Log | implementation strings | Statement | A | Codeforces Round 916 (Div. 3) {1914} | PROGRAMMING | Codeforces Round 916 (Div. 3) Editorial | ||
| 31044 | Preparing for the Contest | constructive algorithms math | Statement | B | Codeforces Round 916 (Div. 3) {1914} | PROGRAMMING | Codeforces Round 916 (Div. 3) Editorial | ||
| 1444 | Light Bulbs (Hard Version) | combinatorics data structures dfs and similar dp ds graphs hashing | Statement | G2 | Codeforces Round 916 (Div. 3) {1914} | PROGRAMMING | Codeforces Round 916 (Div. 3) Editorial | ||
| 1962 | Light Bulbs (Easy Version) | brute force combinatorics dfs and similar dp ds graphs math | Statement | G1 | Codeforces Round 916 (Div. 3) {1914} | PROGRAMMING | Codeforces Round 916 (Div. 3) Editorial | ||
| 12957 | Game with Marbles (Hard Version) | games greedy sortings | Statement | E2 | Codeforces Round 916 (Div. 3) {1914} | PROGRAMMING | Codeforces Round 916 (Div. 3) Editorial | ||
| 12716 | Game with Marbles (Easy Version) | brute force games greedy sortings | Statement | E1 | Codeforces Round 916 (Div. 3) {1914} | PROGRAMMING | Codeforces Round 916 (Div. 3) Editorial | ||
| 31288 | Unnatural Language Processing | dp greedy implementation strings | Statement | D | Codeforces Round 918 (Div. 4) {1915} | PROGRAMMING | 123952 | ||
| 23614 | Romantic Glasses | data structures greedy math | Statement | E | Codeforces Round 918 (Div. 4) {1915} | PROGRAMMING | 123952 |