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 |
|---|---|---|---|---|---|---|---|---|---|
| 596 | Evacuation | flows graphs shortest paths | Statement | E | Codeforces Beta Round 70 (Div. 2) {78} | PROGRAMMING | 2500 | ||
| 825 | Petya and Pipes | flows graphs shortest paths | Statement | E | Codeforces Round 212 (Div. 2) {362} | PROGRAMMING | 2700 | ||
| 174 | The Doctor Meets Vader (Hard) | flows shortest paths | Statement | B3 | Helvetic Coding Contest 2019 online mirror (teams allowed, unrated) {1184} | PROGRAMMING | helvetic-coding-contest-2019-editorial.pdf | 2700 | |
| 509 | Cow and Exercise | flows graphs shortest paths | Statement | G | Codeforces Round 621 (Div. 1 + Div. 2) {1307} | PROGRAMMING | 3500.0 | Codeforces Round #621 (Div. 1 + Div. 2) Editorial | 3000 |