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']
Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 520 | Information Reform | dp implementation trees | Statement | E | Codeforces Beta Round 64 {70} | PROGRAMMING | Analysis Codeforces Beta Round #64 | 2700 | |
| 740 | Genetic engineering | dp string suffix structures trees | Statement | C | Yandex.Algorithm 2011: Round 2 {86} | PROGRAMMING | 2400 | ||
| 708 | Castle | dp greedy probabilities sortings trees | Statement | D | Codeforces Beta Round 79 (Div. 1 Only) {101} | PROGRAMMING | 2300 | ||
| 3660 | Lucky Tree | dp ds trees | Statement | C | Codeforces Beta Round 84 (Div. 1 Only) {109} | PROGRAMMING | 2000 | ||
| 3690 | Spiders | dp greedy trees | Statement | F | School Regional Team Contest, Saratov, 2011 {120} | PROGRAMMING | 1500 | ||
| 984 | Shaass the Great | dp trees | Statement | E | Codeforces Round 178 (Div. 2) {294} | PROGRAMMING | Codeforces Round #178 Editorial | 2700 | |
| 26357 | k-Tree | dp implementation trees | Statement | C | Codeforces Round 247 (Div. 2) {431} | PROGRAMMING | Editorial Codeforces Round #247 (Div. 2) | 1600 | |
| 759 | Berland Federalization | dp trees | Statement | D | Testing Round 10 {440} | PROGRAMMING | 2600 | ||
| 109 | An easy problem about trees | dp games greedy trees | Statement | F | MemSQL Start[c]UP 2.0 - Round 2 {457} | PROGRAMMING | MemSQL Start[c]UP 2.0 Round 1 and 2 Editorials | 3000 | |
| 990 | Fox And Travelling | dp trees | Statement | D | Codeforces Round 290 (Div. 1) {512} | PROGRAMMING | 2900 | ||
| 2831 | Road Improvement | dp trees | Statement | D | Codeforces Round 302 (Div. 1) {543} | PROGRAMMING | Editorial Codeforces Round #302 | 2300 | |
| 2353 | Running Track | dp greedy strings trees | Statement | C | Codeforces Round 338 (Div. 2) {615} | PROGRAMMING | Codeforces Round #338 (Div. 2) editorial | 1900 | |
| 646 | Bear and Destroying Subtrees | dp math probabilities trees | Statement | E | VK Cup 2016 - Round 3 {643} | PROGRAMMING | VK Cup 2016 — Round 3 — Editorial | 2600 | |
| 403 | Andrew and Chemistry | dp hashing trees | Statement | D | Codeforces Round 373 (Div. 1) {718} | PROGRAMMING | Codeforces Round #373 — Editorial | 2900 | |
| 889 | Ostap and Tree | dp trees | Statement | E | Codeforces Round 382 (Div. 2) {735} | PROGRAMMING | 2800 | ||
| 648 | Send the Fool Further! (medium) | dp trees | Statement | K | Helvetic Coding Contest 2017 online mirror (teams allowed, unrated) {802} | PROGRAMMING | 2100 | ||
| 2122 | Helga Hufflepuff's Cup | dp trees | Statement | C | Manthan, Codefest 17 {855} | PROGRAMMING | 2000 | ||
| 1055 | Third Month Insanity | dp probabilities trees | Statement | D | MemSQL Start[c]UP 3.0 - Round 1 {859} | PROGRAMMING | 2100 | ||
| 533 | Policeman and a Tree | dp graphs trees | Statement | E | Codeforces Round 438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined) {868} | PROGRAMMING | 2600 | ||
| 1234 | Stranger Trees | dp math matrices trees | Statement | D | Codeforces Round 459 (Div. 1) {917} | PROGRAMMING | Codeforces Round #459 Editorial | 2600 | |
| 385 | Heaps | dp trees | Statement | F | Codeforces Round 471 (Div. 2) {955} | PROGRAMMING | Editorial | 2800 | |
| 202 | Cactus to Tree | dp graphs trees | Statement | F | Codeforces Round 480 (Div. 2) {980} | PROGRAMMING | Tutorial | 2900 | |
| 983 | Vasya and Maximum Matching | dp trees | Statement | F | Technocup 2019 - Elimination Round 3 {1032} | PROGRAMMING | Codeforces Round #522 and Technocup 2019 Elimination Round 3 Editorial | 2600 | |
| 469 | Random Forest Rank | dp graph matchings math trees | Statement | E | Codeforces Round 518 (Div. 1) [Thanks, Mail.Ru!] {1067} | PROGRAMMING | Tutorial | 2800 | |
| 425 | Speed Dial | dp strings trees | Statement | F | Educational Codeforces Round 55 (Rated for Div. 2) {1082} | PROGRAMMING | 63544 | 2900 | |
| 1525 | Ehab and a component choosing problem | dp greedy math trees | Statement | E | Codeforces Round 525 (Div. 2) {1088} | PROGRAMMING | Codeforces round #525 editorial | 2400 | |
| 1207 | Leaf Partition | dp trees | Statement | F | Forethought Future Cup - Elimination Round {1146} | PROGRAMMING | 66639 | 2400 | |
| 2444 | Neko and Aki's Prank | dp greedy trees | Statement | D | Codeforces Round 554 (Div. 2) {1152} | PROGRAMMING | T | 2000 | |
| 388 | Anagram Paths | dp implementation trees | Statement | D | Codeforces Round 562 (Div. 1) {1168} | PROGRAMMING | Codeforces Round #562 — Editorial | 2900 | |
| 2656 | Paint the Tree | dp sortings trees | Statement | E | Technocup 2020 - Elimination Round 1 {1223} | PROGRAMMING | Сodeforces Round 591 (and Technocup 2020 — Elimination Round 1) Editorial | 2200 | |
| 2462 | Maximum Weight Subset | dp trees | Statement | F | Codeforces Round 595 (Div. 3) {1249} | PROGRAMMING | Codeforces Round #595 (Div. 3) Editorial | 2500 | |
| 531 | Cleaning Robots | dp trees | Statement | B | 2019-2020 ICPC, Asia Jakarta Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1252} | PROGRAMMING | T | 2600 | |
| 617 | Tree Elimination | dp trees | Statement | D | Codeforces Round 606 (Div. 1, based on Technocup 2020 Elimination Round 4) {1276} | PROGRAMMING | Technocup 2020 — Elimination Round 4 + Codeforces Round 606: Editorial | 2600 | |
| 1040 | Miss Punyverse | dp greedy trees | Statement | D | Codeforces Round 607 (Div. 1) {1280} | PROGRAMMING | Codeforces Round #607 Editorial | 2700 | |
| 881 | Chaotic V. | dp graphs greedy math number theory trees | Statement | D | Codeforces Round 614 (Div. 1) {1292} | PROGRAMMING | 1750.0 | Codeforces Round #614 Editorial | 2700 |
| 105 | Assigning Fares | dp dp dp trees | Statement | F | Codeforces Round 626 (Div. 1, based on Moscow Open Olympiad in Informatics) {1322} | PROGRAMMING | 3000.0 | Codeforces Round #626 Editorial | |
| 86 | Spiderweb Trees | dp geometry trees | Statement | G | Codeforces Global Round 7 {1326} | PROGRAMMING | 4000.0 | 74961 | 3600 |