Codeforces-55D Beautiful numbers

数位DP第一题

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
const int N=20;
const int M=2520;
typedef long long ll;
ll d[N][50][M+10];
int dis[N],hash[M+10];
ll gcd(ll a,ll b)
{
	return b?gcd(b,a%b):a;
}
ll dfs(int len,int num,int lcm,bool flag)
{
	if(len==-1) return num%lcm==0;
	int hlcm=hash[lcm];
	if(!flag&&~d[len][hlcm][num]) return d[len][hlcm][num];
	ll ans=0;
    int end=flag?dis[len]:9;
    for(int i=0;i<=end;i++)
        ans+=dfs(len-1,(num*10+i)%M,i?lcm*i/gcd(lcm,i):lcm,flag&&i==end);
    if(!flag) d[len][hlcm][num]=ans;
    return ans;
}
ll solve(ll n)
{
	int pos=0;
	while(n)
	{
		dis[pos++]=n%10;
		n/=10;
	}
	return dfs(pos-1,0,1,1);
}
int main()
{
	int T;
	scanf("%d",&T);
	int cnt=0;
	for(int i=1;i<=M;i++)
		if(M%i==0)
			hash[i]=cnt++;
	memset(d,-1,sizeof(d));
	ll l,r;
	while(T--)
	{
		scanf("%lld%lld",&l,&r);
		printf("%lld\n",solve(r)-solve(l-1));
	}
	return 0;
}