标签：hdu acm c++ 高精度加法
Integer Inquiry
Problem 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.
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
1
123456789012345678901234567890
123456789012345678901234567890
123456789012345678901234567890
0
Sample Output
370370367037037036703703703670
高精度加法。需要注意，结果可能为0。代码如下：
#include<cstdio>
#include<cstring>
int main(){
int T;
scanf("%d",&T);
while(T--){
int ans[110]={0};//保存结果
char s[110];
while(scanf("%s",s)!=EOF&&s[0]!='0'){
int a[110]={0};
int l=strlen(s);
for(int i=l-1;i>=0;i--)
a[l-i-1]=s[i]-'0';
for(int i=0;i<110;i++){
ans[i+1]+=(ans[i]+a[i])/10;
ans[i]=(ans[i]+a[i])%10;
}
}
int i=109;
while(ans[i]==0) i--;
if(i>=0)//结果不为0
for(;i>=0;i--)
printf("%d",ans[i]);
else printf("0");//结果为0
printf("\n");
if(T) printf("\n");
}
return 0;
}
版权声明：本文为博主原创文章，未经博主允许不得转载。
HDU 1047.Integer Inquiry【多个大数相加】【高精度】【8月25】
标签：hdu acm c++ 高精度加法
原文地址：http://blog.csdn.net/a995549572/article/details/47981357
