hdu 4541 Ten Googol

http://acm.hdu.edu.cn/showproblem.php?pid=4541

打表找规律

 #include <cstdio>
 #include <cstring>
 #include <algorithm>
 using namespace std;

 int t;
 int n,m;
 int a[][]={{, , , , },{, , , , },{, , , , , , },{, , , , , , },{, , , }, {,,  ,,  , , , , , , , , ,}, {, , , , , , , , , , , , , , , , , , , , , ,, }};

 int main()
 {
     scanf("%d",&t);
     int cas=;
     while(t--)
     {
         scanf("%d%d",&n,&m);
         printf("Case #%d: ",cas++);
         if(m>a[n-][])
         {
             printf("-1\n");
         }
         else if(n==&&m==)
         {
             printf("10000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n");
         }
         else if(n==&&m==)
         {
              printf("20000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n");
         }
         else if(n==&&m==)
         {
              printf("60000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n");
         }
         else if(n==&&m==)
         {
             printf("100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n");
         }
         else
         {
             printf("%d\n",a[n-][m]);
         }
     }
     return ;
 }