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 |
---|---|---|---|---|---|---|---|---|---|
676 | Have You Ever Heard About the Word? | greedy hashing string suffix structures strings | Statement | D | Codeforces Round 189 (Div. 1) {319} | PROGRAMMING | Codeforces Round #189 — Editorial | 2700 | |
15036 | Vitaliy and Pie | greedy hashing strings | Statement | A | Codeforces Round 297 (Div. 2) {525} | PROGRAMMING | 1200 | ||
3984 | Tavas and Malekas | greedy hashing string suffix structures strings | Statement | D | Codeforces Round 299 (Div. 2) {535} | PROGRAMMING | 2100 | ||
6242 | Camp Schedule | greedy hashing strings | Statement | B | Codeforces Round 545 (Div. 1) {1137} | PROGRAMMING | Codeforces Round #545 – Editorial | 1700 | |
10381 | Prefix-Suffix Palindrome (Hard version) | greedy hashing string suffix structures strings | Statement | D2 | Codeforces Global Round 7 {1326} | PROGRAMMING | 1000.0 | 74961 | 1800 |