【HDOJ】4278 Faulty Odomete

水题。

/* 4278 */
#include <cstdio>
#include <cstring>
#include <cstdlib>

#define MAXN 10

int a[MAXN][MAXN];

void init() {
    int i, j, k;
    
    a[0][0] = a[0][1] = a[0][2] = 0;
    a[0][3] = a[0][4] = a[0][5] = a[0][6] = a[0][7] = 1;
    a[0][8] = a[0][9] = 2;
    
    for (i=1,k=10; i<MAXN; ++i,k*=10) {
        a[i][0] = a[i-1][9];
        for (j=1; j<MAXN; ++j) {
            if (j == 3 || j==8) {
                a[i][j] = a[i][j-1] + k;
            } else {
                a[i][j] = a[i][j-1] + a[i][0];
            }
        }
    }
}

int main() {
    int n, m;
    int i, j, k;
    int ans;
    
    #ifndef ONLINE_JUDGE
        freopen("data.in", "r", stdin);
        freopen("data.out", "w", stdout);
    #endif
    
    init();
    while (scanf("%d", &n)!=EOF && n) {
        ans = m = n;
        i = 0;
        while (n) {
            k = n%10;
            if (k)
                ans -= a[i][k-1];
            n /= 10;
            ++i;
        }
        printf("%d: %d
", m, ans);
    }
    
    return 0;
}