杭电oj 1002

 #include <iostream>
 #include <algorithm>
 using namespace std;
 int nCases;
 int m[], n[];
 char a[], b[];
 int main()
 {
     scanf("%d", &nCases);
     for(int i = ; i <= nCases; ++i)
     {
         memset(m, , sizeof(m));
         memset(n, , sizeof(n));
         getchar();
         scanf("%s %s", a, b);
         int len1 = strlen(a);
         int len2 = strlen(b);
         if(len1 > len2)   //是m长度大于n
         {
             // 把字符数组a逆序转成int数组m
             int cnt = ;
             for(int j = len1-; j >= ; --j)
                 m[cnt++] = a[j] - '';
             // 把字符数组b逆序转成int数组n
             cnt = ;
             for(int j = len2-; j >= ; --j)
                 n[cnt++] = b[j] - '';
         }
         else
         {
             // 把字符数组a逆序转成int数组n
             int cnt = ;
             for(int j = len1-; j >= ; --j)
                 n[cnt++] = a[j] - '';
             // 把字符数组b逆序转成int数组m
             cnt = ;
             for(int j = len2-; j >= ; --j)
                 m[cnt++] = b[j] - '';
         }
         int len = len1 > len2? len2: len1;
         int k = ;  //指示最高位

         for(int j = ; j < len; ++j)
         {
             m[j] += n[j];
             if(m[j] >= )
                 k = j+;
             m[j+] += (m[j]/);
             m[j] %= ;
         }
         printf("Case %d:\n", i);
         printf("%s + %s = ",a, b);
         len = len1>len2? len1: len2;
         if(k < len-)
             k = len-;
         for(int j = k; j >= ; --j)
             printf("%d", m[j]);
         i == nCases? printf("\n"): printf("\n\n");
     }
     return ;
 }