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 |
|---|---|---|---|---|---|---|---|---|---|
| 429 | A task for substrings | data structures string suffix structures strings | Statement | G | Codeforces Round 857 (Div. 1) {1801} | PROGRAMMING | 3500.0 | Codeforces Round #857 Editorial | |
| 571 | Polyathlon | data structures hashing string suffix structures strings | Statement | I | 2024-2025 ICPC, NERC, Southern and Volga Russian Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2038} | PROGRAMMING | 2500 |