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 |
|---|---|---|---|---|---|---|---|---|---|
| 777 | Defining Macros | dp expression parsing implementation | Statement | E | Codeforces Beta Round 7 {7} | PROGRAMMING | 2500 | ||
| 610 | Widget Library | dp expression parsing graphs implementation | Statement | B | Codeforces Beta Round 74 (Div. 1 Only) {89} | PROGRAMMING | Solutions for Codeforces Beta Round #74 | 2200 | |
| 452 | Unambiguous Arithmetic Expression | dp expression parsing | Statement | D | Codeforces Beta Round 87 (Div. 1 Only) {115} | PROGRAMMING | Tutorial | 2600 | |
| 367 | Formurosa | divide and conquer dp expression parsing | Statement | C | Codeforces Round 134 (Div. 1) {217} | PROGRAMMING | Editorial for Codeforces Round #134 | 2500 | |
| 1734 | 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 | |
| 547 | Boolean Function | bitmasks dp expression parsing | Statement | E | Codeforces Round 323 (Div. 1) {582} | PROGRAMMING | Codeforces Round #323 Editorial | 2900 |