106 大整数相加

问题描述 :

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

输入说明 :

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.

输出说明 :

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.

输入范例 :

2
1 2
112233445566778899 998877665544332211
输出范例 :

Case 1:
1 + 2 = 3

Case 2:
112233445566778899 + 998877665544332211 = 1111111111111111110

c++:

#include <bits/stdc++.h>
using namespace std;

int main()
{	
	int n;
	cin>>n;
	for(int k=1;k<=n;k++){
		char a[1000];
		char b[1000];
		cin>>a;
		cin>>b;
		int count=1;
		int carry[10]={0};
		char num1[1000]={'0'};
		char num2[1000]={'0'};
		int len1=strlen(a);
		int len2=strlen(b);
		int result[1000]={0};
		int len3=0; int x=0;//存放进位； 
		for(int i=0;i<len1;i++){
			num1[len1-1-i]=a[i]-'0';//将字符转化为十进制并把个位放在开头 
		} 
		for(int i=0;i<len2;i++){
			num2[len2-1-i]=b[i]-'0';
		} 
		while(len3<len1||len3<len2){
			result[len3]=num1[len3]+num2[len3]+x;
			x=result[len3]/10;
			result[len3]=result[len3]%10;//实际的值 
			len3++;
		}
		carry[len3]=x;
		if(carry[len3]==0){
			len3--;//除去最高位 
		}else{
			result[len3]=carry[len3];
		}
		printf("Case %d:\n",k);
		printf("%s + %s = ",a,b);
		for(int i=len3;i>=0;i--){
			printf("%d",result[i]);
		}
		printf("\n\n");		
	}
	
	return 0;
}