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 |
|---|---|---|---|---|---|---|---|---|---|
| 1061 | Expression | *special expression parsing | Statement | B | Unknown Language Round 1 {64} | PROGRAMMING | 1500 | ||
| 195 | Domain | *special expression parsing | Statement | F | Unknown Language Round 1 {64} | PROGRAMMING | 2100 | ||
| 84 | Perse-script | *special expression parsing | Statement | D | Unknown Language Round 2 {72} | PROGRAMMING | 2400 | ||
| 316 | BHTML+BCSS | *special dfs and similar expression parsing | Statement | E | Чемпионат КРОК 2012 - Квалификационный раунд {172} | PROGRAMMING | 2500 | ||
| 719 | Stack | *special expression parsing implementation | Statement | H | Surprise Language Round 6 {188} | PROGRAMMING | Surprise Language Round #6: editorial | 1900 | |
| 14380 | Are You a Robot? | *special *special *special expression parsing | Statement | A | April Fools Day Contest 2023 {1812} | PROGRAMMING | Editorial of April Fools Day Contest 2023 | ||
| 643 | Mysterious Script | *special expression parsing | Statement | I | April Fools Day Contest 2025 {2095} | PROGRAMMING | April Fools Day Contest 2025 Editorial |