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 ... 74 75 76 77 78 ... 100 101 102 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 1949 | Math Test | bitmasks brute force greedy | Statement | E | Educational Codeforces Round 120 (Rated for Div. 2) {1622} | PROGRAMMING | Educational Codeforces Round 120 Editorial | ||
| 30554 | Construct a Rectangle | math | Statement | A | Educational Codeforces Round 120 (Rated for Div. 2) {1622} | PROGRAMMING | Educational Codeforces Round 120 Editorial | ||
| 21315 | Berland Music | greedy sortings | Statement | B | Educational Codeforces Round 120 (Rated for Div. 2) {1622} | PROGRAMMING | Educational Codeforces Round 120 Editorial | ||
| 1393 | Robot Cleaner Revisit | dp implementation math probabilities | Statement | D | Codeforces Round 763 (Div. 2) {1623} | PROGRAMMING | 2500.0 | Codeforces Round #763 (Div. 2) Editorial | |
| 20175 | Robot Cleaner | brute force implementation math | Statement | A | Codeforces Round 763 (Div. 2) {1623} | PROGRAMMING | 500.0 | Codeforces Round #763 (Div. 2) Editorial | |
| 1138 | Middle Duplication | data structures dfs and similar greedy strings trees | Statement | E | Codeforces Round 763 (Div. 2) {1623} | PROGRAMMING | 2750.0 | Codeforces Round #763 (Div. 2) Editorial | |
| 14176 | Game on Ranges | brute force implementation sortings | Statement | B | Codeforces Round 763 (Div. 2) {1623} | PROGRAMMING | 1000.0 | Codeforces Round #763 (Div. 2) Editorial | |
| 12618 | Balanced Stone Heaps | binary search greedy | Statement | C | Codeforces Round 763 (Div. 2) {1623} | PROGRAMMING | 1750.0 | Codeforces Round #763 (Div. 2) Editorial | |
| 53486 | Plus One on the Subset | math | Statement | A | Codeforces Round 764 (Div. 3) {1624} | PROGRAMMING | Codeforces Round #764 (Div. 3) Editorial | ||
| 17409 | Palindromes Coloring | binary search greedy sortings strings | Statement | D | Codeforces Round 764 (Div. 3) {1624} | PROGRAMMING | Codeforces Round #764 (Div. 3) Editorial | ||
| 6232 | MinOr Tree | bitmasks dfs and similar ds greedy | Statement | G | Codeforces Round 764 (Div. 3) {1624} | PROGRAMMING | Codeforces Round #764 (Div. 3) Editorial | ||
| 4182 | Masha-forgetful | brute force constructive algorithms dp hashing implementation strings | Statement | E | Codeforces Round 764 (Div. 3) {1624} | PROGRAMMING | Codeforces Round #764 (Div. 3) Editorial | ||
| 38574 | Make AP | implementation math | Statement | B | Codeforces Round 764 (Div. 3) {1624} | PROGRAMMING | Codeforces Round #764 (Div. 3) Editorial | ||
| 3423 | Interacdive Problem | binary search constructive algorithms interactive | Statement | F | Codeforces Round 764 (Div. 3) {1624} | PROGRAMMING | Codeforces Round #764 (Div. 3) Editorial | ||
| 25191 | Division by Two and Permutation | constructive algorithms flows graph matchings greedy math | Statement | C | Codeforces Round 764 (Div. 3) {1624} | PROGRAMMING | Codeforces Round #764 (Div. 3) Editorial | ||
| 11031 | Road Optimization | data structures dp | Statement | C | Codeforces Round 765 (Div. 2) {1625} | PROGRAMMING | 1500.0 | Editorial of Codeforces Round #765 (Div. 2) | |
| 16201 | Elementary Particles | greedy | Statement | B | Codeforces Round 765 (Div. 2) {1625} | PROGRAMMING | 1000.0 | Editorial of Codeforces Round #765 (Div. 2) | |
| 604 | Cats on the Upgrade (hard version) | data structures dfs and similar graphs trees | Statement | E2 | Codeforces Round 765 (Div. 2) {1625} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round #765 (Div. 2) | |
| 1061 | Cats on the Upgrade (easy version) | data structures dfs and similar divide and conquer dp graphs trees | Statement | E1 | Codeforces Round 765 (Div. 2) {1625} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round #765 (Div. 2) | |
| 2100 | Binary Spiders | bitmasks data structures implementation sortings trees | Statement | D | Codeforces Round 765 (Div. 2) {1625} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round #765 (Div. 2) | |
| 17416 | Ancient Civilization | bitmasks greedy math | Statement | A | Codeforces Round 765 (Div. 2) {1625} | PROGRAMMING | 500.0 | Editorial of Codeforces Round #765 (Div. 2) | |
| 11098 | Monsters And Spells | data structures dp fft greedy implementation two pointers | Statement | C | Educational Codeforces Round 121 (Rated for Div. 2) {1626} | PROGRAMMING | 99136 | ||
| 23037 | Minor Reduction | greedy greedy strings strings | Statement | B | Educational Codeforces Round 121 (Rated for Div. 2) {1626} | PROGRAMMING | 99136 | ||
| 3975 | Martial Arts Tournament | binary search brute force greedy | Statement | D | Educational Codeforces Round 121 (Rated for Div. 2) {1626} | PROGRAMMING | 99136 | ||
| 29255 | Equidistant Letters | constructive algorithms | Statement | A | Educational Codeforces Round 121 (Rated for Div. 2) {1626} | PROGRAMMING | 99136 | ||
| 1625 | Black and White Tree | dp greedy trees | Statement | E | Educational Codeforces Round 121 (Rated for Div. 2) {1626} | PROGRAMMING | 99136 | ||
| 744 | A Random Code Problem | combinatorics dp math number theory | Statement | F | Educational Codeforces Round 121 (Rated for Div. 2) {1626} | PROGRAMMING | 99136 | ||
| 603 | Not Splitting | geometry graphs implementation shortest paths | Statement | F | Codeforces Round 766 (Div. 2) {1627} | PROGRAMMING | 2750.0 | Codeforces Round #766 (Div. 2) Editorial | |
| 16811 | Not Sitting | games greedy sortings | Statement | B | Codeforces Round 766 (Div. 2) {1627} | PROGRAMMING | 1250.0 | Codeforces Round #766 (Div. 2) Editorial | |
| 24217 | Not Shading | constructive algorithms implementation | Statement | A | Codeforces Round 766 (Div. 2) {1627} | PROGRAMMING | 500.0 | Codeforces Round #766 (Div. 2) Editorial | |
| 2457 | Not Escaping | data structures dp implementation shortest paths sortings two pointers | Statement | E | Codeforces Round 766 (Div. 2) {1627} | PROGRAMMING | 2000.0 | Codeforces Round #766 (Div. 2) Editorial | |
| 14815 | Not Assigning | constructive algorithms dfs and similar number theory trees | Statement | C | Codeforces Round 766 (Div. 2) {1627} | PROGRAMMING | 1250.0 | Codeforces Round #766 (Div. 2) Editorial | |
| 8494 | Not Adding | dp math number theory | Statement | D | Codeforces Round 766 (Div. 2) {1627} | PROGRAMMING | 1750.0 | Codeforces Round #766 (Div. 2) Editorial | |
| 90 | Spaceship Crisis Management | binary search data structures geometry sortings | Statement | F | Codeforces Round 767 (Div. 1) {1628} | PROGRAMMING | 3000.0 | 99276 | |
| 11834 | Peculiar Movie Preferences | greedy strings | Statement | B | Codeforces Round 767 (Div. 1) {1628} | PROGRAMMING | 750.0 | 99276 | |
| 15866 | Meximum Array | brute force constructive algorithms greedy math | Statement | A | Codeforces Round 767 (Div. 1) {1628} | PROGRAMMING | 500.0 | 99276 | |
| 936 | Groceries in Meteor Town | data structures trees | Statement | E | Codeforces Round 767 (Div. 1) {1628} | PROGRAMMING | 2250.0 | 99276 | |
| 3244 | Grid Xor | constructive algorithms greedy implementation interactive math | Statement | C | Codeforces Round 767 (Div. 1) {1628} | PROGRAMMING | 1250.0 | 99276 | |
| 2201 | Game on Sum (Hard Version) | combinatorics dp games | Statement | D2 | Codeforces Round 767 (Div. 1) {1628} | PROGRAMMING | 750.0 | 99276 | |
| 3260 | Game on Sum (Easy Version) | combinatorics dp games | Statement | D1 | Codeforces Round 767 (Div. 1) {1628} | PROGRAMMING | 1000.0 | 99276 | |
| 23700 | GCD Arrays | greedy math number theory | Statement | B | Codeforces Round 767 (Div. 2) {1629} | PROGRAMMING | 750.0 | Editorial of Codeforces Round #767 | |
| 29533 | Download More RAM | greedy sortings | Statement | A | Codeforces Round 767 (Div. 2) {1629} | PROGRAMMING | 500.0 | Editorial of Codeforces Round #767 | |
| 5858 | Range and Partition | binary search data structures greedy two pointers | Statement | B | Codeforces Round 768 (Div. 1) {1630} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round #768 | |
| 2992 | Paint the Middle | data structures dp greedy sortings | Statement | C | Codeforces Round 768 (Div. 1) {1630} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round #768 | |
| 593 | Making It Bipartite | flows graphs number theory | Statement | F | Codeforces Round 768 (Div. 1) {1630} | PROGRAMMING | 3000.0 | Editorial of Codeforces Round #768 | |
| 1688 | Flipping Range | dp greedy number theory | Statement | D | Codeforces Round 768 (Div. 1) {1630} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round #768 | |
| 449 | Expected Components | combinatorics number theory probabilities | Statement | E | Codeforces Round 768 (Div. 1) {1630} | PROGRAMMING | 2500.0 | Editorial of Codeforces Round #768 | |
| 14831 | And Matching | bitmasks constructive algorithms | Statement | A | Codeforces Round 768 (Div. 1) {1630} | PROGRAMMING | 500.0 | Editorial of Codeforces Round #768 | |
| 29790 | Min Max Swap | greedy | Statement | A | Codeforces Round 768 (Div. 2) {1631} | PROGRAMMING | 500.0 | Editorial of Codeforces Round #768 | |
| 20994 | Fun with Even Subarrays | dp greedy | Statement | B | Codeforces Round 768 (Div. 2) {1631} | PROGRAMMING | 1000.0 | Editorial of Codeforces Round #768 | |
| 12965 | Strange Test | binary search bitmasks brute force greedy math | Statement | C | Codeforces Round 769 (Div. 2) {1632} | PROGRAMMING | 1500.0 | Editorial of Codeforces Round #769 | |
| 23253 | Roof Construction | bitmasks constructive algorithms | Statement | B | Codeforces Round 769 (Div. 2) {1632} | PROGRAMMING | 1000.0 | Editorial of Codeforces Round #769 | |
| 4800 | New Year Concert | binary search data structures dp greedy math number theory two pointers | Statement | D | Codeforces Round 769 (Div. 2) {1632} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round #769 | |
| 1030 | Distance Tree (hard version) | dfs and similar shortest paths trees | Statement | E2 | Codeforces Round 769 (Div. 2) {1632} | PROGRAMMING | 1500.0 | Editorial of Codeforces Round #769 | |
| 1207 | Distance Tree (easy version) | dfs and similar shortest paths trees | Statement | E1 | Codeforces Round 769 (Div. 2) {1632} | PROGRAMMING | 1500.0 | Editorial of Codeforces Round #769 | |
| 29782 | ABC | implementation | Statement | A | Codeforces Round 769 (Div. 2) {1632} | PROGRAMMING | 500.0 | Editorial of Codeforces Round #769 | |
| 1575 | Spanning Tree Queries | binary search data structures ds graphs implementation math sortings | Statement | E | Educational Codeforces Round 122 (Rated for Div. 2) {1633} | PROGRAMMING | 99539 | ||
| 325 | Perfect Matching | data structures interactive trees | Statement | F | Educational Codeforces Round 122 (Rated for Div. 2) {1633} | PROGRAMMING | 99539 | ||
| 28004 | Minority | greedy | Statement | B | Educational Codeforces Round 122 (Rated for Div. 2) {1633} | PROGRAMMING | 99539 | ||
| 14765 | Make Them Equal | dp greedy shortest paths | Statement | D | Educational Codeforces Round 122 (Rated for Div. 2) {1633} | PROGRAMMING | 99539 | ||
| 20252 | Kill the Monster | brute force math | Statement | C | Educational Codeforces Round 122 (Rated for Div. 2) {1633} | PROGRAMMING | 99539 | ||
| 33737 | Div. 7 | brute force | Statement | A | Educational Codeforces Round 122 (Rated for Div. 2) {1633} | PROGRAMMING | 99539 | ||
| 24036 | Reverse and Concatenate | brute force strings | Statement | A | Codeforces Round 770 (Div. 2) {1634} | PROGRAMMING | 500.0 | Codeforces Round #770 (Div. 2) editorial | |
| 18373 | OKEA | constructive algorithms math | Statement | C | Codeforces Round 770 (Div. 2) {1634} | PROGRAMMING | 1500.0 | Codeforces Round #770 (Div. 2) editorial | |
| 17355 | Fortune Telling | bitmasks math | Statement | B | Codeforces Round 770 (Div. 2) {1634} | PROGRAMMING | 1250.0 | Codeforces Round #770 (Div. 2) editorial | |
| 4445 | Finding Zero | constructive algorithms greedy interactive | Statement | D | Codeforces Round 770 (Div. 2) {1634} | PROGRAMMING | 2000.0 | Codeforces Round #770 (Div. 2) editorial | |
| 1632 | Fibonacci Additions | brute force hashing math | Statement | F | Codeforces Round 770 (Div. 2) {1634} | PROGRAMMING | 3000.0 | Codeforces Round #770 (Div. 2) editorial | |
| 1757 | Fair Share | constructive algorithms data structures dfs and similar graph matchings graphs | Statement | E | Codeforces Round 770 (Div. 2) {1634} | PROGRAMMING | 2500.0 | Codeforces Round #770 (Div. 2) editorial | |
| 23383 | Min Or Sum | bitmasks greedy | Statement | A | Codeforces Round 772 (Div. 2) {1635} | PROGRAMMING | 500.0 | Codeforces Round #772 Editorial | |
| 6400 | Infinite Set | dp math matrices number theory strings | Statement | D | Codeforces Round 772 (Div. 2) {1635} | PROGRAMMING | 2250.0 | Codeforces Round #772 Editorial | |
| 18396 | Differential Sorting | constructive algorithms greedy | Statement | C | Codeforces Round 772 (Div. 2) {1635} | PROGRAMMING | 1500.0 | Codeforces Round #772 Editorial | |
| 1153 | Closest Pair | data structures greedy | Statement | F | Codeforces Round 772 (Div. 2) {1635} | PROGRAMMING | 3000.0 | Codeforces Round #772 Editorial | |
| 2296 | Cars | constructive algorithms dfs and similar ds graphs greedy sortings | Statement | E | Codeforces Round 772 (Div. 2) {1635} | PROGRAMMING | 2250.0 | Codeforces Round #772 Editorial | |
| 18008 | Avoid Local Maximums | greedy | Statement | B | Codeforces Round 772 (Div. 2) {1635} | PROGRAMMING | 1000.0 | Codeforces Round #772 Editorial | |
| 7943 | Yet Another Minimization Problem | dp math | Statement | D | Codeforces Global Round 19 {1637} | PROGRAMMING | 2000.0 | Tutorial | |
| 1825 | Towers | constructive algorithms dfs and similar dp greedy trees | Statement | F | Codeforces Global Round 19 {1637} | PROGRAMMING | 3250.0 | Tutorial | |
| 22509 | Sorting Parts | sortings | Statement | A | Codeforces Global Round 19 {1637} | PROGRAMMING | 500.0 | Tutorial | |
| 336 | Minimize Inversions Number | data structures math sortings | Statement | H | Codeforces Global Round 19 {1637} | PROGRAMMING | 4000.0 | Tutorial | |
| 14936 | MEX and Array | brute force dp greedy math | Statement | B | Codeforces Global Round 19 {1637} | PROGRAMMING | 1000.0 | Tutorial | |
| 541 | Birthday | constructive algorithms math | Statement | G | Codeforces Global Round 19 {1637} | PROGRAMMING | 4000.0 | Tutorial | |
| 3430 | Best Pair | binary search brute force | Statement | E | Codeforces Global Round 19 {1637} | PROGRAMMING | 2500.0 | Tutorial | |
| 17973 | Andrew and Stones | constructive algorithms greedy | Statement | C | Codeforces Global Round 19 {1637} | PROGRAMMING | 1500.0 | Tutorial | |
| 228 | Two Posters | data structures two pointers | Statement | F | Codeforces Round 771 (Div. 2) {1638} | PROGRAMMING | 3250.0 | Codeforces Round #771 Editorial | |
| 21617 | Reverse | greedy math | Statement | A | Codeforces Round 771 (Div. 2) {1638} | PROGRAMMING | 500.0 | Codeforces Round #771 Editorial | |
| 21087 | Odd Swap Sort | data structures math sortings | Statement | B | Codeforces Round 771 (Div. 2) {1638} | PROGRAMMING | 750.0 | Codeforces Round #771 Editorial | |
| 14901 | Inversion Graph | ds graphs math | Statement | C | Codeforces Round 771 (Div. 2) {1638} | PROGRAMMING | 1250.0 | Codeforces Round #771 Editorial | |
| 1972 | Colorful Operations | data structures implementation | Statement | E | Codeforces Round 771 (Div. 2) {1638} | PROGRAMMING | 2500.0 | Codeforces Round #771 Editorial | |
| 4287 | Big Brush | dfs and similar greedy implementation | Statement | D | Codeforces Round 771 (Div. 2) {1638} | PROGRAMMING | 1750.0 | Codeforces Round #771 Editorial | |
| 0 | Treasure Hunt | graphs interactive | Statement | K | Pinely Treasure Hunt Contest {1639} | PROGRAMMING | |||
| 0 | Treasure Hunt | graphs interactive | Statement | J | Pinely Treasure Hunt Contest {1639} | PROGRAMMING | |||
| 0 | Treasure Hunt | graphs interactive | Statement | I | Pinely Treasure Hunt Contest {1639} | PROGRAMMING | |||
| 0 | Treasure Hunt | graphs interactive | Statement | H | Pinely Treasure Hunt Contest {1639} | PROGRAMMING | |||
| 0 | Treasure Hunt | graphs interactive | Statement | G | Pinely Treasure Hunt Contest {1639} | PROGRAMMING | |||
| 0 | Treasure Hunt | graphs interactive | Statement | F | Pinely Treasure Hunt Contest {1639} | PROGRAMMING | |||
| 0 | Treasure Hunt | graphs interactive | Statement | E | Pinely Treasure Hunt Contest {1639} | PROGRAMMING | |||
| 0 | Treasure Hunt | graphs graphs graphs interactive interactive | Statement | D | Pinely Treasure Hunt Contest {1639} | PROGRAMMING | |||
| 0 | Treasure Hunt | graphs graphs interactive interactive | Statement | C | Pinely Treasure Hunt Contest {1639} | PROGRAMMING | |||
| 0 | Treasure Hunt | graphs interactive | Statement | B | Pinely Treasure Hunt Contest {1639} | PROGRAMMING | |||
| 0 | Treasure Hunt | graphs interactive | Statement | A | Pinely Treasure Hunt Contest {1639} | PROGRAMMING | |||
| 1279 | Two Arrays | bitmasks brute force combinatorics hashing probabilities two pointers | Statement | D | Codeforces Round 773 (Div. 1) {1641} | PROGRAMMING | 1750.0 | Codeforces Round #773 editorial |