SZU:B47 Big Integer I

Judge Info

Memory Limit: 32768KB
Case Time Limit: 10000MS
Time Limit: 10000MS
Judger: Normal

Description

Please calculate the answer of A+B and the answer of A-B, both A and B are integer.

Input

The first line of input contains , the number of test cases. There is only line for each test case. It contains two integers .

Output

For each test case, output two lines A+B and A-B.

Sample Input

Sample Output

题解：

1. 调试了很多遍，WA，之后朋友用python 测试很多大数据，我都测试了，数据正常，但还是WA，问了cxc，才发现，擦擦，尼玛，爆粗有木有？调代码调了四个多小时只是没考虑前导0 ？带前导0也算神马整数， -000001 是 -1 0000002 是 2 ，哪有这么无语的数据，擦擦！！

2. 第二次调试发现前导0去掉了。但是忽略了一个重要的数据，妹的 -00000 减去 +0000000 等于 -0 的有木有？又单独考虑0的符号问题，最终AC。

虽然我代码写的很啰嗦，也很难懂，给自己做个留念吧。

 #include <stdio.h>

 #include <string.h>

 #define max(a, b) ((a) >= (b) ? (a) : (b)) 

 char A[];

 char B[];

 int  C[];

 int mark;

 char *revstr(char *str, size_t len)

 {

     char    *start = str;

     char    *end = str + len - ;

     char    ch;

     if (str != NULL)

     {

         while (start < end)

         {

             ch = *start;

             *start++ = *end;

             *end-- = ch;

         }

     }

     return str;

 }

 void add(char A[], char B[]){

     int i, lenA, lenB, len;

     memset(C,,sizeof(C));

     lenA = strlen(A);

     lenB = strlen(B);

     len = max(lenA, lenB);

     revstr(A,lenA);

     revstr(B,lenB);

     A[lenA] = '';

     B[lenB] = '';

     for(i=;i<len+;i++){

         C[i] = (A[i] - '') + (B[i] - '') ;

     }

     for(i=;i<len+;i++){

         if(C[i] >  ){

             C[i]%=;

             C[i+]++;

         }

     }

     if(mark == ) putchar('-');

     if(C[len]==){

         for(i=len-;i>=;--i)

             printf("%d", C[i]);

         printf("\n");

     }

     else {

         for(i=len;i>=;--i)

             printf("%d", C[i]);

         printf("\n");

     }

     A[lenA] = '\0';

     B[lenB] = '\0';

     revstr(A,lenA);

     revstr(B,lenB);

 }

 void minus(char A[], char B[]){

     int i, lenA, lenB, len;

     memset(C,,sizeof(C));

     lenA = strlen(A);

     lenB = strlen(B);

     len = max(lenA, lenB);

     revstr(A,lenA);

     revstr(B,lenB);

     A[lenA] = '';

     B[lenB] = '';

     for(i=;i<len;i++){

         C[i] = (A[i] - '') - (B[i] - '') ;

     }

     for(i=;i<len;++i){

         if(C[i] < ){

             C[i] += ;

             C[i+]--;

         }

     }

     if(mark == ) putchar('-');

     for(;C[len]==;--len)

         if(len==)

             break;

     for(i=len;i>=;--i)

         printf("%d", C[i]);

     printf("\n");

     A[lenA] = '\0';

     B[lenB] = '\0';

     revstr(A,lenA);

     revstr(B,lenB);

 }

 int main(int argc, char const *argv[])

 {

     int t, i, lenA, lenB, len, Amark, Bmark;

     scanf("%d", &t);

     while(t--){

         mark = ;

         Amark = ;

         Bmark = ;

         memset(A,'',sizeof(A));

         memset(B,'',sizeof(B));

         scanf("%s", A);

         scanf("%s", B);

         lenA = strlen(A);

         lenB = strlen(B);

         int len;

         len = max(lenA, lenB);

         if(A[] == '-'){

              for(i=;i<lenA;++i)

                  A[i-]=A[i];

              A[i-]='\0';

              A[i] = '';

              Amark = ;

          }

          if(B[] == '-'){

              for(i=;i<lenB;++i)

                  B[i-]=B[i];

              B[i-]='\0';

              B[i] = '';

              Bmark = ;

          }

          while(A[]== ''){

              for(i=;i<lenA;++i)

                  A[i]=A[i+];

              A[lenA]='';

          }

          if(A[]=='\0'){

              A[]='';

              A[]='\0';

          }

          while(B[]== ''){

              for(i=;i<lenB;++i)

                  B[i]=B[i+];

              B[lenB]='';

          }

          if(B[]=='\0'){

              B[]='';

              B[]='\0';

          }

          if(A[] == '' && B[] == ''){

              printf("0\n");

              printf("0\n");

              continue;

          }

         lenA = strlen(A);

         lenB = strlen(B);

         len = max(lenA, lenB);

         lenA = strlen(A);

         lenB = strlen(B);

         if(Amark ==  && Bmark ==  ){

             mark = ;

             add(A,B);

             if(lenA>lenB){

                 mark = ;

                 minus(A,B);

             }

             else if(lenA < lenB){

                 mark = ;

                 minus(B,A);

             }

             else {

                 if(strcmp(A,B)>){

                     mark = ;

                     minus(A,B);

                 }

                 else if(strcmp(A,B)<){

                     mark = ;

                     minus(B,A);

                 }

                 else {mark = ;minus(A,B);}

             }

             continue;

         }

         if(Amark ==  && Bmark ==){

             mark = ;

             add(A,B);

             if(lenA>lenB){

                 mark = ;

                 minus(A,B);

             }

             else if(lenA<lenB){

                 mark = ;

                 minus(B,A);

             }

             else {

                 if(strcmp(A,B)>){

                     mark = ;

                     minus(A,B);

                 }

                 else if(strcmp(A,B)<){

                     mark = ;

                     minus(B,A);

                 }

                 else{

                     minus(A,B);

                 }

             }

             continue;

         }

         if(Amark ==  && Bmark == ){

             if(lenA>lenB){

                 mark = ;

                 minus(A,B);

             }

             else if(lenA<lenB){

                 mark = ;

                 minus(B,A);

             }

             else {

                 if(strcmp(A,B)>){

                     mark = ;

                     minus(A,B);

                 }

                 else if(strcmp(A,B)<){

                     mark = ;

                     minus(B,A);

                 }

                 else{

                     mark = ;

                     minus(A,B);

                 }

             }

             mark = ;

             add(A,B);

             continue;

         }

         if(Amark ==  && Bmark == ){

             if(lenA>lenB){

                 mark = ;

                 minus(A,B);

             }

             else if(lenA<lenB){

                 mark = ;

                 minus(B,A);

             }

             else{

                 if(strcmp(A,B)>){

                     mark = ;

                     minus(A,B);

                 }

                 else if(strcmp(A,B)<){

                     mark = ;

                     minus(B,A);

                 }

                 else {

                     mark = ;

                     minus(A,B);

                 }

             }

             mark = ;

             add(A,B);

             continue;

         }

     }

     return ;

 }

巴特西