Hdu

题目：

A + B Problem II

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

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

　　太久没有写高精度，今天写了一下高精度加法，第一次写高精度的时候用了80+行，后来改到<40行，结果现在太久没有写，一写就是70+ = =，当然这次和以前写的有点不一样，以前写的就是纯粹地为了得到那个答案，这次写有一点像是做模板的性质(虽然感觉这模板不可恭维= =)，这次写的是写在一个结构体里面，这样是为了在需要高精度的运算的时候可以更加方便的使用(只是自己感觉方便使用= =)，而且我把一个大数定义成结构体，结构体里面除了大数加法的函数以外还有大数和大数的长度以及大数由低位到高位的写法，方便以后添加高精度剪发，乘法，除法。

 

上代码：

 

#include <stdio.h>
#include <string.h>
#define MAX 1050
using namespace std;

typedef struct N
{
    char num[MAX],anum[MAX];
    int len;
    void anti()
    {
        int i;
        for(i=0;i<len;i++)
        {
            anum[i]=num[len-i-1];
        }
    }
    void big_plus(N a,N b)
    {
        int c,i;
        c=0;
        memset(num,0,sizeof(num));
        memset(anum,0,sizeof(anum));
        len=0;
        for(len=0;len<a.len && len<b.len;len++)
        {
            int temp=((a.anum[len]-'0')+(b.anum[len]-'0')+c);
            c=temp/10;;
            anum[len]=temp%10+'0';
        }
        while(len<a.len)
        {
            int temp=(a.anum[len]-'0')+c;
            c=temp/10;
            anum[len++]=temp%10+'0';
        }
        while(len<b.len)
        {
            int temp=(b.anum[len]-'0')+c;
            c=temp/10;
            anum[len++]=temp%10+'0';
        }
        if(c) anum[len++]='1';
        while(len && anum[len-1]=='0') len--;
        if(!len){anum[len++]='0';}
        for(i=0;i<len;i++)
        {
            num[i]=anum[len-i-1];
        }
    }
}N;


int main()
{
    int i,t;
    N n1,n2,n3;
    //freopen("data.txt","r",stdin);
    scanf("%d",&t);
    for(i=1;i<=t;i++)
    {
        scanf("%s %s",n1.num,n2.num);
        n1.len=strlen(n1.num);
        n2.len=strlen(n2.num);
        n1.anti();
        n2.anti();
        n3.big_plus(n1,n2);
        printf("Case %d:
",i);
        printf("%s + %s = %s
",n1.num,n2.num,n3.num);
        if(i!=t) printf("
");
    }
    return 0;
}