Codeforces 55D. Beautiful numbers 数位DP 离散化

题意：定义一个数为beautiful number，则这个数可以被其每位数整除，给出左右边界l和r，求出边界内存在的beautiful number个数
思路：数据量太大(9*10^18)，故先要离散化，之后用数位DP对每位进行枚举，求出当前数位漂亮数字个数，递归求出答案。lcm表示a，b的最小公倍数，用来求各位数的最小公倍数，len表示枚举边界，即数位长度，lim表示是否最高位，用来求枚举上界

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<vector>
#include<queue>
#include<map>
#include<algorithm>
using namespace std;
typedef long long ll;
const int maxn = 2520+5;
const int inf = 0x3f3f3f3f;
int index[maxn], dis[maxn];
ll dp[30][maxn][50], l, r;
int gcd(int a, int b)
{
	if (!b)
		return a;
	return gcd(b, a%b);
}
int lcm(int a, int b)
{
	return a/gcd(a, b)*b;
}
ll dfs(int len, int sum, int lc, int lim)
{
	if (len == -1) return sum%lc == 0 ? 1 : 0;
	if (!lim && dp[len][sum][index[lc]] != -1)
		return dp[len][sum][index[lc]];
	ll res = 0;
	int up = lim ? dis[len] : 9;
	for (int i = 0; i <= up; i++) {
		int cur = (sum*10+i)%2520;
		int llc = lc;
		if (i)
			llc = lcm(lc, i);
		res += dfs(len-1, cur, llc, lim&&i==up);
	}
	if (lim) return res;
	else return dp[len][sum][index[lc]] = res;
}
ll solve(ll x)
{
	int len = 0;
	while (x) {
		dis[len++] = x%10;
		x /= 10;
	}
	return dfs(len-1, 0, 1, 1);
}
int main()
{
	int T, num = 0;
	cin >> T;
	for (int i = 1; i <= 2520; i++)
		if (2520%i == 0)
			index[i] = num++;
	memset(dp, -1, sizeof(dp));
	while (T--) {
		cin >> l >> r;
		cout << solve(r)-solve(l-1) << "\n";
	}
	return 0; 
}