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 ... 101 102 103 104 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
---|---|---|---|---|---|---|---|---|---|
4024 | White Magic | constructive algorithms greedy implementation | Statement | B | Codeforces Round 1004 (Div. 1) {2066} | PROGRAMMING | 750.0 | ||
268 | Tropical Season | data structures greedy implementation | Statement | E | Codeforces Round 1004 (Div. 1) {2066} | PROGRAMMING | 2000.0 | ||
5462 | Object Identification | graphs implementation interactive | Statement | A | Codeforces Round 1004 (Div. 1) {2066} | PROGRAMMING | 750.0 | ||
45 | Curse | constructive algorithms dp math | Statement | F | Codeforces Round 1004 (Div. 1) {2066} | PROGRAMMING | 3000.0 | ||
412 | Club of Young Aircraft Builders (hard version) | combinatorics dp math | Statement | D2 | Codeforces Round 1004 (Div. 1) {2066} | PROGRAMMING | 1250.0 | ||
1006 | Club of Young Aircraft Builders (easy version) | combinatorics dp math | Statement | D1 | Codeforces Round 1004 (Div. 1) {2066} | PROGRAMMING | 750.0 | ||
1749 | Bitwise Slides | bitmasks combinatorics dp math | Statement | C | Codeforces Round 1004 (Div. 1) {2066} | PROGRAMMING | 1250.0 | ||
15110 | Two Large Bags | dp greedy sortings | Statement | B | Codeforces Round 1004 (Div. 2) {2067} | PROGRAMMING | 1000.0 | ||
10247 | Devyatkino | brute force dp greedy math | Statement | C | Codeforces Round 1004 (Div. 2) {2067} | PROGRAMMING | 1250.0 | ||
22378 | Adjacent Digit Sums | constructive algorithms math | Statement | A | Codeforces Round 1004 (Div. 2) {2067} | PROGRAMMING | 500.0 | ||
65 | Urban Planning | constructive algorithms | Statement | B | European Championship 2025 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {2068} | PROGRAMMING | |||
909 | The Ultimate Wine Tasting Event | combinatorics greedy | Statement | J | European Championship 2025 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {2068} | PROGRAMMING | |||
241 | Statues | constructive algorithms greedy | Statement | H | European Championship 2025 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {2068} | PROGRAMMING | |||
193 | Porto Vs. Benfica | data structures dfs and similar ds graphs shortest paths | Statement | E | European Championship 2025 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {2068} | PROGRAMMING | |||
25 | Pinball | graphs shortest paths | Statement | I | European Championship 2025 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {2068} | PROGRAMMING | |||
137 | Morse Code | dp greedy sortings trees | Statement | D | European Championship 2025 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {2068} | PROGRAMMING | |||
772 | Mascot Naming | brute force greedy strings | Statement | F | European Championship 2025 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {2068} | PROGRAMMING | |||
592 | Condorcet Elections | constructive algorithms graphs probabilities | Statement | A | European Championship 2025 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {2068} | PROGRAMMING | |||
27 | A Very Long Hike | shortest paths | Statement | G | European Championship 2025 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {2068} | PROGRAMMING | |||
123 | Amusement Park Rides | flows graphs | Statement | K | European Championship 2025 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {2068} | PROGRAMMING | |||
845 | Ads | binary search greedy two pointers | Statement | C | European Championship 2025 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {2068} | PROGRAMMING | |||
23783 | Was there an Array? | brute force greedy | Statement | A | Educational Codeforces Round 174 (Rated for Div. 2) {2069} | PROGRAMMING | |||
15555 | Set of Strangers | greedy matrices | Statement | B | Educational Codeforces Round 174 (Rated for Div. 2) {2069} | PROGRAMMING | |||
5444 | Palindrome Shuffle | binary search greedy hashing strings two pointers | Statement | D | Educational Codeforces Round 174 (Rated for Div. 2) {2069} | PROGRAMMING | |||
583 | Graph Inclusion | data structures divide and conquer ds | Statement | F | Educational Codeforces Round 174 (Rated for Div. 2) {2069} | PROGRAMMING | |||
11248 | Beautiful Sequence | combinatorics dp greedy | Statement | C | Educational Codeforces Round 174 (Rated for Div. 2) {2069} | PROGRAMMING | |||
1442 | A, B, AB and BA | constructive algorithms greedy sortings strings | Statement | E | Educational Codeforces Round 174 (Rated for Div. 2) {2069} | PROGRAMMING | |||
7580 | Tree Jumps | combinatorics dfs and similar dp trees | Statement | D | Educational Codeforces Round 175 (Rated for Div. 2) {2070} | PROGRAMMING | |||
16528 | Robot Program | brute force implementation math | Statement | B | Educational Codeforces Round 175 (Rated for Div. 2) {2070} | PROGRAMMING | |||
10249 | Limited Repainting | binary search greedy | Statement | C | Educational Codeforces Round 175 (Rated for Div. 2) {2070} | PROGRAMMING | |||
1297 | Game with Binary String | data structures divide and conquer games greedy math | Statement | E | Educational Codeforces Round 175 (Rated for Div. 2) {2070} | PROGRAMMING | |||
236 | Friends and Pizza | Statement | F | Educational Codeforces Round 175 (Rated for Div. 2) {2070} | PROGRAMMING | ||||
22825 | FizzBuzz Remixed | brute force math | Statement | A | Educational Codeforces Round 175 (Rated for Div. 2) {2070} | PROGRAMMING | |||
7190 | Trapmigiano Reggiano | constructive algorithms dfs and similar sortings trees | Statement | C | Codeforces Round 1007 (Div. 2) {2071} | PROGRAMMING | 1500.0 | ||
179 | Towering Arrays | binary search data structures | Statement | F | Codeforces Round 1007 (Div. 2) {2071} | PROGRAMMING | 3000.0 | ||
23621 | The Play Never Ends | math number theory | Statement | A | Codeforces Round 1007 (Div. 2) {2071} | PROGRAMMING | 500.0 | ||
16792 | Perfecto | brute force constructive algorithms greedy math probabilities | Statement | B | Codeforces Round 1007 (Div. 2) {2071} | PROGRAMMING | 1000.0 | ||
265 | LeaFall | combinatorics probabilities trees | Statement | E | Codeforces Round 1007 (Div. 2) {2071} | PROGRAMMING | 2500.0 | ||
690 | Infinite Sequence (Hard Version) | bitmasks constructive algorithms data structures dp implementation math | Statement | D2 | Codeforces Round 1007 (Div. 2) {2071} | PROGRAMMING | 1250.0 | ||
4889 | Infinite Sequence (Easy Version) | bitmasks dp math | Statement | D1 | Codeforces Round 1007 (Div. 2) {2071} | PROGRAMMING | 1750.0 | ||
34920 | New World, New Me, New Array | greedy greedy implementation math | Statement | A | Codeforces Round 1006 (Div. 3) {2072} | PROGRAMMING | |||
1562 | I've Been Flipping Numbers for 300 Years and Calculated the Sum | brute force math number theory | Statement | G | Codeforces Round 1006 (Div. 3) {2072} | PROGRAMMING | |||
25625 | Having Been a Treasurer in the Past, I Help Goblins Deceive | combinatorics constructive algorithms strings | Statement | B | Codeforces Round 1006 (Div. 3) {2072} | PROGRAMMING | |||
6219 | Goodbye, Banker Life | bitmasks combinatorics constructive algorithms math number theory | Statement | F | Codeforces Round 1006 (Div. 3) {2072} | PROGRAMMING | |||
14106 | For Wizards, the Exam Is Easy, but I Couldn't Handle It | brute force greedy implementation | Statement | D | Codeforces Round 1006 (Div. 3) {2072} | PROGRAMMING | |||
9350 | Do You Love Your Hero and His Two-Hit Multi-Target Attacks? | binary search constructive algorithms geometry greedy math | Statement | E | Codeforces Round 1006 (Div. 3) {2072} | PROGRAMMING | |||
15608 | Creating Keys for StORages Has Become My Main Skill | bitmasks constructive algorithms greedy | Statement | C | Codeforces Round 1006 (Div. 3) {2072} | PROGRAMMING | |||
323 | Tower of Hanoi | Statement | D | 2025 ICPC Asia Pacific Championship - Online Mirror (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2073} | PROGRAMMING | ||||
17 | Three-Dimensional Embedding | Statement | B | 2025 ICPC Asia Pacific Championship - Online Mirror (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2073} | PROGRAMMING | ||||
67 | Squares on Grid Lines | Statement | I | 2025 ICPC Asia Pacific Championship - Online Mirror (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2073} | PROGRAMMING | ||||
192 | Secret Lilies and Roses | interactive | Statement | H | 2025 ICPC Asia Pacific Championship - Online Mirror (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2073} | PROGRAMMING | |||
40 | Minus Operator | interactive | Statement | E | 2025 ICPC Asia Pacific Championship - Online Mirror (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2073} | PROGRAMMING | |||
27 | Hold the Star | Statement | F | 2025 ICPC Asia Pacific Championship - Online Mirror (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2073} | PROGRAMMING | ||||
681 | Gathering Sharks | Statement | J | 2025 ICPC Asia Pacific Championship - Online Mirror (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2073} | PROGRAMMING | ||||
560 | Corrupted File | Statement | G | 2025 ICPC Asia Pacific Championship - Online Mirror (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2073} | PROGRAMMING | ||||
791 | Control Towers | Statement | A | 2025 ICPC Asia Pacific Championship - Online Mirror (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2073} | PROGRAMMING | ||||
40 | Can You Reach There? | Statement | M | 2025 ICPC Asia Pacific Championship - Online Mirror (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2073} | PROGRAMMING | ||||
196 | Cactus Connectivity | Statement | C | 2025 ICPC Asia Pacific Championship - Online Mirror (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2073} | PROGRAMMING | ||||
137 | Book Sorting | Statement | K | 2025 ICPC Asia Pacific Championship - Online Mirror (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2073} | PROGRAMMING | ||||
1085 | Boarding Queue | Statement | L | 2025 ICPC Asia Pacific Championship - Online Mirror (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2073} | PROGRAMMING | ||||
17425 | XOR and Triangle | binary search bitmasks brute force greedy | Statement | C | Codeforces Round 1009 (Div. 3) {2074} | PROGRAMMING | |||
28636 | The Third Side | greedy math | Statement | B | Codeforces Round 1009 (Div. 3) {2074} | PROGRAMMING | |||
1378 | Game With Triangles: Season 2 | dp greedy | Statement | G | Codeforces Round 1009 (Div. 3) {2074} | PROGRAMMING | |||
4868 | Empty Triangle | geometry interactive probabilities | Statement | E | Codeforces Round 1009 (Div. 3) {2074} | PROGRAMMING | |||
34394 | Draw a Square | implementation | Statement | A | Codeforces Round 1009 (Div. 3) {2074} | PROGRAMMING | |||
9052 | Counting Points | brute force geometry implementation two pointers | Statement | D | Codeforces Round 1009 (Div. 3) {2074} | PROGRAMMING | |||
1781 | Counting Necessary Nodes | bitmasks divide and conquer implementation math | Statement | F | Codeforces Round 1009 (Div. 3) {2074} | PROGRAMMING | |||
693 | XOR Matrix | bitmasks dp | Statement | E | Educational Codeforces Round 176 (Rated for Div. 2) {2075} | PROGRAMMING | |||
10221 | Two Colors | binary search data structures dp math | Statement | C | Educational Codeforces Round 176 (Rated for Div. 2) {2075} | PROGRAMMING | |||
23145 | To Zero | greedy math | Statement | A | Educational Codeforces Round 176 (Rated for Div. 2) {2075} | PROGRAMMING | |||
3889 | Equalization | bitmasks brute force dp greedy math | Statement | D | Educational Codeforces Round 176 (Rated for Div. 2) {2075} | PROGRAMMING | |||
338 | Beautiful Sequence Returns | binary search data structures implementation | Statement | F | Educational Codeforces Round 176 (Rated for Div. 2) {2075} | PROGRAMMING | |||
14073 | Array Recoloring | greedy | Statement | B | Educational Codeforces Round 176 (Rated for Div. 2) {2075} | PROGRAMMING | |||
58 | RGB Walking | bitmasks chinese remainder theorem dfs and similar graphs number theory | Statement | G | Codeforces Round 1008 (Div. 1) {2077} | PROGRAMMING | 3000.0 | ||
216 | Maximum Polygon | brute force data structures implementation math | Statement | D | Codeforces Round 1008 (Div. 1) {2077} | PROGRAMMING | 2250.0 | ||
2400 | Finding OR Sum | bitmasks constructive algorithms implementation interactive math | Statement | B | Codeforces Round 1008 (Div. 1) {2077} | PROGRAMMING | 1000.0 | ||
10451 | Breach of Faith | constructive algorithms greedy math sortings | Statement | A | Codeforces Round 1008 (Div. 1) {2077} | PROGRAMMING | 500.0 | ||
1196 | Binary Subsequence Value Sum | combinatorics dp fft implementation math | Statement | C | Codeforces Round 1008 (Div. 1) {2077} | PROGRAMMING | 1500.0 | ||
396 | Another Folding Strip | combinatorics data structures divide and conquer dp math sortings | Statement | E | Codeforces Round 1008 (Div. 1) {2077} | PROGRAMMING | 2250.0 | ||
166 | AND x OR | bitmasks constructive algorithms dp | Statement | F | Codeforces Round 1008 (Div. 1) {2077} | PROGRAMMING | 2500.0 | ||
14689 | Vicious Labyrinth | constructive algorithms graphs greedy implementation math | Statement | B | Codeforces Round 1008 (Div. 2) {2078} | PROGRAMMING | 750.0 | ||
4387 | Scammy Game Ad | dp greedy math | Statement | D | Codeforces Round 1008 (Div. 2) {2078} | PROGRAMMING | 1750.0 | ||
19373 | Final Verdict | greedy math | Statement | A | Codeforces Round 1008 (Div. 2) {2078} | PROGRAMMING | 500.0 | ||
129 | Dreaming Is Not Harmful | *special | Statement | C | XIX Open Olympiad in Informatics - Final Stage, Day 1 (Unrated, Online Mirror, IOI rules) {2079} | PROGRAMMING | |||
341 | Cute Subsequences | *special sortings | Statement | D | XIX Open Olympiad in Informatics - Final Stage, Day 1 (Unrated, Online Mirror, IOI rules) {2079} | PROGRAMMING | |||
87 | Arithmetic Exercise | *special data structures dp greedy | Statement | B | XIX Open Olympiad in Informatics - Final Stage, Day 1 (Unrated, Online Mirror, IOI rules) {2079} | PROGRAMMING | |||
13 | Alice, Bob, And Two Arrays | *special data structures dp games | Statement | A | XIX Open Olympiad in Informatics - Final Stage, Day 1 (Unrated, Online Mirror, IOI rules) {2079} | PROGRAMMING | |||
16 | Strong Connectivity Strikes Back | *special constructive algorithms graphs | Statement | A | XIX Open Olympiad in Informatics - Final Stage, Day 2 (Unrated, Online Mirror, IOI rules) {2080} | PROGRAMMING | |||
21 | Order Statistics | *special binary search | Statement | D | XIX Open Olympiad in Informatics - Final Stage, Day 2 (Unrated, Online Mirror, IOI rules) {2080} | PROGRAMMING | |||
87 | Card Flip | *special | Statement | C | XIX Open Olympiad in Informatics - Final Stage, Day 2 (Unrated, Online Mirror, IOI rules) {2080} | PROGRAMMING | |||
192 | Best Runner | *special | Statement | B | XIX Open Olympiad in Informatics - Final Stage, Day 2 (Unrated, Online Mirror, IOI rules) {2080} | PROGRAMMING | |||
186 | Quaternary Matrix | bitmasks greedy | Statement | C | Codeforces Round 1010 (Div. 1, Unrated) {2081} | PROGRAMMING | 1750.0 | ||
33 | Quantifier | combinatorics dp implementation | Statement | E | Codeforces Round 1010 (Div. 1, Unrated) {2081} | PROGRAMMING | 2250.0 | ||
565 | MST in Modulo Graph | constructive algorithms ds graphs greedy math number theory sortings | Statement | D | Codeforces Round 1010 (Div. 1, Unrated) {2081} | PROGRAMMING | 1750.0 | ||
2199 | Math Division | bitmasks dp math probabilities | Statement | A | Codeforces Round 1010 (Div. 1, Unrated) {2081} | PROGRAMMING | 500.0 | ||
56 | Hot Matrix | constructive algorithms math | Statement | F | Codeforces Round 1010 (Div. 1, Unrated) {2081} | PROGRAMMING | 2500.0 | ||
22 | Hard Formula (Hard Version) | math | Statement | G2 | Codeforces Round 1010 (Div. 1, Unrated) {2081} | PROGRAMMING | 1500.0 | ||
45 | Hard Formula | math | Statement | G1 | Codeforces Round 1010 (Div. 1, Unrated) {2081} | PROGRAMMING | 1500.0 | ||
604 | Balancing | greedy | Statement | B | Codeforces Round 1010 (Div. 1, Unrated) {2081} | PROGRAMMING | 1000.0 | ||
5218 | Floor or Ceil | Statement | B | Codeforces Round 1010 (Div. 2, Unrated) {2082} | PROGRAMMING | 1000.0 |