zoj1292--------Integer Inquiry 大数

``This supercomputer is great,'' remarked Chip. ``I only wish Timothy were here to see these results.'' (Chip moved to a new apartment, once one became available on the third floor of the Lemon Sky apartments on Third Street.)

Input

The input will consist of at most 100 lines of text, each of which contains a single VeryLongInteger. Each VeryLongInteger will be 100 or fewer characters in length, and will only contain digits (no VeryLongInteger will be negative).

The final input line will contain a single zero on a line by itself.

Output

Your program should output the sum of the VeryLongIntegers given in the input.

This problem contains multiple test cases!

The first line of a multiple input is an integer N, then a blank line followed by N input blocks. Each input block is in the format indicated in the problem description. There is a blank line between input blocks.

The output format consists of N output blocks. There is a blank line between output blocks.

Sample Input

123456789012345678901234567890
123456789012345678901234567890
123456789012345678901234567890
0

Sample Output

370370367037037036703703703670

大数处理，比1205略有不同，这个方法是参考别人的代码并有所修改

代码：

#include<iostream> 
#include <stdio.h>
#include <string.h>
using namespace std; 

void AddS(int A[],char B[],int L)
{
	int i,j;
	i=j=0;
	for(i=L-1;i>=0;i--,j++)
	{
		A[j]=A[j]+B[i]-'0';
		if(A[j]>=10)
		{
			A[j]=A[j]%10;
			A[j+1]+=1;	
		}	
	}	
}

int main() 
{
	int N,j,i;
	char B[105];
	int A[105];
	cin>>N;
	while(N--)
	{
		memset(A,0,sizeof(A));     //memset:作用是在一段内存块中填充某个给定的值
		memset(B,0,sizeof(B));
		while(scanf("%s",B)!=EOF&&strcmp(B,"0")!=0)
			AddS(A,B,strlen(B));
		for(i=104;!A[i];i--);      //这样处理使其从第一个不为零处开始输出 
			for(j=i;j>=0;j--)
				cout<<A[j];
		cout<<endl;
		if(N)
			cout<<endl;
	}
	return 0; 	
}