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 ... 20 21 22 23 24 ... 100 101 102 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 2128 | Candy Boxes | brute force constructive algorithms math | Statement | B | Codeforces Round 278 (Div. 2) {488} | PROGRAMMING | 1800 | ||
| 10152 | SwapSort | greedy implementation sortings | Statement | A | Codeforces Round 277.5 (Div. 2) {489} | PROGRAMMING | Codeforces Round #277.5 (Div. 2) Editorial [A-D for now] | 1300 | |
| 50206 | BerSU Ball | dfs and similar dp graph matchings greedy sortings two pointers | Statement | B | Codeforces Round 277.5 (Div. 2) {489} | PROGRAMMING | Codeforces Round #277.5 (Div. 2) Editorial [A-D for now] | 1300 | |
| 47146 | Given Length and Sum of Digits... | dp greedy implementation | Statement | C | Codeforces Round 277.5 (Div. 2) {489} | PROGRAMMING | Codeforces Round #277.5 (Div. 2) Editorial [A-D for now] | 1400 | |
| 6733 | Unbearable Controversy of Being | brute force combinatorics dfs and similar graphs | Statement | D | Codeforces Round 277.5 (Div. 2) {489} | PROGRAMMING | Codeforces Round #277.5 (Div. 2) Editorial [A-D for now] | 1700 | |
| 1703 | Special Matrices | combinatorics dp | Statement | F | Codeforces Round 277.5 (Div. 2) {489} | PROGRAMMING | Codeforces Round #277.5 (Div. 2) Editorial [A-D for now] | 2200 | |
| 1042 | Hiking | binary search dp | Statement | E | Codeforces Round 277.5 (Div. 2) {489} | PROGRAMMING | 2700 | ||
| 6088 | Queue | ds implementation | Statement | B | Codeforces Round 279 (Div. 2) {490} | PROGRAMMING | Codeforces Round #279 (Div. 2) Editorial | 1500 | |
| 9143 | Hacking Cypher | brute force math number theory strings | Statement | C | Codeforces Round 279 (Div. 2) {490} | PROGRAMMING | Codeforces Round #279 (Div. 2) Editorial | 1700 | |
| 2165 | Chocolate | brute force dfs and similar math meet-in-the-middle number theory | Statement | D | Codeforces Round 279 (Div. 2) {490} | PROGRAMMING | 1900 | ||
| 1616 | Restoring Increasing Sequence | binary search brute force greedy implementation | Statement | E | Codeforces Round 279 (Div. 2) {490} | PROGRAMMING | Codeforces Round #279 (Div. 2) Editorial | 2100 | |
| 1752 | Treeland Tour | data structures dfs and similar dp trees | Statement | F | Codeforces Round 279 (Div. 2) {490} | PROGRAMMING | 2500 | ||
| 61116 | Team Olympiad | greedy implementation sortings | Statement | A | Codeforces Round 279 (Div. 2) {490} | PROGRAMMING | Codeforces Round #279 (Div. 2) Editorial | 900 | |
| 3000 | Up the hill | constructive algorithms implementation | Statement | A | Testing Round 11 {491} | PROGRAMMING | 1200 | ||
| 574 | New York Hotel | greedy math | Statement | B | Testing Round 11 {491} | PROGRAMMING | 1900 | ||
| 424 | Deciphering | flows graph matchings | Statement | C | Testing Round 11 {491} | PROGRAMMING | 2400 | ||
| 78058 | Vanya and Lanterns | binary search implementation math sortings | Statement | B | Codeforces Round 280 (Div. 2) {492} | PROGRAMMING | Разбор задач | 1200 | |
| 14314 | Vanya and Exams | greedy sortings | Statement | C | Codeforces Round 280 (Div. 2) {492} | PROGRAMMING | Разбор задач | 1400 | |
| 3190 | Vanya and Computer Game | binary search implementation math sortings | Statement | D | Codeforces Round 280 (Div. 2) {492} | PROGRAMMING | Разбор задач | 1800 | |
| 1653 | Vanya and Field | math | Statement | E | Codeforces Round 280 (Div. 2) {492} | PROGRAMMING | Разбор задач | 2200 | |
| 52610 | Vanya and Cubes | implementation | Statement | A | Codeforces Round 280 (Div. 2) {492} | PROGRAMMING | Разбор задач | 900 | |
| 6146 | Vasya and Football | implementation | Statement | A | Codeforces Round 281 (Div. 2) {493} | PROGRAMMING | Codeforces Round #281 (Div. 2) Editorial | 1400 | |
| 13450 | Vasya and Wrestling | implementation | Statement | B | Codeforces Round 281 (Div. 2) {493} | PROGRAMMING | 1500 | ||
| 9765 | Vasya and Chess | constructive algorithms games math | Statement | D | Codeforces Round 281 (Div. 2) {493} | PROGRAMMING | 1700 | ||
| 6881 | Vasya and Basketball | binary search brute force data structures implementation sortings two pointers | Statement | C | Codeforces Round 281 (Div. 2) {493} | PROGRAMMING | Codeforces Round #281 (Div. 2) Editorial | 1700 | |
| 491 | Vasya and Polynomial | math | Statement | E | Codeforces Round 281 (Div. 2) {493} | PROGRAMMING | Codeforces Round #281 (Div. 2) Editorial | 2900 | |
| 6303 | Treasure | greedy | Statement | A | Codeforces Round 282 (Div. 1) {494} | PROGRAMMING | 15148 | 1700 | |
| 2770 | Obsessive String | dp strings | Statement | B | Codeforces Round 282 (Div. 1) {494} | PROGRAMMING | 15148 | 2300 | |
| 628 | Birthday | data structures dfs and similar dp trees | Statement | D | Codeforces Round 282 (Div. 1) {494} | PROGRAMMING | 2700 | ||
| 882 | Helping People | dp probabilities | Statement | C | Codeforces Round 282 (Div. 1) {494} | PROGRAMMING | 2900 | ||
| 324 | Sharti | data structures games | Statement | E | Codeforces Round 282 (Div. 1) {494} | PROGRAMMING | 3200 | ||
| 8582 | Digital Counter | implementation | Statement | A | Codeforces Round 282 (Div. 2) {495} | PROGRAMMING | Tutorial | 1200 | |
| 7234 | Modular Equations | math number theory | Statement | B | Codeforces Round 282 (Div. 2) {495} | PROGRAMMING | Tutorial | 1600 | |
| 16591 | Minimum Difficulty | brute force implementation math | Statement | A | Codeforces Round 283 (Div. 2) {496} | PROGRAMMING | 1000 | ||
| 5964 | Secret Combination | brute force constructive algorithms implementation | Statement | B | Codeforces Round 283 (Div. 2) {496} | PROGRAMMING | 15208 | 1500 | |
| 7804 | Removing Columns | brute force constructive algorithms implementation | Statement | C | Codeforces Round 283 (Div. 2) {496} | PROGRAMMING | 15208 | 1600 | |
| 3048 | Tennis Game | binary search | Statement | D | Codeforces Round 283 (Div. 2) {496} | PROGRAMMING | 15208 | 2100 | |
| 1681 | Distributing Parts | greedy sortings | Statement | E | Codeforces Round 283 (Div. 2) {496} | PROGRAMMING | 2600 | ||
| 231 | Gears | brute force geometry math | Statement | D | Codeforces Round 283 (Div. 1) {497} | PROGRAMMING | 2800 | ||
| 288 | Subsequences Return | dp matrices | Statement | E | Codeforces Round 283 (Div. 1) {497} | PROGRAMMING | 15208 | 2900 | |
| 6517 | Crazy Town | geometry | Statement | A | Codeforces Round 284 (Div. 1) {498} | PROGRAMMING | 1600 | ||
| 1140 | Traffic Jams in the Land | data structures dp number theory | Statement | D | Codeforces Round 284 (Div. 1) {498} | PROGRAMMING | 2400 | ||
| 3569 | Array and Operations | flows graph matchings number theory | Statement | C | Codeforces Round 284 (Div. 1) {498} | PROGRAMMING | Codeforces Round #284 Editorial | 2400 | |
| 1199 | Name That Tune | dp probabilities two pointers | Statement | B | Codeforces Round 284 (Div. 1) {498} | PROGRAMMING | 2500 | ||
| 481 | Stairs and Lines | dp matrices | Statement | E | Codeforces Round 284 (Div. 1) {498} | PROGRAMMING | Codeforces Round #284 Editorial | 2600 | |
| 40251 | Lecture | implementation strings | Statement | B | Codeforces Round 284 (Div. 2) {499} | PROGRAMMING | 1000 | ||
| 14058 | Watching a movie | greedy implementation | Statement | A | Codeforces Round 284 (Div. 2) {499} | PROGRAMMING | 15353 | 1100 | |
| 54658 | New Year Transportation | dfs and similar graphs implementation | Statement | A | Good Bye 2014 {500} | PROGRAMMING | 1100 | ||
| 8972 | New Year Permutation | dfs and similar ds graphs greedy math sortings | Statement | B | Good Bye 2014 {500} | PROGRAMMING | 1600 | ||
| 5845 | New Year Book Reading | constructive algorithms greedy implementation math | Statement | C | Good Bye 2014 {500} | PROGRAMMING | 1600 | ||
| 3138 | New Year Santa Network | combinatorics dfs and similar graphs trees | Statement | D | Good Bye 2014 {500} | PROGRAMMING | 1900 | ||
| 1470 | New Year Domino | data structures dp ds | Statement | E | Good Bye 2014 {500} | PROGRAMMING | 2200 | ||
| 752 | New Year Shopping | divide and conquer dp | Statement | F | Good Bye 2014 {500} | PROGRAMMING | 2600 | ||
| 157 | New Year Running | number theory trees | Statement | G | Good Bye 2014 {500} | PROGRAMMING | 3000 | ||
| 23102 | Contest | implementation | Statement | A | Codeforces Round 285 (Div. 2) {501} | PROGRAMMING | Tutorial | 1000 | |
| 16981 | Misha and Changing Handles | data structures ds strings | Statement | B | Codeforces Round 285 (Div. 2) {501} | PROGRAMMING | Tutorial | 1100 | |
| 5689 | Misha and Forest | constructive algorithms data structures greedy sortings trees | Statement | C | Codeforces Round 285 (Div. 2) {501} | PROGRAMMING | Tutorial | 1700 | |
| 2459 | Misha and Permutations Summation | data structures | Statement | D | Codeforces Round 285 (Div. 2) {501} | PROGRAMMING | 2300 | ||
| 926 | Misha and Palindrome Degree | binary search combinatorics implementation | Statement | E | Codeforces Round 285 (Div. 2) {501} | PROGRAMMING | Tutorial | 2800 | |
| 311 | Misha and XOR | bitmasks | Statement | D | Codeforces Round 285 (Div. 1) {504} | PROGRAMMING | 15743 | 2700 | |
| 954 | Misha and LCP on Tree | binary search dfs and similar hashing string suffix structures trees | Statement | E | Codeforces Round 285 (Div. 1) {504} | PROGRAMMING | 15743 | 3000 | |
| 6709 | Mr. Kitayuta's Gift | brute force implementation strings | Statement | A | Codeforces Round 286 (Div. 2) {505} | PROGRAMMING | Tutorial | 1200 | |
| 13354 | Mr. Kitayuta's Colorful Graph | dfs and similar dp ds graphs | Statement | B | Codeforces Round 286 (Div. 2) {505} | PROGRAMMING | Tutorial | 1500 | |
| 6541 | Mr. Kitayuta, the Treasure Hunter | dfs and similar dp two pointers | Statement | C | Codeforces Round 286 (Div. 2) {505} | PROGRAMMING | 2100 | ||
| 2621 | Mr. Kitayuta's Technology | dfs and similar | Statement | D | Codeforces Round 286 (Div. 2) {505} | PROGRAMMING | 2500 | ||
| 1424 | Mr. Kitayuta vs. Bamboos | binary search greedy | Statement | E | Codeforces Round 286 (Div. 2) {505} | PROGRAMMING | 2800 | ||
| 2213 | Mr. Kitayuta's Colorful Graph | brute force dfs and similar ds graphs | Statement | D | Codeforces Round 286 (Div. 1) {506} | PROGRAMMING | Editorial | 2300 | |
| 771 | Mr. Kitayuta's Gift | combinatorics dp matrices strings | Statement | E | Codeforces Round 286 (Div. 1) {506} | PROGRAMMING | Editorial | 2900 | |
| 19051 | Amr and Music | greedy implementation sortings | Statement | A | Codeforces Round 287 (Div. 2) {507} | PROGRAMMING | Editorial | 1100 | |
| 25058 | Amr and Pins | geometry math | Statement | B | Codeforces Round 287 (Div. 2) {507} | PROGRAMMING | Editorial | 1400 | |
| 4397 | Guess Your Way Out! | implementation math trees | Statement | C | Codeforces Round 287 (Div. 2) {507} | PROGRAMMING | Editorial | 1700 | |
| 2991 | Breaking Good | dfs and similar dp graphs shortest paths | Statement | E | Codeforces Round 287 (Div. 2) {507} | PROGRAMMING | 2200 | ||
| 1871 | The Maths Lecture | dp implementation | Statement | D | Codeforces Round 287 (Div. 2) {507} | PROGRAMMING | Editorial | 2500 | |
| 7996 | Pasha and Pixels | brute force | Statement | A | Codeforces Round 288 (Div. 2) {508} | PROGRAMMING | 1200 | ||
| 22878 | Anton and currency you all know | greedy math strings | Statement | B | Codeforces Round 288 (Div. 2) {508} | PROGRAMMING | 16048 | 1300 | |
| 4496 | Anya and Ghosts | constructive algorithms greedy | Statement | C | Codeforces Round 288 (Div. 2) {508} | PROGRAMMING | 1600 | ||
| 1790 | Arthur and Brackets | dp greedy | Statement | E | Codeforces Round 288 (Div. 2) {508} | PROGRAMMING | 16048 | 2400 | |
| 3566 | Tanya and Password | dfs and similar graphs | Statement | D | Codeforces Round 288 (Div. 2) {508} | PROGRAMMING | 16048 | 2900 | |
| 9695 | Painting Pebbles | constructive algorithms greedy implementation | Statement | B | Codeforces Round 289 (Div. 2, ACM ICPC Rules) {509} | PROGRAMMING | Tutorial CodeForces Round 289 (Div.2) (Second Winter Computer Camp Selection 2015) | 1300 | |
| 2115 | Sums of Digits | dp greedy implementation | Statement | C | Codeforces Round 289 (Div. 2, ACM ICPC Rules) {509} | PROGRAMMING | Tutorial CodeForces Round 289 (Div.2) (Second Winter Computer Camp Selection 2015) | 2000 | |
| 1813 | Pretty Song | math strings | Statement | E | Codeforces Round 289 (Div. 2, ACM ICPC Rules) {509} | PROGRAMMING | Tutorial CodeForces Round 289 (Div.2) (Second Winter Computer Camp Selection 2015) | 2000 | |
| 766 | Restoring Numbers | constructive algorithms math | Statement | D | Codeforces Round 289 (Div. 2, ACM ICPC Rules) {509} | PROGRAMMING | 2400 | ||
| 1088 | Progress Monitoring | dp | Statement | F | Codeforces Round 289 (Div. 2, ACM ICPC Rules) {509} | PROGRAMMING | Tutorial CodeForces Round 289 (Div.2) (Second Winter Computer Camp Selection 2015) | 2600 | |
| 39054 | Maximum in Table | brute force implementation | Statement | A | Codeforces Round 289 (Div. 2, ACM ICPC Rules) {509} | PROGRAMMING | Tutorial CodeForces Round 289 (Div.2) (Second Winter Computer Camp Selection 2015) | 700 | |
| 14273 | Fox And Two Dots | dfs and similar | Statement | B | Codeforces Round 290 (Div. 2) {510} | PROGRAMMING | Codeforces Round #290 Editorial | 1500 | |
| 16892 | Fox And Names | dfs and similar graphs sortings | Statement | C | Codeforces Round 290 (Div. 2) {510} | PROGRAMMING | Codeforces Round #290 Editorial | 1800 | |
| 5764 | Fox And Jumping | bitmasks brute force dp math | Statement | D | Codeforces Round 290 (Div. 2) {510} | PROGRAMMING | Codeforces Round #290 Editorial | 2100 | |
| 2249 | Fox And Dinner | flows | Statement | E | Codeforces Round 290 (Div. 2) {510} | PROGRAMMING | Codeforces Round #290 Editorial | 2800 | |
| 87478 | Fox And Snake | implementation | Statement | A | Codeforces Round 290 (Div. 2) {510} | PROGRAMMING | Codeforces Round #290 Editorial | 800 | |
| 524 | Fox And Polygon | constructive algorithms divide and conquer | Statement | E | Codeforces Round 290 (Div. 1) {512} | PROGRAMMING | 2800 | ||
| 989 | Fox And Travelling | dp trees | Statement | D | Codeforces Round 290 (Div. 1) {512} | PROGRAMMING | 2900 | ||
| 3730 | Permutations | brute force | Statement | B1 | Rockethon 2015 {513} | PROGRAMMING | 16260 | 1500 | |
| 2822 | Permutations | bitmasks divide and conquer math | Statement | B2 | Rockethon 2015 {513} | PROGRAMMING | 16260 | 1800 | |
| 1798 | Inversions problem | brute force dfs and similar dp meet-in-the-middle | Statement | G1 | Rockethon 2015 {513} | PROGRAMMING | 16260 | 1800 | |
| 1569 | Second price auction | bitmasks probabilities | Statement | C | Rockethon 2015 {513} | PROGRAMMING | 2000 | ||
| 667 | Inversions problem | dp probabilities | Statement | G2 | Rockethon 2015 {513} | PROGRAMMING | 16260 | 2400 | |
| 622 | Constrained Tree | dfs and similar | Statement | D1 | Rockethon 2015 {513} | PROGRAMMING | 2400 | ||
| 500 | Subarray Cuts | dp | Statement | E1 | Rockethon 2015 {513} | PROGRAMMING | 16260 | 2500 | |
| 386 | Constrained Tree | constructive algorithms data structures | Statement | D2 | Rockethon 2015 {513} | PROGRAMMING | 2500 | ||
| 601 | Subarray Cuts | dp | Statement | E2 | Rockethon 2015 {513} | PROGRAMMING | 16260 | 2700 |