【HDU 2089】 不要62

【题目链接】

点击打开链接

【算法】

数位DP

和上一题 ： HDU3555很像

【代码】

#include<bits/stdc++.h>
using namespace std;
#define MAXL 10

long long n,m;
long long a[MAXL],dp[MAXL][MAXL];

template <typename T> inline void read(T &x) {
        long long 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() {
        long long i,j,k;
        dp[][] = ;
        for (i = ; i <= MAXL; i++) {
                for (j = ; j <= ; j++) {
                        if (j == ) continue;
                        for (k = ; k <= ; k++) {
                                if (k == ) continue;
                                if (j ==  && k == ) continue;
                                dp[i][j] += dp[i-][k];
                        }
                }
        }
}
inline long long calc(long long n) {
        long long i,j,ans = ;
        a[] = ;
        while(n) {
                a[++a[]] = n % ;
                n /= ;
        }
        a[a[]+] = ;
        for (i = a[]; i >= ; i--) {
                for (j = ; j < a[i]; j++) {
                        if (j == ) continue;
                        if (a[i+] ==  && j == ) continue;
                        ans += dp[i][j];
                }
                if (a[i] == ) break;
                if (a[i+] ==  && a[i] == ) break;
        }
        return ans;
}

int main() {

        getdp();
        while (true) {
                read(n); read(m);
                if (!n && !m) break;
                writeln(calc(m+)-calc(n));
        }

        return ;

}