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 ... 26 27 28 29 30 ... 100 101 102 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 3809 | Report | data structures sortings | Statement | C | Codeforces Round 344 (Div. 2) {631} | PROGRAMMING | 1700 | ||
| 2101 | Messenger | data structures hashing implementation string suffix structures strings | Statement | D | Codeforces Round 344 (Div. 2) {631} | PROGRAMMING | 2100 | ||
| 2480 | Product Sum | data structures dp geometry | Statement | E | Codeforces Round 344 (Div. 2) {631} | PROGRAMMING | Editorial Codeforces Round #344 (Div. 2) | 2500 | |
| 4632 | Grandma Laura and Apples | Statement | A | Educational Codeforces Round 9 {632} | PROGRAMMING | 1200 | |||
| 4049 | Alice, Bob, Two Teams | brute force constructive algorithms | Statement | B | Educational Codeforces Round 9 {632} | PROGRAMMING | 43493 | 1400 | |
| 8235 | The Smallest String Concatenation | sortings strings | Statement | C | Educational Codeforces Round 9 {632} | PROGRAMMING | 43493 | 1800 | |
| 3890 | Longest Subsequence | brute force math number theory | Statement | D | Educational Codeforces Round 9 {632} | PROGRAMMING | 43493 | 2200 | |
| 1116 | Magic Matrix | brute force divide and conquer graphs matrices trees | Statement | F | Educational Codeforces Round 9 {632} | PROGRAMMING | 43493 | 2400 | |
| 2887 | Thief in a Shop | divide and conquer dp fft math | Statement | E | Educational Codeforces Round 9 {632} | PROGRAMMING | 43493 | 2500 | |
| 13027 | Ebony and Ivory | brute force math number theory | Statement | A | Manthan, Codefest 16 {633} | PROGRAMMING | Manthan, Codefest 16: Editorials | 1200 | |
| 6771 | A Trivial Problem | brute force constructive algorithms math number theory | Statement | B | Manthan, Codefest 16 {633} | PROGRAMMING | Manthan, Codefest 16: Editorials | 1300 | |
| 2821 | Spy Syndrome 2 | data structures dp hashing implementation sortings string suffix structures strings | Statement | C | Manthan, Codefest 16 {633} | PROGRAMMING | Manthan, Codefest 16: Editorials | 1900 | |
| 2833 | Fibonacci-ish | brute force dp hashing implementation math | Statement | D | Manthan, Codefest 16 {633} | PROGRAMMING | Manthan, Codefest 16: Editorials | 2000 | |
| 592 | Startup Funding | binary search constructive algorithms data structures probabilities two pointers | Statement | E | Manthan, Codefest 16 {633} | PROGRAMMING | 2400 | ||
| 1028 | The Chocolate Spree | dfs and similar dp graphs trees | Statement | F | Manthan, Codefest 16 {633} | PROGRAMMING | 2500 | ||
| 798 | Yash And Trees | bitmasks data structures dfs and similar math number theory | Statement | G | Manthan, Codefest 16 {633} | PROGRAMMING | Manthan, Codefest 16: Editorials | 2700 | |
| 604 | Fibonacci-ish II | data structures implementation | Statement | H | Manthan, Codefest 16 {633} | PROGRAMMING | Manthan, Codefest 16: Editorials | 2800 | |
| 3337 | Island Puzzle | constructive algorithms implementation | Statement | A | 8VC Venture Cup 2016 - Final Round (Div. 1 Edition) {634} | PROGRAMMING | 1400 | ||
| 2934 | Orchestra | brute force implementation | Statement | A | 8VC Venture Cup 2016 - Final Round (Div. 2 Edition) {635} | PROGRAMMING | 8VC Venture Cup 2016 — Final Round Editorial | 1200 | |
| 5497 | Voting for Photos | *special constructive algorithms implementation | Statement | A | VK Cup 2016 - Qualification Round 1 {637} | PROGRAMMING | 1500 | ||
| 17644 | Chat Order | *special binary search constructive algorithms data structures sortings | Statement | B | VK Cup 2016 - Qualification Round 1 {637} | PROGRAMMING | 1500 | ||
| 2436 | Promocodes with Mistakes | *special brute force constructive algorithms implementation | Statement | C | VK Cup 2016 - Qualification Round 1 {637} | PROGRAMMING | 1800 | ||
| 2041 | Running with Obstacles | *special data structures dp greedy | Statement | D | VK Cup 2016 - Qualification Round 1 {637} | PROGRAMMING | 2000 | ||
| 4079 | Home Numbers | *special constructive algorithms math | Statement | A | VK Cup 2016 - Qualification Round 2 {638} | PROGRAMMING | 1500 | ||
| 1985 | Making Genome in Berland | *special dfs and similar strings | Statement | B | VK Cup 2016 - Qualification Round 2 {638} | PROGRAMMING | 1800 | ||
| 1724 | Road Improvement | *special dfs and similar graphs greedy trees | Statement | C | VK Cup 2016 - Qualification Round 2 {638} | PROGRAMMING | 2100 | ||
| 727 | Three-dimensional Turtle Super Computer | brute force dfs and similar graphs | Statement | D | VK Cup 2016 - Qualification Round 2 {638} | PROGRAMMING | 2200 | ||
| 6179 | Bear and Displayed Friends | implementation | Statement | A | VK Cup 2016 - Round 1 {639} | PROGRAMMING | 1200 | ||
| 6567 | Bear and Forgotten Tree 3 | constructive algorithms graphs trees | Statement | B | VK Cup 2016 - Round 1 {639} | PROGRAMMING | Tutorial | 1600 | |
| 1220 | Bear and Polynomials | hashing implementation math | Statement | C | VK Cup 2016 - Round 1 {639} | PROGRAMMING | 2200 | ||
| 978 | Bear and Contribution | data structures greedy sortings | Statement | D | VK Cup 2016 - Round 1 {639} | PROGRAMMING | 2500 | ||
| 586 | Bear and Paradox | greedy math sortings | Statement | E | VK Cup 2016 - Round 1 {639} | PROGRAMMING | 2800 | ||
| 430 | Bear and Chemistry | data structures dfs and similar graphs trees | Statement | F | VK Cup 2016 - Round 1 {639} | PROGRAMMING | 3300 | ||
| 5995 | Little Artem and Grasshopper | implementation | Statement | A | VK Cup 2016 - Round 2 {641} | PROGRAMMING | VK Cup 2016 — Раунд 2 (editorial) | 1100 | |
| 4014 | Little Artem and Matrix | implementation | Statement | B | VK Cup 2016 - Round 2 {641} | PROGRAMMING | 1400 | ||
| 3090 | Little Artem and Dance | brute force constructive algorithms implementation | Statement | C | VK Cup 2016 - Round 2 {641} | PROGRAMMING | VK Cup 2016 — Раунд 2 (editorial) | 1800 | |
| 3356 | Little Artem and Time Machine | data structures | Statement | E | VK Cup 2016 - Round 2 {641} | PROGRAMMING | VK Cup 2016 — Раунд 2 (editorial) | 2000 | |
| 1364 | Little Artem and Random Variable | dp implementation math probabilities | Statement | D | VK Cup 2016 - Round 2 {641} | PROGRAMMING | 2300 | ||
| 195 | Little Artem and 2-SAT | Statement | F | VK Cup 2016 - Round 2 {641} | PROGRAMMING | 2900 | |||
| 92 | Little Artem and Graph | Statement | G | VK Cup 2016 - Round 2 {641} | PROGRAMMING | VK Cup 2016 — Раунд 2 (editorial) | 3300 | ||
| 0 | Scheduler for Invokers | *special | Statement | A | VK Cup 2016 - Wild Card Round 2 {642} | PROGRAMMING | 2900 | ||
| 4164 | Bear and Colors | implementation | Statement | A | VK Cup 2016 - Round 3 {643} | PROGRAMMING | VK Cup 2016 — Round 3 — Editorial | 1500 | |
| 3215 | Bear and Two Paths | constructive algorithms graphs | Statement | B | VK Cup 2016 - Round 3 {643} | PROGRAMMING | 1600 | ||
| 1426 | Levels and Regions | dp | Statement | C | VK Cup 2016 - Round 3 {643} | PROGRAMMING | VK Cup 2016 — Round 3 — Editorial | 2500 | |
| 645 | Bear and Destroying Subtrees | dp math probabilities trees | Statement | E | VK Cup 2016 - Round 3 {643} | PROGRAMMING | VK Cup 2016 — Round 3 — Editorial | 2600 | |
| 728 | Bears and Juice | dp math meet-in-the-middle | Statement | F | VK Cup 2016 - Round 3 {643} | PROGRAMMING | 2900 | ||
| 317 | Bearish Fanpages | Statement | D | VK Cup 2016 - Round 3 {643} | PROGRAMMING | 2900 | |||
| 1030 | Choosing Ads | data structures | Statement | G | VK Cup 2016 - Round 3 {643} | PROGRAMMING | VK Cup 2016 — Round 3 — Editorial | 3100 | |
| 4473 | Parliament of Berland | *special constructive algorithms | Statement | A | CROC 2016 - Qualification {644} | PROGRAMMING | 1700 | ||
| 2715 | Processing Queries | *special constructive algorithms data structures two pointers | Statement | B | CROC 2016 - Qualification {644} | PROGRAMMING | 2200 | ||
| 924 | Hostname Aliases | *special binary search data structures implementation sortings strings | Statement | C | CROC 2016 - Qualification {644} | PROGRAMMING | 2300 | ||
| 3593 | Amity Assessment | brute force constructive algorithms implementation | Statement | A | CROC 2016 - Elimination Round {645} | PROGRAMMING | Editorial for CROC 2016 Elimination Round | 1200 | |
| 3431 | Mischievous Mess Makers | greedy math | Statement | B | CROC 2016 - Elimination Round {645} | PROGRAMMING | Editorial for CROC 2016 Elimination Round | 1300 | |
| 3453 | Enduring Exodus | binary search two pointers | Statement | C | CROC 2016 - Elimination Round {645} | PROGRAMMING | 1600 | ||
| 2959 | Robot Rapping Results Report | binary search dp graphs | Statement | D | CROC 2016 - Elimination Round {645} | PROGRAMMING | 1800 | ||
| 1291 | Intellectual Inquiry | dp greedy strings | Statement | E | CROC 2016 - Elimination Round {645} | PROGRAMMING | 2100 | ||
| 811 | Cowslip Collections | combinatorics math number theory | Statement | F | CROC 2016 - Elimination Round {645} | PROGRAMMING | 2500 | ||
| 116 | Armistice Area Apportionment | binary search geometry | Statement | G | CROC 2016 - Elimination Round {645} | PROGRAMMING | 2600 | ||
| 1072 | Путь Робота | dfs and similar graphs | Statement | C | Технокубок 2016 - Отборочный Раунд 1 {648} | PROGRAMMING | 1500.0 | 1100 | |
| 258 | Собачки и миски | greedy sortings | Statement | D | Технокубок 2016 - Отборочный Раунд 1 {648} | PROGRAMMING | 2000.0 | 1900 | |
| 140 | Собери число | Statement | E | Технокубок 2016 - Отборочный Раунд 1 {648} | PROGRAMMING | 2500.0 | 2300 | ||
| 1668 | Собери стол | constructive algorithms sortings | Statement | B | Технокубок 2016 - Отборочный Раунд 1 {648} | PROGRAMMING | 1000.0 | 800 | |
| 777 | Наибольший подъем | constructive algorithms | Statement | A | Технокубок 2016 - Отборочный Раунд 1 {648} | PROGRAMMING | 500.0 | 900 | |
| 1413 | Любимые числа Поликарпа | constructive algorithms | Statement | A | Технокубок 2016 - Отборочный Раунд 2 {649} | PROGRAMMING | 500.0 | 1000 | |
| 561 | Этажи | constructive algorithms | Statement | B | Технокубок 2016 - Отборочный Раунд 2 {649} | PROGRAMMING | 1000.0 | 1400 | |
| 481 | Печать условий | greedy sortings | Statement | C | Технокубок 2016 - Отборочный Раунд 2 {649} | PROGRAMMING | 1500.0 | 1500 | |
| 373 | Дефрагментация памяти | constructive algorithms greedy implementation | Statement | D | Технокубок 2016 - Отборочный Раунд 2 {649} | PROGRAMMING | 2000.0 | 1600 | |
| 111 | Автобус | binary search data structures greedy sortings | Statement | E | Технокубок 2016 - Отборочный Раунд 2 {649} | PROGRAMMING | 2500.0 | 2100 | |
| 15747 | Watchmen | data structures geometry math | Statement | A | Codeforces Round 345 (Div. 1) {650} | PROGRAMMING | Codeforces Round #345: editorial | 1500 | |
| 3371 | Image Preview | binary search brute force dp two pointers | Statement | B | Codeforces Round 345 (Div. 1) {650} | PROGRAMMING | 1900 | ||
| 2039 | Table Compression | dfs and similar dp ds graphs greedy | Statement | C | Codeforces Round 345 (Div. 1) {650} | PROGRAMMING | 2300 | ||
| 1399 | Zip-line | binary search data structures dp hashing | Statement | D | Codeforces Round 345 (Div. 1) {650} | PROGRAMMING | 2600 | ||
| 610 | Clockwork Bomb | data structures dfs and similar ds greedy trees | Statement | E | Codeforces Round 345 (Div. 1) {650} | PROGRAMMING | 3100 | ||
| 23169 | Joysticks | dp greedy implementation math | Statement | A | Codeforces Round 345 (Div. 2) {651} | PROGRAMMING | 1100 | ||
| 11671 | Beautiful Paintings | greedy sortings | Statement | B | Codeforces Round 345 (Div. 2) {651} | PROGRAMMING | 1200 | ||
| 10472 | z-sort | sortings | Statement | B | Educational Codeforces Round 10 {652} | PROGRAMMING | Editorial of Educational Codeforces Round 10 | 1100 | |
| 4806 | Gabriel and Caterpillar | implementation math | Statement | A | Educational Codeforces Round 10 {652} | PROGRAMMING | Editorial of Educational Codeforces Round 10 | 1400 | |
| 3286 | Foe Pairs | combinatorics sortings two pointers | Statement | C | Educational Codeforces Round 10 {652} | PROGRAMMING | 1800 | ||
| 4088 | Nested Segments | data structures sortings | Statement | D | Educational Codeforces Round 10 {652} | PROGRAMMING | Editorial of Educational Codeforces Round 10 | 1900 | |
| 2270 | Pursuit For Artifacts | dfs and similar ds graphs trees | Statement | E | Educational Codeforces Round 10 {652} | PROGRAMMING | 2300 | ||
| 560 | Ants on a Circle | constructive algorithms math | Statement | F | Educational Codeforces Round 10 {652} | PROGRAMMING | Editorial of Educational Codeforces Round 10 | 2800 | |
| 8298 | Bear and Three Balls | brute force implementation sortings | Statement | A | IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2) {653} | PROGRAMMING | IndiaHacks Finals 2016 — Editorial | 1000 | |
| 5039 | Bear and Compressing | brute force dfs and similar dp strings | Statement | B | IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2) {653} | PROGRAMMING | 1300 | ||
| 1657 | Bear and Up-Down | brute force implementation | Statement | C | IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2) {653} | PROGRAMMING | IndiaHacks Finals 2016 — Editorial | 1900 | |
| 2535 | Delivery Bears | binary search flows graphs | Statement | D | IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2) {653} | PROGRAMMING | 2100 | ||
| 1576 | Bear and Forgotten Tree 2 | dfs and similar ds graphs trees | Statement | E | IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2) {653} | PROGRAMMING | 2400 | ||
| 1011 | Paper task | data structures string suffix structures strings | Statement | F | IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2) {653} | PROGRAMMING | IndiaHacks Finals 2016 — Editorial | 2500 | |
| 565 | Move by Prime | combinatorics math number theory | Statement | G | IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2) {653} | PROGRAMMING | IndiaHacks Finals 2016 — Editorial | 3000 | |
| 1659 | Scrambled | *special implementation | Statement | B | April Fools Day Contest 2016 {656} | PROGRAMMING | 44141 | 1700 | |
| 3640 | Da Vinci Powers | *special | Statement | A | April Fools Day Contest 2016 {656} | PROGRAMMING | 44141 | 1900 | |
| 730 | Out of Controls | *special | Statement | E | April Fools Day Contest 2016 {656} | PROGRAMMING | 44141 | 2100 | |
| 914 | Ace It! | *special | Statement | F | April Fools Day Contest 2016 {656} | PROGRAMMING | 44141 | 2100 | |
| 487 | You're a Professional | *special | Statement | G | April Fools Day Contest 2016 {656} | PROGRAMMING | 44141 | 2200 | |
| 697 | Without Text | *special | Statement | C | April Fools Day Contest 2016 {656} | PROGRAMMING | 44141 | 2200 | |
| 962 | Rosetta Problem | *special | Statement | D | April Fools Day Contest 2016 {656} | PROGRAMMING | 44141 | 2200 | |
| 7158 | Bear and Reverse Radewoosh | implementation | Statement | A | VK Cup 2016 - Round 1 (Div. 2 Edition) {658} | PROGRAMMING | 700 | ||
| 16041 | Round House | implementation math | Statement | A | Codeforces Round 346 (Div. 2) {659} | PROGRAMMING | Editorial for Codeforces Round #346 (Div. 2) | 1100 | |
| 11526 | Tanya and Toys | greedy implementation | Statement | C | Codeforces Round 346 (Div. 2) {659} | PROGRAMMING | 1200 | ||
| 6322 | Qualifying Contest | constructive algorithms sortings | Statement | B | Codeforces Round 346 (Div. 2) {659} | PROGRAMMING | 1400 | ||
| 6369 | Bicycle Race | geometry implementation math | Statement | D | Codeforces Round 346 (Div. 2) {659} | PROGRAMMING | 1500 |