P2602-数位dp

P2602

题目描述

题解

分别计算每一个数字，数位dp

代码

#include<bits/stdc++.h>
#define int long long
using namespace std;
int dp[20][20],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,bool limit,bool lead,int num){
	if(pos==-1) return sum;
	if(!limit&&!lead&&dp[pos][sum]!=-1) return dp[pos][sum];
	int up=limit?a[pos]:9,ans=0;
	for(int i=0;i<=up;i++)
		ans+=dfs(pos-1,sum+((!lead||i)&&(i==num)),limit&&(i==a[pos]),lead&&(i==0),num);//注意判断前导0 
	if(!limit&&!lead) dp[pos][sum]=ans;
	return ans;
}
int solve(int x,int num){
	int tot=0;
	while(x){
		a[tot++]=x%10;
		x/=10;
	}memset(dp,-1,sizeof(dp));
	return dfs(tot-1,0,1,1,num);
}
signed main(){
	n=read(),m=read();
	for(int i=0;i<10;i++)
		printf("%lld ",solve(m,i)-solve(n-1,i));//考虑分别计算每一个数字 
	printf("\n");
	return 0;
}