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 |
|---|---|---|---|---|---|---|---|---|---|
| 1237 | String | string suffix structures | Statement | D | Codeforces Beta Round 92 (Div. 1 Only) {123} | PROGRAMMING | Codeforces Beta Round #92 - Analysis | 2300 | |
| 477 | Good Substrings | string suffix structures | Statement | G2 | ABBYY Cup 3.0 {316} | PROGRAMMING | 2200 | ||
| 503 | Good Substrings | string suffix structures | Statement | G3 | ABBYY Cup 3.0 {316} | PROGRAMMING | 2800 | ||
| 1583 | Fake News (hard) | string suffix structures | Statement | I | Helvetic Coding Contest 2017 online mirror (teams allowed, unrated) {802} | PROGRAMMING | helvetic-coding-contest-2017-editorial.pdf | 2400 | |
| 123 | Permutation Concatenation | string suffix structures | Statement | G | Codeforces Global Round 6 {1266} | PROGRAMMING | Codeforces Global Round 6 Editorial | 3300 | |
| 353 | Asterisk Substrings | string suffix structures | Statement | F | Codeforces Round 606 (Div. 1, based on Technocup 2020 Elimination Round 4) {1276} | PROGRAMMING | Technocup 2020 — Elimination Round 4 + Codeforces Round 606: Editorial | 3300 |