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 ... 7 8 9 10 11 ... 100 101 102 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 2602 | Broken checker | *special brute force | Statement | D | April Fools Day Contest {171} | PROGRAMMING | April Fools Day Contest: editorial | 1400 | |
| 1301 | ucyhf | *special brute force implementation number theory | Statement | F | April Fools Day Contest {171} | PROGRAMMING | April Fools Day Contest: editorial | 1700 | |
| 946 | Mysterious numbers - 2 | *special | Statement | G | April Fools Day Contest {171} | PROGRAMMING | April Fools Day Contest: editorial | 2000 | |
| 1481 | MYSTERIOUS LANGUAGE | *special | Statement | E | April Fools Day Contest {171} | PROGRAMMING | April Fools Day Contest: editorial | 2000 | |
| 1103 | A Piece of Cake | *special implementation | Statement | C | April Fools Day Contest {171} | PROGRAMMING | April Fools Day Contest: editorial | 2100 | |
| 286 | A polyline | *special implementation | Statement | H | April Fools Day Contest {171} | PROGRAMMING | April Fools Day Contest: editorial | 2200 | |
| 6385 | Phone Code | *special brute force implementation | Statement | A | Croc Champ 2012 - Qualification Round {172} | PROGRAMMING | 1600 | ||
| 2799 | Pseudorandom Sequence Period | *special implementation number theory | Statement | B | Croc Champ 2012 - Qualification Round {172} | PROGRAMMING | 1800 | ||
| 1407 | Calendar Reform | *special number theory | Statement | D | Croc Champ 2012 - Qualification Round {172} | PROGRAMMING | 1900 | ||
| 1151 | Bus | *special implementation sortings | Statement | C | Croc Champ 2012 - Qualification Round {172} | PROGRAMMING | 1900 | ||
| 273 | BHTML+BCSS | *special dfs and similar expression parsing | Statement | E | Croc Champ 2012 - Qualification Round {172} | PROGRAMMING | 2500 | ||
| 2336 | Rock-Paper-Scissors | implementation math | Statement | A | Croc Champ 2012 - Round 1 {173} | PROGRAMMING | 1300 | ||
| 1004 | Spiral Maximum | brute force dp | Statement | C | Croc Champ 2012 - Round 1 {173} | PROGRAMMING | Croc Champ 2012 — Round 1 — Editorial | 1800 | |
| 3284 | Chamber of Secrets | dfs and similar shortest paths | Statement | B | Croc Champ 2012 - Round 1 {173} | PROGRAMMING | 1800 | ||
| 255 | Deputies | constructive algorithms graphs greedy implementation | Statement | D | Croc Champ 2012 - Round 1 {173} | PROGRAMMING | 2400 | ||
| 576 | Camping Groups | data structures sortings | Statement | E | Croc Champ 2012 - Round 1 {173} | PROGRAMMING | 2600 | ||
| 2998 | Problem About Equation | math | Statement | A | VK Cup 2012 Round 3 (Unofficial Div. 2 Edition) {174} | PROGRAMMING | VK Cup 2012 Round 3 — Разбор | 1200 | |
| 2309 | File List | dp greedy implementation | Statement | B | VK Cup 2012 Round 3 (Unofficial Div. 2 Edition) {174} | PROGRAMMING | VK Cup 2012 Round 3 — Разбор | 1500 | |
| 1164 | Range Increments | data structures greedy | Statement | C | VK Cup 2012 Round 3 (Unofficial Div. 2 Edition) {174} | PROGRAMMING | VK Cup 2012 Round 3 — Разбор | 1800 | |
| 2427 | Robot Bicorn Attack | brute force implementation | Statement | A | Codeforces Round 115 {175} | PROGRAMMING | Codeforces Round #115 — editorial F | 1400 | |
| 1438 | Plane of Tanks: Pro | implementation | Statement | B | Codeforces Round 115 {175} | PROGRAMMING | 1400 | ||
| 1339 | Geometry Horse | greedy implementation sortings two pointers | Statement | C | Codeforces Round 115 {175} | PROGRAMMING | 1600 | ||
| 301 | Plane of Tanks: Duel | brute force dp math probabilities | Statement | D | Codeforces Round 115 {175} | PROGRAMMING | 2400 | ||
| 267 | Power Defence | brute force dp geometry greedy | Statement | E | Codeforces Round 115 {175} | PROGRAMMING | 2500 | ||
| 66 | Gnomes of Might and Magic | data structures graphs implementation shortest paths | Statement | F | Codeforces Round 115 {175} | PROGRAMMING | 3000 | ||
| 1527 | Trading Business | greedy sortings | Statement | A | Croc Champ 2012 - Round 2 {176} | PROGRAMMING | 1500 | ||
| 1895 | Word Cut | dp | Statement | B | Croc Champ 2012 - Round 2 {176} | PROGRAMMING | Croc Champ 2012 — Round 2 — Editorial | 1900 | |
| 488 | Playing with Superglue | combinatorics constructive algorithms | Statement | C | Croc Champ 2012 - Round 2 {176} | PROGRAMMING | 2000 | ||
| 328 | Hyper String | dp | Statement | D | Croc Champ 2012 - Round 2 {176} | PROGRAMMING | 2500 | ||
| 1232 | Archaeology | data structures dfs and similar trees | Statement | E | Croc Champ 2012 - Round 2 {176} | PROGRAMMING | 3000 | ||
| 4352 | Rectangular Game | number theory | Statement | B1 | ABBYY Cup 2.0 - Easy {177} | PROGRAMMING | 1000 | ||
| 3090 | Rectangular Game | number theory | Statement | B2 | ABBYY Cup 2.0 - Easy {177} | PROGRAMMING | 1200 | ||
| 2250 | Encrypting Messages | brute force | Statement | D1 | ABBYY Cup 2.0 - Easy {177} | PROGRAMMING | 1200 | ||
| 2625 | Party | brute force dfs and similar ds graphs | Statement | C2 | ABBYY Cup 2.0 - Easy {177} | PROGRAMMING | 1500 | ||
| 2625 | Party | dfs and similar ds graphs | Statement | C1 | ABBYY Cup 2.0 - Easy {177} | PROGRAMMING | 1500 | ||
| 2077 | Encrypting Messages | data structures | Statement | D2 | ABBYY Cup 2.0 - Easy {177} | PROGRAMMING | 1500 | ||
| 630 | Space Voyage | binary search | Statement | E1 | ABBYY Cup 2.0 - Easy {177} | PROGRAMMING | 1700 | ||
| 306 | Script Generation | Statement | F1 | ABBYY Cup 2.0 - Easy {177} | PROGRAMMING | 1800 | |||
| 439 | Space Voyage | binary search | Statement | E2 | ABBYY Cup 2.0 - Easy {177} | PROGRAMMING | 1900 | ||
| 211 | Script Generation | Statement | F2 | ABBYY Cup 2.0 - Easy {177} | PROGRAMMING | 2300 | |||
| 192 | Fibonacci Strings | strings | Statement | G1 | ABBYY Cup 2.0 - Easy {177} | PROGRAMMING | 2300 | ||
| 207 | Fibonacci Strings | matrices strings | Statement | G2 | ABBYY Cup 2.0 - Easy {177} | PROGRAMMING | 2400 | ||
| 7482 | Good Matrix Elements | implementation | Statement | A2 | ABBYY Cup 2.0 - Easy {177} | PROGRAMMING | 700 | ||
| 9090 | Good Matrix Elements | implementation | Statement | A1 | ABBYY Cup 2.0 - Easy {177} | PROGRAMMING | 700 | ||
| 1666 | Educational Game | greedy | Statement | A2 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | 1000 | ||
| 1648 | Educational Game | Statement | A1 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | 1000 | |||
| 1467 | Educational Game | greedy | Statement | A3 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | 1200 | ||
| 654 | Magic Squares | Statement | D1 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | ABBYY Cup 2.0 — Hard: solutions | 1500 | ||
| 497 | Smart Beaver and Resolving Collisions | Statement | C1 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | 1600 | |||
| 773 | Greedy Merchants | Statement | B1 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | 1600 | |||
| 685 | Greedy Merchants | Statement | B2 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | 1700 | |||
| 1262 | Greedy Merchants | Statement | B3 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | 1900 | |||
| 328 | Smart Beaver and Resolving Collisions | Statement | C3 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | 2000 | |||
| 310 | Smart Beaver and Resolving Collisions | Statement | C2 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | 2000 | |||
| 293 | The Beaver's Problem - 2 | Statement | E1 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | 2100 | |||
| 411 | Representative Sampling | Statement | F1 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | 2100 | |||
| 234 | The Beaver's Problem - 2 | Statement | E2 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | 2200 | |||
| 251 | Magic Squares | Statement | D3 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | ABBYY Cup 2.0 — Hard: solutions | 2200 | ||
| 274 | Magic Squares | Statement | D2 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | ABBYY Cup 2.0 — Hard: solutions | 2200 | ||
| 203 | The Beaver's Problem - 2 | Statement | E3 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | 2400 | |||
| 357 | Representative Sampling | dp sortings strings | Statement | F2 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | 2400 | ||
| 440 | Representative Sampling | Statement | F3 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | 2600 | |||
| 2556 | Mathematical Analysis Rocks! | constructive algorithms implementation math | Statement | F | Codeforces Round 116 (Div. 2, ACM-ICPC Rules) {180} | PROGRAMMING | 1300 | ||
| 7595 | Letter | dp | Statement | C | Codeforces Round 116 (Div. 2, ACM-ICPC Rules) {180} | PROGRAMMING | 1400 | ||
| 1829 | Cubes | binary search dp two pointers | Statement | E | Codeforces Round 116 (Div. 2, ACM-ICPC Rules) {180} | PROGRAMMING | 1700 | ||
| 553 | Defragmentation | implementation | Statement | A | Codeforces Round 116 (Div. 2, ACM-ICPC Rules) {180} | PROGRAMMING | 1800 | ||
| 737 | Name | greedy strings | Statement | D | Codeforces Round 116 (Div. 2, ACM-ICPC Rules) {180} | PROGRAMMING | 2000 | ||
| 356 | Divisibility Rules | math number theory | Statement | B | Codeforces Round 116 (Div. 2, ACM-ICPC Rules) {180} | PROGRAMMING | 2300 | ||
| 3082 | Number of Triplets | binary search brute force | Statement | B | Croc Champ 2012 - Round 2 (Unofficial Div. 2 Edition) {181} | PROGRAMMING | Croc Champ 2012 — Round 2 — Editorial | 1300 | |
| 7425 | Series of Crimes | brute force geometry implementation | Statement | A | Croc Champ 2012 - Round 2 (Unofficial Div. 2 Edition) {181} | PROGRAMMING | Croc Champ 2012 — Round 2 — Editorial | 800 | |
| 6990 | Vasya's Calendar | implementation | Statement | B | Codeforces Round 117 (Div. 2) {182} | PROGRAMMING | 1000 | ||
| 8194 | Common Divisors | brute force hashing implementation math strings | Statement | D | Codeforces Round 117 (Div. 2) {182} | PROGRAMMING | Codeforces Round #117 (Div. 2) Разбор Задач | 1400 | |
| 1490 | Wooden Fence | dp | Statement | E | Codeforces Round 117 (Div. 2) {182} | PROGRAMMING | 1800 | ||
| 751 | Optimal Sum | data structures greedy | Statement | C | Codeforces Round 117 (Div. 2) {182} | PROGRAMMING | Codeforces Round #117 (Div. 2) Разбор Задач | 2300 | |
| 292 | Battlefield | geometry graphs implementation shortest paths | Statement | A | Codeforces Round 117 (Div. 2) {182} | PROGRAMMING | 2300 | ||
| 703 | Zoo | brute force geometry | Statement | B | Croc Champ 2012 - Final {183} | PROGRAMMING | 1700 | ||
| 562 | Headquarters | constructive algorithms math | Statement | A | Croc Champ 2012 - Final {183} | PROGRAMMING | 1900 | ||
| 648 | Cyclic Coloring | dfs and similar | Statement | C | Croc Champ 2012 - Final {183} | PROGRAMMING | 2200 | ||
| 140 | Candy Shop | greedy | Statement | E | Croc Champ 2012 - Final {183} | PROGRAMMING | 2700 | ||
| 409 | T-shirt | dp greedy probabilities | Statement | D | Croc Champ 2012 - Final {183} | PROGRAMMING | 2800 | ||
| 6001 | Plant | math | Statement | A | Codeforces Round 118 (Div. 1) {185} | PROGRAMMING | Tutorial | 1300 | |
| 1680 | Mushroom Scientists | math ternary search | Statement | B | Codeforces Round 118 (Div. 1) {185} | PROGRAMMING | 1900 | ||
| 140 | Clever Fat Rat | dp | Statement | C | Codeforces Round 118 (Div. 1) {185} | PROGRAMMING | 2300 | ||
| 452 | Visit of the Great | math number theory | Statement | D | Codeforces Round 118 (Div. 1) {185} | PROGRAMMING | 2600 | ||
| 146 | Soap Time! - 2 | binary search data structures | Statement | E | Codeforces Round 118 (Div. 1) {185} | PROGRAMMING | 2900 | ||
| 5678 | Growing Mushrooms | greedy sortings | Statement | B | Codeforces Round 118 (Div. 2) {186} | PROGRAMMING | Editorial for Round #118 | 1200 | |
| 17301 | Comparing Strings | implementation strings | Statement | A | Codeforces Round 118 (Div. 2) {186} | PROGRAMMING | Editorial for Round #118 | 1200 | |
| 2860 | Permutations | greedy | Statement | A | Codeforces Round 119 (Div. 1) {187} | PROGRAMMING | 1600 | ||
| 2008 | AlgoRace | dp shortest paths | Statement | B | Codeforces Round 119 (Div. 1) {187} | PROGRAMMING | 1900 | ||
| 1391 | Weak Memory | dfs and similar ds | Statement | C | Codeforces Round 119 (Div. 1) {187} | PROGRAMMING | 2100 | ||
| 539 | BRT Contract | data structures | Statement | D | Codeforces Round 119 (Div. 1) {187} | PROGRAMMING | 2700 | ||
| 104 | Heaven Tour | data structures greedy | Statement | E | Codeforces Round 119 (Div. 1) {187} | PROGRAMMING | 2800 | ||
| 786 | Hexagonal Numbers | *special | Statement | A | Surprise Language Round 6 {188} | PROGRAMMING | Surprise Language Round #6: editorial | 1200 | |
| 460 | LCM | *special implementation math | Statement | C | Surprise Language Round 6 {188} | PROGRAMMING | Surprise Language Round #6: editorial | 1400 | |
| 687 | Asterisks | *special implementation | Statement | D | Surprise Language Round 6 {188} | PROGRAMMING | Surprise Language Round #6: editorial | 1400 | |
| 744 | A + Reverse B | *special implementation | Statement | B | Surprise Language Round 6 {188} | PROGRAMMING | Surprise Language Round #6: editorial | 1400 | |
| 506 | HQ9+ | *special implementation | Statement | E | Surprise Language Round 6 {188} | PROGRAMMING | Surprise Language Round #6: editorial | 1500 | |
| 307 | Binary Notation | *special implementation | Statement | F | Surprise Language Round 6 {188} | PROGRAMMING | Surprise Language Round #6: editorial | 1600 | |
| 337 | Array Sorting | *special implementation | Statement | G | Surprise Language Round 6 {188} | PROGRAMMING | Surprise Language Round #6: editorial | 1700 | |
| 268 | Stack | *special expression parsing implementation | Statement | H | Surprise Language Round 6 {188} | PROGRAMMING | Surprise Language Round #6: editorial | 1900 |