HDU1047(大数相加)
Integer InquiryTime Limit: 2000/1000 MS (Java/Others)????Memory Limit: 65536/32768 K (Java/Others)
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
?
Sample Output
? //大数相加,化为字符串处理 #include<iostream> #include<string.h> using namespace std; #define MAX 110 int main() { ?int n,len,i,flag,tlen; ? ?char s[MAX]; ?int sum[MAX]; ? ?while(cin>>n) ?{ ??while(n--) ??{ ???memset(sum,sizeof(sum)); ???len=0; ???while(cin>>s&&strcmp(s,"0")) ???{ ????tlen=strlen(s); ????if(tlen>len) ?????len=tlen; ????for(i=tlen-1;i>=0;i--) ????{ ?????sum[tlen-1-i]+=s[i]-'0'; ?????if(sum[tlen-1-i]>9) ?????{ ??????sum[tlen-1-i]%=10; ??????sum[tlen-i]+=1; ?????}?? ????}? ???} ???tlen=0; ???for(i=len+6;i>=0;i--) ???{ ????if(sum[i]&&tlen==0) ?????tlen=1; ????if(tlen||i==0) ?????cout<<sum[i]; ???} ???cout<<endl; ???if(n>0) ????cout<<endl; ??} ?} ?return 0; } (编辑:李大同) 【声明】本站内容均来自网络,其相关言论仅代表作者个人观点,不代表本站立场。若无意侵犯到您的权利,请及时与联系站长删除相关内容! |