大数相加的运算

A + B Problem II

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

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

 

 

Author

Ignatius.L

 

 

Recommend

We have carefully selected several similar problems for you:  1004 1003 1008 1005 1009 

 

#include<iostream>
#include<string>
#include<cstring>
#include<algorithm>
using namespace std;

int vec1[100002];
int vec2[100002];
int vec[100002];

int main(){
	int n;
	cin>>n;
	for(int t=1;t<=n;t++){
		string s1;
		string s2;
		cin>>s1;
		cin>>s2;
		string s3=s1;
		string s4=s2;
		memset(vec1,0,sizeof(vec1));
		memset(vec2,0,sizeof(vec2));
		memset(vec,0,sizeof(vec));
		reverse(s1.begin(),s1.end());
		reverse(s2.begin(),s2.end());
		int l1=s1.length();
		int l2=s2.length();
		for(int i=0;i<l1;i++){
			vec1[i]=s1[i]-48;
		}
		for(int i=0;i<l2;i++){
			vec2[i]=s2[i]-48;
		} 
		int l= l1>l2? l1: l2;
		int nex=0;
		for(int i=0;i<l;i++){
			int ans=vec1[i]+vec2[i]+nex;
			vec[i]=ans%10;
			nex=ans/10;
		}
		if(nex!=0){
			vec[l++]=nex;	
		}
		if(t!=1){
			cout<<endl;
		}
		cout<<"Case "<<t<<":"<<endl;
		cout<<s3<<" + "<<s4<<" = ";
		for(int i=l-1;i>=0;i--){
			cout<<vec[i];
		}
		cout<<endl;
	} 
	
	return 0;
}