求区间的内的数,能被该数上的每一位整除。
求1-9的lcm
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <string>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <cmath>
using namespace std;
#include <queue>
#include <stack>
#include <vector>
#include <deque>
#include <set>
#include <map>
#define cler(arr, val) memset(arr, val, sizeof(arr))
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define IN freopen ("in.txt" , "r" , stdin);
#define OUT freopen ("out.txt" , "w" , stdout);
typedef long long LL;
const int MAXN = 1011;
const int MAXM = 610;
const int INF = 0x3f3f3f3f;
const LL mod = 2147483647;
const double eps= 1e-8;
const double pi=acos(-1.0);
#define lson l,m, rt<<1
#define rson m+1,r,rt<<1|1int len,dig[66];
int len,dig[66],index[3000];
LL dp[20][5000][100];
int lcm(int x,int y)
{
int sum=x*y;
while(x)
{
y=y%x;
swap(x,y);
}
return sum/y;
}
void init()
{
int num=0;
for(int i=1;i<=2520;i++)
if(2520%i==0)
index[i]=num++;
}
LL dfs(int pos,int s,int lc,int limit)
{
if(pos<0)
return s%lc==0;
if(!limit&&dp[pos][s][index[lc]]!=-1)
return dp[pos][s][index[lc]];
LL res=0;
int last=limit?dig[pos]:9;
for(int i=0;i<=last;i++)
{
res+=dfs(pos-1,(s*10+i)%2520,i==0?lc:lcm(lc,i),limit&&(i==last));
}
if(!limit)
dp[pos][s][index[lc]]=res;
return res;
}
LL solve(LL x)
{
len=0;
while(x)
{
dig[len++]=x%10;
x/=10;
}
return dfs(len-1,0,1,1);
}
int main()
{
LL t,x,y;
cin>>t;
init();
cler(dp,-1);
while(t--)
{
cin>>x>>y;
cout<<solve(y)-solve(x-1)<<endl;
}
return 0;
}