HDU 4722 Good Numbers(DP)

题目链接

脑子有点乱，有的地方写错了，尚大婶鄙视了。。。

来个模版的。

 #include <iostream>
 #include <cstdio>
 #include <cstring>
 using namespace std;
 #define LL __int64
 LL dp[][];
 int num[];
 LL dfs(int pos,int pre,int bound)
 {
     int end,tpre,i;
     LL ans = ;
     if(pos == -)
     return pre == ;
     if(!bound&&dp[pos][pre] != -)
     return dp[pos][pre];
     end = bound ? num[pos] : ;
     for(i = ;i <= end;i ++)
     {
         tpre = (pre + i)%;
         ans += dfs(pos-,tpre,bound&&i == end);
     }
     if(!bound)
     dp[pos][pre] = ans;
     return ans;
 }
 LL judge(LL x)
 {
     int pos = ;
     if(x < )
     return ;
     while(x)
     {
         num[pos++] = x%;
         x = x/;
     }
     return dfs(pos-,,);
 }
 int main()
 {
     int t,cas = ;
     LL x,y;
     memset(dp,-,sizeof(dp));
     scanf("%d",&t);
     while(t--)
     {
         scanf("%I64d%I64d",&x,&y);
         printf("Case #%d: ",cas++);
         printf("%I64d\n",judge(y)-judge(x-));
     }
     return ;
 }

 #include <iostream>
 #include <cstdio>
 #include <cstring>
 #include <queue>
 #include <map>
 #include <ctime>
 #include <cmath>
 #include <algorithm>
 using namespace std;
 #define LL __int64
 LL dp[][];
 LL judge(LL x)
 {
     int num[],n = ,sum,i,j;
     LL ans = ;
     if(x < )
     return ;
     else if(x == )
     return ;
     while(x)
     {
         num[n ++] = x%;
         x /= ;
     }
     if(n == )
     return ;
     ans = dp[n-][];
     for(i = ;i < num[n-];i ++)
     {
         ans += dp[n-][-i];
     }
     sum = num[n-];
     for(i = n-;i >= ;i --)
     {
         if(i == )
         {
             for(j = ;j <= num[i];j ++)
             if((sum + j)% == )
             ans ++;
             break;
         }
         for(j = ;j < num[i];j ++)
         ans += dp[i][(-sum-j)%];
         sum = (sum + num[i])%;
     }
     return ans;
 }
 int main()
 {
     int i,j,k,t,cas = ;
     LL x,y;
     for(i = ;i < ;i ++)
     dp[][i] = ;
     for(i = ;i <= ;i ++)
     {
         for(j = ;j < ;j ++)
         {
             for(k = ;k < ;k ++)
             {
                 dp[i][(j+k)%] += dp[i-][j];
             }
         }
     }
     scanf("%d",&t);
     while(t--)
     {
         scanf("%I64d%I64d",&x,&y);
         printf("Case #%d: %I64d\n",cas ++,judge(y)-judge(x-));
     }
     return ;
 }