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 |
|---|---|---|---|---|---|---|---|---|---|
| 9482 | A + B Strikes Back | *special brute force constructive algorithms dsu implementation | Statement | H | April Fools Day Contest 2014 {409} | PROGRAMMING | April Fools Day Contest 2014: editorial | 1700 | |
| 5819 | Voting for Photos | *special constructive algorithms implementation | Statement | A | VK Cup 2016 - Qualification Round 1 {637} | PROGRAMMING | 1500 | ||
| 2523 | Promocodes with Mistakes | *special brute force constructive algorithms implementation | Statement | C | VK Cup 2016 - Qualification Round 1 {637} | PROGRAMMING | 1800 | ||
| 368 | Sweepstake | *special brute force constructive algorithms implementation math | Statement | D | Kotlin Heroes: Episode 8 {1571} | PROGRAMMING | Kotlin Heroes 8 Editorial | ||
| 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 |