# | User | Rating |
---|---|---|
1 | tourist | 3856 |
2 | jiangly | 3747 |
3 | orzdevinwang | 3706 |
4 | jqdai0815 | 3682 |
5 | ksun48 | 3591 |
6 | gamegame | 3477 |
7 | Benq | 3468 |
8 | Radewoosh | 3462 |
9 | ecnerwala | 3451 |
10 | heuristica | 3431 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | -is-this-fft- | 162 |
3 | Dominater069 | 160 |
4 | Um_nik | 158 |
5 | atcoder_official | 157 |
6 | Qingyu | 156 |
7 | djm03178 | 152 |
7 | adamant | 152 |
9 | luogu_official | 150 |
10 | awoo | 147 |
Name |
---|
https://codeforces.net/contest/1080/problem/E
Thanks a lot man :).
https://csacademy.com/contest/archive/task/palindromic-friendship
https://www.codechef.com/problems/PALIN3
https://leetcode.com/problems/longest-palindromic-substring
Thank you :)
https://www.spoj.com/problems/EPALIN/
This is a very simply formulated but tough problem, where Manacher's algorithm is the first (easy) half of the problem:
https://open.kattis.com/problems/palindromes
But it is good for practicing your palindrome thinking. It took me two weeks to come up with a solution a couple of years ago :)
New problem: https://codeforces.net/contest/1326/problem/D2