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 ... 98 99 100 101 102 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 14884 | Stalin Sort | brute force greedy | Statement | B | Codeforces Round 982 (Div. 2) {2027} | PROGRAMMING | 1000.0 | ||
| 19767 | Rectangle Arrangement | geometry implementation math | Statement | A | Codeforces Round 982 (Div. 2) {2027} | PROGRAMMING | 500.0 | ||
| 66 | Bit Game (Hard Version) | bitmasks dp math | Statement | E2 | Codeforces Round 982 (Div. 2) {2027} | PROGRAMMING | 1000.0 | ||
| 162 | Bit Game (Easy Version) | bitmasks brute force games math | Statement | E1 | Codeforces Round 982 (Div. 2) {2027} | PROGRAMMING | 2000.0 | ||
| 10215 | Add Zeros | data structures dfs and similar graphs sortings | Statement | C | Codeforces Round 982 (Div. 2) {2027} | PROGRAMMING | 1250.0 | ||
| 1417 | Alice's Adventures in the Rabbit Hole | constructive algorithms dfs and similar dp greedy math probabilities trees | Statement | E | Codeforces Round 986 (Div. 2) {2028} | PROGRAMMING | 2000.0 | ||
| 10283 | Alice's Adventures in Permuting | binary search implementation math | Statement | B | Codeforces Round 986 (Div. 2) {2028} | PROGRAMMING | 1000.0 | ||
| 7387 | Alice's Adventures in Cutting Cake | binary search dp greedy two pointers | Statement | C | Codeforces Round 986 (Div. 2) {2028} | PROGRAMMING | 1500.0 | ||
| 16109 | Alice's Adventures in ''Chess'' | brute force implementation math strings | Statement | A | Codeforces Round 986 (Div. 2) {2028} | PROGRAMMING | 500.0 | ||
| 2825 | Alice's Adventures in Cards | constructive algorithms data structures dfs and similar dp graphs greedy implementation shortest paths | Statement | D | Codeforces Round 986 (Div. 2) {2028} | PROGRAMMING | 1750.0 | ||
| 385 | Alice's Adventures in Addition | bitmasks dp implementation | Statement | F | Codeforces Round 986 (Div. 2) {2028} | PROGRAMMING | 2500.0 | ||
| 42 | Variance Challenge | flows graphs greedy | Statement | I | Refact.ai Match 1 (Codeforces Round 985) {2029} | PROGRAMMING | 5500.0 | ||
| 12000 | Set | binary search greedy math | Statement | A | Refact.ai Match 1 (Codeforces Round 985) {2029} | PROGRAMMING | 750.0 | ||
| 9418 | Replacement | games greedy strings | Statement | B | Refact.ai Match 1 (Codeforces Round 985) {2029} | PROGRAMMING | 1250.0 | ||
| 703 | Palindrome Everywhere | constructive algorithms greedy | Statement | F | Refact.ai Match 1 (Codeforces Round 985) {2029} | PROGRAMMING | 3000.0 | ||
| 5578 | New Rating | binary search data structures dp greedy | Statement | C | Refact.ai Match 1 (Codeforces Round 985) {2029} | PROGRAMMING | 1750.0 | ||
| 66 | Message Spread | bitmasks combinatorics dp | Statement | H | Refact.ai Match 1 (Codeforces Round 985) {2029} | PROGRAMMING | 5000.0 | ||
| 2983 | Cool Graph | constructive algorithms data structures dfs and similar ds graphs trees | Statement | D | Refact.ai Match 1 (Codeforces Round 985) {2029} | PROGRAMMING | 2250.0 | ||
| 2716 | Common Generator | brute force constructive algorithms greedy math number theory | Statement | E | Refact.ai Match 1 (Codeforces Round 985) {2029} | PROGRAMMING | 2500.0 | ||
| 159 | Balanced Problem | data structures dp | Statement | G | Refact.ai Match 1 (Codeforces Round 985) {2029} | PROGRAMMING | 3500.0 | ||
| 126 | The Destruction of the Universe (Hard Version) | math | Statement | G2 | Codeforces Round 979 (Div. 2) {2030} | PROGRAMMING | 1500.0 | ||
| 172 | The Destruction of the Universe (Easy Version) | combinatorics math | Statement | G1 | Codeforces Round 979 (Div. 2) {2030} | PROGRAMMING | 3000.0 | ||
| 6719 | QED's Favorite Permutation | bitmasks data structures implementation sortings | Statement | D | Codeforces Round 979 (Div. 2) {2030} | PROGRAMMING | 1500.0 | ||
| 816 | Orangutan Approved Subarrays | binary search brute force data structures greedy two pointers | Statement | F | Codeforces Round 979 (Div. 2) {2030} | PROGRAMMING | 2500.0 | ||
| 21057 | Minimise Oneness | brute force combinatorics constructive algorithms | Statement | B | Codeforces Round 979 (Div. 2) {2030} | PROGRAMMING | 500.0 | ||
| 1460 | MEXimize the Score | brute force combinatorics data structures dp math | Statement | E | Codeforces Round 979 (Div. 2) {2030} | PROGRAMMING | 2000.0 | ||
| 17009 | A TRUE Battle | brute force games greedy | Statement | C | Codeforces Round 979 (Div. 2) {2030} | PROGRAMMING | 1000.0 | ||
| 24638 | A Gift From Orangutan | brute force dfs and similar greedy sortings | Statement | A | Codeforces Round 979 (Div. 2) {2030} | PROGRAMMING | 250.0 | ||
| 16659 | Penchick and Satay Sticks | greedy sortings | Statement | B | Codeforces Round 987 (Div. 2) {2031} | PROGRAMMING | 1000.0 | ||
| 17769 | Penchick and Modern Monument | dp greedy math two pointers | Statement | A | Codeforces Round 987 (Div. 2) {2031} | PROGRAMMING | 500.0 | ||
| 327 | Penchick and Even Medians | binary search constructive algorithms interactive | Statement | F | Codeforces Round 987 (Div. 2) {2031} | PROGRAMMING | 3000.0 | ||
| 7031 | Penchick and Desert Rabbit | data structures dfs and similar dp ds greedy two pointers | Statement | D | Codeforces Round 987 (Div. 2) {2031} | PROGRAMMING | 2000.0 | ||
| 2110 | Penchick and Chloe's Trees | data structures dfs and similar dp greedy sortings trees | Statement | E | Codeforces Round 987 (Div. 2) {2031} | PROGRAMMING | 2500.0 | ||
| 12115 | Penchick and BBQ Buns | brute force constructive algorithms math number theory | Statement | C | Codeforces Round 987 (Div. 2) {2031} | PROGRAMMING | 1500.0 | ||
| 12699 | Trinity | binary search math sortings two pointers | Statement | C | Codeforces Round 983 (Div. 2) {2032} | PROGRAMMING | 1250.0 | ||
| 324 | Peanuts | combinatorics dp games math | Statement | F | Codeforces Round 983 (Div. 2) {2032} | PROGRAMMING | 3000.0 | ||
| 17228 | Medians | constructive algorithms greedy hashing implementation math | Statement | B | Codeforces Round 983 (Div. 2) {2032} | PROGRAMMING | 750.0 | ||
| 5008 | Genokraken | binary search constructive algorithms data structures graphs interactive trees two pointers | Statement | D | Codeforces Round 983 (Div. 2) {2032} | PROGRAMMING | 1750.0 | ||
| 21884 | Circuit | greedy implementation math number theory | Statement | A | Codeforces Round 983 (Div. 2) {2032} | PROGRAMMING | 500.0 | ||
| 1101 | Balanced | constructive algorithms data structures implementation math | Statement | E | Codeforces Round 983 (Div. 2) {2032} | PROGRAMMING | 2250.0 | ||
| 13923 | Sakurako's Field Trip | binary search dp greedy | Statement | C | Codeforces Round 981 (Div. 3) {2033} | PROGRAMMING | |||
| 10908 | Sakurako, Kosuke, and the Permutation | brute force data structures dfs and similar ds fft greedy math | Statement | E | Codeforces Round 981 (Div. 3) {2033} | PROGRAMMING | |||
| 24508 | Sakurako and Water | constructive algorithms greedy | Statement | B | Codeforces Round 981 (Div. 3) {2033} | PROGRAMMING | |||
| 35117 | Sakurako and Kosuke | constructive algorithms math | Statement | A | Codeforces Round 981 (Div. 3) {2033} | PROGRAMMING | |||
| 1433 | Sakurako and Chefir | data structures dfs and similar dp trees | Statement | G | Codeforces Round 981 (Div. 3) {2033} | PROGRAMMING | |||
| 14323 | Kousuke's Assignment | dp ds greedy math | Statement | D | Codeforces Round 981 (Div. 3) {2033} | PROGRAMMING | |||
| 5668 | Kosuke's Sloth | brute force math number theory | Statement | F | Codeforces Round 981 (Div. 3) {2033} | PROGRAMMING | |||
| 6542 | Trapped in the Witch's Labyrinth | constructive algorithms dfs and similar graphs implementation | Statement | C | Rayan Programming Contest 2024 - Selection (Codeforces Round 989, Div. 1 + Div. 2) {2034} | PROGRAMMING | 1500.0 | ||
| 35 | Simurgh's Watch (Hard Version) | greedy implementation | Statement | G2 | Rayan Programming Contest 2024 - Selection (Codeforces Round 989, Div. 1 + Div. 2) {2034} | PROGRAMMING | 3000.0 | ||
| 43 | Simurgh's Watch (Easy Version) | greedy implementation | Statement | G1 | Rayan Programming Contest 2024 - Selection (Codeforces Round 989, Div. 1 + Div. 2) {2034} | PROGRAMMING | 3000.0 | ||
| 100 | Rayan vs. Rayaneh | dp number theory | Statement | H | Rayan Programming Contest 2024 - Selection (Codeforces Round 989, Div. 1 + Div. 2) {2034} | PROGRAMMING | 5000.0 | ||
| 11912 | Rakhsh's Revival | data structures greedy implementation two pointers | Statement | B | Rayan Programming Contest 2024 - Selection (Codeforces Round 989, Div. 1 + Div. 2) {2034} | PROGRAMMING | 750.0 | ||
| 1563 | Permutations Harmony | brute force combinatorics constructive algorithms greedy hashing implementation math | Statement | E | Rayan Programming Contest 2024 - Selection (Codeforces Round 989, Div. 1 + Div. 2) {2034} | PROGRAMMING | 2000.0 | ||
| 15312 | King Keykhosrow's Mystery | brute force chinese remainder theorem math number theory | Statement | A | Rayan Programming Contest 2024 - Selection (Codeforces Round 989, Div. 1 + Div. 2) {2034} | PROGRAMMING | 500.0 | ||
| 373 | Khayyam's Royal Decree (Hard Version) | combinatorics dp math | Statement | F2 | Rayan Programming Contest 2024 - Selection (Codeforces Round 989, Div. 1 + Div. 2) {2034} | PROGRAMMING | 2000.0 | ||
| 637 | Khayyam's Royal Decree (Easy Version) | combinatorics dp math | Statement | F1 | Rayan Programming Contest 2024 - Selection (Codeforces Round 989, Div. 1 + Div. 2) {2034} | PROGRAMMING | 2000.0 | ||
| 4858 | Darius' Wisdom | constructive algorithms greedy implementation sortings | Statement | D | Rayan Programming Contest 2024 - Selection (Codeforces Round 989, Div. 1 + Div. 2) {2034} | PROGRAMMING | 1500.0 | ||
| 4868 | Yet Another Real Number Problem | binary search brute force data structures dp greedy implementation math two pointers | Statement | D | Codeforces Global Round 27 {2035} | PROGRAMMING | 1500.0 | ||
| 875 | Tree Operations | binary search dfs and similar dp trees | Statement | F | Codeforces Global Round 27 {2035} | PROGRAMMING | 2250.0 | ||
| 16148 | Sliding | math | Statement | A | Codeforces Global Round 27 {2035} | PROGRAMMING | 250.0 | ||
| 66 | Peak Productivity Forces | constructive algorithms | Statement | H | Codeforces Global Round 27 {2035} | PROGRAMMING | 4500.0 | ||
| 1662 | Monster | binary search brute force math | Statement | E | Codeforces Global Round 27 {2035} | PROGRAMMING | 2000.0 | ||
| 87 | Go Learn! (Hard Version) | divide and conquer dp | Statement | G2 | Codeforces Global Round 27 {2035} | PROGRAMMING | 2000.0 | ||
| 146 | Go Learn! (Easy Version) | dp trees | Statement | G1 | Codeforces Global Round 27 {2035} | PROGRAMMING | 2250.0 | ||
| 16662 | Everyone Loves Tres | constructive algorithms greedy math number theory | Statement | B | Codeforces Global Round 27 {2035} | PROGRAMMING | 500.0 | ||
| 8985 | Alya and Permutation | bitmasks constructive algorithms data structures | Statement | C | Codeforces Global Round 27 {2035} | PROGRAMMING | 1000.0 | ||
| 3771 | XORificator 3000 | bitmasks dp number theory | Statement | F | Codeforces Round 984 (Div. 3) {2036} | PROGRAMMING | |||
| 25310 | Startup | greedy sortings | Statement | B | Codeforces Round 984 (Div. 3) {2036} | PROGRAMMING | |||
| 7433 | Reverse the Rivers | binary search greedy | Statement | E | Codeforces Round 984 (Div. 3) {2036} | PROGRAMMING | |||
| 33783 | Quintomania | implementation | Statement | A | Codeforces Round 984 (Div. 3) {2036} | PROGRAMMING | |||
| 1268 | Library of Magic | binary search bitmasks constructive algorithms interactive | Statement | G | Codeforces Round 984 (Div. 3) {2036} | PROGRAMMING | |||
| 12917 | I Love 1543 | brute force implementation matrices | Statement | D | Codeforces Round 984 (Div. 3) {2036} | PROGRAMMING | |||
| 18338 | Anya and 1100 | brute force data structures implementation | Statement | C | Codeforces Round 984 (Div. 3) {2036} | PROGRAMMING | |||
| 28732 | Twice | implementation | Statement | A | Codeforces Round 988 (Div. 3) {2037} | PROGRAMMING | |||
| 19714 | Superultra's Favorite Permutation | constructive algorithms greedy math number theory | Statement | C | Codeforces Round 988 (Div. 3) {2037} | PROGRAMMING | |||
| 11235 | Sharky Surfing | data structures greedy two pointers | Statement | D | Codeforces Round 988 (Div. 3) {2037} | PROGRAMMING | |||
| 2587 | Natlan Exploring | combinatorics dp math number theory | Statement | G | Codeforces Round 988 (Div. 3) {2037} | PROGRAMMING | |||
| 5559 | Kachina's Favorite Binary String | greedy interactive two pointers | Statement | E | Codeforces Round 988 (Div. 3) {2037} | PROGRAMMING | |||
| 21698 | Intercepted Inputs | brute force implementation | Statement | B | Codeforces Round 988 (Div. 3) {2037} | PROGRAMMING | |||
| 2110 | Ardent Flames | binary search data structures sortings two pointers | Statement | F | Codeforces Round 988 (Div. 3) {2037} | PROGRAMMING | |||
| 4451 | DIY | geometry greedy | Statement | C | 2024-2025 ICPC, NERC, Southern and Volga Russian Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2038} | PROGRAMMING | 1400 | ||
| 5154 | Bridge Renovation | brute force dp greedy math | Statement | L | 2024-2025 ICPC, NERC, Southern and Volga Russian Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2038} | PROGRAMMING | 1400 | ||
| 3588 | Bonus Project | games greedy | Statement | A | 2024-2025 ICPC, NERC, Southern and Volga Russian Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2038} | PROGRAMMING | 1400 | ||
| 2126 | Guess One Character | constructive algorithms interactive | Statement | G | 2024-2025 ICPC, NERC, Southern and Volga Russian Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2038} | PROGRAMMING | 1900 | ||
| 1384 | Make It Equal | binary search brute force greedy math | Statement | B | 2024-2025 ICPC, NERC, Southern and Volga Russian Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2038} | PROGRAMMING | 2100 | ||
| 1231 | Grid Walk | dp greedy math number theory | Statement | K | 2024-2025 ICPC, NERC, Southern and Volga Russian Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2038} | PROGRAMMING | 2100 | ||
| 611 | Divide OR Conquer | bitmasks data structures dp implementation | Statement | D | 2024-2025 ICPC, NERC, Southern and Volga Russian Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2038} | PROGRAMMING | 2400 | ||
| 568 | Polyathlon | data structures hashing string suffix structures strings | Statement | I | 2024-2025 ICPC, NERC, Southern and Volga Russian Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2038} | PROGRAMMING | 2500 | ||
| 375 | Alternative Platforms | combinatorics data structures fft math sortings | Statement | F | 2024-2025 ICPC, NERC, Southern and Volga Russian Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2038} | PROGRAMMING | 2500 | ||
| 233 | Royal Flush | dp implementation | Statement | M | 2024-2025 ICPC, NERC, Southern and Volga Russian Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2038} | PROGRAMMING | 2800 | ||
| 118 | Barrels | data structures greedy math | Statement | E | 2024-2025 ICPC, NERC, Southern and Volga Russian Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2038} | PROGRAMMING | 2900 | ||
| 111 | Galactic Council | flows | Statement | H | 2024-2025 ICPC, NERC, Southern and Volga Russian Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2038} | PROGRAMMING | 3000 | ||
| 6813 | Waiting for... | greedy implementation | Statement | J | 2024-2025 ICPC, NERC, Southern and Volga Russian Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2038} | PROGRAMMING | 800 | ||
| 8808 | Fixing the Expression | implementation | Statement | N | 2024-2025 ICPC, NERC, Southern and Volga Russian Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2038} | PROGRAMMING | 800 | ||
| 3937 | Shohag Loves XOR (Hard Version) | bitmasks brute force math number theory | Statement | C2 | CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!) {2039} | PROGRAMMING | 1500.0 | ||
| 10243 | Shohag Loves XOR (Easy Version) | bitmasks brute force math number theory | Statement | C1 | CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!) {2039} | PROGRAMMING | 1000.0 | ||
| 13105 | Shohag Loves Strings | constructive algorithms greedy implementation strings | Statement | B | CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!) {2039} | PROGRAMMING | 1000.0 | ||
| 44 | Shohag Loves Pebae | Statement | G | CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!) {2039} | PROGRAMMING | 4250.0 | |||
| 15436 | Shohag Loves Mod | constructive algorithms number theory | Statement | A | CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!) {2039} | PROGRAMMING | 500.0 | ||
| 1864 | Shohag Loves Inversions | combinatorics constructive algorithms dp math | Statement | E | CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!) {2039} | PROGRAMMING | 2750.0 |