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 |
|---|---|---|---|---|---|---|---|---|---|
| 356 | Table | *special greedy implementation math | Statement | C | Unknown Language Round 1 {64} | PROGRAMMING | 1700 | ||
| 499 | LCM | *special implementation math | Statement | C | Surprise Language Round 6 {188} | PROGRAMMING | Surprise Language Round #6: editorial | 1400 | |
| 3059 | Maximize Sum of Digits | *special implementation math | Statement | B | VK Cup 2017 - Qualification 2 {770} | PROGRAMMING | Tutorial of VK Cup 2017 Qualification Round 2 | 1700 | |
| 75 | Chess Rush | *special combinatorics dp implementation math | Statement | C | Central-European Olympiad in Informatics, CEOI 2020, Day 2 (IOI, Unofficial Mirror Contest, Unrated) {1403} | PROGRAMMING | CEOI 2020 Online Mirror — Day 2 Tutorial | ||
| 1130 | Travel to Bertown | *special implementation math | Statement | A | Kotlin Heroes: Episode 7 {1533} | PROGRAMMING | Kotlin Heroes 7 — Editorial | ||
| 368 | Sweepstake | *special brute force constructive algorithms implementation math | Statement | D | Kotlin Heroes: Episode 8 {1571} | PROGRAMMING | Kotlin Heroes 8 Editorial |