HDU.1002.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): 454726 Accepted Submission(s): 88102

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

#include<stdio.h>
#include<string.h>
int main(){
	int t,i,j,len1,len2,k=0,len,num[1100]={0};
	char str1[1100],str2[1100],ch='+';
	scanf("%d",&t);
	int x=t;
	while(t--){
		k++;
		memset(str1,0,sizeof(str1));
		memset(str2,0,sizeof(str2));
		memset(num,0,sizeof(num));
		scanf("%s%s",str1,str2);
		len1=strlen(str1);
		len2=strlen(str2);
		len=len1>len2?len1:len2;
		for(i=len1-1,j=0;i>=0;i--,j++){
			num[j]=str1[i]-'0';	
		}
		
		for(i=len2-1,j=0;i>=0;i--,j++){
			num[j]+=str2[i]-'0';
			if(num[j]>9){
				num[j+1]++;
				num[j]-=10;
			}
		}
		if(num[len]!=0) len++;
		printf("Case %d:\n%s + %s = ",k,str1,str2);
		//出现前导零的情况
		for(i=len-1;i>=0;i--){
			if(num[i]!=0){
				for(j=i;j>=0;j--)
				printf("%d",num[j]);
				break;
			}
		}
		printf("\n");
		if(k<x)//每次换行
		printf("\n");
	}
	return 0;
}