uva 11361 Investigating Div-Sum Property

链接： http://acm.hust.edu.cn/vjudge/problem/viewProblem.action?id=26570

#include <iostream>
#include <cstdio>
#include <vector>
#include <list>
#include <set>
#include <stack>
#include <bitset>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <queue>
#include <cstring>

using namespace std;
#define inf 1000000007
#define M 300500
#define ll long long
#define mod 1000000007

int dp[11][100][100], k;
int bit[11], len;
int pw[11];
void init()
{
    memset( dp, 0, sizeof(dp) );
    dp[0][0][0] = 1;
    for( int i = 0; i < 10; ++i )
    for( int j = 0; j < 10; ++j ){
        for( int x = 0; x < k; ++x )
        for( int y = 0; y < k; ++y ){
            dp[i+1][(x+j)%k][(10*y+j)%k] += dp[i][x][y];
        }
    }
}

int dfs( int n, int x, int y )
{
    if( n == 0 ){
        return dp[0][x][y];
    }
    int ans = 0, x1, y1;
    for( int i = 0; i < bit[n]; ++i ){
        x1 = ( k - i - x ) % k;
        if( x1 < 0 ) x1 += k;
        y1 = 0;
        if( y ) y1 = y * pw[n];
        y1 += i*pw[n-1];
        y1 = (k-y1) % k;
        //y1 = ( k - 100*y - 10*i ) % k;
        if( y1 < 0 ) y1 += k;
        ans += dp[n-1][x1][y1];
    }
    ans += dfs( n-1, (x+bit[n])%k, (10*y+bit[n])%k );
    return ans;
}
int get( int n )
{
    if( n == 0 ) return 0;
    int a = n;
    len = 0;
    while( a ){
        bit[++len] = a % 10;
        a /= 10;
    }
    return dfs( len, 0, 0 ) - 1;
}
int main()
{
    pw[0] = 1;
    pw[1] = 10;
    for( int i = 2; i <= 9; ++i ) pw[i] = pw[i-1]*10;
    int T, a, b;
    scanf( "%d", &T );
    while( T-- ){
        scanf( "%d%d%d", &a, &b, &k );
        if( k >= 100 ){//数字之和不可能超过100
            puts( "0" );
            continue;
        }
        init();
        b = get(b); a = get( a - 1 );
        int ans = b - a;
        printf( "%d\n", ans );
    }
}