POJ 1503 Integer Inquiry 【大数加法】

Description

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

总结: 注意可能有以0开头的数据 

code:

View Code
#include<stdio.h>
#include<string.h>
int main()
{
char s[102];
int b[10002];
int flag,t,k,len,i,ans;
memset(b,0,sizeof(b));
while(gets(s))
{
if(!strcmp(s,"0"))
break;
len=strlen(s);
for(k=0,i=len-1;i>=0;i--)
{
b[k]=b[k]+s[i]-'0';
k++;
}
}
for(i=0;i<=10001;i++)
{
b[i+1]+=b[i]/10;
b[i]=b[i]%10;
}
for(i=10001;i>=0;i--)
if(b[i])
break;
for(;i>=0;i--)
printf("%d",b[i]);
printf("\n");
return 0;
}


转载于:https://www.cnblogs.com/dream-wind/archive/2012/03/16/2399624.html

评论将由博主筛选后显示,对所有人可见 | 还能输入1000个字符 “速评一下”
©️2020 CSDN 皮肤主题: 大白 设计师:CSDN官方博客 返回首页