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 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 131 | Helper | Statement | E | Codeforces Beta Round 33 (Codeforces format) {33} | PROGRAMMING | 2500 | |||
| 143 | Tram | Statement | I | School Team Contest 1 (Winter Computer School 2010/11) {39} | PROGRAMMING | 2700 | |||
| 86 | Testing | Statement | K | School Team Contest 1 (Winter Computer School 2010/11) {39} | PROGRAMMING | School Team Contest #1 (Winter Computer School 2010/11): Problem K Tutorial | 2700 | ||
| 66 | Petya and Rectangle | Statement | E | Codeforces Beta Round 85 (Div. 1 Only) {111} | PROGRAMMING | 3000 | |||
| 67 | Polycarpus and Tasks | Statement | E | VK Cup 2012 Round 3 {164} | PROGRAMMING | 3100 | |||
| 305 | Script Generation | Statement | F1 | ABBYY Cup 2.0 - Easy {177} | PROGRAMMING | 1800 | |||
| 210 | Script Generation | Statement | F2 | ABBYY Cup 2.0 - Easy {177} | PROGRAMMING | 2300 | |||
| 1617 | Educational Game | Statement | A1 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | 1000 | |||
| 644 | Magic Squares | Statement | D1 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | ABBYY Cup 2.0 — Hard: solutions | 1500 | ||
| 764 | Greedy Merchants | Statement | B1 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | 1600 | |||
| 492 | Smart Beaver and Resolving Collisions | Statement | C1 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | 1600 | |||
| 682 | Greedy Merchants | Statement | B2 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | 1700 | |||
| 1223 | Greedy Merchants | Statement | B3 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | 1900 | |||
| 307 | Smart Beaver and Resolving Collisions | Statement | C2 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | 2000 | |||
| 324 | Smart Beaver and Resolving Collisions | Statement | C3 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | 2000 | |||
| 289 | The Beaver's Problem - 2 | Statement | E1 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | 2100 | |||
| 404 | Representative Sampling | Statement | F1 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | 2100 | |||
| 273 | Magic Squares | Statement | D2 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | ABBYY Cup 2.0 — Hard: solutions | 2200 | ||
| 250 | Magic Squares | Statement | D3 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | ABBYY Cup 2.0 — Hard: solutions | 2200 | ||
| 230 | The Beaver's Problem - 2 | Statement | E2 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | 2200 | |||
| 201 | The Beaver's Problem - 2 | Statement | E3 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | 2400 | |||
| 434 | Representative Sampling | Statement | F3 | ABBYY Cup 2.0 - Hard {178} | PROGRAMMING | 2600 | |||
| 273 | Military Trainings | Statement | B1 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 1700 | |||
| 189 | Military Trainings | Statement | B2 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 1900 | |||
| 117 | The Beaver's Problem - 3 | Statement | D1 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 1900 | |||
| 110 | The Beaver's Problem - 3 | Statement | D2 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 2000 | |||
| 136 | The Beaver's Problem - 3 | Statement | D3 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 2100 | |||
| 165 | Military Trainings | Statement | B3 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 2200 | |||
| 154 | The Beaver's Problem - 3 | Statement | D4 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 2200 | |||
| 142 | The Beaver's Problem - 3 | Statement | D5 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 2300 | |||
| 84 | The Beaver's Problem - 3 | Statement | D6 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 2300 | |||
| 95 | The Beaver's Problem - 3 | Statement | D8 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 2300 | |||
| 107 | Game with Two Trees | Statement | C1 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 2400 | |||
| 101 | The Beaver's Problem - 3 | Statement | D7 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 2400 | |||
| 88 | The Beaver's Problem - 3 | Statement | D9 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 2400 | |||
| 90 | Game with Two Trees | Statement | C2 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 2500 | |||
| 82 | The Beaver's Problem - 3 | Statement | D10 | Abbyy Cup 2.0 - Final (unofficial) {207} | PROGRAMMING | 2700 | |||
| 2540 | Bracket Sequence | data structures expression parsing implementation | Statement | A | Codeforces Round 138 (Div. 1) {223} | PROGRAMMING | 1800 | ||
| 379 | Numbers | Statement | D | Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements) {241} | PROGRAMMING | 2900 | |||
| 109 | String Theory | Statement | E | Codeforces Round 165 (Div. 1) {269} | PROGRAMMING | 3100 | |||
| 166 | Suns and Rays | Statement | F2 | ABBYY Cup 3.0 {316} | PROGRAMMING | ABBYY Cup 3.0. Solutions | 2500 | ||
| 261 | Inna and Large Sweet Matrix | Statement | E | Codeforces Round 229 (Div. 2) {390} | PROGRAMMING | 2500.0 | |||
| 171 | The Tournament | Statement | C3 | Rockethon 2014 {391} | PROGRAMMING | 8.0 | |||
| 119 | Three Trees | Statement | E1 | Rockethon 2014 {391} | PROGRAMMING | 11.0 | |||
| 160 | Three Trees | Statement | E2 | Rockethon 2014 {391} | PROGRAMMING | 13.0 | |||
| 107 | Stock Trading | Statement | F3 | Rockethon 2014 {391} | PROGRAMMING | 10.0 | |||
| 179 | Deleting Substrings | Statement | E | Codeforces Round 230 (Div. 1) {392} | PROGRAMMING | 2500.0 | 83942 | ||
| 6651 | Nineteen | Statement | A | Codeforces Round 230 (Div. 2) {393} | PROGRAMMING | 500.0 | 83942 | ||
| 1986 | Three matrices | Statement | B | Codeforces Round 230 (Div. 2) {393} | PROGRAMMING | 1000.0 | 83942 | ||
| 91 | Sorting Permutations | Statement | E | Codeforces Round 233 (Div. 1) {398} | PROGRAMMING | 2500.0 | Codeforces Round #233 Editorial | ||
| 1842 | Red and Blue Balls | Statement | B | Codeforces Round 233 (Div. 2) {399} | PROGRAMMING | 1000.0 | Codeforces Round #233 Editorial | ||
| 5780 | Domino Effect | Statement | B | Codeforces Round 238 (Div. 2) {405} | PROGRAMMING | 1200 | |||
| 244 | Special Graph | Statement | E | Codeforces Round 249 (Div. 2) {435} | PROGRAMMING | 2500 | |||
| 471 | Little Pony and Elements of Harmony | dp matrices | Statement | D | Codeforces Round 259 (Div. 1) {453} | PROGRAMMING | Codeforces Round #259 Editorial | 2900 | |
| 7425 | Design Tutorial: Learn from Life | Statement | B | Codeforces Round 270 {472} | PROGRAMMING | Editorial | 1300 | ||
| 8182 | Replace To Make Regular Bracket Sequence | data structures expression parsing math | Statement | C | Educational Codeforces Round 4 {612} | PROGRAMMING | 22299 | 1500 | |
| 4605 | Grandma Laura and Apples | Statement | A | Educational Codeforces Round 9 {632} | PROGRAMMING | 1200 | |||
| 195 | Little Artem and 2-SAT | Statement | F | VK Cup 2016 - Round 2 {641} | PROGRAMMING | 2900 | |||
| 91 | Little Artem and Graph | Statement | G | VK Cup 2016 - Round 2 {641} | PROGRAMMING | VK Cup 2016 — Раунд 2 (editorial) | 3300 | ||
| 316 | Bearish Fanpages | Statement | D | VK Cup 2016 - Round 3 {643} | PROGRAMMING | 2900 | |||
| 127 | Собери число | Statement | E | Технокубок 2016 - Отборочный Раунд 1 {648} | PROGRAMMING | 2500.0 | 2300 | ||
| 2879 | Collective Mindsets (easy) | Statement | A1 | Helvetic Coding Contest 2016 online mirror (teams, unrated) {690} | PROGRAMMING | 1200 | |||
| 2621 | The Wall (easy) | Statement | D1 | Helvetic Coding Contest 2016 online mirror (teams, unrated) {690} | PROGRAMMING | Tutotial | 1300 | ||
| 2772 | Brain Network (easy) | Statement | C1 | Helvetic Coding Contest 2016 online mirror (teams, unrated) {690} | PROGRAMMING | Tutotial | 1400 | ||
| 2172 | Tree of Life (easy) | Statement | F1 | Helvetic Coding Contest 2016 online mirror (teams, unrated) {690} | PROGRAMMING | Tutotial | 1400 | ||
| 941 | Recover Polygon (easy) | Statement | B1 | Helvetic Coding Contest 2016 online mirror (teams, unrated) {690} | PROGRAMMING | 1800 | |||
| 677 | Photographs (I) | Statement | E1 | Helvetic Coding Contest 2016 online mirror (teams, unrated) {690} | PROGRAMMING | 1900 | |||
| 523 | The Wall (hard) | Statement | D3 | Helvetic Coding Contest 2016 online mirror (teams, unrated) {690} | PROGRAMMING | Tutotial | 2100 | ||
| 710 | Collective Mindsets (medium) | Statement | A2 | Helvetic Coding Contest 2016 online mirror (teams, unrated) {690} | PROGRAMMING | Tutotial | 2400 | ||
| 550 | Collective Mindsets (hard) | Statement | A3 | Helvetic Coding Contest 2016 online mirror (teams, unrated) {690} | PROGRAMMING | 2500 | |||
| 142 | Photographs (II) | Statement | E2 | Helvetic Coding Contest 2016 online mirror (teams, unrated) {690} | PROGRAMMING | 2700 | |||
| 93 | Recover Polygon (hard) | Statement | B3 | Helvetic Coding Contest 2016 online mirror (teams, unrated) {690} | PROGRAMMING | 2800 | |||
| 117 | Cron | Statement | E | Codeforces Round 363 (Div. 1) {698} | PROGRAMMING | Solution | 2800 | ||
| 164 | Messages on a Tree | Statement | G | Canada Cup 2016 {725} | PROGRAMMING | 3300 | |||
| 91 | Ber Patio | Statement | F | 2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {730} | PROGRAMMING | Разбор задач (видео, по-русски) | 3200 | ||
| 104 | Roads Orientation Problem | Statement | K | 2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {730} | PROGRAMMING | 3300 | |||
| 86 | Expression Queries | Statement | L | 2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {730} | PROGRAMMING | 3300 | |||
| 1577 | Draw Brackets! | *special implementation | Statement | D | VK Cup 2017 - Qualification 2 {770} | PROGRAMMING | Tutorial of VK Cup 2017 Qualification Round 2 | 1900 | |
| 98 | Expected Earnings | Statement | F | IndiaHacks 2nd Elimination 2017 (unofficial, unrated mirror, ICPC rules) {838} | PROGRAMMING | 53736 | 2800 | ||
| 2448 | Load Testing | Statement | H | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred) {847} | PROGRAMMING | 1700 | |||
| 409 | Masha and Cactus | Statement | D | Russian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed] {856} | PROGRAMMING | Tutorial | 2500 | ||
| 71 | Satellites | Statement | E | Russian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed] {856} | PROGRAMMING | 3100 | |||
| 56 | Graphic Settings | Statement | G | Educational Codeforces Round 29 {863} | PROGRAMMING | 3100 | |||
| 7926 | Vlad and Cafes | Statement | B | Технокубок 2018 - Отборочный Раунд 3 {886} | PROGRAMMING | Editorial Codeforces Round 445 (and Technocup 2018 — Elimination Round 3) | 1000 | ||
| 385 | New Year and Boolean Bridges | Statement | H | Good Bye 2017 {908} | PROGRAMMING | Good Bye 2017 Editorial | 3000 | ||
| 0 | Labyrinth-1 | Statement | 01 | AIM Tech Mini Marathon 1 {921} | PROGRAMMING | 3200 | |||
| 0 | Labyrinth-2 | Statement | 02 | AIM Tech Mini Marathon 1 {921} | PROGRAMMING | 3200 | |||
| 0 | Labyrinth-3 | Statement | 03 | AIM Tech Mini Marathon 1 {921} | PROGRAMMING | 3200 | |||
| 0 | Labyrinth-4 | Statement | 04 | AIM Tech Mini Marathon 1 {921} | PROGRAMMING | 3200 | |||
| 0 | Labyrinth-5 | Statement | 05 | AIM Tech Mini Marathon 1 {921} | PROGRAMMING | 3200 | |||
| 0 | Labyrinth-6 | Statement | 06 | AIM Tech Mini Marathon 1 {921} | PROGRAMMING | 3200 | |||
| 0 | Labyrinth-7 | Statement | 07 | AIM Tech Mini Marathon 1 {921} | PROGRAMMING | 3200 | |||
| 0 | Labyrinth-8 | Statement | 08 | AIM Tech Mini Marathon 1 {921} | PROGRAMMING | 3200 | |||
| 0 | Labyrinth-9 | Statement | 09 | AIM Tech Mini Marathon 1 {921} | PROGRAMMING | 3200 | |||
| 0 | Labyrinth-10 | Statement | 10 | AIM Tech Mini Marathon 1 {921} | PROGRAMMING | 3200 | |||
| 0 | Labyrinth-11 | Statement | 11 | AIM Tech Mini Marathon 1 {921} | PROGRAMMING | 3200 | |||
| 0 | Labyrinth-12 | Statement | 12 | AIM Tech Mini Marathon 1 {921} | PROGRAMMING | 3200 | |||
| 0 | Labyrinth-13 | Statement | 13 | AIM Tech Mini Marathon 1 {921} | PROGRAMMING | 3200 | |||
| 0 | Labyrinth-14 | Statement | 14 | AIM Tech Mini Marathon 1 {921} | PROGRAMMING | 3200 | |||
| 871 | Contact ATC | Statement | D | VK Cup 2018 - Round 2 {924} | PROGRAMMING | 2500 |