杭电2006年计算机复试真题第二题（HDU ACM 1002）

A + B Problem II
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 580794 Accepted Submission(s): 110569

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

#include "iostream"
#include "string"
using namespace std;

int main(void) {
	string a,b;
	string ans;
	int cnt;
	cin>>cnt;
	int index=1;
	while(cnt--){
		cin>>a>>b;
		int i=a.size()-1;
		int j=b.size()-1;
		bool ci=false;
		ans.clear(); 
		while(i>=0&&j>=0){
			int now=a[i]-'0'+b[j]-'0';
			if(ci)now+=1;
			if(now>=10){
				ci=true;
				now-=10;
			}else{
				ci=false;
			}
			ans+=to_string(now);
			i--;j--;
		}
		while(i>=0){
			int now=a[i]-'0';
			if(ci)now+=1;
			if(now>=10){
				ci=true;
				now-=10;
			}else{
				ci=false;
			}
			ans+=to_string(now);
			i--;
		}
		while(j>=0){
			int now=b[j]-'0';
			if(ci)now+=1;
			if(now>=10){
				ci=true;
				now-=10;
			}else{
				ci=false;
			}
			ans+=to_string(now);
			j--;
		}
		if(ci)ans+='1';
		printf("Case %d:\n",index);
		cout<<a<<" + "<<b<<" = ";
		for(auto x=ans.rbegin();x!=ans.rend();x++){
			cout<<*x;
		}
		
		if(cnt!=0){
			cout<<endl<<endl;
		}else{
			cout<<endl;
		}
		index++;
	}

	return 0;
}