Problem Description
A wqb-number, or B-number for short, is a non-negative integer whose decimal form contains the sub- string "13" and can be divided by 13. For example, 130 and 2613 are wqb-numbers, but 143 and 2639 are not. Your task is to calculate how many wqb-numbers from 1 to n for a given integer n.
Input
Process till EOF. In each line, there is one positive integer n(1 <= n <= 1000000000).
Output
Print each answer in a single line.
Sample Input
13 100 200 1000
Sample Output
1 1 2 2
题意:问1~n中包含"13"序列且能被13整除的数有多少个。
思路:记忆化搜索+数位DP;
dp[i][j][k]:i表示位数,j表示被13除的余数;
k==0 不包含13且不以1结尾
k==1 不包含13且以1结尾
k==2 包含13
代码:
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int dp[15][15][3];
int num[15];
int ok(int a,int b)
{
if(a==0)
{
if(b==1) return 1;
else return 0;
}
else if(a==1)
{
if(b==3) return 2;
else if(b==1) return 1;
else return 0;
}
else
return 2;
}
int dfs(int len,int p,int f,int flag)
{
if(len<=0)
return p==0&&f==2;
if(!flag&&dp[len][p][f]!=-1)
return dp[len][p][f];
int end=flag?num[len]:9;
int ans=0;
for(int i=0;i<=end;i++)
{
ans=ans+dfs(len-1,(p*10+i)%13,ok(f,i),flag&&i==end);
}
if(!flag)
dp[len][p][f]=ans;
return ans;
}
int solve(int n)
{
int len=0;
while(n)
{
num[++len]=n%10;
n=n/10;
}
return dfs(len,0,0,1);
}
int main()
{
int n;
while(~scanf("%d",&n))
{
memset(dp,-1,sizeof(dp));
printf("%d\n",solve(n));
}
}