Does anyone know how to solve this problem?
http://www.spoj.com/problems/LQDNUMS/
Or at least please give me the references for it. Thanks a lot in advance.
# | User | Rating |
---|---|---|
1 | tourist | 3947 |
2 | jiangly | 3734 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | ecnerwala | 3581 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | ksun48 | 3479 |
# | User | Contrib. |
---|---|---|
1 | awoo | 162 |
2 | maomao90 | 160 |
3 | nor | 156 |
4 | cry | 155 |
4 | adamant | 155 |
4 | atcoder_official | 155 |
4 | -is-this-fft- | 155 |
8 | maroonrk | 153 |
9 | SecondThread | 147 |
10 | Petr | 146 |
Does anyone know how to solve this problem?
http://www.spoj.com/problems/LQDNUMS/
Or at least please give me the references for it. Thanks a lot in advance.
Name |
---|
I have some ideas to solve it in polynomial time, but it's too slow.
Let F(N) be the length of the result string. We have to find N, such that F(N) == M.
Use binary search to find N. F(N) can be calculated using DP and fast matrix exponentiation. I know how to do it with about 18-36 matrices of size K x K, K ~ 18 * 10 * 2.
No, i was wrong with matrix exponentiation. I think there is kind of dp, we have to divide iterval [1..N] into several ones with the same prefix. for example for N = 1234 ther will be
[1..999] for all numbers with length < length(N)
[1000..1199] — 1 234
[1200..1229] — 12 34
[1230..1234] — 123 4
for each of these intervals we have to use this dp recursively.