HDU3652 B-number(数位dp 深搜版本)

B-number

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


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


Author
wqb0039


Source
2010 Asia Regional Chengdu Site —— Online Contest

依旧数位dp，只是这里多记录了一个状态，能否被13整除，那么我们就多加一个变量mod记录当前
的mod值，加了一个状态，然后dfs就可以了。

#include<iostream>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<cctype>
#include<cmath>
#include<ctime>
#include<string>
#include<stack>
#include<deque>
#include<queue>
#include<list>
#include<set>
#include<map>
#include<cstdio>
#include<limits.h>
#define MOD 1000000007
#define fir first
#define sec second
#define fin freopen("/home/ostreambaba/文档/input.txt", "r", stdin)
#define fout freopen("/home/ostreambaba/文档/output.txt", "w", stdout)
#define mes(x, m) memset(x, m, sizeof(x))
#define Pii pair<int, int>
#define Pll pair<ll, ll>
#define INF 1e9+7
#define inf 0x3f3f3f3f

#define Pi 4.0*atan(1.0)
#define Sqrt(x) (x)*(x)

#define lowbit(x) (x&(-x))
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1

typedef long long ll;
typedef unsigned long long ull;
const double eps = 1e-12;
const int maxn = 3000;
const int maxm = 1500;
using namespace std;
inline int read(){
    int x(0),f(1);
    char ch=getchar();
    while (ch<'0'||ch>'9') {if (ch=='-') f=-1;ch=getchar();}
    while (ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
    return x*f;
}
int f[20][13][3];
int bit[20];
inline int dfs(int pos,int st,bool flag,int mod)
{
    if(pos==0){
        return (st==2&&mod==0);
    }
    if(!flag&&~f[pos][mod][st]){
        return f[pos][mod][st];
    }
    int ret=0;
    int x=flag?bit[pos]:9;
    for(int i=0;i<=x;++i){
        int tmp=(mod*10+i)%13;
        if((st==2)||(st==1&&i==3)){
            ret+=dfs(pos-1,2,flag&&i==bit[pos],tmp);
        }
        else if(i==1){
            ret+=dfs(pos-1,1,flag&&i==bit[pos],tmp);
        }
        else{
            ret+=dfs(pos-1,0,flag&&i==bit[pos],tmp);
        }
    }
    if(!flag){
        f[pos][mod][st]=ret;
    }
    return ret;
}
int calc(ll n)
{
    int k=0;
    while(n)
    {
        bit[++k]=n%10;
        n/=10;
    }
    return dfs(k,0,true,0);
}
int main()
{
    ll l;
    mes(f,-1);
    while(~scanf("%d",&l)){
        cout<<calc(l)<<endl;
    }
    return 0;
}