杭电OJ A + B Problem II

A + B Problem II

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 310934    Accepted Submission(s): 60113

Problem Description

I have a very simple problem for you. Given two integers A and B, your job is to calculate the Sum of A + B.

 

Input

The first line of the input contains an integer T(1<=T<=20) which means the number of test cases. Then T lines follow, each line consists of two positive integers, A and B. Notice that the integers are very large, that means you should not process them by using 32-bit integer. You may assume the length of each integer will not exceed 1000.

 

Output

For each test case, you should output two lines. The first line is "Case #:", # means the number of the test case. The second line is the an equation "A + B = Sum", Sum means the result of A + B. Note there are some spaces int the equation. Output a blank line between two test cases.

 

Sample Input

  
  

   
   2
1 2
112233445566778899 998877665544332211
  
  

 

Sample Output

  
  

   
   Case 1:
1 + 2 = 3

Case 2:
112233445566778899 + 998877665544332211 = 1111111111111111110
  
  

 

Author

Ignatius.L

//2016年6月17日11:38:03
# include <stdio.h>
# include <string.h>
int main (void)
{
    int T, i;
    int iSum[1000];
    char cNum1[1000], cNum2[1000];
    int iCount1, iCount2;
    int t, j, g, count;
    scanf ("%d", &T);
    for (i = 0; i < T; i++)
    {
        t = 0;
        j = 0;
        count = 0;
        scanf ("%s %s", cNum1, cNum2);
        printf ("Case %d:\n", i+1);
        printf ("%s + %s = ", cNum1, cNum2);
        iCount1 = strlen(cNum1)-1;
        iCount2 = strlen(cNum2)-1;
        while (iCount1 >= 0 && iCount2 >= 0)
        {
            iSum[j] = cNum1[iCount1]-'0'+cNum2[iCount2]-'0'+t;
            t = iSum[j]/10;
            iSum[j] = iSum[j]%10;
            j++;
            iCount1--;
            iCount2--;
            count++;
        }
        while (iCount1 >= 0)
        {
            iSum[j] = cNum1[iCount1]-'0'+t;
            t = iSum[j]/10;
            iCount1--;
            j++;
        }
        while (iCount2 >= 0)
        {
            iSum[j] = cNum2[iCount2]-'0'+t;
            t = iSum[j]/10;
            iCount2--;
            j++;
        }
        for (g=j-1; g>=0; g--)
        {
            printf ("%d", iSum[g]);
        }
        printf ("\n");
        if (i+1!=T)
            printf ("\n");
    }
    return 0;
}
/*------------------------
2
1 2
Case 1:
1 + 2 = 3

112233445566778899 998877665544332211
Case 2:
112233445566778899 + 998877665544332211 = 111111111111111110
Press any key to continue...
----------------------*/