POJ 1503

#include <iostream>
#include <string>
using namespace std;
const int maxn = 500;
char a1[maxn], b1[maxn];
int a2[maxn], b2[maxn], c[maxn], flag;
int main()
{
	memset(a2, 0, sizeof(a2));
	memset(b2, 0, sizeof(b2));
    int i, j;
	while (cin >> b1)
	{	
		if (strcmp(b1,"0") == 0)
			break;
		flag = 1;
		j = 0;
		for (i = strlen(a1) - 1; i >= 0; i--)
		{
			a2[j++] = a1[i] - '0';
		}
		j = 0;
		for (i = strlen(b1) - 1; i >= 0 ; i--)
		{
			b2[j++] =b1[i] - '0';
		}
		
		int c = 0;
		for (i = 0; i < maxn; i++)
		{
			a2[i] = a2[i]  + b2[i] + c;
			c = a2[i] / 10;
			a2[i] = a2[i] % 10;
			
		}
	}
	for (j = maxn-1; j >= 0; j--)
	{
		if (a2[j])
			break;
	}
	for (i = j; i >= 0; i--)
	{
		cout << a2[i];
	}
	if(flag == 1)
		cout << endl;
	else
		cout <<"0"<<endl;
	return 0;
}