杭电OJ-1002 A + B Problem II

A+B Problem II (Problem-1002)

Input

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

完整代码如下： (language : G++ )

#include<stdio.h>
#include<string.h>
#define N 1002
int main()
{
    int a[N],b[N],answer[N];
    char x;
    int n,i,p,q;
    int temp,yu,jin,k,z;
    int lenA,lenB;
    scanf("%d",&n);
    getchar();
    for(i=1; i<=n; i++)
    {
        memset(&a,0,sizeof(N));
        memset(&b,0,sizeof(N));
        memset(&answer,0,sizeof(N));
        p=0,q=0,k=0;
        temp = 0;
        jin = 0;
        yu = 0;
        while(scanf("%c",&x))
        {
            if(x==' ')
                break;
            a[p++] = int(x) - 48;
        }

        while(scanf("%c",&x))
        {
            if(x=='\n')
                break;
            b[q++] = int(x) - 48;
        }
        lenA = p; // 下标则需要-1
        lenB = q;
        while(p && q)
        {
            if(p==0 || q==0)
                break;
            p--;
            q--;
            temp = a[p] + b[q] + jin;
            jin = temp / 10;
            yu = temp % 10;
            answer[k++] = yu;
        }
        //jin

        while(p!=0)
        {
            p--;
            if(jin == 0)  // 判断进位是否为0
                answer[k++] = a[p];
            while(jin != 0) // 判断进位是否为0
            {
                temp = jin + a[p];
                jin = temp / 10;
                yu = temp % 10;
                answer[k++] = yu;
            }
        }
        while(q!=0)
        {
            q--;
            if(jin == 0)  // 判断进位是否为0
                answer[k++] = b[q];
            while(jin != 0) // 判断进位是否为0
            {
                temp = jin + b[q];
                jin = temp / 10;
                yu = temp % 10;
                answer[k++] = yu;
            }
        }
        if(jin!=0) // 若 p==0 && q==0
        {
            answer[k++] = jin;
        }
        printf("Case %d:\n", i);
        for(p=0; p<lenA; p++)
        {
            printf("%d",a[p]);
        }
        printf(" + ");
        for(q=0; q<lenB; q++)
        {
            printf("%d",b[q]);
        }
        printf(" = ");
        for(z=k-1; z>=0; z--)
        {
            printf("%d",answer[z]);
        }
        printf("\n");
        if(i!=n)
            printf("\n");
    }
    return 0;
}

我的想法

本题是两个整数的大数运算，显然通过简单的int、long、long long等并不能直接实现我们想要的结果。

在这里由于事先不知道用户会输入多少位的整数，所以我采用字符串形式存储数据的输入：（如果碰见 ’ ’ 空字符，表明第一个整数已经输入完毕，然后开始输入第二个整数直到遇见 ‘\n’ 即敲回车），再通过强制类型转换将字符型转换为整型，通过ASCII码进行运算，把对应数字存储在int数组中。

while(scanf("%c",&x))
{
	if(x==' ')
                break;
        a[p++] = int(x) - 48；
}
while(scanf("%c",&x))
{
	if(x=='\n')
		break;
        b[q++] = int(x) - 48;
}

然后开始对数据进行求和，从最后一位开始进行求和运算，获得对应的进位以及余数。

while(p && q)
{
    if(p==0 || q==0)
        break;
    p--;
    q--;
    temp = a[p] + b[q] + jin;
    jin = temp / 10;
    yu = temp % 10;
    answer[k++] = yu;
}

判断p和q是否均为0或者p和q，其中一个下标等于0。

1. 如果p和q之中只有一个下标为0，则继续判断另一个下标位置是否为0，如果不是则需要将对应数据与进位（如果有的话）继续进行求和运算。
2. 如果p和q下标均为0，判断是否有进位，然后进行求和运算。

while(p!=0)
{
    p--;
    if(jin == 0)  // 判断进位是否为0
        answer[k++] = a[p];
    while(jin != 0) // 判断进位是否为0
    {
        temp = jin + a[p];
        jin = temp / 10;
        yu = temp % 10;
        answer[k++] = yu;
    }
}
while(q!=0)
{
    q--;
    if(jin == 0)  // 判断进位是否为0
        answer[k++] = b[q];
    while(jin != 0) // 判断进位是否为0
    {
        temp = jin + b[q];
        jin = temp / 10;
        yu = temp % 10;
        answer[k++] = yu;
    }
}
if(jin!=0) // 若 p==0 && q==0
{
    answer[k++] = jin;
}

最后逆序打印出answer[]数组，即为所求结果。

for(z=k-1; z>=0; z--)
{
    printf("%d",answer[z]);
}