G - B-number

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基础题，

代码：

#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;
int a[20];
int dp[20][20][15][15];

int sove(int pos,int b,int qian,int bb,int limit)
{
    if(pos==-1)return bb&&!b;
    if(!limit&&dp[pos][b][qian][bb]!=-1)return dp[pos][b][qian][bb];
    int sum=0;
    int end=limit?a[pos]:9;
    for(int i=0;i<=end;i++)
    {
        if(qian==1&&i==3)sum+=sove(pos-1,(b*10+i)%13,i,1,limit&&(i==a[pos]));
        else sum+=sove(pos-1,(b*10+i)%13,i,bb,limit&&(i==a[pos]));
    }
    if(!limit)dp[pos][b][qian][bb]=sum;
    return sum;
}

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

        printf("%d\n",go(n));
    }
    return 0;
}