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 ... 19 20 21 22 23 ... 100 101 102 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 5941 | No to Palindromes! | greedy strings | Statement | A | Codeforces Round 265 (Div. 1) {464} | PROGRAMMING | Codeforces Round #265 Editorial | 1700 | |
| 1862 | Substitutes in Number | dp | Statement | C | Codeforces Round 265 (Div. 1) {464} | PROGRAMMING | Codeforces Round #265 Editorial | 2200 | |
| 1714 | Restore Cube | brute force geometry | Statement | B | Codeforces Round 265 (Div. 1) {464} | PROGRAMMING | Codeforces Round #265 Editorial | 2200 | |
| 675 | World of Darkraft - 2 | dp probabilities | Statement | D | Codeforces Round 265 (Div. 1) {464} | PROGRAMMING | Codeforces Round #265 Editorial | 2600 | |
| 1536 | The Classic Problem | data structures graphs shortest paths | Statement | E | Codeforces Round 265 (Div. 1) {464} | PROGRAMMING | 2900 | ||
| 10483 | Inbox (100500) | implementation | Statement | B | Codeforces Round 265 (Div. 2) {465} | PROGRAMMING | Codeforces Round #265 Editorial | 1000 | |
| 10110 | inc ARG | implementation | Statement | A | Codeforces Round 265 (Div. 2) {465} | PROGRAMMING | Codeforces Round #265 Editorial | 900 | |
| 65695 | Cheap Travel | implementation | Statement | A | Codeforces Round 266 (Div. 2) {466} | PROGRAMMING | Editorial Codeforces Round #266 (Div. 2) | 1200 | |
| 37089 | Number of Ways | binary search brute force data structures dp two pointers | Statement | C | Codeforces Round 266 (Div. 2) {466} | PROGRAMMING | Editorial Codeforces Round #266 (Div. 2) | 1700 | |
| 4973 | Wonder Room | brute force math | Statement | B | Codeforces Round 266 (Div. 2) {466} | PROGRAMMING | Editorial Codeforces Round #266 (Div. 2) | 1800 | |
| 3293 | Increase Sequence | combinatorics dp | Statement | D | Codeforces Round 266 (Div. 2) {466} | PROGRAMMING | Editorial Codeforces Round #266 (Div. 2) | 2300 | |
| 2295 | Information Graph | dfs and similar ds graphs trees | Statement | E | Codeforces Round 266 (Div. 2) {466} | PROGRAMMING | Editorial Codeforces Round #266 (Div. 2) | 2400 | |
| 38526 | Fedor and New Game | bitmasks brute force constructive algorithms implementation | Statement | B | Codeforces Round 267 (Div. 2) {467} | PROGRAMMING | Разбор задач | 1200 | |
| 14934 | George and Job | dp implementation | Statement | C | Codeforces Round 267 (Div. 2) {467} | PROGRAMMING | Разбор задач | 1700 | |
| 1873 | Fedor and Essay | dfs and similar dp graphs hashing strings | Statement | D | Codeforces Round 267 (Div. 2) {467} | PROGRAMMING | 2100 | ||
| 802 | Alex and Complicated Task | data structures dp greedy | Statement | E | Codeforces Round 267 (Div. 2) {467} | PROGRAMMING | Разбор задач | 2900 | |
| 128024 | George and Accommodation | implementation | Statement | A | Codeforces Round 267 (Div. 2) {467} | PROGRAMMING | Разбор задач | 800 | |
| 8058 | 24 Game | constructive algorithms greedy math | Statement | A | Codeforces Round 268 (Div. 1) {468} | PROGRAMMING | 13896 | 1600 | |
| 4341 | Two Sets | 2-sat dfs and similar ds graph matchings greedy | Statement | B | Codeforces Round 268 (Div. 1) {468} | PROGRAMMING | 13896 | 2000 | |
| 2446 | Hack it! | binary search constructive algorithms math | Statement | C | Codeforces Round 268 (Div. 1) {468} | PROGRAMMING | 13896 | 2800 | |
| 372 | Tree | graph matchings | Statement | D | Codeforces Round 268 (Div. 1) {468} | PROGRAMMING | 13896 | 3000 | |
| 343 | Permanent | dp graph matchings math meet-in-the-middle | Statement | E | Codeforces Round 268 (Div. 1) {468} | PROGRAMMING | 13896 | 3100 | |
| 101849 | I Wanna Be the Guy | greedy implementation | Statement | A | Codeforces Round 268 (Div. 2) {469} | PROGRAMMING | Codeforces Round #268 Editorial | 1000 | |
| 12820 | Chat Online | implementation | Statement | B | Codeforces Round 268 (Div. 2) {469} | PROGRAMMING | 1300 | ||
| 680 | Crystal Ball Sequence | *special implementation | Statement | A | Surprise Language Round 7 {470} | PROGRAMMING | Surprise Language Round #7: editorial | 1400 | |
| 262 | Hexakosioihexekontahexaphobia | *special | Statement | B | Surprise Language Round 7 {470} | PROGRAMMING | Surprise Language Round #7: editorial | 1800 | |
| 200 | Chessboard | *special | Statement | E | Surprise Language Round 7 {470} | PROGRAMMING | Surprise Language Round #7: editorial | 1900 | |
| 258 | Eval | *special | Statement | C | Surprise Language Round 7 {470} | PROGRAMMING | Surprise Language Round #7: editorial | 2100 | |
| 155 | Caesar Cipher | *special | Statement | D | Surprise Language Round 7 {470} | PROGRAMMING | Surprise Language Round #7: editorial | 2200 | |
| 107 | Pairwise Sums | *special | Statement | F | Surprise Language Round 7 {470} | PROGRAMMING | Surprise Language Round #7: editorial | 2300 | |
| 96 | Hamming Distance | *special | Statement | G | Surprise Language Round 7 {470} | PROGRAMMING | Surprise Language Round #7: editorial | 2500 | |
| 190 | Array Sorting | *special | Statement | H | Surprise Language Round 7 {470} | PROGRAMMING | Surprise Language Round #7: editorial | 2600 | |
| 13466 | MUH and Sticks | implementation | Statement | A | Codeforces Round 269 (Div. 2) {471} | PROGRAMMING | Codeforces Round #269 Editorial | 1200 | |
| 5974 | MUH and Important Things | implementation sortings | Statement | B | Codeforces Round 269 (Div. 2) {471} | PROGRAMMING | 1400 | ||
| 3588 | MUH and House of Cards | binary search brute force greedy math | Statement | C | Codeforces Round 269 (Div. 2) {471} | PROGRAMMING | Codeforces Round #269 Editorial | 1700 | |
| 8573 | MUH and Cube Walls | string suffix structures strings | Statement | D | Codeforces Round 269 (Div. 2) {471} | PROGRAMMING | Codeforces Round #269 Editorial | 2000 | |
| 83 | MUH and Lots and Lots of Segments | data structures ds | Statement | E | Codeforces Round 269 (Div. 2) {471} | PROGRAMMING | 2700 | ||
| 7464 | Design Tutorial: Learn from Life | Statement | B | Codeforces Round 270 {472} | PROGRAMMING | Editorial | 1300 | ||
| 6380 | Design Tutorial: Make It Nondeterministic | greedy | Statement | C | Codeforces Round 270 {472} | PROGRAMMING | Editorial | 1400 | |
| 5572 | Design Tutorial: Inverse the Problem | dfs and similar ds shortest paths trees | Statement | D | Codeforces Round 270 {472} | PROGRAMMING | Editorial | 1900 | |
| 259 | Design Tutorial: Change the Goal | constructive algorithms math matrices | Statement | F | Codeforces Round 270 {472} | PROGRAMMING | 2600 | ||
| 132 | Design Tutorial: Learn from a Game | constructive algorithms implementation | Statement | E | Codeforces Round 270 {472} | PROGRAMMING | 2700 | ||
| 412 | Design Tutorial: Increase the Constraints | bitmasks data structures fft | Statement | G | Codeforces Round 270 {472} | PROGRAMMING | Editorial | 2800 | |
| 62022 | Design Tutorial: Learn from Math | math number theory | Statement | A | Codeforces Round 270 {472} | PROGRAMMING | Editorial | 900 | |
| 46992 | Keyboard | implementation | Statement | A | Codeforces Round 271 (Div. 2) {474} | PROGRAMMING | Codeforces Round #271 (Div. 2) Editorial | 1000 | |
| 50817 | Worms | binary search implementation | Statement | B | Codeforces Round 271 (Div. 2) {474} | PROGRAMMING | Codeforces Round #271 (Div. 2) Editorial | 1300 | |
| 26222 | Flowers | dp | Statement | D | Codeforces Round 271 (Div. 2) {474} | PROGRAMMING | Codeforces Round #271 (Div. 2) Editorial | 1700 | |
| 3162 | Captain Marmot | brute force geometry | Statement | C | Codeforces Round 271 (Div. 2) {474} | PROGRAMMING | Codeforces Round #271 (Div. 2) Editorial | 1900 | |
| 3493 | Pillars | binary search data structures dp sortings trees | Statement | E | Codeforces Round 271 (Div. 2) {474} | PROGRAMMING | Codeforces Round #271 (Div. 2) Editorial | 2200 | |
| 9118 | Ant colony | data structures math number theory | Statement | F | Codeforces Round 271 (Div. 2) {474} | PROGRAMMING | 2200 | ||
| 4791 | Bayan Bus | implementation | Statement | A | Bayan 2015 Contest Warm Up {475} | PROGRAMMING | Bayan 2015 Contest Warm Up Editorial | 1300 | |
| 8634 | Strongly Connected City | brute force dfs and similar graphs implementation | Statement | B | Bayan 2015 Contest Warm Up {475} | PROGRAMMING | Bayan 2015 Contest Warm Up Editorial | 1400 | |
| 5119 | CGCDSSQ | brute force data structures math | Statement | D | Bayan 2015 Contest Warm Up {475} | PROGRAMMING | Bayan 2015 Contest Warm Up Editorial | 2000 | |
| 790 | Kamal-ol-molk's Painting | brute force constructive algorithms greedy | Statement | C | Bayan 2015 Contest Warm Up {475} | PROGRAMMING | Bayan 2015 Contest Warm Up Editorial | 2100 | |
| 418 | Strongly Connected City 2 | dfs and similar | Statement | E | Bayan 2015 Contest Warm Up {475} | PROGRAMMING | Bayan 2015 Contest Warm Up Editorial | 2600 | |
| 234 | Meta-universe | data structures | Statement | F | Bayan 2015 Contest Warm Up {475} | PROGRAMMING | Bayan 2015 Contest Warm Up Editorial | 2800 | |
| 45211 | Dreamoon and Stairs | implementation math | Statement | A | Codeforces Round 272 (Div. 2) {476} | PROGRAMMING | Editorial | 1100 | |
| 31735 | Dreamoon and WiFi | bitmasks brute force combinatorics dp math probabilities | Statement | B | Codeforces Round 272 (Div. 2) {476} | PROGRAMMING | 1300 | ||
| 5770 | Dreamoon and Sums | math | Statement | C | Codeforces Round 272 (Div. 2) {476} | PROGRAMMING | Editorial | 1700 | |
| 4723 | Dreamoon and Sets | constructive algorithms greedy math | Statement | D | Codeforces Round 272 (Div. 2) {476} | PROGRAMMING | Editorial | 2000 | |
| 1991 | Dreamoon and Strings | dp strings | Statement | E | Codeforces Round 272 (Div. 2) {476} | PROGRAMMING | Editorial | 2600 | |
| 532 | Dreamoon and Binary | dp strings | Statement | D | Codeforces Round 272 (Div. 1) {477} | PROGRAMMING | Разбор (англ.) | 2600 | |
| 135 | Dreamoon and Notepad | data structures | Statement | E | Codeforces Round 272 (Div. 1) {477} | PROGRAMMING | 3100 | ||
| 25953 | Initial Bet | implementation | Statement | A | Codeforces Round 273 (Div. 2) {478} | PROGRAMMING | Editorial | 1200 | |
| 37366 | Random Teams | combinatorics constructive algorithms greedy math | Statement | B | Codeforces Round 273 (Div. 2) {478} | PROGRAMMING | Editorial | 1300 | |
| 18631 | Table Decorations | greedy | Statement | C | Codeforces Round 273 (Div. 2) {478} | PROGRAMMING | Editorial | 1700 | |
| 6164 | Red-Green Towers | dp | Statement | D | Codeforces Round 273 (Div. 2) {478} | PROGRAMMING | Editorial | 2100 | |
| 221 | Wavy numbers | brute force dfs and similar meet-in-the-middle sortings | Statement | E | Codeforces Round 273 (Div. 2) {478} | PROGRAMMING | Editorial | 2700 | |
| 97367 | Expression | brute force math | Statement | A | Codeforces Round 274 (Div. 2) {479} | PROGRAMMING | Codeforces Round #274: editorial | 1100 | |
| 7970 | Towers | brute force constructive algorithms greedy implementation sortings | Statement | B | Codeforces Round 274 (Div. 2) {479} | PROGRAMMING | 1400 | ||
| 30238 | Exams | greedy sortings | Statement | C | Codeforces Round 274 (Div. 2) {479} | PROGRAMMING | 1500 | ||
| 4854 | Long Jumps | binary search greedy implementation | Statement | D | Codeforces Round 274 (Div. 2) {479} | PROGRAMMING | 1800 | ||
| 5212 | Riding in a Lift | combinatorics dp | Statement | E | Codeforces Round 274 (Div. 2) {479} | PROGRAMMING | 2000 | ||
| 461 | Parcels | dp graphs | Statement | D | Codeforces Round 274 (Div. 1) {480} | PROGRAMMING | 2600 | ||
| 575 | Parking Lot | data structures divide and conquer | Statement | E | Codeforces Round 274 (Div. 1) {480} | PROGRAMMING | Codeforces Round #274: editorial | 2800 | |
| 9759 | Diverse Permutation | constructive algorithms greedy | Statement | A | Codeforces Round 275 (Div. 1) {482} | PROGRAMMING | Codeforces Round #275 Editorial | 1300 | |
| 6683 | Interesting Array | constructive algorithms data structures trees | Statement | B | Codeforces Round 275 (Div. 1) {482} | PROGRAMMING | Codeforces Round #275 Editorial | 2000 | |
| 543 | Random Function and Tree | combinatorics dp trees | Statement | D | Codeforces Round 275 (Div. 1) {482} | PROGRAMMING | Codeforces Round #275 Editorial | 2600 | |
| 953 | Game with Strings | bitmasks dp probabilities | Statement | C | Codeforces Round 275 (Div. 1) {482} | PROGRAMMING | 2800 | ||
| 179 | ELCA | data structures trees | Statement | E | Codeforces Round 275 (Div. 1) {482} | PROGRAMMING | 3200 | ||
| 23488 | Counterexample | brute force implementation math number theory | Statement | A | Codeforces Round 275 (Div. 2) {483} | PROGRAMMING | Codeforces Round #275 Editorial | 1100 | |
| 4112 | Friends and Presents | binary search math | Statement | B | Codeforces Round 275 (Div. 2) {483} | PROGRAMMING | Codeforces Round #275 Editorial | 1800 | |
| 11668 | Bits | bitmasks constructive algorithms | Statement | A | Codeforces Round 276 (Div. 1) {484} | PROGRAMMING | Codeforces Round #276 — Editorial | 1700 | |
| 7141 | Maximum Value | binary search math sortings two pointers | Statement | B | Codeforces Round 276 (Div. 1) {484} | PROGRAMMING | Codeforces Round #276 — Editorial | 2100 | |
| 2706 | Kindergarten | data structures dp greedy | Statement | D | Codeforces Round 276 (Div. 1) {484} | PROGRAMMING | Codeforces Round #276 — Editorial | 2400 | |
| 597 | Strange Sorting | implementation math | Statement | C | Codeforces Round 276 (Div. 1) {484} | PROGRAMMING | 2600 | ||
| 2410 | Sign on Fence | binary search constructive algorithms data structures | Statement | E | Codeforces Round 276 (Div. 1) {484} | PROGRAMMING | 2700 | ||
| 6555 | Valuable Resources | brute force greedy | Statement | B | Codeforces Round 276 (Div. 2) {485} | PROGRAMMING | Codeforces Round #276 — Editorial | 1300 | |
| 8382 | Factory | implementation math matrices | Statement | A | Codeforces Round 276 (Div. 2) {485} | PROGRAMMING | Codeforces Round #276 — Editorial | 1400 | |
| 124820 | Calculating Function | implementation math | Statement | A | Codeforces Round 277 (Div. 2) {486} | PROGRAMMING | Codeforces Round #277(Div. 2) Editorial | 1100 | |
| 18031 | OR in Matrix | greedy hashing implementation | Statement | B | Codeforces Round 277 (Div. 2) {486} | PROGRAMMING | Codeforces Round #277(Div. 2) Editorial | 1400 | |
| 11836 | Palindrome Transformation | brute force greedy implementation | Statement | C | Codeforces Round 277 (Div. 2) {486} | PROGRAMMING | 1700 | ||
| 4097 | Valid Sets | dfs and similar dp math trees | Statement | D | Codeforces Round 277 (Div. 2) {486} | PROGRAMMING | Codeforces Round #277(Div. 2) Editorial | 2300 | |
| 2323 | LIS of Sequence | data structures dp greedy hashing math | Statement | E | Codeforces Round 277 (Div. 2) {486} | PROGRAMMING | 2400 | ||
| 3780 | Fight the Monster | binary search brute force implementation | Statement | A | Codeforces Round 278 (Div. 1) {487} | PROGRAMMING | Tutorial | 1900 | |
| 3599 | Strip | binary search data structures dp two pointers | Statement | B | Codeforces Round 278 (Div. 1) {487} | PROGRAMMING | Tutorial | 2300 | |
| 2830 | Prefix Product Sequence | constructive algorithms math number theory | Statement | C | Codeforces Round 278 (Div. 1) {487} | PROGRAMMING | Tutorial | 2600 | |
| 912 | Conveyor Belts | data structures | Statement | D | Codeforces Round 278 (Div. 1) {487} | PROGRAMMING | 2700 | ||
| 2437 | Tourists | data structures dfs and similar graphs trees | Statement | E | Codeforces Round 278 (Div. 1) {487} | PROGRAMMING | Tutorial | 3100 | |
| 14413 | Giga Tower | brute force | Statement | A | Codeforces Round 278 (Div. 2) {488} | PROGRAMMING | Codeforces Round #278 Editorial | 1100 |