【数位dp 离散化】CodeForces - 55D A - Beautiful numbers

A - Beautiful numbers CodeForces - 55D 

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).

Examples

Input

1
1 9

Output

9

Input

1
12 15

Output

2

因为问你的是一段区间内有多少数能整除他的所有非零数位
1-9，1，一定能被任何正整数整除，1-9的最小公倍数为2520
而1-2520中真正是1-9中的最小公倍数的只有48个
dp[i][j][k]:因为dp[25][2520][2520]开不下，所以我们要进行适当离散化
index[]数组标记1-2520，哪些是真正的最小公倍数，是第几个
所以dp[i][j][k]:长度为i的数，该数对2520取模为j，它的数位和的最小公倍数是第k个->index[i]




#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int mod=2520;
ll dp[25][mod][55];
int a[25],index[mod+10];

int gcd(int a,int b)
{
    if(b==0) return a;
    else return gcd(b,a%b);
}

int lcm(int a,int b)
{
    return a*b/gcd(a,b);
}

void init()
{
    int num=0;
    for(int i=1;i<=mod;i++)
    {
        if(mod%i==0)
            index[i]=++num;
    }
}

ll dfs(int pos,int presum,int prelcm,bool limit)
{
    if(pos==0) return presum%prelcm==0;//数能整除数位和，return 1，否则return 0
    if(!limit&&dp[pos][presum][index[prelcm]]!=-1) return dp[pos][presum][index[prelcm]];
    int up=limit?a[pos]:9;
    ll ans=0;
    for(int i=0;i<=up;i++)
    {
        int nowsum=(presum*10+i)%2520;
        int nowlcm=prelcm;
        if(i) nowlcm=lcm(nowlcm,i);
        ans+=dfs(pos-1,nowsum,nowlcm,limit&&i==a[pos]);
    }
    if(!limit) dp[pos][presum][index[prelcm]]=ans;
    return ans;
}

ll solve(ll x)
{
    int pos=0;
    while(x)
    {
        a[++pos]=x%10;
        x/=10;
    }
    return dfs(pos,0,1,1);
}

int main()
{
    int T;
    cin>>T;
    init();
    memset(dp,-1,sizeof(dp));
    while(T--)
    {
        ll n,m;
        cin>>n>>m;
        cout<<solve(m)-solve(n-1)<<endl;
    }
    return 0;
}