△UVA424 - Integer Inquiry（大数相加）

 Integer Inquiry 

One of the first users of BIT's new supercomputer was Chip Diller. He extended his exploration of powers of 3 to go from 0 to 333 and he explored taking various sums of those numbers.

``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.

 

Sample Input

 

123456789012345678901234567890
123456789012345678901234567890
123456789012345678901234567890
0

 

Sample Output

 

370370367037037036703703703670

自己写的太麻烦了，学习了别人的代码。

#include<cstdio>
#include<string.h>

#define maxn 1005

int sum[maxn];

void add(char *str)
{
    int i,j,len;
    len=strlen(str);
    for(i=maxn-1,j=len-1;j>=0;i--,j--) //sum[maxn-1]存的是个位,sum[maxn-2]存的是十位……
    {
        sum[i]+=str[j]-'0';//字符串，别忘了-'0'
    }
    for(i=maxn-1;i>0;i--)
    {
        if(sum[i]>9) //需要进位
        {
            sum[i]-=10;
            sum[i-1]++;
        }
    }
}

int main()
{
    char s[maxn];
    int i;
    memset(sum,0,sizeof(sum));
    while(gets(s) != 0)
    {
        if(strcmp(s,"0") == 0)
            break;
        add(s);
    }
    for(i=0;i<maxn;i++)
    {
        if(sum[i]) //忽略前导0
            break;
    }
    for(;i<maxn;i++)
    {
        printf("%d",sum[i]);
    }
    printf("\n");
    return 0;
}