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 ... 16 17 18 19 20 ... 100 101 102 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 827 | Diverse Substrings | dp strings two pointers | Statement | C | Testing Round 9 {386} | PROGRAMMING | 2100 | ||
| 465 | Game with Points | dp graphs implementation shortest paths | Statement | D | Testing Round 9 {386} | PROGRAMMING | 2300 | ||
| 9848 | George and Sleep | implementation | Statement | A | Codeforces Round 227 (Div. 2) {387} | PROGRAMMING | Editorial Codeforces Round #227 (Div. 2) | 1000 | |
| 12389 | George and Round | brute force greedy two pointers | Statement | B | Codeforces Round 227 (Div. 2) {387} | PROGRAMMING | 1200 | ||
| 2218 | George and Number | greedy implementation | Statement | C | Codeforces Round 227 (Div. 2) {387} | PROGRAMMING | Editorial Codeforces Round #227 (Div. 2) | 1700 | |
| 925 | George and Cards | binary search data structures | Statement | E | Codeforces Round 227 (Div. 2) {387} | PROGRAMMING | 2500 | ||
| 1034 | George and Interesting Graph | graph matchings | Statement | D | Codeforces Round 227 (Div. 2) {387} | PROGRAMMING | Editorial Codeforces Round #227 (Div. 2) | 2700 | |
| 11547 | Fox and Box Accumulation | greedy sortings | Statement | A | Codeforces Round 228 (Div. 1) {388} | PROGRAMMING | Codeforces Round #228 — Editorial | 1400 | |
| 2495 | Fox and Minimal path | bitmasks constructive algorithms graphs implementation math | Statement | B | Codeforces Round 228 (Div. 1) {388} | PROGRAMMING | Codeforces Round #228 — Editorial | 2000 | |
| 3463 | Fox and Card Game | games greedy sortings | Statement | C | Codeforces Round 228 (Div. 1) {388} | PROGRAMMING | Codeforces Round #228 — Editorial | 2000 | |
| 454 | Fox and Perfect Sets | math | Statement | D | Codeforces Round 228 (Div. 1) {388} | PROGRAMMING | Codeforces Round #228 — Editorial | 2700 | |
| 122 | Fox and Meteor Shower | geometry | Statement | E | Codeforces Round 228 (Div. 1) {388} | PROGRAMMING | Codeforces Round #228 — Editorial | 3000 | |
| 14257 | Fox and Number Game | greedy math | Statement | A | Codeforces Round 228 (Div. 2) {389} | PROGRAMMING | Codeforces Round #228 — Editorial | 1100 | |
| 7020 | Fox and Cross | greedy implementation | Statement | B | Codeforces Round 228 (Div. 2) {389} | PROGRAMMING | Codeforces Round #228 — Editorial | 1200 | |
| 1179 | Inna, Dima and Song | implementation | Statement | B | Codeforces Round 229 (Div. 2) {390} | PROGRAMMING | 1000.0 | ||
| 519 | Inna and Sweet Matrix | constructive algorithms | Statement | D | Codeforces Round 229 (Div. 2) {390} | PROGRAMMING | 2000.0 | ||
| 261 | Inna and Large Sweet Matrix | Statement | E | Codeforces Round 229 (Div. 2) {390} | PROGRAMMING | 2500.0 | |||
| 628 | Inna and Candy Boxes | data structures | Statement | C | Codeforces Round 229 (Div. 2) {390} | PROGRAMMING | 1500.0 | ||
| 3604 | Inna and Alarm Clock | implementation | Statement | A | Codeforces Round 229 (Div. 2) {390} | PROGRAMMING | 500.0 | ||
| 396 | Word Folding | brute force | Statement | B | Rockethon 2014 {391} | PROGRAMMING | 5.0 | ||
| 168 | Three Trees | Statement | E2 | Rockethon 2014 {391} | PROGRAMMING | 13.0 | |||
| 121 | Three Trees | Statement | E1 | Rockethon 2014 {391} | PROGRAMMING | 11.0 | |||
| 171 | The Tournament | Statement | C3 | Rockethon 2014 {391} | PROGRAMMING | 8.0 | |||
| 138 | The Tournament | greedy | Statement | C2 | Rockethon 2014 {391} | PROGRAMMING | 4.0 | ||
| 189 | The Tournament | brute force | Statement | C1 | Rockethon 2014 {391} | PROGRAMMING | 4.0 | ||
| 198 | Supercollider | data structures | Statement | D2 | Rockethon 2014 {391} | PROGRAMMING | 16.0 | ||
| 214 | Supercollider | brute force | Statement | D1 | Rockethon 2014 {391} | PROGRAMMING | 3.0 | ||
| 107 | Stock Trading | Statement | F3 | Rockethon 2014 {391} | PROGRAMMING | 10.0 | |||
| 108 | Stock Trading | greedy | Statement | F2 | Rockethon 2014 {391} | PROGRAMMING | 15.0 | ||
| 189 | Stock Trading | dp | Statement | F1 | Rockethon 2014 {391} | PROGRAMMING | 8.0 | ||
| 1725 | Genetic Engineering | implementation two pointers | Statement | A | Rockethon 2014 {391} | PROGRAMMING | 3.0 | Rockethon 2014 Editorial | |
| 600 | Yet Another Number Sequence | combinatorics math matrices | Statement | C | Codeforces Round 230 (Div. 1) {392} | PROGRAMMING | 1500.0 | 83942 | |
| 958 | Tower of Hanoi | dp | Statement | B | Codeforces Round 230 (Div. 1) {392} | PROGRAMMING | 1000.0 | 83942 | |
| 218 | Three Arrays | data structures | Statement | D | Codeforces Round 230 (Div. 1) {392} | PROGRAMMING | 2000.0 | 83942 | |
| 179 | Deleting Substrings | Statement | E | Codeforces Round 230 (Div. 1) {392} | PROGRAMMING | 2500.0 | 83942 | ||
| 979 | Blocked Points | math | Statement | A | Codeforces Round 230 (Div. 1) {392} | PROGRAMMING | 500.0 | 83942 | |
| 2002 | Three matrices | Statement | B | Codeforces Round 230 (Div. 2) {393} | PROGRAMMING | 1000.0 | 83942 | ||
| 6700 | Nineteen | Statement | A | Codeforces Round 230 (Div. 2) {393} | PROGRAMMING | 500.0 | 83942 | ||
| 575 | Very Beautiful Number | math | Statement | B | Codeforces Round 231 (Div. 2) {394} | PROGRAMMING | 1000.0 | ||
| 271 | Physical Education and Buns | brute force implementation math | Statement | D | Codeforces Round 231 (Div. 2) {394} | PROGRAMMING | 2000.0 | ||
| 117 | Lightbulb for Minister | geometry | Statement | E | Codeforces Round 231 (Div. 2) {394} | PROGRAMMING | 2500.0 | ||
| 521 | Dominoes | constructive algorithms greedy | Statement | C | Codeforces Round 231 (Div. 2) {394} | PROGRAMMING | 1500.0 | ||
| 2668 | Counting Sticks | brute force implementation | Statement | A | Codeforces Round 231 (Div. 2) {394} | PROGRAMMING | 500.0 | ||
| 439 | On Sum of Number of Inversions in Permutations | combinatorics math | Statement | D | Codeforces Round 232 (Div. 1) {396} | PROGRAMMING | 2000.0 | Codeforces Round #232 Editorial (restored) | |
| 1111 | On Sum of Fractions | math number theory | Statement | B | Codeforces Round 232 (Div. 1) {396} | PROGRAMMING | 1000.0 | Codeforces Round #232 Editorial (restored) | |
| 1523 | On Number of Decompositions into Multipliers | combinatorics math number theory | Statement | A | Codeforces Round 232 (Div. 1) {396} | PROGRAMMING | 500.0 | Codeforces Round #232 Editorial (restored) | |
| 155 | On Iteration of One Well-Known Function | math | Statement | E | Codeforces Round 232 (Div. 1) {396} | PROGRAMMING | 2500.0 | Codeforces Round #232 Editorial (restored) | |
| 1644 | On Changing Tree | data structures graphs trees | Statement | C | Codeforces Round 232 (Div. 1) {396} | PROGRAMMING | 1500.0 | Codeforces Round #232 Editorial (restored) | |
| 2643 | On Segment's Own Points | implementation | Statement | A | Codeforces Round 232 (Div. 2) {397} | PROGRAMMING | 500.0 | ||
| 760 | On Corruption and Numbers | constructive algorithms implementation math | Statement | B | Codeforces Round 232 (Div. 2) {397} | PROGRAMMING | 1000.0 | ||
| 214 | Tree and Array | constructive algorithms | Statement | C | Codeforces Round 233 (Div. 1) {398} | PROGRAMMING | 1500.0 | ||
| 92 | Sorting Permutations | Statement | E | Codeforces Round 233 (Div. 1) {398} | PROGRAMMING | 2500.0 | Codeforces Round #233 Editorial | ||
| 1072 | Painting The Wall | dp probabilities | Statement | B | Codeforces Round 233 (Div. 1) {398} | PROGRAMMING | 1000.0 | Codeforces Round #233 Editorial | |
| 963 | Instant Messanger | data structures | Statement | D | Codeforces Round 233 (Div. 1) {398} | PROGRAMMING | 2000.0 | Codeforces Round #233 Editorial | |
| 927 | Cards | constructive algorithms implementation | Statement | A | Codeforces Round 233 (Div. 1) {398} | PROGRAMMING | 500.0 | Codeforces Round #233 Editorial | |
| 1843 | Red and Blue Balls | Statement | B | Codeforces Round 233 (Div. 2) {399} | PROGRAMMING | 1000.0 | Codeforces Round #233 Editorial | ||
| 4165 | Pages | implementation | Statement | A | Codeforces Round 233 (Div. 2) {399} | PROGRAMMING | 500.0 | Codeforces Round #233 Editorial | |
| 6581 | Inna and Choose Options | implementation | Statement | A | Codeforces Round 234 (Div. 2) {400} | PROGRAMMING | Codeforces Round #234 (Div. 2) — Tutorial | 1000 | |
| 7861 | Inna and New Matrix of Candies | brute force implementation schedules | Statement | B | Codeforces Round 234 (Div. 2) {400} | PROGRAMMING | Codeforces Round #234 (Div. 2) — Tutorial | 1300 | |
| 2909 | Inna and Huge Candy Matrix | implementation math | Statement | C | Codeforces Round 234 (Div. 2) {400} | PROGRAMMING | 1500 | ||
| 2944 | Dima and Bacteria | ds graphs shortest paths | Statement | D | Codeforces Round 234 (Div. 2) {400} | PROGRAMMING | 2000 | ||
| 978 | Inna and Binary Logic | binary search bitmasks data structures | Statement | E | Codeforces Round 234 (Div. 2) {400} | PROGRAMMING | Codeforces Round #234 (Div. 2) — Tutorial | 2400 | |
| 4448 | Sereja and Contests | greedy implementation math | Statement | B | Codeforces Round 235 (Div. 2) {401} | PROGRAMMING | 1200 | ||
| 20309 | Team | constructive algorithms greedy implementation | Statement | C | Codeforces Round 235 (Div. 2) {401} | PROGRAMMING | Codeforces Round #235 (Div. 2) — Tutorial | 1400 | |
| 4247 | Roman and Numbers | bitmasks brute force combinatorics dp number theory | Statement | D | Codeforces Round 235 (Div. 2) {401} | PROGRAMMING | Codeforces Round #235 (Div. 2) — Tutorial | 2000 | |
| 168 | Olympic Games | math | Statement | E | Codeforces Round 235 (Div. 2) {401} | PROGRAMMING | Codeforces Round #235 (Div. 2) — Tutorial | 2500 | |
| 16576 | Vanya and Cards | implementation math | Statement | A | Codeforces Round 235 (Div. 2) {401} | PROGRAMMING | Codeforces Round #235 (Div. 2) — Tutorial | 900 | |
| 4643 | Nuts | greedy math | Statement | A | Codeforces Round 236 (Div. 2) {402} | PROGRAMMING | Editorial Codeforces Round #236 | 1200 | |
| 3837 | Trees in a Row | brute force implementation | Statement | B | Codeforces Round 236 (Div. 2) {402} | PROGRAMMING | 1400 | ||
| 5998 | Searching for Graph | brute force constructive algorithms graphs | Statement | C | Codeforces Round 236 (Div. 2) {402} | PROGRAMMING | Editorial Codeforces Round #236 | 1500 | |
| 2645 | Upgrading Array | dp greedy math number theory | Statement | D | Codeforces Round 236 (Div. 2) {402} | PROGRAMMING | Editorial Codeforces Round #236 | 2000 | |
| 2211 | Strictly Positive Matrix | graphs math | Statement | E | Codeforces Round 236 (Div. 2) {402} | PROGRAMMING | Editorial Codeforces Round #236 | 2200 | |
| 1127 | Beautiful Pairs of Numbers | combinatorics dp | Statement | D | Codeforces Round 236 (Div. 1) {403} | PROGRAMMING | Editorial Codeforces Round #236 | 2200 | |
| 224 | Two Rooted Trees | data structures implementation trees | Statement | E | Codeforces Round 236 (Div. 1) {403} | PROGRAMMING | 2900 | ||
| 24431 | Valera and X | implementation | Statement | A | Codeforces Round 237 (Div. 2) {404} | PROGRAMMING | Codeforces Round #237 (Div. 2) Editorial | 1100 | |
| 2946 | Marathon | implementation math | Statement | B | Codeforces Round 237 (Div. 2) {404} | PROGRAMMING | Codeforces Round #237 (Div. 2) Editorial | 1500 | |
| 5309 | Restore Graph | dfs and similar graphs sortings | Statement | C | Codeforces Round 237 (Div. 2) {404} | PROGRAMMING | Codeforces Round #237 (Div. 2) Editorial | 1800 | |
| 2202 | Minesweeper 1D | dp implementation | Statement | D | Codeforces Round 237 (Div. 2) {404} | PROGRAMMING | Codeforces Round #237 (Div. 2) Editorial | 2200 | |
| 606 | Maze 1D | binary search greedy implementation | Statement | E | Codeforces Round 237 (Div. 2) {404} | PROGRAMMING | 2700 | ||
| 105217 | Gravity Flip | greedy implementation sortings | Statement | A | Codeforces Round 238 (Div. 2) {405} | PROGRAMMING | Codeforces Round #238 Tutorial | 1000 | |
| 5834 | Domino Effect | Statement | B | Codeforces Round 238 (Div. 2) {405} | PROGRAMMING | 1200 | |||
| 4710 | Unusual Product | implementation math | Statement | C | Codeforces Round 238 (Div. 2) {405} | PROGRAMMING | 1600 | ||
| 3131 | Toy Sum | greedy implementation math | Statement | D | Codeforces Round 238 (Div. 2) {405} | PROGRAMMING | 1900 | ||
| 1452 | Graph Cutting | dfs and similar graphs | Statement | E | Codeforces Round 238 (Div. 2) {405} | PROGRAMMING | 2400 | ||
| 1190 | Hill Climbing | dfs and similar geometry trees | Statement | D | Codeforces Round 238 (Div. 1) {406} | PROGRAMMING | 2200 | ||
| 249 | Hamming Triples | implementation math two pointers | Statement | E | Codeforces Round 238 (Div. 1) {406} | PROGRAMMING | Codeforces Round #238 Tutorial | 2700 | |
| 4935 | Triangle | brute force geometry implementation math | Statement | A | Codeforces Round 239 (Div. 1) {407} | PROGRAMMING | Codeforces Round #239 Editorial | 1700 | |
| 6645 | Long Path | dp implementation | Statement | B | Codeforces Round 239 (Div. 1) {407} | PROGRAMMING | Codeforces Round #239 Editorial | 1800 | |
| 1061 | Curious Array | brute force combinatorics implementation math | Statement | C | Codeforces Round 239 (Div. 1) {407} | PROGRAMMING | Codeforces Round #239 Editorial | 2500 | |
| 681 | Largest Submatrix 3 | dp hashing | Statement | D | Codeforces Round 239 (Div. 1) {407} | PROGRAMMING | Codeforces Round #239 Editorial | 2600 | |
| 811 | k-d-sequence | data structures | Statement | E | Codeforces Round 239 (Div. 1) {407} | PROGRAMMING | Codeforces Round #239 Editorial | 3100 | |
| 9455 | Garland | implementation | Statement | B | Codeforces Round 239 (Div. 2) {408} | PROGRAMMING | Codeforces Round #239 Editorial | 1200 | |
| 11388 | Line to Cashier | implementation | Statement | A | Codeforces Round 239 (Div. 2) {408} | PROGRAMMING | 900 | ||
| 2478 | The Great Game | *special | Statement | A | April Fools Day Contest 2014 {409} | PROGRAMMING | April Fools Day Contest 2014: editorial | 1700 | |
| 1992 | Magnum Opus | *special | Statement | C | April Fools Day Contest 2014 {409} | PROGRAMMING | April Fools Day Contest 2014: editorial | 1700 | |
| 9038 | A + B Strikes Back | *special brute force constructive algorithms ds implementation | Statement | H | April Fools Day Contest 2014 {409} | PROGRAMMING | April Fools Day Contest 2014: editorial | 1700 | |
| 1370 | Mysterious Language | *special | Statement | B | April Fools Day Contest 2014 {409} | PROGRAMMING | April Fools Day Contest 2014: editorial | 1800 | |
| 1727 | Big Data | *special | Statement | D | April Fools Day Contest 2014 {409} | PROGRAMMING | April Fools Day Contest 2014: editorial | 2000 | |
| 582 | Dome | *special | Statement | E | April Fools Day Contest 2014 {409} | PROGRAMMING | April Fools Day Contest 2014: editorial | 2100 | |
| 2103 | 000001 | *special | Statement | F | April Fools Day Contest 2014 {409} | PROGRAMMING | April Fools Day Contest 2014: editorial | 2300 |