【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[][] = a[][] = a[][] = ;
     a[][] = a[][] = a[][] = a[][] = a[][] = ;
     a[][] = a[][] = ;

     for (i=,k=; i<MAXN; ++i,k*=) {
         a[i][] = a[i-][];
         for (j=; j<MAXN; ++j) {
             if (j ==  || j==) {
                 a[i][j] = a[i][j-] + k;
             } else {
                 a[i][j] = a[i][j-] + a[i][];
             }
         }
     }
 }

 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 = ;
         while (n) {
             k = n%;
             if (k)
                 ans -= a[i][k-];
             n /= ;
             ++i;
         }
         printf("%d: %d\n", m, ans);
     }

     return ;
 }