hdu_3555_Bomb(数位DP)

题目连接：hdu_3555_Bomb

题意：和2089一样，只是数据大了点，不过道理是一样的

 #include<cstdio>
 #include<cstring>
 #define F(i,a,b) for(__int64 i=a;i<=b;i++)

 __int64 t,n,dp[][][],dig[],len;

 __int64 dfs(int pos,int pre,bool have,bool inf){
     if(!pos)return have;
     if(!inf&&dp[pos][pre][have]!=-)return dp[pos][pre][have];
     long long end=inf?dig[pos]:,ans=;
     F(i,,end)if(pre==&&i==)ans+=dfs(pos-,i,,inf&&(i==end));
     else ans+=dfs(pos-,i,have,inf&&(i==end));
     if(!inf)dp[pos][pre][have]=ans;
     return ans;
 }

 int main(){
     memset(dp,-,sizeof(dp));
     scanf("%I64d",&t);
     while(t--){
         scanf("%I64d",&n);
         for(len=;n;n/=)dig[++len]=n%;
         printf("%I64d\n",dfs((int)len,,,));
     }
     return ;
 }