【HDU 3555】 Bomb

【题目链接】

点击打开链接

【算法】

数位DP

【代码】

#include<bits/stdc++.h>
using namespace std;
#define MAXL 15
typedef unsigned long long ULL;

ULL T,n,a[MAXL];
ULL dp[MAXL][];

template <typename T> inline void read(T &x) {
    ULL f = ; x = ;
    char c = getchar();
    for (; !isdigit(c); c = getchar()) { if (c == '-') f = -f; }
    for (; isdigit(c); c = getchar()) x = (x << ) + (x << )  + c -'';
    x *= f;
}
template <typename T> inline void write(T x) {
    if (x < ) { putchar('-'); x = -x; }
    if (x > ) write(x/);
    putchar(x%+'');
}
template <typename T> inline void writeln(T x) {
    write(x);
    puts("");
}
inline void getdp() {
    ULL i,j,k;
    dp[][] = ;
    for (i = ; i <= MAXL; i++) {
        for (j = ; j <= ; j++) {
            for (k = ; k <= ; k++) {
                if (j ==  && k == ) continue;
                dp[i][j] += dp[i-][k];
            }
        }
    }
}
inline ULL calc(ULL n) {
    ULL i,j,ans = ;
    a[] = ;
    while (n != ) {
        a[++a[]] = n % ;
        n /= ;
    }
    a[a[]+] = ;
    for (i = a[]; i >= ; i--) {
        for (j = ; j < a[i]; j++) {
            if (a[i+] ==  && j == ) continue;
            ans += dp[i][j];
        }
        if (a[i+] ==  && a[i] == ) break;
    }
    return ans;
} 

int main() {

    getdp();

    read(T);
    while (T--) {
        read(n);
          writeln(n-calc(n+)+);
    }

    return ;
}