Integer Inquiry(UVA—424）-白红宇

Integer Inquiry(UVA—424）

阅读量：3958 次

发布时间：2019-05-24

本文共 1564 字，大约阅读时间需要 5 分钟。

题目：

One of the first users of BIT’s new supercomputer was Chip Diller. He extended his exploration ofpowers 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 Skyapartments on Third Street.)

Input

The input will consist of at most 100 lines of text, each of which contains a single VeryLongInte-ger. Each VeryLongInteger will be 100 or fewer characters in length, and will only contain digits (noVeryLongInteger 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

1234567890123456789012345678901234567890123456789012345678901234567890123456789012345678900

<font color=red Sample Output

370370367037037036703703703670

解题思路：这个题是高精度的问题，多个大数相加的结果.

程序代码：

#include
   
    #include
    
     int a[50000],b[50000],c[55000];char s[200];int main(){
   	int n,m,i,j,k;	memset(a,0,sizeof(a));	scanf("%s",s);	m=strlen(s);	j=0;	for(i=m-1;i>=0;i--)		a[j++]=s[i]-'0';	while(scanf("%s",s)!=EOF)	{
   		memset(b,0,sizeof(b));		memset(c,0,sizeof(c));		if(s[0]=='0')			break;		n=strlen(s);		j=0;		for(i=n-1;i>=0;i--)			b[j++]=s[i]-'0';		if(n>m)			k=n;		else			k=m;		for(i=0;i
     
      =10)			{
   				c[i+1]++;				c[i]=c[i]%10;			}		}		if(c[k]!=0)			k++;		for(i=0;i
      
       =0;i--)		printf("%d",a[i]);	printf("\n");	return 0;	}

转载地址：http://fexzi.baihongyu.com/

你可能感兴趣的文章