Uva 10334

UVa 10334

这道题几乎和UVa 495是一样的。

 #include<iostream>
 #include<cstdio>
 #define mod 1000000
 using namespace std;
 const int maxn = ;
 const int len = ;
 int f[maxn][maxn];

 int main()
 {
     f[][] = , f[][] = ;
     for (int i = ; i <= ; i++)
     {
         int c = ;
         for (int j = ; j <= len; j++)
         {
             int t = f[i - ][j] + f[i - ][j]+c;
             f[i][j] = t%mod;
             c = t / mod;
         }
     }
     int n;
     while (scanf("%d",&n)==)
     {
         int pos = ;
         for (int i = len; i >= ; i--) {
             if (f[n][i] > ) {
                 pos = i; break;
             }
         }
         printf("%d", f[n][pos]);
         for (int i = pos - ; i >= ; i--)
             printf("%06d", f[n][i]);
         printf("\n");
     }
     return ;
 }