B-number HDU - 3652

基本数位dp

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#define ll long long
using namespace std;
int dp[20][15][5];
int digit[20];
ll dfs(int len,int num,int first,int limit)
{
	if(len==0) return num==0&&first==2;
	if(!limit&&dp[len][num][first]!=-1) return dp[len][num][first];
	int up=(limit?digit[len]:9);
	ll ans=0;
	for(int i=0;i<=up;i++)
	{
		if(first==1&&i==3) ans+=dfs(len-1,(num*10+i)%13,2,limit&&(i==up));
        else if(first==2) ans+=dfs(len-1,(num*10+i)%13,2,limit&&(i==up));
		else  ans+=dfs(len-1,(num*10+i)%13,i==1,limit&&(i==up));
		
	}
	if(!limit) dp[len][num][first]=ans;
	return ans;
}
ll solve(ll x)
{
	int len=0;
	while(x)
	{
		digit[++len]=x%10;
		x/=10;
		
	}
	return dfs(len,0,0,1);
}
int main()
{
	ll n;
	while(scanf("%lld",&n)!=EOF)
	{
		memset(dp,-1,sizeof(dp));
		printf("%lld\n",solve(n));
	}
}