ACM篇：POJ2602--Superlong Sums

思路：模拟

scanf及printf似乎会超时

#include <iostream>
#include <cstdio>
#include <cctype>
using namespace std;
const int MAXN = 1000008;
int ans[MAXN];

int readdigit()
{
	int t;
	while(t = getchar())
	{
		if (isdigit(t))break;
	}
	return t - '0';
}
int main()
{
	int len;
	scanf("%d", &len);
	//	work
	for (int i = 1; i <= len; i++)
		ans[i] = readdigit() + readdigit();
	//	carry
	for (int i = len; i >= 1; i--)
		if (ans[i] >= 10)
		{
			ans[i-1]++;
			ans[i] -= 10;
		}
	//	print
	for (int i  = 1; i <= len; i++) putchar(ans[i] + '0');
	return 0;
}