CodeForces 55D Beautiful numbers

  • 2018-09-26
  • 13
  • 0

D. Beautiful numbers

Description:

Volodya is an odd boy and his taste is strange as well. It seems to him that a positive integer number is beautiful if and only if it is divisible by each of its nonzero digits. We will not argue with this and just count the quantity of beautiful numbers in given ranges.

Input:

The first line of the input contains the number of cases t (1 ≤ t ≤ 10). Each of the next t lines contains two natural numbers li and ri (1 ≤ li ≤ ri ≤ 9 ·1018).
Please, do not use %lld specificator to read or write 64-bit integers in C++. It is preffered to use cin (also you may use %I64d).

Output

Output should contain t numbers — answers to the queries, one number per line — quantities of beautiful numbers in given intervals (from li to ri, inclusively).

Sample Input:

1
1 9

Sample Output:

9

Sample Input:

1
12 15

Sample Output:

2

题目链接

数位dp从高数位向低数位记忆化搜索。

AC代码:

评论

还没有任何评论,你来说两句吧