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 |
|---|---|---|---|---|---|---|---|---|---|
| 602 | Stack | *special expression parsing implementation | Statement | H | Surprise Language Round 6 {188} | PROGRAMMING | Surprise Language Round #6: editorial | 1900 | |
| 1733 | Vanya and Brackets | brute force dp expression parsing greedy implementation strings | Statement | E | Codeforces Round 308 (Div. 2) {552} | PROGRAMMING | Codeforces #308 (Div. 2) Editorial | 2300 | |
| 9814 | Replace To Make Regular Bracket Sequence | data structures expression parsing math | Statement | C | Educational Codeforces Round 4 {612} | PROGRAMMING | 22299 | 1500 | |
| 3781 | Rebus | constructive algorithms expression parsing greedy math | Statement | A | Codeforces Round 347 (Div. 1) {663} | PROGRAMMING | Editorial for CROC 2016 Finals and Codeforces Round #347 | 1800 | |
| 128 | Long number | expression parsing math number theory | Statement | F | 8VC Venture Cup 2017 - Final Round {756} | PROGRAMMING | 8VC Venture Cup 2017 — Final Round and Codeforces Round #393 Editorial | 3200 | |
| 2229 | Hyperspace Jump (easy) | expression parsing math | Statement | D1 | Helvetic Coding Contest 2018 online mirror (teams allowed, unrated) {958} | PROGRAMMING | helvetic-coding-contest-2018-editorial.pdf | 1500 |