Calculate in $$$[L, R]$$$ how many numbers whose sum of digits and sum of squares of digits are primes ?
Limit :
$$$1 <= L <= R <= 10 ^ {18}$$$
$$$T <= 10 ^ 4$$$: is the number of queries $$$[L, R]$$$.
For example, in the $$$[1, 20]$$$ there are 4 numbers which are $$$11, 12, 14, 16$$$.
I did digit dp for each query and got TLE
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3690 |
| 2 | jiangly | 3647 |
| 3 | Benq | 3581 |
| 4 | orzdevinwang | 3570 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | Radewoosh | 3509 |
| 8 | ecnerwala | 3486 |
| 9 | jqdai0815 | 3474 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 3 | adamant | 163 |
| 4 | TheScrasse | 159 |
| 5 | nor | 157 |
| 6 | maroonrk | 155 |
| 7 | -is-this-fft- | 152 |
| 8 | Petr | 146 |
| 8 | orz | 146 |
| 10 | pajenegod | 145 |
You can use memorized search to omit some useless status Such as use f[i][j][k] to indicates when number of remaining digits is i,sum of digits at now is j,sum of squares of digits at now is k 's sum of programs.
My English is not good :(
I did it for each query, and got TLE :(
maybe you clear array f in each query However it's not necessary
https://www.geeksforgeeks.org/find-all-numbers-between-range-l-to-r-such-that-sum-of-digit-and-sum-of-square-of-digit-is-prime/
It is not the same problem, look at the constraints.