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 |
|---|---|---|---|---|---|---|---|---|---|
| 2008 | AlgoRace | dp shortest paths | Statement | B | Codeforces Round 119 (Div. 1) {187} | PROGRAMMING | 1900 | ||
| 1918 | Police Station | dp graphs shortest paths | Statement | C | Codeforces Round 130 (Div. 2) {208} | PROGRAMMING | 1900 | ||
| 401 | Meeting Her | dp graphs shortest paths | Statement | E | Codeforces Round 148 (Div. 1) {238} | PROGRAMMING | 2700 | ||
| 14759 | Greg and Graph | dp graphs shortest paths | Statement | B | Codeforces Round 179 (Div. 1) {295} | PROGRAMMING | Codeforces Round #179 tutorial | 1900 | |
| 758 | Robot Control | dp graphs shortest paths | Statement | D | Codeforces Round 201 (Div. 1) {346} | PROGRAMMING | 2600 | ||
| 465 | Game with Points | dp graphs implementation shortest paths | Statement | D | Testing Round 9 {386} | PROGRAMMING | 2300 | ||
| 1564 | President's Path | dp graphs shortest paths | Statement | E | Codeforces Round 241 (Div. 2) {416} | PROGRAMMING | 2400 | ||
| 705 | Perishable Roads | dp graphs shortest paths | Statement | D | VK Cup 2017 - Round 3 {773} | PROGRAMMING | 2700 | ||
| 1609 | Presents in Bankopolis | dp graphs shortest paths | Statement | D | Tinkoff Challenge - Elimination Round {793} | PROGRAMMING | 2100 | ||
| 844 | Elevator | dp graphs shortest paths | Statement | C | Codeforces Round 483 (Div. 1) [Thanks, Botan Investments and Victor Shaburov!] {983} | PROGRAMMING | Codeforces Round #483 [Thanks, Botan Investments and Victor Shaburov!] Editoral | 2500 | |
| 2396 | Find a Number | dp graphs number theory shortest paths | Statement | A | 2018-2019 ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {1070} | PROGRAMMING | Solution to problem M. Algoland and Berland of 2018-2019 ICPC, NEERC | 2200 | |
| 4938 | Subsequences (easy version) | dp graphs implementation shortest paths | Statement | E | Codeforces Round 570 (Div. 3) {1183} | PROGRAMMING | Tutorial | 2000 | |
| 6786 | Anna, Svyatoslav and Maps | dp graphs greedy shortest paths | Statement | C | Codeforces Round 581 (Div. 2) {1204} | PROGRAMMING | 69244 | 1700 | |
| 1284 | Hyakugoku and Ladders | dp probabilities shortest paths | Statement | E | Codeforces Round 597 (Div. 2) {1245} | PROGRAMMING | Codeforces Round #597 (Div. 2) Editorial | 2300 | |
| 9928 | By Elevator or Stairs? | dp shortest paths | Statement | E | Codeforces Round 595 (Div. 3) {1249} | PROGRAMMING | Codeforces Round #595 (Div. 3) Editorial | 1700 | |
| 25877 | Polygon | dp graphs implementation shortest paths | Statement | E | Codeforces Round 644 (Div. 3) {1360} | PROGRAMMING | Codeforces Round #644 (Div. 3) Editorial | 1300 |