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 |
---|---|---|---|---|---|---|---|---|---|
289 | Presents | *special greedy | Statement | D | Unknown Language Round 1 {64} | PROGRAMMING | 1900 | ||
134 | Greedy Petya | *special dfs and similar graphs greedy | Statement | F | April Fools Day Contest 2013 {290} | PROGRAMMING | April Fools Day Contest 2013: editorial | 2800 | |
1479 | Parallel Programming | *special greedy | Statement | D | Croc Champ 2013 - Qualification Round {291} | PROGRAMMING | 2200 | ||
2501 | Name Quest | *special greedy | Statement | C | VK Cup 2015 - Qualification Round 2 {523} | PROGRAMMING | Разбор задач VK Cup 2015 — Квалификация 2 | 1800 | |
2020 | Running with Obstacles | *special data structures dp greedy | Statement | D | VK Cup 2016 - Qualification Round 1 {637} | PROGRAMMING | 2000 | ||
4095 | Maximum Number | *special constructive algorithms greedy | Statement | C | VK Cup 2017 - Wild Card Round 1 {774} | PROGRAMMING | VK Cup 2017 — Уайлд-кард раунд 1 — Разбор | 1200 | |
122 | Wheels | *special binary search greedy | Statement | F | Kotlin Heroes: Episode 1 {1170} | PROGRAMMING | Kotlin Heroes Editorial | ||
194 | Double Permutation Inc. | *special binary search greedy | Statement | E | Kotlin Heroes: Episode 2 {1211} | PROGRAMMING | Kotlin Heroes: Episode 2 Editorial | 2200 | |
400 | Dream Team | *special greedy | Statement | C | Kotlin Heroes: Episode 3 {1297} | PROGRAMMING | Kotlin Heroes: Episode 3 Editorial | ||
1210 | Boot Camp | *special greedy | Statement | B | Kotlin Heroes: Episode 4 {1346} | PROGRAMMING | Kotlin Heroes: Episode 4 — Editorial | 1400 | |
506 | Constructing the Dungeon | *special graphs greedy | Statement | D | Kotlin Heroes: Episode 4 {1346} | PROGRAMMING | Kotlin Heroes: Episode 4 — Editorial | 1600 |