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 |
|---|---|---|---|---|---|---|---|---|---|
| 114 | Table Bowling | *special sortings | Statement | H | Unknown Language Round 1 {64} | PROGRAMMING | 2300 | ||
| 89 | Sort the Table | *special sortings | Statement | I | Unknown Language Round 1 {64} | PROGRAMMING | 2500 | ||
| 167 | Array sorting | *special sortings | Statement | I | Unknown Language Round 4 {130} | PROGRAMMING | Unknown Language Round #4: editorial | 2400 | |
| 1463 | Phone Talks | *special dp sortings | Statement | E | VK Cup 2012 Qualification Round 1 {158} | PROGRAMMING | 2300 | ||
| 3807 | Matchmaker | *special greedy sortings | Statement | B | VK Cup 2012 Qualification Round 2 {159} | PROGRAMMING | 1800 | ||
| 1001 | Zebra Tower | *special data structures greedy sortings | Statement | E | VK Cup 2012 Qualification Round 2 {159} | PROGRAMMING | Simple solution to vk cup Qualification Round 1 and 2 | 2100 | |
| 1146 | Bus | *special implementation sortings | Statement | C | Croc Champ 2012 - Qualification Round {172} | PROGRAMMING | 1900 | ||
| 6102 | Spyke Talks | *special implementation sortings | Statement | A | Croc Champ 2013 - Qualification Round {291} | PROGRAMMING | 1900 | ||
| 17032 | Chat Order | *special binary search constructive algorithms data structures sortings | Statement | B | VK Cup 2016 - Qualification Round 1 {637} | PROGRAMMING | 1500 | ||
| 5773 | Year of University Entrance | *special implementation sortings | Statement | A | VK Cup 2017 - Qualification 1 {769} | PROGRAMMING | Tutorial | 1500 | |
| 1954 | Lie or Truth | *special constructive algorithms sortings | Statement | D | VK Cup 2017 - Wild Card Round 1 {774} | PROGRAMMING | 1500 | ||
| 489 | Ice Cream | *special greedy sortings | Statement | C | Kotlin Heroes: Episode 2 {1211} | PROGRAMMING | Kotlin Heroes: Episode 2 Editorial | 2000 | |
| 262 | Bonus Distribution | *special binary search greedy sortings | Statement | D | Kotlin Heroes: Episode 3 {1297} | PROGRAMMING | Kotlin Heroes: Episode 3 Editorial | ||
| 117 | Movie Fan | *special data structures greedy implementation sortings | Statement | F | Kotlin Heroes: Episode 3 {1297} | PROGRAMMING | Kotlin Heroes: Episode 3 Editorial | ||
| 414 | Cartoons | *special implementation sortings | Statement | B | Kotlin Heroes: Episode 3 {1297} | PROGRAMMING | Kotlin Heroes: Episode 3 Editorial | ||
| 608 | Spring Cleaning | *special greedy sortings | Statement | C | Kotlin Heroes: Episode 4 {1346} | PROGRAMMING | Kotlin Heroes: Episode 4 — Editorial | 1600 |