UVa 10013 - Super long sums

题目：大整数加法。

分析：简单题、模拟。利用数组计算即可。

#include <iostream>
#include <cstdlib>
#include <cstring>
#include <cstdio>

using namespace std;

int A[1000005];
int B[1000005];

int main()
{
	int n,m,l;
	while ( scanf("%d",&n) != EOF ) 
	while ( n -- ) {
		memset( A, 0, sizeof(A) );
		memset( B, 0, sizeof(B) );
		scanf("%d",&m);
		l = m;
		while ( l -- )
			scanf("%d%d",&A[l],&B[l]);
		
		for ( int i = 0 ; i < m ; ++ i ) {
			A[i] += B[i];
			if ( A[i] > 9 ) {
				A[i+1] += A[i]/10;
				A[i] %= 10;
			}
		}
		
		while ( m && !A[m] ) -- m;
		while ( m >= 0 )
			printf("%d",A[m --]);
		printf("\n");
		
		if ( n ) printf("\n");
	}
	
	return 0;
}