| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3993 |
| 2 | jiangly | 3743 |
| 3 | orzdevinwang | 3707 |
| 4 | Radewoosh | 3627 |
| 5 | jqdai0815 | 3620 |
| 6 | Benq | 3564 |
| 7 | Kevin114514 | 3443 |
| 8 | ksun48 | 3434 |
| 9 | Rewinding | 3397 |
| 10 | Um_nik | 3396 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 155 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 10 | nor | 152 |
One of the most positive things in codeforces is that we can see different approaches to solutions to the same problem.
For example to the problem 246D of today.
Approaches:
Suffix Automaton — 6626607
String Hashes — 6625476
Suffix Array — 6630083
Z-Algorithm — 6624439
KMP — 6627491
and many others, just we need find them. You have find another?
Nothing to say)
There is also suffix tree solution 6651814
I have a solution that uses suffix array + LCP pre computation + hashing + two pointers. Got WA at test 29, because I used
unsigned long longin the hashing part to avoid modulo. Never gonna make the same mistake :) Here is the corrected code: http://codeforces.me/contest/432/submission/6632179