hdu 3652 B-number(数位dp)

B-number

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 7199 Accepted Submission(s): 4216

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

dp[pos][pre][stat][r][limit];
pos :当前位；
pre：当前位的前一位
stat：是否满足存在一个“13”字串
limit：是否存在前一位的限制

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <cmath>
#include <cstring>
#include <string>
using namespace std;
int dp[10][10][2][13][2];
int a[10];
int dfs(int pos,int pre,int stat,int r,int limit){
    if (pos==-1) return ((r==0)&&stat);
    if (!limit&&dp[pos][pre][stat][r][limit]!=-1) return dp[pos][pre][stat][r][limit];
    int up=limit?a[pos]:9;
    int ans=0;
    for (int i=0;i<=up;i++){
        if (pre==1&&i==3) ans+=dfs(pos-1,i,1,(r*10+i)%13,limit&&i==a[pos]);
        else ans+=dfs(pos-1,i,stat,(r*10+i)%13,limit&&i==a[pos]);  
    }
    if (!limit) dp[pos][pre][stat][r][limit]=ans;
    return ans;

}
int solve(int x){
    int pos=0;
    while (x){
        a[pos++]=x%10;
        x/=10;
    }
    return dfs(pos-1,0,0,0,1);
}
int main()
{   
    int n;
    memset(dp,-1,sizeof(dp));
    while (~scanf("%d",&n)){
        printf("%d\n",solve(n));
    }
}