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 |
|---|---|---|---|---|---|---|---|---|---|
| 621 | Trial for Chief | graphs greedy shortest paths | Statement | E | Codeforces Beta Round 37 {37} | PROGRAMMING | Codeforces Beta Round #37 (Tutorial) | 2600 | |
| 432 | Track | graphs greedy shortest paths | Statement | C | Codeforces Beta Round 72 (Div. 1 Only) {83} | PROGRAMMING | 2400 | ||
| 710 | Levko and Game | graphs greedy shortest paths | Statement | E | Codeforces Round 210 (Div. 1) {360} | PROGRAMMING | 2800 | ||
| 8706 | Jzzhu and Cities | graphs greedy shortest paths | Statement | B | Codeforces Round 257 (Div. 1) {449} | PROGRAMMING | Codeforces Round #257 Editorial | 2000 | |
| 4679 | Paths and Trees | graphs greedy shortest paths | Statement | E | Codeforces Round 303 (Div. 2) {545} | PROGRAMMING | 2100 | ||
| 7009 | Fair | graphs greedy number theory shortest paths | Statement | A | Codeforces Round 485 (Div. 1) {986} | PROGRAMMING | Codeforces Round #485 Editorial | 1600 | |
| 5262 | Edge Deletion | graphs greedy shortest paths | Statement | D | Educational Codeforces Round 54 (Rated for Div. 2) {1076} | PROGRAMMING | E | 1800 | |
| 7857 | Christmas Trees | graphs greedy shortest paths | Statement | D | Codeforces Round 611 (Div. 3) {1283} | PROGRAMMING | Codeforces Round #611 (Div. 3) Editorial | 1800 |