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 ... 35 36 37 38 39 ... 100 101 102 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 7712 | Rectangles | combinatorics math | Statement | B | AIM Tech Round 4 (Div. 2) {844} | PROGRAMMING | AIM Tech Round 4 -- Editorial | 1300 | |
| 7849 | Chess Tourney | implementation sortings | Statement | A | Educational Codeforces Round 27 {845} | PROGRAMMING | 53986 | 1100 | |
| 9117 | Two TVs | data structures greedy sortings | Statement | C | Educational Codeforces Round 27 {845} | PROGRAMMING | 53986 | 1500 | |
| 5070 | Luba And The Ticket | brute force greedy implementation | Statement | B | Educational Codeforces Round 27 {845} | PROGRAMMING | 53986 | 1600 | |
| 2403 | Driving Test | data structures dp greedy | Statement | D | Educational Codeforces Round 27 {845} | PROGRAMMING | 1800 | ||
| 1731 | Shortest Path Problem? | dfs and similar graphs math | Statement | G | Educational Codeforces Round 27 {845} | PROGRAMMING | 53986 | 2400 | |
| 613 | Fire in the City | binary search data structures | Statement | E | Educational Codeforces Round 27 {845} | PROGRAMMING | 2500 | ||
| 468 | Guards In The Storehouse | bitmasks dp | Statement | F | Educational Codeforces Round 27 {845} | PROGRAMMING | 2600 | ||
| 4312 | Curriculum Vitae | brute force implementation | Statement | A | Educational Codeforces Round 28 {846} | PROGRAMMING | 54357 | 1500 | |
| 2571 | Math Show | brute force greedy | Statement | B | Educational Codeforces Round 28 {846} | PROGRAMMING | 54357 | 1800 | |
| 2578 | Monitor | binary search data structures | Statement | D | Educational Codeforces Round 28 {846} | PROGRAMMING | 54357 | 1900 | |
| 2740 | Four Segments | brute force data structures dp | Statement | C | Educational Codeforces Round 28 {846} | PROGRAMMING | 54357 | 1900 | |
| 2349 | Random Query | data structures math probabilities two pointers | Statement | F | Educational Codeforces Round 28 {846} | PROGRAMMING | 54357 | 2000 | |
| 917 | Chemistry in Berland | dfs and similar greedy trees | Statement | E | Educational Codeforces Round 28 {846} | PROGRAMMING | 2400 | ||
| 6335 | Weather Tomorrow | implementation | Statement | M | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred) {847} | PROGRAMMING | 1000 | ||
| 6929 | University Classes | implementation | Statement | G | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred) {847} | PROGRAMMING | 1000 | ||
| 3476 | Union of Doubly Linked Lists | implementation | Statement | A | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred) {847} | PROGRAMMING | 1500 | ||
| 5148 | Preparing for Merge Sort | binary search data structures | Statement | B | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred) {847} | PROGRAMMING | 1700 | ||
| 2468 | Load Testing | Statement | H | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred) {847} | PROGRAMMING | 1700 | |||
| 2414 | Sum of Nestings | constructive algorithms | Statement | C | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred) {847} | PROGRAMMING | 1900 | ||
| 3162 | Packmen | binary search dp | Statement | E | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred) {847} | PROGRAMMING | 2000 | ||
| 1536 | Noise Level | dfs and similar | Statement | I | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred) {847} | PROGRAMMING | 2000 | ||
| 1716 | Travel Cards | sortings | Statement | K | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred) {847} | PROGRAMMING | 2100 | ||
| 871 | Berland Elections | greedy | Statement | F | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred) {847} | PROGRAMMING | 2200 | ||
| 1230 | Dog Show | data structures greedy | Statement | D | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred) {847} | PROGRAMMING | 2300 | ||
| 643 | Students Initiation | binary search flows | Statement | J | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred) {847} | PROGRAMMING | 2400 | ||
| 322 | Berland SU Computer Network | dfs and similar hashing trees | Statement | L | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred) {847} | PROGRAMMING | 2500 | ||
| 5187 | From Y to Y | constructive algorithms | Statement | A | Codeforces Round 431 (Div. 1) {848} | PROGRAMMING | Codeforces Round #431 Editorial | 1600 | |
| 1920 | Rooter's Song | constructive algorithms data structures geometry implementation sortings two pointers | Statement | B | Codeforces Round 431 (Div. 1) {848} | PROGRAMMING | 2100 | ||
| 1415 | Goodbye Souvenir | data structures divide and conquer | Statement | C | Codeforces Round 431 (Div. 1) {848} | PROGRAMMING | Codeforces Round #431 Editorial | 2800 | |
| 390 | Shake It! | combinatorics dp flows graphs | Statement | D | Codeforces Round 431 (Div. 1) {848} | PROGRAMMING | Codeforces Round #431 Editorial | 2900 | |
| 219 | Days of Floral Colours | combinatorics divide and conquer dp fft math | Statement | E | Codeforces Round 431 (Div. 1) {848} | PROGRAMMING | 3400 | ||
| 9203 | Odds and Ends | implementation | Statement | A | Codeforces Round 431 (Div. 2) {849} | PROGRAMMING | Codeforces Round #431 Editorial | 1100 | |
| 3712 | Tell Your World | brute force geometry | Statement | B | Codeforces Round 431 (Div. 2) {849} | PROGRAMMING | Codeforces Round #431 Editorial | 1600 | |
| 3218 | Five Dimensional Points | brute force geometry math | Statement | A | Codeforces Round 432 (Div. 1, based on IndiaHacks Final Round 2017) {850} | PROGRAMMING | Codeforces Round #432 editorial | 1700 | |
| 2040 | Arpa and a list of numbers | implementation number theory | Statement | B | Codeforces Round 432 (Div. 1, based on IndiaHacks Final Round 2017) {850} | PROGRAMMING | Codeforces Round #432 editorial | 2000 | |
| 1536 | Arpa and a game with Mojtaba | bitmasks dp games | Statement | C | Codeforces Round 432 (Div. 1, based on IndiaHacks Final Round 2017) {850} | PROGRAMMING | Codeforces Round #432 editorial | 2400 | |
| 396 | Tournament Construction | constructive algorithms dp graphs greedy math | Statement | D | Codeforces Round 432 (Div. 1, based on IndiaHacks Final Round 2017) {850} | PROGRAMMING | Codeforces Round #432 editorial | 2700 | |
| 409 | Random Elections | bitmasks brute force divide and conquer fft math | Statement | E | Codeforces Round 432 (Div. 1, based on IndiaHacks Final Round 2017) {850} | PROGRAMMING | 2800 | ||
| 672 | Rainbow Balls | math | Statement | F | Codeforces Round 432 (Div. 1, based on IndiaHacks Final Round 2017) {850} | PROGRAMMING | Codeforces Round #432 editorial | 2800 | |
| 5593 | Arpa and an exam about geometry | geometry math | Statement | B | Codeforces Round 432 (Div. 2, based on IndiaHacks Final Round 2017) {851} | PROGRAMMING | Codeforces Round #432 editorial | 1400 | |
| 9845 | Arpa and a research in Mexican wave | implementation math | Statement | A | Codeforces Round 432 (Div. 2, based on IndiaHacks Final Round 2017) {851} | PROGRAMMING | Codeforces Round #432 editorial | 800 | |
| 1298 | Bathroom terminal | implementation | Statement | G | Bubble Cup X - Finals [Online Mirror] {852} | PROGRAMMING | 1700 | ||
| 1497 | Neural Network country | dp matrices | Statement | B | Bubble Cup X - Finals [Online Mirror] {852} | PROGRAMMING | 2000 | ||
| 1070 | Casinos and travel | dp | Statement | E | Bubble Cup X - Finals [Online Mirror] {852} | PROGRAMMING | 2200 | ||
| 585 | Product transformation | combinatorics math number theory | Statement | F | Bubble Cup X - Finals [Online Mirror] {852} | PROGRAMMING | Tutorial | 2300 | |
| 1063 | Exploration plan | binary search flows graph matchings shortest paths | Statement | D | Bubble Cup X - Finals [Online Mirror] {852} | PROGRAMMING | 2400 | ||
| 603 | Property | greedy sortings | Statement | C | Bubble Cup X - Finals [Online Mirror] {852} | PROGRAMMING | Tutorial | 2500 | |
| 587 | Dating | brute force dfs and similar graphs trees | Statement | I | Bubble Cup X - Finals [Online Mirror] {852} | PROGRAMMING | 2500 | ||
| 394 | Digits | brute force implementation math | Statement | A | Bubble Cup X - Finals [Online Mirror] {852} | PROGRAMMING | 2700 | ||
| 152 | Bob and stages | dp geometry | Statement | H | Bubble Cup X - Finals [Online Mirror] {852} | PROGRAMMING | 3100 | ||
| 5917 | Planning | greedy | Statement | A | Codeforces Round 433 (Div. 1, based on Olympiad of Metropolises) {853} | PROGRAMMING | 1500 | ||
| 2555 | Jury Meeting | greedy sortings two pointers | Statement | B | Codeforces Round 433 (Div. 1, based on Olympiad of Metropolises) {853} | PROGRAMMING | 1900 | ||
| 1521 | Boredom | data structures | Statement | C | Codeforces Round 433 (Div. 1, based on Olympiad of Metropolises) {853} | PROGRAMMING | 2200 | ||
| 681 | Michael and Charging Stations | binary search dp greedy | Statement | D | Codeforces Round 433 (Div. 1, based on Olympiad of Metropolises) {853} | PROGRAMMING | 2400 | ||
| 70 | Lada Malina | data structures geometry | Statement | E | Codeforces Round 433 (Div. 1, based on Olympiad of Metropolises) {853} | PROGRAMMING | 3400 | ||
| 8262 | Maxim Buys an Apartment | constructive algorithms math | Statement | B | Codeforces Round 433 (Div. 2, based on Olympiad of Metropolises) {854} | PROGRAMMING | 1200 | ||
| 13758 | Fraction | brute force constructive algorithms math | Statement | A | Codeforces Round 433 (Div. 2, based on Olympiad of Metropolises) {854} | PROGRAMMING | 900 | ||
| 8850 | Marvolo Gaunt's Ring | brute force data structures dp | Statement | B | Manthan, Codefest 17 {855} | PROGRAMMING | 1500 | ||
| 2116 | Helga Hufflepuff's Cup | dp trees | Statement | C | Manthan, Codefest 17 {855} | PROGRAMMING | 2000 | ||
| 1827 | Salazar Slytherin's Locket | bitmasks dp | Statement | E | Manthan, Codefest 17 {855} | PROGRAMMING | 54750 | 2200 | |
| 534 | Rowena Ravenclaw's Diadem | trees | Statement | D | Manthan, Codefest 17 {855} | PROGRAMMING | 2400 | ||
| 464 | Nagini | binary search data structures | Statement | F | Manthan, Codefest 17 {855} | PROGRAMMING | 3000 | ||
| 223 | Harry Vs Voldemort | dfs and similar dp graphs trees | Statement | G | Manthan, Codefest 17 {855} | PROGRAMMING | 3000 | ||
| 22467 | Tom Riddle's Diary | brute force implementation strings | Statement | A | Manthan, Codefest 17 {855} | PROGRAMMING | 54750 | 700 | |
| 1468 | Set Theory | brute force constructive algorithms | Statement | A | Russian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed] {856} | PROGRAMMING | Tutorial | 1600 | |
| 521 | Similar Words | dp strings | Statement | B | Russian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed] {856} | PROGRAMMING | Tutorial | 2300 | |
| 636 | Eleventh Birthday | combinatorics dp math | Statement | C | Russian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed] {856} | PROGRAMMING | 2400 | ||
| 416 | Masha and Cactus | Statement | D | Russian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed] {856} | PROGRAMMING | Tutorial | 2500 | ||
| 105 | To Play or not to Play | greedy | Statement | F | Russian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed] {856} | PROGRAMMING | 3100 | ||
| 72 | Satellites | Statement | E | Russian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed] {856} | PROGRAMMING | 3100 | |||
| 8141 | k-rounding | brute force math number theory | Statement | A | Технокубок 2018 - Отборочный Раунд 1 {858} | PROGRAMMING | Codeforces Round 434 Div.1+Div.2 (and Technocup 2018 — Elimination Round 1) Editorial | 1200 | |
| 3776 | Which floor? | brute force implementation | Statement | B | Технокубок 2018 - Отборочный Раунд 1 {858} | PROGRAMMING | 1500 | ||
| 5653 | Did you mean... | dp greedy implementation | Statement | C | Технокубок 2018 - Отборочный Раунд 1 {858} | PROGRAMMING | Codeforces Round 434 Div.1+Div.2 (and Technocup 2018 — Elimination Round 1) Editorial | 1500 | |
| 3923 | Polycarp's phone book | data structures implementation sortings | Statement | D | Технокубок 2018 - Отборочный Раунд 1 {858} | PROGRAMMING | Codeforces Round 434 Div.1+Div.2 (and Technocup 2018 — Elimination Round 1) Editorial | 1700 | |
| 513 | Tests Renumeration | greedy implementation | Statement | E | Технокубок 2018 - Отборочный Раунд 1 {858} | PROGRAMMING | 2300 | ||
| 1684 | Wizard's Tour | constructive algorithms dfs and similar graphs | Statement | F | Технокубок 2018 - Отборочный Раунд 1 {858} | PROGRAMMING | 2400 | ||
| 7105 | Lazy Security Guard | brute force geometry math | Statement | B | MemSQL Start[c]UP 3.0 - Round 1 {859} | PROGRAMMING | Tutorial | 1000 | |
| 5494 | Pie Rules | dp games | Statement | C | MemSQL Start[c]UP 3.0 - Round 1 {859} | PROGRAMMING | Tutorial | 1500 | |
| 1055 | Third Month Insanity | dp probabilities trees | Statement | D | MemSQL Start[c]UP 3.0 - Round 1 {859} | PROGRAMMING | 2100 | ||
| 1888 | Desk Disorder | combinatorics dfs and similar ds graphs trees | Statement | E | MemSQL Start[c]UP 3.0 - Round 1 {859} | PROGRAMMING | Tutorial | 2100 | |
| 188 | Ordering T-Shirts | greedy | Statement | F | MemSQL Start[c]UP 3.0 - Round 1 {859} | PROGRAMMING | 2700 | ||
| 162 | Circle of Numbers | math | Statement | G | MemSQL Start[c]UP 3.0 - Round 1 {859} | PROGRAMMING | Tutorial | 2900 | |
| 7822 | Declined Finalists | greedy implementation | Statement | A | MemSQL Start[c]UP 3.0 - Round 1 {859} | PROGRAMMING | Tutorial | 800 | |
| 448 | Arkady and a Nobody-men | data structures dfs and similar trees | Statement | E | Codeforces Round 434 (Div. 1, based on Technocup 2018 Elimination Round 1) {860} | PROGRAMMING | 2600 | ||
| 9636 | Mahmoud and Ehab and the MEX | greedy implementation | Statement | A | Codeforces Round 435 (Div. 2) {862} | PROGRAMMING | Codeforces round #435 editorial | 1000 | |
| 18912 | Mahmoud and Ehab and the bipartiteness | dfs and similar graphs trees | Statement | B | Codeforces Round 435 (Div. 2) {862} | PROGRAMMING | Codeforces round #435 editorial | 1400 | |
| 4162 | Mahmoud and Ehab and the xor | constructive algorithms | Statement | C | Codeforces Round 435 (Div. 2) {862} | PROGRAMMING | Codeforces round #435 editorial | 1800 | |
| 1907 | Mahmoud and Ehab and the binary string | binary search divide and conquer interactive | Statement | D | Codeforces Round 435 (Div. 2) {862} | PROGRAMMING | 2000 | ||
| 1691 | Mahmoud and Ehab and the function | binary search data structures sortings | Statement | E | Codeforces Round 435 (Div. 2) {862} | PROGRAMMING | 2200 | ||
| 214 | Mahmoud and Ehab and the final stage | data structures strings | Statement | F | Codeforces Round 435 (Div. 2) {862} | PROGRAMMING | Codeforces round #435 editorial | 2800 | |
| 8748 | Kayaking | brute force greedy sortings | Statement | B | Educational Codeforces Round 29 {863} | PROGRAMMING | Editorial | 1500 | |
| 3338 | Yet Another Array Queries Problem | data structures implementation | Statement | D | Educational Codeforces Round 29 {863} | PROGRAMMING | Editorial | 1800 | |
| 2540 | 1-2-3 | graphs implementation | Statement | C | Educational Codeforces Round 29 {863} | PROGRAMMING | 1800 | ||
| 3244 | Turn Off The TV | data structures sortings | Statement | E | Educational Codeforces Round 29 {863} | PROGRAMMING | Editorial | 2000 | |
| 1297 | Almost Permutation | flows | Statement | F | Educational Codeforces Round 29 {863} | PROGRAMMING | Editorial | 2300 | |
| 57 | Graphic Settings | Statement | G | Educational Codeforces Round 29 {863} | PROGRAMMING | 3100 | |||
| 10336 | Quasi-palindrome | brute force implementation | Statement | A | Educational Codeforces Round 29 {863} | PROGRAMMING | Editorial | 900 | |
| 11728 | Fair Game | implementation sortings | Statement | A | Codeforces Round 436 (Div. 2) {864} | PROGRAMMING | 1000 | ||
| 9324 | Polycarp and Letters | brute force implementation strings | Statement | B | Codeforces Round 436 (Div. 2) {864} | PROGRAMMING | Codeforces Round #436 (Div.2) Разбор | 1100 |