hdu 4839 数位DP

以前一直用DFS写数位dp的。。。。。

妈蛋，这题用DFS会超内存T_T

这题我们首先预处理出所有的情况

dp[pos][k][i][j]表示pos位数无限制各位数字和为i且对k取余为j的个数

然后我们一位一位的统计最后情况即可

AC代码如下：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;

int dp[11][82][82][82];

void init(){
    memset( dp, 0, sizeof( dp ) );
    for( int i = 1; i <= 81; i++ ){
        dp[0][i][0][0] = 1;
    }
    for( int pos = 0; pos < 10; pos++ ){
        for( int k = 1; k <= 81; k++ ){
            for( int i = 0; i <= 81; i++ ){
                for( int j = 0; j <= 81; j++ ){
                    if( dp[pos][k][i][j] == 0 ) continue;
                    for( int l = 0; l < 10; l++ ){
                        if( i + l > 81 )    continue;
                        int t = (j+(int)pow((double)10,pos)*l)%k;
                        dp[pos+1][k][i+l][t] += dp[pos][k][i][j];
                    }
                }
            }
        }
    }
}

int solve( int n ){
    int digit[11], tot = 0;
    while( n ){
        digit[tot++] = n % 10;
        n /= 10;
    }
    int ans = 0;
    if( tot == 0 ){
        return 0;
    }
    for( int l = 1; l <= 81; l++ ){
        int presum = 0;
        int premod = 0;
        for( int i = tot; i > 1; i-- ){
            for( int j = 0; j < digit[i-1]; j++ ){
                for( int k = 0; k <= 81; k++ ){
                    if( ( k + premod + (int)pow((double)10,i-1) * j ) % l == 0 ){
                        ans += dp[i-1][l][l-presum-j][k];
                    }
                }
            }
            presum += digit[i-1];
            premod = ( premod + (int)pow((double)10,i-1) * digit[i-1] ) % l;
        }
        for( int i = 0; i <= digit[0]; i++ ){
            if( presum + i == l && ( premod + i ) % l == 0 ){
                ans++;
            }
        }
    }
    return ans;
}

int main(){
    int T, Case = 1;
    int A, B;
    init();
    scanf( "%d", &T );
    while( T-- ){
        scanf( "%d%d", &A, &B );
        printf( "Case %d: %d\n", Case++, solve( B ) - solve( A - 1 ) );
    }
    return 0;
}