A - Integer Inquiry
Crawling in process...
Crawling failed
Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64u
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.)
``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.
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 <iostream>
#include<string.h>
#include<cstdio>
using namespace std;
char c[101];
int sum[150]= {0},len,i;
int main()
{
while(scanf("%s",c)&&strcmp(c,"0"))//一直输入字符串,一直相加
{
len=strlen(c);
for(i=0; i<len; i++)
sum[i]+=c[len-1-i]-'0';//计算出来sum[0],sum[1],sum[2]..即各位,十位,百位
}
for(i=0; i<149; i++)
{
if(sum[i]>=10)
{
sum[i+1]+=sum[i]/10;//进位处理
sum[i]%=10;
}
}
i=149;
while(sum[i]==0)//用while而不能用if,并且开辟空间足够大,不用最高位处理
i--;
for(int j=i; j>=0; j--)
printf("%d",sum[j]);
return 0;
}
学习总结:日积月累,必有收获