Review the problem statement from Codeforces (link will open a new tab). When you've matched your problem, go to the solutions.
Get exact match for tags using this format, eg: [u'brute force', 'dp']
Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 393 | Twilight and Ancient Scroll (easier version) | dp hashing implementation string suffix structures strings | Statement | E1 | Codeforces Round 662 (Div. 2) {1393} | PROGRAMMING | 1500.0 | Codeforces Round #662 Editorial | |
| 382 | Twilight and Ancient Scroll (harder version) | dp implementation string suffix structures strings | Statement | E2 | Codeforces Round 662 (Div. 2) {1393} | PROGRAMMING | 1500.0 | Codeforces Round #662 Editorial | |
| 1433 | Rescue Niwen! | dp string suffix structures strings | Statement | E | Codeforces Round 741 (Div. 2) {1562} | PROGRAMMING | 2750.0 | Editorial of Codeforces Round 741 (Div. 2) | |
| 467 | Missing Separators | dp sortings string suffix structures strings | Statement | H | 2024-2025 ICPC Asia Jakarta Regional Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2045} | PROGRAMMING | 2200 |