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 ... 13 14 15 16 17 ... 100 101 102 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 11327 | Sereja and Bottles | brute force | Statement | A | Codeforces Round 187 (Div. 2) {315} | PROGRAMMING | Codeforces Round #187 tutorial | 1400 | |
| 2697 | Special Task | greedy | Statement | A1 | ABBYY Cup 3.0 {316} | PROGRAMMING | ABBYY Cup 3.0. Solutions | 1100 | |
| 2163 | Special Task | math | Statement | A2 | ABBYY Cup 3.0 {316} | PROGRAMMING | ABBYY Cup 3.0. Solutions | 1400 | |
| 1489 | Summer Homework | brute force data structures | Statement | E1 | ABBYY Cup 3.0 {316} | PROGRAMMING | ABBYY Cup 3.0. Solutions | 1500 | |
| 1603 | EKG | dfs and similar dp | Statement | B2 | ABBYY Cup 3.0 {316} | PROGRAMMING | ABBYY Cup 3.0. Solutions | 1600 | |
| 1391 | EKG | brute force dfs and similar | Statement | B1 | ABBYY Cup 3.0 {316} | PROGRAMMING | ABBYY Cup 3.0. Solutions | 1600 | |
| 979 | Good Substrings | hashing strings | Statement | G1 | ABBYY Cup 3.0 {316} | PROGRAMMING | 1700 | ||
| 561 | Tidying Up | flows | Statement | C1 | ABBYY Cup 3.0 {316} | PROGRAMMING | 2200 | ||
| 477 | Good Substrings | string suffix structures | Statement | G2 | ABBYY Cup 3.0 {316} | PROGRAMMING | 2200 | ||
| 637 | Tidying Up | flows graph matchings | Statement | C2 | ABBYY Cup 3.0 {316} | PROGRAMMING | 2300 | ||
| 464 | PE Lesson | dp | Statement | D2 | ABBYY Cup 3.0 {316} | PROGRAMMING | ABBYY Cup 3.0. Solutions | 2300 | |
| 535 | PE Lesson | brute force dp | Statement | D1 | ABBYY Cup 3.0 {316} | PROGRAMMING | ABBYY Cup 3.0. Solutions | 2300 | |
| 401 | Summer Homework | data structures math | Statement | E2 | ABBYY Cup 3.0 {316} | PROGRAMMING | ABBYY Cup 3.0. Solutions | 2400 | |
| 611 | PE Lesson | dp math | Statement | D3 | ABBYY Cup 3.0 {316} | PROGRAMMING | ABBYY Cup 3.0. Solutions | 2400 | |
| 167 | Suns and Rays | Statement | F2 | ABBYY Cup 3.0 {316} | PROGRAMMING | ABBYY Cup 3.0. Solutions | 2500 | ||
| 181 | Suns and Rays | dfs and similar implementation | Statement | F1 | ABBYY Cup 3.0 {316} | PROGRAMMING | ABBYY Cup 3.0. Solutions | 2500 | |
| 535 | Summer Homework | data structures math | Statement | E3 | ABBYY Cup 3.0 {316} | PROGRAMMING | ABBYY Cup 3.0. Solutions | 2500 | |
| 183 | Suns and Rays | constructive algorithms dfs and similar implementation | Statement | F3 | ABBYY Cup 3.0 {316} | PROGRAMMING | ABBYY Cup 3.0. Solutions | 2600 | |
| 503 | Good Substrings | string suffix structures | Statement | G3 | ABBYY Cup 3.0 {316} | PROGRAMMING | 2800 | ||
| 4701 | Perfect Pair | brute force | Statement | A | Codeforces Round 188 (Div. 1) {317} | PROGRAMMING | Analysis | 1600 | |
| 1609 | Ants | brute force implementation | Statement | B | Codeforces Round 188 (Div. 1) {317} | PROGRAMMING | Analysis | 2000 | |
| 1094 | Game with Powers | dp games | Statement | D | Codeforces Round 188 (Div. 1) {317} | PROGRAMMING | Analysis | 2200 | |
| 511 | Balance | constructive algorithms dfs and similar graphs trees | Statement | C | Codeforces Round 188 (Div. 1) {317} | PROGRAMMING | Analysis | 2700 | |
| 157 | Princess and Her Shadow | constructive algorithms shortest paths | Statement | E | Codeforces Round 188 (Div. 1) {317} | PROGRAMMING | 3200 | ||
| 119027 | Even Odds | math | Statement | A | Codeforces Round 188 (Div. 2) {318} | PROGRAMMING | 7956 | 1000 | |
| 7757 | Strings of Power | implementation strings two pointers | Statement | B | Codeforces Round 188 (Div. 2) {318} | PROGRAMMING | 7956 | 1300 | |
| 2848 | Malek Dance Club | combinatorics math | Statement | A | Codeforces Round 189 (Div. 1) {319} | PROGRAMMING | Codeforces Round #189 — Editorial | 1700 | |
| 4264 | Psychos in a Line | data structures implementation | Statement | B | Codeforces Round 189 (Div. 1) {319} | PROGRAMMING | Codeforces Round #189 — Editorial | 2000 | |
| 5381 | Kalila and Dimna in the Logging Industry | dp geometry | Statement | C | Codeforces Round 189 (Div. 1) {319} | PROGRAMMING | 2400 | ||
| 676 | Have You Ever Heard About the Word? | greedy hashing string suffix structures strings | Statement | D | Codeforces Round 189 (Div. 1) {319} | PROGRAMMING | Codeforces Round #189 — Editorial | 2700 | |
| 668 | Ping-Pong | data structures | Statement | E | Codeforces Round 189 (Div. 1) {319} | PROGRAMMING | Codeforces Round #189 — Editorial | 3000 | |
| 39812 | Magic Numbers | brute force greedy | Statement | A | Codeforces Round 189 (Div. 2) {320} | PROGRAMMING | Codeforces Round #189 — Editorial | 1000 | |
| 7325 | Ping-Pong (Easy Version) | dfs and similar graphs | Statement | B | Codeforces Round 189 (Div. 2) {320} | PROGRAMMING | Codeforces Round #189 — Editorial | 1500 | |
| 3660 | Ciel and Robot | binary search implementation math | Statement | A | Codeforces Round 190 (Div. 1) {321} | PROGRAMMING | Codeforces Round #190 — Editorial | 1700 | |
| 3212 | Ciel and Duel | dp flows greedy | Statement | B | Codeforces Round 190 (Div. 1) {321} | PROGRAMMING | 2000 | ||
| 7587 | Ciel the Commander | constructive algorithms dfs and similar divide and conquer greedy trees | Statement | C | Codeforces Round 190 (Div. 1) {321} | PROGRAMMING | Codeforces Round #190 — Editorial | 2500 | |
| 5199 | Ciel and Gondolas | data structures divide and conquer dp | Statement | E | Codeforces Round 190 (Div. 1) {321} | PROGRAMMING | 2600 | ||
| 553 | Ciel and Flipboard | dp greedy math | Statement | D | Codeforces Round 190 (Div. 1) {321} | PROGRAMMING | Codeforces Round #190 — Editorial | 2900 | |
| 8281 | Ciel and Dancing | greedy | Statement | A | Codeforces Round 190 (Div. 2) {322} | PROGRAMMING | Codeforces Round #190 — Editorial | 1100 | |
| 11968 | Ciel and Flowers | combinatorics math | Statement | B | Codeforces Round 190 (Div. 2) {322} | PROGRAMMING | Codeforces Round #190 — Editorial | 1600 | |
| 796 | Black-and-White Cube | combinatorics constructive algorithms | Statement | A | Testing Round 7 {323} | PROGRAMMING | 1600 | ||
| 407 | Tournament-graph | constructive algorithms graphs | Statement | B | Testing Round 7 {323} | PROGRAMMING | 2000 | ||
| 616 | Two permutations | data structures | Statement | C | Testing Round 7 {323} | PROGRAMMING | 2200 | ||
| 2169 | Square and Rectangles | implementation | Statement | A | MemSQL start[c]up Round 1 {325} | PROGRAMMING | Editorial | 1500 | |
| 1583 | Stadium and Games | binary search math | Statement | B | MemSQL start[c]up Round 1 {325} | PROGRAMMING | Editorial | 1800 | |
| 351 | Monsters and Diamonds | dfs and similar graphs shortest paths | Statement | C | MemSQL start[c]up Round 1 {325} | PROGRAMMING | 2500 | ||
| 842 | The Red Button | combinatorics dfs and similar ds graphs greedy | Statement | E | MemSQL start[c]up Round 1 {325} | PROGRAMMING | Editorial | 2700 | |
| 544 | Reclamation | ds | Statement | D | MemSQL start[c]up Round 1 {325} | PROGRAMMING | 2800 | ||
| 43132 | Flipping Game | brute force dp implementation | Statement | A | Codeforces Round 191 (Div. 2) {327} | PROGRAMMING | fegh | 1200 | |
| 20055 | Hungry Sequence | math | Statement | B | Codeforces Round 191 (Div. 2) {327} | PROGRAMMING | fegh | 1300 | |
| 3253 | Magic Five | combinatorics math | Statement | C | Codeforces Round 191 (Div. 2) {327} | PROGRAMMING | fegh | 1700 | |
| 2325 | Block Tower | constructive algorithms dfs and similar graphs | Statement | D | Codeforces Round 191 (Div. 2) {327} | PROGRAMMING | 2000 | ||
| 1434 | Axis Walking | bitmasks combinatorics constructive algorithms dp meet-in-the-middle | Statement | E | Codeforces Round 191 (Div. 2) {327} | PROGRAMMING | 2500 | ||
| 1383 | Sheldon and Ice Pieces | greedy | Statement | B | Testing Round 8 {328} | PROGRAMMING | 1500 | ||
| 2138 | IQ Test | implementation | Statement | A | Testing Round 8 {328} | PROGRAMMING | 1800 | ||
| 4666 | Purification | constructive algorithms greedy | Statement | A | Codeforces Round 192 (Div. 1) {329} | PROGRAMMING | 1500 | ||
| 6588 | Biridian Forest | dfs and similar shortest paths | Statement | B | Codeforces Round 192 (Div. 1) {329} | PROGRAMMING | 1700 | ||
| 410 | The Evil Temple and the Moving Rocks | constructive algorithms | Statement | D | Codeforces Round 192 (Div. 1) {329} | PROGRAMMING | 2400 | ||
| 924 | Graph Reconstruction | constructive algorithms | Statement | C | Codeforces Round 192 (Div. 1) {329} | PROGRAMMING | Codeforces Round #192 Editorial | 2600 | |
| 169 | Evil | math | Statement | E | Codeforces Round 192 (Div. 1) {329} | PROGRAMMING | Codeforces Round #192 Editorial | 3100 | |
| 17450 | Road Construction | constructive algorithms graphs | Statement | B | Codeforces Round 192 (Div. 2) {330} | PROGRAMMING | Codeforces Round #192 Editorial | 1300 | |
| 29117 | Cakeminator | brute force implementation | Statement | A | Codeforces Round 192 (Div. 2) {330} | PROGRAMMING | Codeforces Round #192 Editorial | 900 | |
| 6321 | The Great Julya Calendar | dp | Statement | C1 | ABBYY Cup 3.0 - Finals (online version) {331} | PROGRAMMING | ABBYY Cup 3.0 — Finals. Solutions | 1200 | |
| 1401 | Oh Sweet Beaverette | brute force implementation | Statement | A1 | ABBYY Cup 3.0 - Finals (online version) {331} | PROGRAMMING | ABBYY Cup 3.0 — Finals. Solutions | 1400 | |
| 1437 | Oh Sweet Beaverette | data structures sortings | Statement | A2 | ABBYY Cup 3.0 - Finals (online version) {331} | PROGRAMMING | ABBYY Cup 3.0 — Finals. Solutions | 1600 | |
| 757 | Shave Beaver! | implementation | Statement | B1 | ABBYY Cup 3.0 - Finals (online version) {331} | PROGRAMMING | 1700 | ||
| 743 | Shave Beaver! | data structures | Statement | B2 | ABBYY Cup 3.0 - Finals (online version) {331} | PROGRAMMING | 1900 | ||
| 206 | Escaping on Beaveractor | dfs and similar implementation | Statement | D1 | ABBYY Cup 3.0 - Finals (online version) {331} | PROGRAMMING | 2300 | ||
| 396 | The Great Julya Calendar | dp | Statement | C2 | ABBYY Cup 3.0 - Finals (online version) {331} | PROGRAMMING | ABBYY Cup 3.0 — Finals. Solutions | 2400 | |
| 506 | The Great Julya Calendar | dp | Statement | C3 | ABBYY Cup 3.0 - Finals (online version) {331} | PROGRAMMING | ABBYY Cup 3.0 — Finals. Solutions | 2500 | |
| 136 | Escaping on Beaveractor | graphs | Statement | D2 | ABBYY Cup 3.0 - Finals (online version) {331} | PROGRAMMING | 2600 | ||
| 179 | Escaping on Beaveractor | data structures implementation trees | Statement | D3 | ABBYY Cup 3.0 - Finals (online version) {331} | PROGRAMMING | 2900 | ||
| 218 | Deja Vu | constructive algorithms dp | Statement | E2 | ABBYY Cup 3.0 - Finals (online version) {331} | PROGRAMMING | 3000 | ||
| 165 | Deja Vu | constructive algorithms graphs implementation | Statement | E1 | ABBYY Cup 3.0 - Finals (online version) {331} | PROGRAMMING | 3000 | ||
| 3596 | Down the Hatch! | implementation | Statement | A | Codeforces Round 193 (Div. 2) {332} | PROGRAMMING | 1300 | ||
| 8123 | Maximum Absurdity | data structures dp implementation | Statement | B | Codeforces Round 193 (Div. 2) {332} | PROGRAMMING | 1500 | ||
| 937 | Students' Revenge | data structures greedy sortings | Statement | C | Codeforces Round 193 (Div. 2) {332} | PROGRAMMING | 2200 | ||
| 388 | Theft of Blueprints | graphs math | Statement | D | Codeforces Round 193 (Div. 2) {332} | PROGRAMMING | 2400 | ||
| 308 | Binary Key | dp greedy implementation | Statement | E | Codeforces Round 193 (Div. 2) {332} | PROGRAMMING | 2600 | ||
| 4073 | Secrets | greedy | Statement | A | Codeforces Round 194 (Div. 1) {333} | PROGRAMMING | 1500 | ||
| 2660 | Chips | greedy | Statement | B | Codeforces Round 194 (Div. 1) {333} | PROGRAMMING | Codeforces Round 194 — Editoral | 1800 | |
| 2133 | Characteristics of Rectangles | binary search bitmasks brute force implementation sortings | Statement | D | Codeforces Round 194 (Div. 1) {333} | PROGRAMMING | Codeforces Round 194 — Editoral | 2100 | |
| 1158 | Summer Earnings | binary search bitmasks brute force geometry sortings | Statement | E | Codeforces Round 194 (Div. 1) {333} | PROGRAMMING | Codeforces Round 194 — Editoral | 2400 | |
| 392 | Lucky Tickets | brute force constructive algorithms | Statement | C | Codeforces Round 194 (Div. 1) {333} | PROGRAMMING | 2800 | ||
| 18896 | Candy Bags | implementation | Statement | A | Codeforces Round 194 (Div. 2) {334} | PROGRAMMING | Codeforces Round 194 — Editoral | 1000 | |
| 3627 | Eight Point Sets | sortings | Statement | B | Codeforces Round 194 (Div. 2) {334} | PROGRAMMING | Codeforces Round 194 — Editoral | 1500 | |
| 2634 | Banana | binary search constructive algorithms greedy | Statement | A | MemSQL start[c]up Round 2 - online version {335} | PROGRAMMING | MemSQL start[c]up Round 2 -- Editorial | 1500 | |
| 2119 | Palindrome | constructive algorithms dp | Statement | B | MemSQL start[c]up Round 2 - online version {335} | PROGRAMMING | MemSQL start[c]up Round 2 -- Editorial | 1900 | |
| 542 | More Reclamation | games | Statement | C | MemSQL start[c]up Round 2 - online version {335} | PROGRAMMING | 2100 | ||
| 332 | Rectangles and Square | brute force dp | Statement | D | MemSQL start[c]up Round 2 - online version {335} | PROGRAMMING | 2400 | ||
| 226 | Counting Skyscrapers | dp math probabilities | Statement | E | MemSQL start[c]up Round 2 - online version {335} | PROGRAMMING | 2900 | ||
| 635 | Buy One, Get One Free | dp greedy | Statement | F | MemSQL start[c]up Round 2 - online version {335} | PROGRAMMING | MemSQL start[c]up Round 2 -- Editorial | 2900 | |
| 10202 | Vasily the Bear and Triangle | implementation math | Statement | A | Codeforces Round 195 (Div. 2) {336} | PROGRAMMING | Tutorial Codeforces Round #195 (Div. 2) | 1100 | |
| 2509 | Vasily the Bear and Sequence | brute force greedy implementation number theory | Statement | C | Codeforces Round 195 (Div. 2) {336} | PROGRAMMING | 1800 | ||
| 1257 | Vasily the Bear and Fly | math | Statement | B | Codeforces Round 195 (Div. 2) {336} | PROGRAMMING | Tutorial Codeforces Round #195 (Div. 2) | 1900 | |
| 1043 | Vasily the Bear and Beautiful Strings | combinatorics math number theory | Statement | D | Codeforces Round 195 (Div. 2) {336} | PROGRAMMING | Tutorial Codeforces Round #195 (Div. 2) | 2400 | |
| 116 | Vasily the Bear and Painting Square | bitmasks combinatorics dp implementation | Statement | E | Codeforces Round 195 (Div. 2) {336} | PROGRAMMING | 2600 | ||
| 82175 | Puzzles | greedy | Statement | A | Codeforces Round 196 (Div. 2) {337} | PROGRAMMING | Codeforces Round #196 — Problems Analysis | 1000 | |
| 9452 | Routine Problem | greedy math number theory | Statement | B | Codeforces Round 196 (Div. 2) {337} | PROGRAMMING | Codeforces Round #196 — Problems Analysis | 1400 | |
| 4988 | Quiz | binary search greedy math matrices number theory | Statement | C | Codeforces Round 196 (Div. 2) {337} | PROGRAMMING | 1700 |