I struggle with following problem: find number of palindromes <= N (1<=N<=10^5000). Also you should use DP. Please help.
# | User | Rating |
---|---|---|
1 | Radewoosh | 3611 |
2 | jiangly | 3597 |
3 | Benq | 3593 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3570 |
6 | cnnfls_csy | 3569 |
7 | tourist | 3565 |
8 | maroonrk | 3487 |
9 | gyh20 | 3447 |
10 | Rebelz | 3409 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
I struggle with following problem: find number of palindromes <= N (1<=N<=10^5000). Also you should use DP. Please help.
Name |
---|
That’s a task B from current long tour of Moscow Open Olympiad. You should be ashamed
damn, should have known already from the fact that this post is written from an alt literally made 8 hours ago
Hi! Here is my full solution: link