P4127-数位dp

P4127

题目描述

题解

考虑枚举数字和，然后进行数位dp

代码

#include<bits/stdc++.h>
#define int long long
using namespace std;
int dp[20][200][200],a[100],n,m;
int read(){
	int f=1,re=0;char ch;
	for(ch=getchar();!isdigit(ch)&&ch!='-';ch=getchar());
	if(ch=='-'){f=-1,ch=getchar();}
	for(;isdigit(ch);ch=getchar()) re=(re<<3)+(re<<1)+ch-'0';
	return re*f;
}
int dfs(int pos,int sum,int val,int mod,bool limit){
	if(sum<0) return 0;//如果大于限制的数字和，不合法 
	if(pos==-1) return sum==0&&val==0;
	if(!limit&&dp[pos][sum][val]!=-1) return dp[pos][sum][val];
	int up=limit?a[pos]:9,ans=0;
	for(int i=0;i<=up;i++)
		ans+=dfs(pos-1,sum-i,(val*10+i)%mod,mod,limit&&(i==a[pos]));
	if(!limit) dp[pos][sum][val]=ans;
	return ans;
}
int solve(int x){
	int tot=0,ans=0;
	while(x){
		a[tot++]=x%10;
		x/=10;
	}
	for(int i=1;i<=tot*9;i++){//枚举数字和 
		memset(dp,-1,sizeof(dp));
		ans+=dfs(tot-1,i,0,i,1); 
	}return ans;
}
signed main(){
	memset(dp,-1,sizeof(dp));
	int l=read(),r=read();
	printf("%lld\n",solve(r)-solve(l-1));
	return 0;
}