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 ... 28 29 30 31 32 ... 100 101 102 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 42 | Loader | *special | Statement | I | Surprise Language Round 8 {683} | PROGRAMMING | 2600 | ||
| 43 | The Hero with Bombs | *special | Statement | J | Surprise Language Round 8 {683} | PROGRAMMING | 2900 | ||
| 4296 | Robbers' watch | brute force combinatorics dp math | Statement | A | Codeforces Round 359 (Div. 1) {685} | PROGRAMMING | Codeforces Round #359 Editorial | 1700 | |
| 4309 | Kay and Snowflake | data structures dfs and similar dp trees | Statement | B | Codeforces Round 359 (Div. 1) {685} | PROGRAMMING | 2000 | ||
| 489 | Kay and Eternity | brute force implementation sortings | Statement | D | Codeforces Round 359 (Div. 1) {685} | PROGRAMMING | Codeforces Round #359 Editorial | 2600 | |
| 563 | Travelling Through the Snow Queen's Kingdom | bitmasks brute force divide and conquer graphs | Statement | E | Codeforces Round 359 (Div. 1) {685} | PROGRAMMING | 2700 | ||
| 593 | Optimal Point | binary search math | Statement | C | Codeforces Round 359 (Div. 1) {685} | PROGRAMMING | 2800 | ||
| 7825 | Little Robber Girl's Zoo | constructive algorithms implementation sortings | Statement | B | Codeforces Round 359 (Div. 2) {686} | PROGRAMMING | 1200 | ||
| 38549 | Free Ice Cream | constructive algorithms implementation | Statement | A | Codeforces Round 359 (Div. 2) {686} | PROGRAMMING | Codeforces Round #359 Editorial | 800 | |
| 14643 | NP-Hard Problem | dfs and similar graphs | Statement | A | Codeforces Round 360 (Div. 1) {687} | PROGRAMMING | 1500 | ||
| 6000 | Remainders Game | chinese remainder theorem math number theory | Statement | B | Codeforces Round 360 (Div. 1) {687} | PROGRAMMING | Codeforces Round #360 Editorial [+ Challenges!] | 1900 | |
| 5848 | The Values You Can Make | dp | Statement | C | Codeforces Round 360 (Div. 1) {687} | PROGRAMMING | Codeforces Round #360 Editorial [+ Challenges!] | 2000 | |
| 978 | Dividing Kingdom II | brute force data structures ds graphs sortings | Statement | D | Codeforces Round 360 (Div. 1) {687} | PROGRAMMING | 2500 | ||
| 325 | TOF | dfs and similar graphs | Statement | E | Codeforces Round 360 (Div. 1) {687} | PROGRAMMING | Codeforces Round #360 Editorial [+ Challenges!] | 2800 | |
| 32921 | Lovely Palindromes | constructive algorithms math | Statement | B | Codeforces Round 360 (Div. 2) {688} | PROGRAMMING | Codeforces Round #360 Editorial [+ Challenges!] | 1000 | |
| 14077 | Opponents | implementation | Statement | A | Codeforces Round 360 (Div. 2) {688} | PROGRAMMING | Codeforces Round #360 Editorial [+ Challenges!] | 800 | |
| 5298 | Mike and Cellphone | brute force constructive algorithms implementation | Statement | A | Codeforces Round 361 (Div. 2) {689} | PROGRAMMING | Tutorial | 1400 | |
| 6089 | Mike and Shortcuts | dfs and similar graphs greedy shortest paths | Statement | B | Codeforces Round 361 (Div. 2) {689} | PROGRAMMING | 1600 | ||
| 5505 | Mike and Chocolate Thieves | binary search combinatorics math | Statement | C | Codeforces Round 361 (Div. 2) {689} | PROGRAMMING | 1700 | ||
| 3532 | Friends and Subsequences | binary search data structures | Statement | D | Codeforces Round 361 (Div. 2) {689} | PROGRAMMING | Tutorial | 2200 | |
| 1976 | Mike and Geometry Problem | combinatorics data structures dp geometry implementation | Statement | E | Codeforces Round 361 (Div. 2) {689} | PROGRAMMING | Tutorial | 2300 | |
| 2893 | Collective Mindsets (easy) | Statement | A1 | Helvetic Coding Contest 2016 online mirror (teams, unrated) {690} | PROGRAMMING | 1200 | |||
| 2642 | The Wall (easy) | Statement | D1 | Helvetic Coding Contest 2016 online mirror (teams, unrated) {690} | PROGRAMMING | Tutotial | 1300 | ||
| 2198 | Tree of Life (easy) | Statement | F1 | Helvetic Coding Contest 2016 online mirror (teams, unrated) {690} | PROGRAMMING | Tutotial | 1400 | ||
| 2818 | Brain Network (easy) | Statement | C1 | Helvetic Coding Contest 2016 online mirror (teams, unrated) {690} | PROGRAMMING | Tutotial | 1400 | ||
| 3883 | Brain Network (medium) | dfs and similar graphs trees | Statement | C2 | Helvetic Coding Contest 2016 online mirror (teams, unrated) {690} | PROGRAMMING | Tutotial | 1600 | |
| 1265 | The Wall (medium) | combinatorics | Statement | D2 | Helvetic Coding Contest 2016 online mirror (teams, unrated) {690} | PROGRAMMING | Tutotial | 1800 | |
| 944 | Recover Polygon (easy) | Statement | B1 | Helvetic Coding Contest 2016 online mirror (teams, unrated) {690} | PROGRAMMING | 1800 | |||
| 683 | Photographs (I) | Statement | E1 | Helvetic Coding Contest 2016 online mirror (teams, unrated) {690} | PROGRAMMING | 1900 | |||
| 529 | The Wall (hard) | Statement | D3 | Helvetic Coding Contest 2016 online mirror (teams, unrated) {690} | PROGRAMMING | Tutotial | 2100 | ||
| 917 | Brain Network (hard) | trees | Statement | C3 | Helvetic Coding Contest 2016 online mirror (teams, unrated) {690} | PROGRAMMING | Tutotial | 2200 | |
| 711 | Collective Mindsets (medium) | Statement | A2 | Helvetic Coding Contest 2016 online mirror (teams, unrated) {690} | PROGRAMMING | Tutotial | 2400 | ||
| 554 | Collective Mindsets (hard) | Statement | A3 | Helvetic Coding Contest 2016 online mirror (teams, unrated) {690} | PROGRAMMING | 2500 | |||
| 208 | Recover Polygon (medium) | geometry | Statement | B2 | Helvetic Coding Contest 2016 online mirror (teams, unrated) {690} | PROGRAMMING | 2700 | ||
| 143 | Photographs (II) | Statement | E2 | Helvetic Coding Contest 2016 online mirror (teams, unrated) {690} | PROGRAMMING | 2700 | |||
| 93 | Recover Polygon (hard) | Statement | B3 | Helvetic Coding Contest 2016 online mirror (teams, unrated) {690} | PROGRAMMING | 2800 | |||
| 85 | Tree of Life (medium) | constructive algorithms hashing trees | Statement | F2 | Helvetic Coding Contest 2016 online mirror (teams, unrated) {690} | PROGRAMMING | 3000 | ||
| 54 | Tree of Life (hard) | trees | Statement | F3 | Helvetic Coding Contest 2016 online mirror (teams, unrated) {690} | PROGRAMMING | Tutotial | 3200 | |
| 10322 | Fashion in Berland | implementation | Statement | A | Educational Codeforces Round 14 {691} | PROGRAMMING | Editorial of Educational Codeforces Round 14 | 1100 | |
| 7486 | s-palindrome | implementation strings | Statement | B | Educational Codeforces Round 14 {691} | PROGRAMMING | Editorial of Educational Codeforces Round 14 | 1600 | |
| 5608 | Swaps in Permutation | dfs and similar ds math | Statement | D | Educational Codeforces Round 14 {691} | PROGRAMMING | Editorial of Educational Codeforces Round 14 | 1700 | |
| 2638 | Exponential notation | implementation strings | Statement | C | Educational Codeforces Round 14 {691} | PROGRAMMING | Editorial of Educational Codeforces Round 14 | 1900 | |
| 2599 | Xor-sequences | matrices | Statement | E | Educational Codeforces Round 14 {691} | PROGRAMMING | Editorial of Educational Codeforces Round 14 | 2000 | |
| 1319 | Couple Cover | brute force dp number theory | Statement | F | Educational Codeforces Round 14 {691} | PROGRAMMING | 2300 | ||
| 6160 | Lorenzo Von Matterhorn | brute force data structures implementation trees | Statement | A | Codeforces Round 362 (Div. 1) {696} | PROGRAMMING | 1500 | ||
| 3553 | Puzzles | dfs and similar math probabilities trees | Statement | B | Codeforces Round 362 (Div. 1) {696} | PROGRAMMING | Codeforces Round #362 (Editorial) | 1800 | |
| 2107 | PLEASE | combinatorics dp implementation math matrices | Statement | C | Codeforces Round 362 (Div. 1) {696} | PROGRAMMING | 2200 | ||
| 1348 | Legen... | data structures dp matrices strings | Statement | D | Codeforces Round 362 (Div. 1) {696} | PROGRAMMING | Codeforces Round #362 (Editorial) | 2700 | |
| 566 | ...Wait for it... | data structures ds trees | Statement | E | Codeforces Round 362 (Div. 1) {696} | PROGRAMMING | 2900 | ||
| 129 | ...Dary! | binary search geometry two pointers | Statement | F | Codeforces Round 362 (Div. 1) {696} | PROGRAMMING | 3200 | ||
| 12906 | Pineapple Incident | implementation math | Statement | A | Codeforces Round 362 (Div. 2) {697} | PROGRAMMING | 1000 | ||
| 5789 | Barnicle | brute force implementation math strings | Statement | B | Codeforces Round 362 (Div. 2) {697} | PROGRAMMING | 1400 | ||
| 31400 | Vacations | dp | Statement | A | Codeforces Round 363 (Div. 1) {698} | PROGRAMMING | Solution | 1400 | |
| 5816 | Fix a Tree | constructive algorithms dfs and similar ds graphs trees | Statement | B | Codeforces Round 363 (Div. 1) {698} | PROGRAMMING | 1700 | ||
| 1350 | LRU | bitmasks dp math probabilities | Statement | C | Codeforces Round 363 (Div. 1) {698} | PROGRAMMING | Solution | 2700 | |
| 552 | Limak and Shooting Points | brute force geometry | Statement | D | Codeforces Round 363 (Div. 1) {698} | PROGRAMMING | 2800 | ||
| 119 | Cron | Statement | E | Codeforces Round 363 (Div. 1) {698} | PROGRAMMING | Solution | 2800 | ||
| 441 | Coprime Permutation | combinatorics number theory | Statement | F | Codeforces Round 363 (Div. 1) {698} | PROGRAMMING | Solution | 3000 | |
| 16226 | Launch of Collider | implementation | Statement | A | Codeforces Round 363 (Div. 2) {699} | PROGRAMMING | 1000 | ||
| 7633 | One Bomb | implementation | Statement | B | Codeforces Round 363 (Div. 2) {699} | PROGRAMMING | Codeforces Round #363 problems analysis | 1400 | |
| 3205 | As Fast As Possible | binary search math | Statement | A | Codeforces Round 364 (Div. 1) {700} | PROGRAMMING | 46283 | 1900 | |
| 4120 | Connecting Universities | dfs and similar dp graphs trees | Statement | B | Codeforces Round 364 (Div. 1) {700} | PROGRAMMING | 2100 | ||
| 1330 | Break Up | dfs and similar graphs | Statement | C | Codeforces Round 364 (Div. 1) {700} | PROGRAMMING | 2700 | ||
| 468 | Huffman Coding on Segment | data structures greedy | Statement | D | Codeforces Round 364 (Div. 1) {700} | PROGRAMMING | 3000 | ||
| 1211 | Cool Slogans | string suffix structures strings | Statement | E | Codeforces Round 364 (Div. 1) {700} | PROGRAMMING | 46283 | 3300 | |
| 11849 | Cells Not Under Attack | data structures math | Statement | B | Codeforces Round 364 (Div. 2) {701} | PROGRAMMING | Codeforces Round #364 problem analysis | 1200 | |
| 15904 | They Are Everywhere | binary search strings two pointers | Statement | C | Codeforces Round 364 (Div. 2) {701} | PROGRAMMING | Codeforces Round #364 problem analysis | 1500 | |
| 19852 | Cards | greedy implementation | Statement | A | Codeforces Round 364 (Div. 2) {701} | PROGRAMMING | Codeforces Round #364 problem analysis | 800 | |
| 12196 | Powers of Two | brute force data structures implementation math | Statement | B | Educational Codeforces Round 15 {702} | PROGRAMMING | 46324 | 1500 | |
| 16446 | Cellular Network | binary search implementation two pointers | Statement | C | Educational Codeforces Round 15 {702} | PROGRAMMING | 46324 | 1500 | |
| 3405 | Road to Post Office | math | Statement | D | Educational Codeforces Round 15 {702} | PROGRAMMING | 46324 | 1900 | |
| 2646 | Analysis of Pathes in Functional Graph | data structures graphs | Statement | E | Educational Codeforces Round 15 {702} | PROGRAMMING | 46324 | 2100 | |
| 1541 | T-Shirts | data structures | Statement | F | Educational Codeforces Round 15 {702} | PROGRAMMING | 2800 | ||
| 46533 | Maximum Increase | dp greedy implementation | Statement | A | Educational Codeforces Round 15 {702} | PROGRAMMING | 46324 | 900 | |
| 5713 | Mishka and trip | implementation math | Statement | B | Codeforces Round 365 (Div. 2) {703} | PROGRAMMING | Codeforces Round #365 (Div. 2) Editorial | 1400 | |
| 3674 | Mishka and Interesting sum | data structures | Statement | D | Codeforces Round 365 (Div. 2) {703} | PROGRAMMING | 2100 | ||
| 1868 | Chris and Road | geometry implementation | Statement | C | Codeforces Round 365 (Div. 2) {703} | PROGRAMMING | 2100 | ||
| 608 | Mishka and Divisors | dp number theory | Statement | E | Codeforces Round 365 (Div. 2) {703} | PROGRAMMING | Codeforces Round #365 (Div. 2) Editorial | 2900 | |
| 58291 | Mishka and Game | implementation | Statement | A | Codeforces Round 365 (Div. 2) {703} | PROGRAMMING | Codeforces Round #365 (Div. 2) Editorial | 700 | |
| 9466 | Thor | brute force data structures implementation | Statement | A | Codeforces Round 366 (Div. 1) {704} | PROGRAMMING | Tutorial | 1600 | |
| 1928 | Ant Man | dp graphs greedy | Statement | B | Codeforces Round 366 (Div. 1) {704} | PROGRAMMING | 2700 | ||
| 475 | Black Widow | dp graphs implementation math | Statement | C | Codeforces Round 366 (Div. 1) {704} | PROGRAMMING | 2800 | ||
| 820 | Captain America | flows greedy | Statement | D | Codeforces Round 366 (Div. 1) {704} | PROGRAMMING | 3000 | ||
| 291 | Iron Man | data structures geometry trees | Statement | E | Codeforces Round 366 (Div. 1) {704} | PROGRAMMING | 3500 | ||
| 9219 | Spider Man | games math | Statement | B | Codeforces Round 366 (Div. 2) {705} | PROGRAMMING | 1200 | ||
| 111347 | Hulk | implementation | Statement | A | Codeforces Round 366 (Div. 2) {705} | PROGRAMMING | tutorial | 600 | |
| 66494 | Interesting drink | binary search dp implementation | Statement | B | Codeforces Round 367 (Div. 2) {706} | PROGRAMMING | Tutorial | 1100 | |
| 14630 | Beru-taxi | brute force geometry implementation | Statement | A | Codeforces Round 367 (Div. 2) {706} | PROGRAMMING | Tutorial | 1100 | |
| 16746 | Hard problem | dp strings | Statement | C | Codeforces Round 367 (Div. 2) {706} | PROGRAMMING | 1600 | ||
| 10407 | Vasiliy's Multiset | binary search bitmasks data structures trees | Statement | D | Codeforces Round 367 (Div. 2) {706} | PROGRAMMING | Tutorial | 1800 | |
| 1198 | Working routine | data structures implementation | Statement | E | Codeforces Round 367 (Div. 2) {706} | PROGRAMMING | Tutorial | 2600 | |
| 50343 | Brain's Photos | implementation | Statement | A | Codeforces Round 368 (Div. 2) {707} | PROGRAMMING | 46662 | 1000 | |
| 13025 | Bakery | graphs | Statement | B | Codeforces Round 368 (Div. 2) {707} | PROGRAMMING | 1300 | ||
| 12793 | Pythagorean Triples | math number theory | Statement | C | Codeforces Round 368 (Div. 2) {707} | PROGRAMMING | 46662 | 1500 | |
| 2748 | Persistent Bookcase | bitmasks data structures dfs and similar implementation | Statement | D | Codeforces Round 368 (Div. 2) {707} | PROGRAMMING | 46662 | 2100 | |
| 1240 | Garlands | data structures | Statement | E | Codeforces Round 368 (Div. 2) {707} | PROGRAMMING | 2500 | ||
| 9122 | Letters Cyclic Shift | constructive algorithms greedy implementation strings | Statement | A | AIM Tech Round 3 (Div. 1) {708} | PROGRAMMING | Editorial | 1200 | |
| 3276 | Recover the String | constructive algorithms greedy implementation math | Statement | B | AIM Tech Round 3 (Div. 1) {708} | PROGRAMMING | Editorial | 1900 | |
| 3455 | Centroids | data structures dfs and similar dp graphs greedy trees | Statement | C | AIM Tech Round 3 (Div. 1) {708} | PROGRAMMING | Editorial | 2500 | |
| 795 | Incorrect Flow | flows | Statement | D | AIM Tech Round 3 (Div. 1) {708} | PROGRAMMING | 2900 |