HDU1002 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): 400857    Accepted Submission(s): 77569

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

AC代码：

#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
#define INF 1000
char stra[INF],strb[INF];
int ans[INF],cnt=0,c=0;

void last(int a,int b,char str[]) {
    int i=a-b-1;
    while(i>=0) {
        ans[cnt]=str[i]+c-'0';
        if(ans[cnt]>9) {
            c=ans[cnt]/10;
            ans[cnt]%=10;
        } else c=0;
        cnt++;
        i--;
    }
}
int main() {
	int n,h,i,j;
	scanf("%d",&n);
	for(h=1;h<=n;h++){
		scanf("%s%s",stra,strb);cnt=0;c=0;
		int lena=strlen(stra),lenb=strlen(strb);
		for(i=lena-1,j=lenb-1; i>=0&&j>=0; i--,j--) {
			ans[cnt]=stra[i]-'0'+strb[j]-'0'+c;
			if(ans[cnt]>9) {
				c=ans[cnt]/10;
				ans[cnt]%=10;
			} else
				c=0;
			cnt++;
		}
		if(lena>lenb) {
			last(lena,lenb,stra);
		} else if(lena<lenb) {
			last(lenb,lena,strb);
		}
		if(c>0) {
			ans[cnt++]=c;
		}
		printf("Case %d:\n",h);
		printf("%s + %s = ",stra,strb);
		for(i=cnt-1;i>=0;i--)
			printf("%d",ans[i]);
		printf("\n");
		if(h<n)
			printf("\n");
	}
    return 0;
}