HDU3652 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

包含13，并且能被13整除的个数。

记录dp[len][num][sum][flag]表示长度为len，结尾为num，和模13之后的数，和当前是否包含13。

然后记忆化搜索就可以了。

用过的状态，在dp里就应该有相应的体现，缺一不可。

//#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
using namespace std;
typedef long long LL;
const int mod=13;
int l,r;
int dp[20][10][13][2];
int digit[20];
int dfs(int len,int num,int sum,int flag,bool up)
{
    if(!len)return (sum == 0 && flag);
    if(!up && dp[len][num][sum][flag] != -1)return dp[len][num][sum][flag];
    int res = 0;
    int n = up?digit[len] : 9;
    for(int i = 0 ; i <= n ; ++i)
    {
        if(!flag)
        {
            if(num == 1 && i == 3)res += dfs(len-1,i,(sum*10+i)%mod,1,up && i==n);
            else res += dfs(len-1,i,(sum*10+i)%mod,0,up && i==n);
        }
        else res += dfs(len-1,i,(sum*10+i)%mod,1,up && i==n);
    }
    if(!up)dp[len][num][sum][flag] = res;
    return res;
}
int cal(int x)
{
    int len = 0;
    while(x)
    {
        digit[++len] = x % 10;
        x /= 10;
    }
    return dfs(len,0,0,0,1);
}
int main()
{
    memset(dp,-1,sizeof dp);
    while(~scanf("%d",&r))
    {
        printf("%d\n",cal(r));
    }
    return 0;
}