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 ... 76 77 78 79 80 ... 100 101 102 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 1137 | Il Derby della Madonnina | data structures dp | Statement | L | SWERC 2021-2022 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1662} | PROGRAMMING | 102042 | ||
| 2242 | Ice Cream Shop | sortings | Statement | I | SWERC 2021-2022 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1662} | PROGRAMMING | 102042 | ||
| 485 | Gastronomic Event | trees | Statement | G | SWERC 2021-2022 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1662} | PROGRAMMING | 102042 | ||
| 1932 | Evolution of Weasels | strings | Statement | D | SWERC 2021-2022 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1662} | PROGRAMMING | 102042 | ||
| 346 | European Trip | graphs | Statement | C | SWERC 2021-2022 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1662} | PROGRAMMING | 102042 | ||
| 805 | Drone Photo | math sortings | Statement | N | SWERC 2021-2022 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1662} | PROGRAMMING | 102042 | ||
| 1444 | Circular Maze | dfs and similar graphs implementation | Statement | O | SWERC 2021-2022 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1662} | PROGRAMMING | 102042 | ||
| 3120 | Boundary | math | Statement | H | SWERC 2021-2022 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1662} | PROGRAMMING | 102042 | ||
| 3605 | Bottle Arrangements | constructive algorithms | Statement | M | SWERC 2021-2022 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1662} | PROGRAMMING | 102042 | ||
| 1084 | Antennas | data structures dfs and similar graphs graphs implementation implementation shortest paths shortest paths | Statement | F | SWERC 2021-2022 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1662} | PROGRAMMING | 102042 | ||
| 10560 | Who Tested? | trees | Statement | A | April Fools Day Contest 2022 {1663} | PROGRAMMING | April Fools Day Contest 2022 Editorial | ||
| 213 | Six Characters | Statement | G | April Fools Day Contest 2022 {1663} | PROGRAMMING | April Fools Day Contest 2022 Editorial | |||
| 5712 | Pōja Verdon | implementation | Statement | C | April Fools Day Contest 2022 {1663} | PROGRAMMING | April Fools Day Contest 2022 Editorial | ||
| 3426 | Mike's Sequence | math | Statement | B | April Fools Day Contest 2022 {1663} | PROGRAMMING | April Fools Day Contest 2022 Editorial | ||
| 1421 | Is it rated - 3 | Statement | D | April Fools Day Contest 2022 {1663} | PROGRAMMING | April Fools Day Contest 2022 Editorial | |||
| 349 | In Every Generation... | Statement | F | April Fools Day Contest 2022 {1663} | PROGRAMMING | April Fools Day Contest 2022 Editorial | |||
| 1289 | Cross-Language Program | constructive algorithms | Statement | H | April Fools Day Contest 2022 {1663} | PROGRAMMING | April Fools Day Contest 2022 Editorial | ||
| 559 | Are You Safe? | implementation | Statement | E | April Fools Day Contest 2022 {1663} | PROGRAMMING | April Fools Day Contest 2022 Editorial | ||
| 8548 | Tree Infection | binary search dfs and similar greedy trees | Statement | C | Codeforces Round 781 (Div. 2) {1665} | PROGRAMMING | 1250.0 | Codeforces Round #781 (Div. 2) Editorial | |
| 1565 | MinimizOR | binary search bitmasks data structures dp greedy implementation | Statement | E | Codeforces Round 781 (Div. 2) {1665} | PROGRAMMING | 2250.0 | Codeforces Round #781 (Div. 2) Editorial | |
| 23998 | GCD vs LCM | constructive algorithms math | Statement | A | Codeforces Round 781 (Div. 2) {1665} | PROGRAMMING | 500.0 | Codeforces Round #781 (Div. 2) Editorial | |
| 4087 | GCD Guess | bitmasks chinese remainder theorem constructive algorithms interactive math number theory | Statement | D | Codeforces Round 781 (Div. 2) {1665} | PROGRAMMING | 1500.0 | Codeforces Round #781 (Div. 2) Editorial | |
| 21740 | Array Cloning Technique | constructive algorithms greedy sortings | Statement | B | Codeforces Round 781 (Div. 2) {1665} | PROGRAMMING | 750.0 | Codeforces Round #781 (Div. 2) Editorial | |
| 3255 | Labyrinth | dfs and similar graphs | Statement | L | 2021-2022 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1666} | PROGRAMMING | Tutorial (PDF) | ||
| 254 | Kingdom Partition | Statement | K | 2021-2022 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1666} | PROGRAMMING | Tutorial (PDF) | |||
| 1403 | Job Lookup | constructive algorithms dp | Statement | J | 2021-2022 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1666} | PROGRAMMING | Tutorial (PDF) | ||
| 1516 | Interactive Treasure Hunt | brute force interactive math | Statement | I | 2021-2022 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1666} | PROGRAMMING | Tutorial (PDF) | ||
| 73 | Heroes of Might | math | Statement | H | 2021-2022 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1666} | PROGRAMMING | |||
| 138 | Global Warming | geometry math | Statement | G | 2021-2022 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1666} | PROGRAMMING | |||
| 1233 | Fancy Stack | combinatorics dp | Statement | F | 2021-2022 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1666} | PROGRAMMING | Tutorial (PDF) | ||
| 758 | Even Split | binary search constructive algorithms greedy | Statement | E | 2021-2022 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1666} | PROGRAMMING | Tutorial (PDF) | ||
| 9624 | Deletive Editing | greedy | Statement | D | 2021-2022 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1666} | PROGRAMMING | Tutorial (PDF) | ||
| 3306 | Connect the Points | brute force constructive algorithms geometry | Statement | C | 2021-2022 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1666} | PROGRAMMING | Tutorial (PDF) | ||
| 55 | Budget Distribution | Statement | B | 2021-2022 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1666} | PROGRAMMING | Tutorial (PDF) | |||
| 113 | Admissible Map | Statement | A | 2021-2022 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1666} | PROGRAMMING | Tutorial (PDF) | |||
| 14899 | Make it Increasing | brute force greedy math | Statement | A | Codeforces Round 783 (Div. 1) {1667} | PROGRAMMING | 250.0 | Codeforces Round #783 Editorial | 1300 |
| 3807 | Optimal Partition | data structures dp | Statement | B | Codeforces Round 783 (Div. 1) {1667} | PROGRAMMING | 1000.0 | Codeforces Round #783 Editorial | 2100 |
| 1707 | Half Queen Cover | constructive algorithms math | Statement | C | Codeforces Round 783 (Div. 1) {1667} | PROGRAMMING | 1500.0 | Codeforces Round #783 Editorial | 2400 |
| 681 | Edge Elimination | constructive algorithms dfs and similar dp trees | Statement | D | Codeforces Round 783 (Div. 1) {1667} | PROGRAMMING | 2000.0 | Codeforces Round #783 Editorial | 2900 |
| 692 | Centroid Probabilities | combinatorics dp fft math | Statement | E | Codeforces Round 783 (Div. 1) {1667} | PROGRAMMING | 2750.0 | Codeforces Round #783 Editorial | 3000 |
| 104 | Yin Yang | implementation | Statement | F | Codeforces Round 783 (Div. 1) {1667} | PROGRAMMING | 3500.0 | Codeforces Round #783 Editorial | 3500 |
| 16413 | Direction Change | implementation math | Statement | A | Codeforces Round 783 (Div. 2) {1668} | PROGRAMMING | 500.0 | Codeforces Round #783 Editorial | 800 |
| 16960 | Social Distance | greedy math sortings | Statement | B | Codeforces Round 783 (Div. 2) {1668} | PROGRAMMING | 500.0 | Codeforces Round #783 Editorial | 900 |
| 27612 | Eating Candies | binary search data structures greedy two pointers | Statement | F | Codeforces Round 784 (Div. 4) {1669} | PROGRAMMING | 102101 | 1100 | |
| 22941 | Colorful Stamp | implementation | Statement | D | Codeforces Round 784 (Div. 4) {1669} | PROGRAMMING | 102101 | 1100 | |
| 19051 | Fall Down | dfs and similar implementation | Statement | G | Codeforces Round 784 (Div. 4) {1669} | PROGRAMMING | 102101 | 1200 | |
| 18585 | 2-Letter Strings | data structures math strings | Statement | E | Codeforces Round 784 (Div. 4) {1669} | PROGRAMMING | 102101 | 1200 | |
| 20162 | Maximal AND | bitmasks greedy math | Statement | H | Codeforces Round 784 (Div. 4) {1669} | PROGRAMMING | 102101 | 1300 | |
| 45542 | Triple | implementation sortings | Statement | B | Codeforces Round 784 (Div. 4) {1669} | PROGRAMMING | 102101 | 800 | |
| 36265 | Odd/Even Increments | greedy greedy implementation math | Statement | C | Codeforces Round 784 (Div. 4) {1669} | PROGRAMMING | 102101 | 800 | |
| 67609 | Division? | implementation | Statement | A | Codeforces Round 784 (Div. 4) {1669} | PROGRAMMING | 102101 | 800 | |
| 12881 | Dorms War | brute force implementation strings | Statement | B | Codeforces Round 788 (Div. 2) {1670} | PROGRAMMING | 1000.0 | Tutorial | 1100 |
| 10167 | Where is the Pizza? | data structures dfs and similar ds graphs implementation math | Statement | C | Codeforces Round 788 (Div. 2) {1670} | PROGRAMMING | 1750.0 | Tutorial | 1400 |
| 5244 | Very Suspicious | binary search brute force geometry implementation math | Statement | D | Codeforces Round 788 (Div. 2) {1670} | PROGRAMMING | 2250.0 | Tutorial | 1700 |
| 1802 | Hemose on the Tree | bitmasks constructive algorithms dfs and similar trees | Statement | E | Codeforces Round 788 (Div. 2) {1670} | PROGRAMMING | 2750.0 | Tutorial | 2200 |
| 1029 | Jee, You See? | bitmasks combinatorics dp | Statement | F | Codeforces Round 788 (Div. 2) {1670} | PROGRAMMING | 3000.0 | Tutorial | 2400 |
| 15543 | Prof. Slim | greedy implementation sortings | Statement | A | Codeforces Round 788 (Div. 2) {1670} | PROGRAMMING | 500.0 | Tutorial | 800 |
| 20665 | String Building | implementation | Statement | A | Educational Codeforces Round 127 (Rated for Div. 2) {1671} | PROGRAMMING | 102181 | ||
| 2798 | Preorder | combinatorics divide and conquer dp ds hashing trees | Statement | E | Educational Codeforces Round 127 (Rated for Div. 2) {1671} | PROGRAMMING | 102181 | ||
| 341 | Permutation Counting | brute force combinatorics dp fft math | Statement | F | Educational Codeforces Round 127 (Rated for Div. 2) {1671} | PROGRAMMING | 102181 | ||
| 7855 | Insert a Progression | brute force constructive algorithms greedy | Statement | D | Educational Codeforces Round 127 (Rated for Div. 2) {1671} | PROGRAMMING | 102181 | ||
| 18073 | Dolce Vita | binary search brute force greedy math | Statement | C | Educational Codeforces Round 127 (Rated for Div. 2) {1671} | PROGRAMMING | 102181 | ||
| 18778 | Consecutive Points Segment | brute force math sortings | Statement | B | Educational Codeforces Round 127 (Rated for Div. 2) {1671} | PROGRAMMING | 102181 | ||
| 13405 | Unequal Array | constructive algorithms greedy implementation | Statement | C | Codeforces Global Round 20 {1672} | PROGRAMMING | 750.0 | Global Round 20 Editorial | 1100 |
| 6417 | Cyclic Rotation | constructive algorithms greedy implementation two pointers | Statement | D | Codeforces Global Round 20 {1672} | PROGRAMMING | 1000.0 | Global Round 20 Editorial | 1700 |
| 3173 | Array Shuffling | constructive algorithms graphs greedy | Statement | F1 | Codeforces Global Round 20 {1672} | PROGRAMMING | 1250.0 | Global Round 20 Editorial | 2000 |
| 2289 | notepad.exe | binary search constructive algorithms greedy interactive | Statement | E | Codeforces Global Round 20 {1672} | PROGRAMMING | 1500.0 | Global Round 20 Editorial | 2200 |
| 994 | Zigu Zagu | constructive algorithms greedy | Statement | H | Codeforces Global Round 20 {1672} | PROGRAMMING | 3000.0 | Global Round 20 Editorial | 2700 |
| 831 | Checker for Array Shuffling | constructive algorithms dfs and similar graphs | Statement | F2 | Codeforces Global Round 20 {1672} | PROGRAMMING | 1250.0 | Global Round 20 Editorial | 2800 |
| 179 | PermutationForces | data structures greedy | Statement | I | Codeforces Global Round 20 {1672} | PROGRAMMING | 4000.0 | Global Round 20 Editorial | 3000 |
| 334 | Cross Xor | graphs math | Statement | G | Codeforces Global Round 20 {1672} | PROGRAMMING | 2750.0 | Global Round 20 Editorial | 3200 |
| 16260 | Log Chopping | constructive algorithms games implementation math | Statement | A | Codeforces Global Round 20 {1672} | PROGRAMMING | 250.0 | Global Round 20 Editorial | 800 |
| 16012 | I love AAAB | constructive algorithms implementation | Statement | B | Codeforces Global Round 20 {1672} | PROGRAMMING | 500.0 | Global Round 20 Editorial | 800 |
| 18573 | Subtle Substring Subtraction | games greedy strings | Statement | A | Codeforces Round 785 (Div. 2) {1673} | PROGRAMMING | 500.0 | Codeforces Round #785 (Div. 2) Editorial | |
| 728 | Power or XOR? | combinatorics math number theory | Statement | E | Codeforces Round 785 (Div. 2) {1673} | PROGRAMMING | 2750.0 | Codeforces Round #785 (Div. 2) Editorial | |
| 13396 | Palindrome Basis | dp math number theory | Statement | C | Codeforces Round 785 (Div. 2) {1673} | PROGRAMMING | 1500.0 | Codeforces Round #785 (Div. 2) Editorial | |
| 3359 | Lost Arithmetic Progression | combinatorics implementation math number theory | Statement | D | Codeforces Round 785 (Div. 2) {1673} | PROGRAMMING | 2000.0 | Codeforces Round #785 (Div. 2) Editorial | |
| 15829 | A Perfectly Balanced String? | brute force greedy strings | Statement | B | Codeforces Round 785 (Div. 2) {1673} | PROGRAMMING | 750.0 | Codeforces Round #785 (Div. 2) Editorial | |
| 864 | Anti-Theft Road Planning | bitmasks constructive algorithms divide and conquer greedy interactive math | Statement | F | Codeforces Round 785 (Div. 2) {1673} | PROGRAMMING | 3250.0 | Codeforces Round #785 (Div. 2) Editorial | |
| 2579 | Remove Directed Edges | dfs and similar dp graphs | Statement | G | Codeforces Round 786 (Div. 3) {1674} | PROGRAMMING | 102482 | ||
| 26581 | Number Transformation | constructive algorithms math | Statement | A | Codeforces Round 786 (Div. 3) {1674} | PROGRAMMING | 102482 | ||
| 24082 | Infinite Replacement | combinatorics implementation strings | Statement | C | Codeforces Round 786 (Div. 3) {1674} | PROGRAMMING | 102482 | ||
| 26775 | Dictionary | combinatorics math | Statement | B | Codeforces Round 786 (Div. 3) {1674} | PROGRAMMING | 102482 | ||
| 5164 | Desktop Rearrangement | data structures greedy implementation | Statement | F | Codeforces Round 786 (Div. 3) {1674} | PROGRAMMING | 102482 | ||
| 6589 | Breaking the Wall | binary search brute force constructive algorithms greedy math | Statement | E | Codeforces Round 786 (Div. 3) {1674} | PROGRAMMING | 102482 | ||
| 16671 | A-B-C Sort | constructive algorithms implementation sortings | Statement | D | Codeforces Round 786 (Div. 3) {1674} | PROGRAMMING | 102482 | ||
| 5494 | Vlad and Unfinished Business | dfs and similar dp greedy trees | Statement | F | Codeforces Round 787 (Div. 3) {1675} | PROGRAMMING | 102550 | ||
| 13344 | Vertical Paths | graphs implementation trees | Statement | D | Codeforces Round 787 (Div. 3) {1675} | PROGRAMMING | 102550 | ||
| 1809 | Sorting Pancakes | dp | Statement | G | Codeforces Round 787 (Div. 3) {1675} | PROGRAMMING | 102550 | ||
| 10942 | Replace With the Previous, Minimize | ds greedy strings | Statement | E | Codeforces Round 787 (Div. 3) {1675} | PROGRAMMING | 102550 | ||
| 28838 | Make It Increasing | dp greedy | Statement | B | Codeforces Round 787 (Div. 3) {1675} | PROGRAMMING | 102550 | ||
| 33841 | Food for Animals | math | Statement | A | Codeforces Round 787 (Div. 3) {1675} | PROGRAMMING | 102550 | ||
| 18459 | Detective Task | dp greedy | Statement | C | Codeforces Round 787 (Div. 3) {1675} | PROGRAMMING | 102550 | ||
| 26059 | X-Sum | brute force greedy implementation | Statement | D | Codeforces Round 790 (Div. 4) {1676} | PROGRAMMING | Codeforces Round #790 (Div. 4) Editorial | ||
| 16641 | White-Black Balanced Subtrees | dfs and similar dp graphs trees | Statement | G | Codeforces Round 790 (Div. 4) {1676} | PROGRAMMING | Codeforces Round #790 (Div. 4) Editorial | ||
| 30933 | Most Similar Words | brute force greedy implementation implementation math strings | Statement | C | Codeforces Round 790 (Div. 4) {1676} | PROGRAMMING | Codeforces Round #790 (Div. 4) Editorial | ||
| 11206 | Maximum Crossings (Hard Version) | data structures divide and conquer sortings | Statement | H2 | Codeforces Round 790 (Div. 4) {1676} | PROGRAMMING | Codeforces Round #790 (Div. 4) Editorial | ||
| 14557 | Maximum Crossings (Easy Version) | brute force | Statement | H1 | Codeforces Round 790 (Div. 4) {1676} | PROGRAMMING | Codeforces Round #790 (Div. 4) Editorial | ||
| 68264 | Lucky? | implementation | Statement | A | Codeforces Round 790 (Div. 4) {1676} | PROGRAMMING | Codeforces Round #790 (Div. 4) Editorial | ||
| 17548 | Longest Strike | data structures greedy implementation sortings two pointers | Statement | F | Codeforces Round 790 (Div. 4) {1676} | PROGRAMMING | Codeforces Round #790 (Div. 4) Editorial |