light oj 1068 数位dp

 #include <stdio.h>
 #include <string.h>
 #include <stdlib.h>
 #include <math.h>
 #include <iostream>
 #include <algorithm>
 #include <climits>
 #include <queue>
 #define ll long long

 using namespace std;
 const int N = 1e4+;

 int digit[],l,k;
 ll dp[][][];

 void init()
 {
     memset(dp,-,sizeof(dp));
 }

 ll dfs( int cur, int n, int sum, int f)
 {
     if(cur == -)
     {
         return (n ==  && sum == ) ?:;
     }

     if(!f && dp[cur][n][sum] != -)
         return dp[cur][n][sum];

     ll ans = ;
     int len = f?digit[cur]:;
     for(int i = ; i <= len; i++)
     {
         ans += dfs(cur-, (n* + i)%k, (sum+i)%k, f&(i == len));
     }
     if(!f)
         return dp[cur][n][sum] = ans;
     else
         return ans;
 }

 ll work(int num,int mod)
 {
     l = ;
     while(num > )
     {
         digit[l++] = num%;
         num /= ;
     }
     ll ans = dfs(l-, , , );
     return ans;
 }

 void solve()
 {
     int a,b;

     init();
     scanf("%d %d %d",&a,&b,&k);
     if(k > )
     {
         printf("0\n");
         return ;
     }
     printf("%lld\n", work(b,k) - work(a-,k));

 }

 int main(void)
 {

     int t,cnt = ;
     scanf("%d",&t);
     while(t--)
     {
         printf("Case %d: ",++cnt);
         solve();
     }
     return ;
 }