题目链接:点这里!!!
题意:给出a,b,求出[a,b]中各位数字之和能整除原数的数的个数(1<=a<=b<=1e18)。
题解:
做的第二道数位dp的题。我们可以枚举各位数字之和,最大也就9*17。
然后我们设dp[i][j][k]为当前为第i位时前i-1位的各位数字之和为j,组成的数的大小为k(对枚举的数取模之后)。然后注意下边界,随便搞就是了。
代码:
#include<cstdio>
#include<cstring>
#include<iostream>
#include<sstream>
#include<algorithm>
#include<vector>
#include<bitset>
#include<set>
#include<queue>
#include<stack>
#include<map>
#include<cstdlib>
#include<cmath>
#define LL long long
#define pb push_back
#define pa pair<int,int>
#define clr(a,b) memset(a,b,sizeof(a))
#define lson lr<<1,l,mid
#define rson lr<<1|1,mid+1,r
#define bug(x) printf("%d++++++++++++++++++++%d\n",x,x)
#define key_value ch[ch[root][1]][0]
#pragma comment(linker, "/STACK:102400000000,102400000000")
const LL MOD = 1000000007;
const int N = 10+15;
const int maxn = 8e3+15;
const int letter = 130;
const int INF = 2e9;
const double pi=acos(-1.0);
const double eps=1e-10;
using namespace std;
inline int read()
{
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
LL x,y;
int b[25],k,q[25][200][200];
LL dp[25][200][200];
///dp[i][j] 表示当前位为i,前面和为j
LL dfs(int sum,int bo,int i,int j,int pc){
if(i==0&&sum==0) return 1LL;
if(i==0) return 0;
if(bo&&q[i][j][sum]) return dp[i][j][sum];
if(bo){
q[i][j][sum]=1;
LL &vs=dp[i][j][sum];
for(int h=0;h<=9;h++){
if(h+j<=pc&&h+j+9*(i-1)>=pc)
vs+=dfs((sum*10+h)%pc,bo,i-1,j+h,pc);
}
return vs;
}
else {
LL vs=0;
for(int h=0;h<=b[i];h++){
if(h+j<=pc&&h+j+9*(i-1)>=pc)
vs+=dfs((sum*10+h)%pc,h!=b[i],i-1,j+h,pc);
}
return vs;
}
}
LL get(LL p){
k=0;
LL x=p;
int vp=0;
while(x){vp+=(int)(x%10),b[++k]=(int)(x%10),x/=10;}
int vs;
if(k==1) vs=b[k];
else vs=b[k]-1+(k-1)*9;
vs=max(vs,vp);
LL ans=0;
for(int i=1;i<=vs;i++){
clr(q,0),clr(dp,0);
ans+=dfs(0,0,k,0,i);
}
return ans;
}
int main(){
cin>>x>>y;
cout << get(y)-get(x-1) << endl;
return 0;
}