G - B-number HDU - 3652 (数位dp)

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

#include <stdio.h>
#include <algorithm>
#include<string.h>
using namespace std;
int a[20];
int dp[20][10][20][2];
int dfs(int pos,int pre,int kk,int stast ,bool limit)
{
    if(pos==-1)
    {
        if(stast&&kk==0) return 1;
        return 0;
    }
    if(!limit&&dp[pos][pre][kk][stast]!=-1) return dp[pos][pre][kk][stast];
    int up=limit?a[pos]:9;
    int tmp=0;
    for(int i=0;i<=up;i++)
    {
        if(pre==1&&i==3)
            tmp+=dfs(pos-1,i,(kk*10+i)%13,1,limit&&i==a[pos]);
        else
            tmp+=dfs(pos-1,i,(kk*10+i)%13,stast,limit&&i==a[pos]);
    }
    if(!limit) dp[pos][pre][kk][stast]=tmp;
    return tmp;
}
int slove(int x)
{
    int cnt=0;
    while(x)
    {
        a[cnt++]=x%10;
        x=x/10;
    }
    return dfs(cnt-1,0,0,0,true);
}
int main()
{
    memset(dp,-1,sizeof(dp));
    int n;
    while(~scanf("%d",&n))
        printf("%d\n",slove(n));
    
}