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 ... 18 19 20 21 22 ... 100 101 102 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 25515 | Devu, the Singer and Churu, the Joker | greedy implementation | Statement | A | Codeforces Round 251 (Div. 2) {439} | PROGRAMMING | Codeforces Round #251 Editorial | 1100 | |
| 14465 | Devu, the Dumb Guy | implementation sortings | Statement | B | Codeforces Round 251 (Div. 2) {439} | PROGRAMMING | 1200 | ||
| 3984 | Devu and Partitioning of the Array | brute force constructive algorithms implementation number theory | Statement | C | Codeforces Round 251 (Div. 2) {439} | PROGRAMMING | Codeforces Round #251 Editorial | 1700 | |
| 6220 | Devu and his Brother | binary search sortings ternary search two pointers | Statement | D | Codeforces Round 251 (Div. 2) {439} | PROGRAMMING | Codeforces Round #251 Editorial | 1900 | |
| 1596 | Devu and Birthday Celebration | combinatorics dp math | Statement | E | Codeforces Round 251 (Div. 2) {439} | PROGRAMMING | Codeforces Round #251 Editorial | 2600 | |
| 7620 | Forgotten Episode | implementation | Statement | A | Testing Round 10 {440} | PROGRAMMING | 1000 | ||
| 2011 | Balancer | greedy implementation | Statement | B | Testing Round 10 {440} | PROGRAMMING | 1600 | ||
| 928 | One-Based Arithmetic | brute force dfs and similar divide and conquer | Statement | C | Testing Round 10 {440} | PROGRAMMING | 2000 | ||
| 758 | Berland Federalization | dp trees | Statement | D | Testing Round 10 {440} | PROGRAMMING | 2600 | ||
| 18666 | Valera and Antique Items | implementation | Statement | A | Codeforces Round 252 (Div. 2) {441} | PROGRAMMING | 1000 | ||
| 7143 | Valera and Fruits | greedy implementation | Statement | B | Codeforces Round 252 (Div. 2) {441} | PROGRAMMING | 12615 | 1400 | |
| 11346 | Valera and Tubes | constructive algorithms dfs and similar implementation | Statement | C | Codeforces Round 252 (Div. 2) {441} | PROGRAMMING | 12615 | 1500 | |
| 1117 | Valera and Swaps | constructive algorithms ds graphs implementation math string suffix structures | Statement | D | Codeforces Round 252 (Div. 2) {441} | PROGRAMMING | 2300 | ||
| 733 | Valera and Number | bitmasks dp math probabilities | Statement | E | Codeforces Round 252 (Div. 2) {441} | PROGRAMMING | 12615 | 2700 | |
| 5313 | Andrey and Problem | greedy math probabilities | Statement | B | Codeforces Round 253 (Div. 1) {442} | PROGRAMMING | Codeforces #253 editorial | 1800 | |
| 2167 | Borya and Hanabi | bitmasks brute force implementation | Statement | A | Codeforces Round 253 (Div. 1) {442} | PROGRAMMING | Codeforces #253 editorial | 2000 | |
| 1820 | Artem and Array | data structures greedy | Statement | C | Codeforces Round 253 (Div. 1) {442} | PROGRAMMING | Codeforces #253 editorial | 2500 | |
| 1012 | Adam and Tree | data structures trees | Statement | D | Codeforces Round 253 (Div. 1) {442} | PROGRAMMING | Codeforces #253 editorial | 2500 | |
| 176 | Gena and Second Distance | geometry | Statement | E | Codeforces Round 253 (Div. 1) {442} | PROGRAMMING | Codeforces #253 editorial | 3100 | |
| 4074 | Kolya and Tandem Repeat | brute force implementation strings | Statement | B | Codeforces Round 253 (Div. 2) {443} | PROGRAMMING | Codeforces #253 editorial | 1500 | |
| 93177 | Anton and Letters | constructive algorithms implementation | Statement | A | Codeforces Round 253 (Div. 2) {443} | PROGRAMMING | Codeforces #253 editorial | 800 | |
| 3442 | DZY Loves Physics | greedy math | Statement | A | Codeforces Round 254 (Div. 1) {444} | PROGRAMMING | Codeforces Round #254 Editorial | 1800 | |
| 2997 | DZY Loves Colors | data structures | Statement | C | Codeforces Round 254 (Div. 1) {444} | PROGRAMMING | 2300 | ||
| 790 | DZY Loves Strings | binary search hashing strings two pointers | Statement | D | Codeforces Round 254 (Div. 1) {444} | PROGRAMMING | 2400 | ||
| 1078 | DZY Loves FFT | probabilities | Statement | B | Codeforces Round 254 (Div. 1) {444} | PROGRAMMING | Codeforces Round #254 Editorial | 2400 | |
| 787 | DZY Loves Planting | binary search ds trees | Statement | E | Codeforces Round 254 (Div. 1) {444} | PROGRAMMING | Codeforces Round #254 Editorial | 2600 | |
| 30428 | DZY Loves Chessboard | dfs and similar implementation | Statement | A | Codeforces Round 254 (Div. 2) {445} | PROGRAMMING | Codeforces Round #254 Editorial | 1200 | |
| 12922 | DZY Loves Chemistry | dfs and similar ds greedy | Statement | B | Codeforces Round 254 (Div. 2) {445} | PROGRAMMING | Codeforces Round #254 Editorial | 1500 | |
| 12721 | DZY Loves Sequences | dp implementation two pointers | Statement | A | Codeforces Round #FF (Div. 1) {446} | PROGRAMMING | Codeforces Round #FF(255) Editorial | 1700 | |
| 3614 | DZY Loves Modification | brute force data structures greedy | Statement | B | Codeforces Round #FF (Div. 1) {446} | PROGRAMMING | Codeforces Round #FF(255) Editorial | 2100 | |
| 3437 | DZY Loves Fibonacci Numbers | data structures math number theory | Statement | C | Codeforces Round #FF (Div. 1) {446} | PROGRAMMING | Codeforces Round #FF(255) Editorial | 2600 | |
| 420 | DZY Loves Games | math matrices probabilities | Statement | D | Codeforces Round #FF (Div. 1) {446} | PROGRAMMING | Codeforces Round #FF(255) Editorial | 2800 | |
| 134 | DZY Loves Bridges | math matrices | Statement | E | Codeforces Round #FF (Div. 1) {446} | PROGRAMMING | 3100 | ||
| 20404 | DZY Loves Strings | greedy implementation | Statement | B | Codeforces Round #FF (Div. 2) {447} | PROGRAMMING | Codeforces Round #FF(255) Editorial | 1000 | |
| 9728 | DZY Loves Hash | implementation | Statement | A | Codeforces Round #FF (Div. 2) {447} | PROGRAMMING | Codeforces Round #FF(255) Editorial | 900 | |
| 16274 | Suffix Structures | implementation strings | Statement | B | Codeforces Round 256 (Div. 2) {448} | PROGRAMMING | Tutorial | 1400 | |
| 8409 | Painting Fence | divide and conquer dp greedy | Statement | C | Codeforces Round 256 (Div. 2) {448} | PROGRAMMING | Tutorial | 1900 | |
| 14485 | Multiplication Table | binary search brute force | Statement | D | Codeforces Round 256 (Div. 2) {448} | PROGRAMMING | Tutorial | 1900 | |
| 1551 | Divisors | brute force dfs and similar implementation number theory | Statement | E | Codeforces Round 256 (Div. 2) {448} | PROGRAMMING | Tutorial | 2500 | |
| 24650 | Rewards | implementation | Statement | A | Codeforces Round 256 (Div. 2) {448} | PROGRAMMING | Tutorial | 900 | |
| 3963 | Jzzhu and Chocolate | greedy math | Statement | A | Codeforces Round 257 (Div. 1) {449} | PROGRAMMING | Codeforces Round #257 Editorial | 1700 | |
| 8870 | Jzzhu and Cities | graphs greedy shortest paths | Statement | B | Codeforces Round 257 (Div. 1) {449} | PROGRAMMING | Codeforces Round #257 Editorial | 2000 | |
| 4676 | Jzzhu and Numbers | bitmasks combinatorics dp | Statement | D | Codeforces Round 257 (Div. 1) {449} | PROGRAMMING | Codeforces Round #257 Editorial | 2400 | |
| 2296 | Jzzhu and Apples | constructive algorithms number theory | Statement | C | Codeforces Round 257 (Div. 1) {449} | PROGRAMMING | Codeforces Round #257 Editorial | 2500 | |
| 289 | Jzzhu and Squares | dp math number theory | Statement | E | Codeforces Round 257 (Div. 1) {449} | PROGRAMMING | Codeforces Round #257 Editorial | 2900 | |
| 35794 | Jzzhu and Children | implementation | Statement | A | Codeforces Round 257 (Div. 2) {450} | PROGRAMMING | Codeforces Round #257 Editorial | 1000 | |
| 26767 | Jzzhu and Sequences | implementation math | Statement | B | Codeforces Round 257 (Div. 2) {450} | PROGRAMMING | Codeforces Round #257 Editorial | 1400 | |
| 67442 | Game With Sticks | implementation | Statement | A | Codeforces Round 258 (Div. 2) {451} | PROGRAMMING | Codeforces Round #258 Editorial | 1000 | |
| 46705 | Sort the Array | implementation sortings | Statement | B | Codeforces Round 258 (Div. 2) {451} | PROGRAMMING | Codeforces Round #258 Editorial | 1300 | |
| 3406 | Predict Outcome of the Game | brute force implementation math | Statement | C | Codeforces Round 258 (Div. 2) {451} | PROGRAMMING | 1700 | ||
| 4811 | Count Good Substrings | math | Statement | D | Codeforces Round 258 (Div. 2) {451} | PROGRAMMING | Codeforces Round #258 Editorial | 2100 | |
| 3754 | Devu and Flowers | bitmasks combinatorics number theory | Statement | E | Codeforces Round 258 (Div. 2) {451} | PROGRAMMING | Codeforces Round #258 Editorial | 2400 | |
| 8073 | Eevee | brute force implementation strings | Statement | A | MemSQL Start[c]UP 2.0 - Round 1 {452} | PROGRAMMING | MemSQL Start[c]UP 2.0 Round 1 and 2 Editorials | 1200 | |
| 2023 | 4-point polyline | brute force constructive algorithms geometry trees | Statement | B | MemSQL Start[c]UP 2.0 - Round 1 {452} | PROGRAMMING | MemSQL Start[c]UP 2.0 Round 1 and 2 Editorials | 1800 | |
| 1531 | Washer, Dryer, Folder | greedy implementation | Statement | D | MemSQL Start[c]UP 2.0 - Round 1 {452} | PROGRAMMING | 1900 | ||
| 1655 | Magic Trick | combinatorics math probabilities | Statement | C | MemSQL Start[c]UP 2.0 - Round 1 {452} | PROGRAMMING | MemSQL Start[c]UP 2.0 Round 1 and 2 Editorials | 2100 | |
| 1073 | Three strings | data structures ds string suffix structures strings | Statement | E | MemSQL Start[c]UP 2.0 - Round 1 {452} | PROGRAMMING | MemSQL Start[c]UP 2.0 Round 1 and 2 Editorials | 2400 | |
| 1562 | Permutation | data structures divide and conquer hashing | Statement | F | MemSQL Start[c]UP 2.0 - Round 1 {452} | PROGRAMMING | MemSQL Start[c]UP 2.0 Round 1 and 2 Editorials | 2600 | |
| 10875 | Little Pony and Expected Maximum | probabilities | Statement | A | Codeforces Round 259 (Div. 1) {453} | PROGRAMMING | Codeforces Round #259 Editorial | 1600 | |
| 4809 | Little Pony and Harmony Chest | bitmasks brute force dp | Statement | B | Codeforces Round 259 (Div. 1) {453} | PROGRAMMING | Codeforces Round #259 Editorial | 2200 | |
| 1667 | Little Pony and Summer Sun Celebration | constructive algorithms dfs and similar graphs | Statement | C | Codeforces Round 259 (Div. 1) {453} | PROGRAMMING | 2800 | ||
| 472 | Little Pony and Elements of Harmony | dp matrices | Statement | D | Codeforces Round 259 (Div. 1) {453} | PROGRAMMING | Codeforces Round #259 Editorial | 2900 | |
| 760 | Little Pony and Lord Tirek | data structures | Statement | E | Codeforces Round 259 (Div. 1) {453} | PROGRAMMING | 3000 | ||
| 18331 | Little Pony and Sort by Shift | implementation | Statement | B | Codeforces Round 259 (Div. 2) {454} | PROGRAMMING | Codeforces Round #259 Editorial | 1300 | |
| 14996 | Little Pony and Crystal Mine | implementation | Statement | A | Codeforces Round 259 (Div. 2) {454} | PROGRAMMING | Codeforces Round #259 Editorial | 800 | |
| 60765 | Boredom | dp | Statement | A | Codeforces Round 260 (Div. 1) {455} | PROGRAMMING | Codeforces Round #260 — Editorial | 1600 | |
| 6085 | A Lot of Games | dfs and similar dp games implementation strings trees | Statement | B | Codeforces Round 260 (Div. 1) {455} | PROGRAMMING | Codeforces Round #260 — Editorial | 2100 | |
| 5869 | Civilization | dfs and similar dp ds ternary search trees | Statement | C | Codeforces Round 260 (Div. 1) {455} | PROGRAMMING | Codeforces Round #260 — Editorial | 2200 | |
| 3079 | Serega and Fun | data structures | Statement | D | Codeforces Round 260 (Div. 1) {455} | PROGRAMMING | Codeforces Round #260 — Editorial | 2600 | |
| 697 | Function | data structures | Statement | E | Codeforces Round 260 (Div. 1) {455} | PROGRAMMING | Codeforces Round #260 — Editorial | 2800 | |
| 49604 | Laptops | sortings | Statement | A | Codeforces Round 260 (Div. 2) {456} | PROGRAMMING | Разбор задач | 1200 | |
| 17039 | Fedya and Maths | math number theory | Statement | B | Codeforces Round 260 (Div. 2) {456} | PROGRAMMING | Разбор задач | 1200 | |
| 1285 | Golden System | math meet-in-the-middle | Statement | A | MemSQL Start[c]UP 2.0 - Round 2 {457} | PROGRAMMING | MemSQL Start[c]UP 2.0 Round 1 and 2 Editorials | 1800 | |
| 1141 | Distributed Join | greedy | Statement | B | MemSQL Start[c]UP 2.0 - Round 2 {457} | PROGRAMMING | MemSQL Start[c]UP 2.0 Round 1 and 2 Editorials | 1900 | |
| 890 | Elections | brute force | Statement | C | MemSQL Start[c]UP 2.0 - Round 2 {457} | PROGRAMMING | MemSQL Start[c]UP 2.0 Round 1 and 2 Editorials | 2100 | |
| 282 | Bingo! | combinatorics math probabilities | Statement | D | MemSQL Start[c]UP 2.0 - Round 2 {457} | PROGRAMMING | MemSQL Start[c]UP 2.0 Round 1 and 2 Editorials | 2700 | |
| 109 | An easy problem about trees | dp games greedy trees | Statement | F | MemSQL Start[c]UP 2.0 - Round 2 {457} | PROGRAMMING | MemSQL Start[c]UP 2.0 Round 1 and 2 Editorials | 3000 | |
| 97 | Flow Optimality | constructive algorithms flows math | Statement | E | MemSQL Start[c]UP 2.0 - Round 2 {457} | PROGRAMMING | 3200 | ||
| 33495 | Pashmak and Garden | implementation | Statement | A | Codeforces Round 261 (Div. 2) {459} | PROGRAMMING | Codeforces Round #261 Editorial | 1300 | |
| 41470 | Pashmak and Flowers | combinatorics implementation sortings | Statement | B | Codeforces Round 261 (Div. 2) {459} | PROGRAMMING | Codeforces Round #261 Editorial | 1300 | |
| 10488 | Pashmak and Parmida's problem | data structures divide and conquer sortings | Statement | D | Codeforces Round 261 (Div. 2) {459} | PROGRAMMING | Codeforces Round #261 Editorial | 1800 | |
| 6223 | Pashmak and Buses | combinatorics constructive algorithms math | Statement | C | Codeforces Round 261 (Div. 2) {459} | PROGRAMMING | Codeforces Round #261 Editorial | 1900 | |
| 5585 | Pashmak and Graph | dp sortings | Statement | E | Codeforces Round 261 (Div. 2) {459} | PROGRAMMING | Codeforces Round #261 Editorial | 2100 | |
| 47185 | Vasya and Socks | brute force implementation math | Statement | A | Codeforces Round 262 (Div. 2) {460} | PROGRAMMING | 13465 | 1000 | |
| 12537 | Little Dima and Equation | brute force implementation math number theory | Statement | B | Codeforces Round 262 (Div. 2) {460} | PROGRAMMING | 13465 | 1500 | |
| 6297 | Present | binary search data structures greedy | Statement | C | Codeforces Round 262 (Div. 2) {460} | PROGRAMMING | 13465 | 1900 | |
| 1008 | Little Victor and Set | brute force constructive algorithms math | Statement | D | Codeforces Round 262 (Div. 2) {460} | PROGRAMMING | 13465 | 2500 | |
| 344 | Roland and Rose | brute force geometry math sortings | Statement | E | Codeforces Round 262 (Div. 2) {460} | PROGRAMMING | 13465 | 2700 | |
| 15610 | Appleman and Toastman | greedy sortings | Statement | A | Codeforces Round 263 (Div. 1) {461} | PROGRAMMING | Tutorial | 1200 | |
| 5900 | Appleman and Tree | dfs and similar dp trees | Statement | B | Codeforces Round 263 (Div. 1) {461} | PROGRAMMING | Tutorial | 2200 | |
| 1339 | Appleman and a Sheet of Paper | data structures implementation | Statement | C | Codeforces Round 263 (Div. 1) {461} | PROGRAMMING | Tutorial | 2500 | |
| 377 | Appleman and Complicated Task | ds math | Statement | D | Codeforces Round 263 (Div. 1) {461} | PROGRAMMING | Tutorial | 2700 | |
| 455 | Appleman and a Game | binary search shortest paths strings | Statement | E | Codeforces Round 263 (Div. 1) {461} | PROGRAMMING | Tutorial | 3000 | |
| 17044 | Appleman and Easy Task | brute force implementation | Statement | A | Codeforces Round 263 (Div. 2) {462} | PROGRAMMING | Tutorial | 1100 | |
| 14670 | Appleman and Card Game | greedy | Statement | B | Codeforces Round 263 (Div. 2) {462} | PROGRAMMING | Tutorial | 1300 | |
| 27851 | Caisa and Pylons | brute force implementation math | Statement | B | Codeforces Round 264 (Div. 2) {463} | PROGRAMMING | CF 264 Div 2 Tutorial | 1200 | |
| 9301 | Caisa and Sugar | brute force implementation | Statement | A | Codeforces Round 264 (Div. 2) {463} | PROGRAMMING | CF 264 Div 2 Tutorial | 1300 | |
| 8813 | Gargari and Bishops | greedy hashing implementation | Statement | C | Codeforces Round 264 (Div. 2) {463} | PROGRAMMING | CF 264 Div 2 Tutorial | 1800 | |
| 6639 | Gargari and Permutations | dfs and similar dp graphs implementation | Statement | D | Codeforces Round 264 (Div. 2) {463} | PROGRAMMING | CF 264 Div 2 Tutorial | 2000 | |
| 1630 | Caisa and Tree | brute force dfs and similar math number theory trees | Statement | E | Codeforces Round 264 (Div. 2) {463} | PROGRAMMING | CF 264 Div 2 Tutorial | 2400 |