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 |
|---|---|---|---|---|---|---|---|---|---|
| 36719 | Dijkstra? | graphs shortest paths | Statement | C | Codeforces Alpha Round 20 (Codeforces format) {20} | PROGRAMMING | 2100 | ||
| 6763 | Roads in Berland | graphs shortest paths | Statement | C | Codeforces Beta Round 25 (Div. 2 Only) {25} | PROGRAMMING | 1800 | ||
| 965 | Quarrel | graphs shortest paths | Statement | E | Codeforces Beta Round 29 (Div. 2, Codeforces format) {29} | PROGRAMMING | 2400 | ||
| 637 | Trial for Chief | graphs greedy shortest paths | Statement | E | Codeforces Beta Round 37 {37} | PROGRAMMING | Codeforces Beta Round #37 (Tutorial) | 2600 | |
| 3823 | Shortest Path | graphs shortest paths | Statement | E | Codeforces Beta Round 55 (Div. 2) {59} | PROGRAMMING | 2100 | ||
| 440 | Track | graphs greedy shortest paths | Statement | C | Codeforces Beta Round 72 (Div. 1 Only) {83} | PROGRAMMING | 2400 | ||
| 935 | Take-off Ramps | graphs shortest paths | Statement | D | Codeforces Round 101 (Div. 2) {141} | PROGRAMMING | 2400 | ||
| 1225 | Flights | graphs shortest paths | Statement | E | Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements) {241} | PROGRAMMING | 2600 | ||
| 914 | BerDonalds | graphs math shortest paths | Statement | D | Codeforces Round 163 (Div. 2) {266} | PROGRAMMING | Codeforces Round #163 (Div. 2) Tutorial | 2600 | |
| 732 | Levko and Game | graphs greedy shortest paths | Statement | E | Codeforces Round 210 (Div. 1) {360} | PROGRAMMING | 2800 | ||
| 10784 | Rook, Bishop and King | graphs math shortest paths | Statement | A | Codeforces Round 217 (Div. 2) {370} | PROGRAMMING | Codeforces Round #217 (Div. 2): tutorial | 1200 | |
| 9108 | Jzzhu and Cities | graphs greedy shortest paths | Statement | B | Codeforces Round 257 (Div. 1) {449} | PROGRAMMING | Codeforces Round #257 Editorial | 2000 | |
| 892 | Playing on Graph | graphs shortest paths | Statement | E | VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only) {542} | PROGRAMMING | 2600 | ||
| 4965 | Paths and Trees | graphs greedy shortest paths | Statement | E | Codeforces Round 303 (Div. 2) {545} | PROGRAMMING | 2100 | ||
| 12563 | The Two Routes | graphs shortest paths | Statement | A | Codeforces Round 333 (Div. 1) {601} | PROGRAMMING | 1600 | ||
| 2228 | World Tour | graphs shortest paths | Statement | B | Codeforces Round 349 (Div. 1) {666} | PROGRAMMING | 2100 | ||
| 1877 | Theseus and labyrinth | graphs implementation shortest paths | Statement | D | Codeforces Round 354 (Div. 2) {676} | PROGRAMMING | 2000 | ||
| 964 | Dynamic Shortest Path | graphs shortest paths | Statement | D | AIM Tech Round 4 (Div. 1) {843} | PROGRAMMING | AIM Tech Round 4 -- Editorial | 2700 | |
| 7330 | Fair | graphs greedy number theory shortest paths | Statement | A | Codeforces Round 485 (Div. 1) {986} | PROGRAMMING | Codeforces Round #485 Editorial | 1600 | |
| 660 | Oppa Funcan Style Remastered | graphs math number theory shortest paths | Statement | F | Codeforces Round 485 (Div. 1) {986} | PROGRAMMING | Codeforces Round #485 Editorial | 3200 | |
| 7985 | Labyrinth | graphs shortest paths | Statement | B | Codeforces Round 516 (Div. 1, by Moscow Team Olympiad) {1063} | PROGRAMMING | 1800 | ||
| 5434 | Edge Deletion | graphs greedy shortest paths | Statement | D | Educational Codeforces Round 54 (Rated for Div. 2) {1076} | PROGRAMMING | E | 1800 | |
| 134 | Knightmare (easy) | graphs interactive shortest paths | Statement | E1 | Codeforces Round 577 (Div. 2) {1201} | PROGRAMMING | Codeforces Round #577 (Div 2) Editorial | 2900 | |
| 151 | Knightmare (hard) | graphs interactive shortest paths | Statement | E2 | Codeforces Round 577 (Div. 2) {1201} | PROGRAMMING | Codeforces Round #577 (Div 2) Editorial | 3000 | |
| 8120 | Christmas Trees | graphs greedy shortest paths | Statement | D | Codeforces Round 611 (Div. 3) {1283} | PROGRAMMING | Codeforces Round #611 (Div. 3) Editorial | 1800 | |
| 2305 | Nastya and Unexpected Guest | graphs shortest paths | Statement | C | Codeforces Round 637 (Div. 1) - Thanks, Ivan Belonogov! {1340} | PROGRAMMING | 1250.0 | Codeforces Round #637 Editorial |