Review the problem statement from Codeforces (link will open a new tab). When you've matched your problem, go to the solutions.
Search on plain tags, ratings, names, and problem text. Example: brute force or binary search
Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 122 | Table Bowling | *special sortings | Statement | H | Unknown Language Round 1 {64} | PROGRAMMING | 2300 | ||
| 94 | Sort the Table | *special sortings | Statement | I | Unknown Language Round 1 {64} | PROGRAMMING | 2500 | ||
| 191 | Array sorting | *special sortings | Statement | I | Unknown Language Round 4 {130} | PROGRAMMING | Unknown Language Round #4: editorial | 2400 | |
| 1537 | Phone Talks | *special dp sortings | Statement | E | VK Cup 2012 Qualification Round 1 {158} | PROGRAMMING | Simple solution to vk cup Qualification Round 1 and 2 | 2300 | |
| 4173 | Matchmaker | *special greedy sortings | Statement | B | VK Cup 2012 Qualification Round 2 {159} | PROGRAMMING | Simple solution to vk cup Qualification Round 1 and 2 | 1800 | |
| 1096 | 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 | |
| 1257 | Bus | *special implementation sortings | Statement | C | Croc Champ 2012 - Qualification Round {172} | PROGRAMMING | 1900 | ||
| 6468 | Spyke Talks | *special implementation sortings | Statement | A | Croc Champ 2013 - Qualification Round {291} | PROGRAMMING | 1900 | ||
| 22465 | Chat Order | *special binary search constructive algorithms data structures sortings | Statement | B | VK Cup 2016 - Qualification Round 1 {637} | PROGRAMMING | 1500 | ||
| 1000 | Hostname Aliases | *special binary search data structures implementation sortings strings | Statement | C | CROC 2016 - Qualification {644} | PROGRAMMING | 2300 | ||
| 6408 | Year of University Entrance | *special implementation sortings | Statement | A | VK Cup 2017 - Qualification 1 {769} | PROGRAMMING | Tutorial | 1500 | |
| 2105 | Lie or Truth | *special constructive algorithms sortings | Statement | D | VK Cup 2017 - Wild Card Round 1 {774} | PROGRAMMING | VK Cup 2017 — Уайлд-кард раунд 1 — Разбор | 1500 | |
| 565 | Ice Cream | *special greedy sortings | Statement | C | Kotlin Heroes: Episode 2 {1211} | PROGRAMMING | Kotlin Heroes: Episode 2 Editorial | 2000 | |
| 274 | Bonus Distribution | *special binary search greedy sortings | Statement | D | Kotlin Heroes: Episode 3 {1297} | PROGRAMMING | Kotlin Heroes: Episode 3 Editorial | ||
| 127 | Movie Fan | *special data structures greedy implementation sortings | Statement | F | Kotlin Heroes: Episode 3 {1297} | PROGRAMMING | Kotlin Heroes: Episode 3 Editorial | ||
| 429 | Cartoons | *special implementation sortings | Statement | B | Kotlin Heroes: Episode 3 {1297} | PROGRAMMING | Kotlin Heroes: Episode 3 Editorial | ||
| 677 | Spring Cleaning | *special greedy sortings | Statement | C | Kotlin Heroes: Episode 4 {1346} | PROGRAMMING | Kotlin Heroes: Episode 4 — Editorial | 1600 | |
| 141 | Mixture | *special data structures geometry math sortings | Statement | B | Baltic Olympiad in Informatics 2020, Day 1 (IOI, Unofficial Mirror Contest, Unrated) {1386} | PROGRAMMING | T | ||
| 1349 | Fancy Fence | *special data structures dp dsu math sortings | Statement | A | Central-European Olympiad in Informatics, CEOI 2020, Day 1 (IOI, Unofficial Mirror Contest, Unrated) {1402} | PROGRAMMING | Editorial | ||
| 129 | Roads | *special geometry sortings | Statement | B | Central-European Olympiad in Informatics, CEOI 2020, Day 1 (IOI, Unofficial Mirror Contest, Unrated) {1402} | PROGRAMMING | Editorial | ||
| 312 | The Potion of Great Power | *special binary search data structures graphs interactive sortings two pointers | Statement | A | Central-European Olympiad in Informatics, CEOI 2020, Day 2 (IOI, Unofficial Mirror Contest, Unrated) {1403} | PROGRAMMING | CEOI 2020 Online Mirror — Day 2 Tutorial | ||
| 589 | Teams Forming | *special sortings | Statement | D | Kotlin Heroes: Practice 7 {1532} | PROGRAMMING | |||
| 175 | Almost Certainly | *special constructive algorithms data structures sortings | Statement | D | XVIII Open Olympiad in Informatics - Final Stage, Day 2 (Unrated, Online Mirror, IOI rules) {1940} | PROGRAMMING | |||
| 270 | Three Arrays | *special constructive algorithms implementation sortings | Statement | B | XVIII Open Olympiad in Informatics - Final Stage, Day 2 (Unrated, Online Mirror, IOI rules) {1940} | PROGRAMMING | |||
| 43 | Burenka and Pether | *special data structures dfs and similar divide and conquer dsu graphs sortings trees | Statement | C | XVIII Open Olympiad in Informatics - Final Stage, Day 2 (Unrated, Online Mirror, IOI rules) {1940} | PROGRAMMING | |||
| 678 | Cute Subsequences | *special sortings | Statement | D | XIX Open Olympiad in Informatics - Final Stage, Day 1 (Unrated, Online Mirror, IOI rules) {2079} | PROGRAMMING | |||
| 61 | Good Robot Paths | *special data structures geometry sortings | Statement | G | Kotlin Heroes: Episode 13 {2141} | PROGRAMMING | Kotlin Heroes 13 Editorial |