杭电oj--1002题

```cpp
#include<iostream>
#include<string>
#include<cstdio>
using namespace std;

int main()
{
	int sum[1000];
	int T;
	cin >> T;
	string a, b;
	
	for (int l = 1; l <=T; l++)
	{
		int q = 0;//用于记录数组的长度
		cin >> a >> b;
		int i, j;
		int temp = 0;
		int m=0, n=0;
		i = a.length();
		j = b.length();
		i=i-1;
		j=j-1;
		while (i >= 0 && j >= 0)
		{
			m = a[i] - '0';
			n = b[j] - '0';//把accic码转换为int型输出

			sum[q++] = (temp + m + n) % 10;
			temp = (temp + m + n)/10;//temp取进位，并加到下一次的加法中

			i--;
			j--;

		}
		//判断a,b哪个数比较长
		if (i > j)
		{
			while (i >=0)
			{
				m = a[i]-'0';
				sum[q++] = (temp + m) % 10;
				temp=(temp + m) / 10;
				i--;

			}                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                               
		}
		if (j>i)
		{
			while (j>= 0)
			{
				m = b[j]-'0';
				sum[q++] = (temp + m) % 10;
				temp = (temp + m)/10;
				j--;
			}
		}
		sum[q] = temp;
		cout << "case"<< T-1<< ":" << endl;
		cout << a << "+"<< b << '=';
		if (sum[q] != 0)
			cout << sum[q];
		for(--q;q>=0;q--)
			cout << sum[q];
		cout << endl;

		if (l < T - 1)
			cout << endl;
	}
	return 0;
}