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 |
|---|---|---|---|---|---|---|---|---|---|
| 194 | Goshtasp, Vishtasp and Eidi | *special greedy math | Statement | A | Unknown Language Round 2 {72} | PROGRAMMING | 1900 | ||
| 2654 | Friends or Not | *special greedy implementation | Statement | A | VK Cup 2012 Qualification Round 2 {159} | PROGRAMMING | Simple solution to vk cup Qualification Round 1 and 2 | 1700 | |
| 182 | Rock-Paper-Scissors Bot | *special greedy strings | Statement | E | Kotlin Heroes: Episode 11 {2011} | PROGRAMMING | Kotlin Heroes 11 — Editorial |