UVa 424 - Integer Inquiry

超级计算机上的大数运算

最新推荐文章于 2014-12-07 15:26:51 发布

Invalid_Pointer

最新推荐文章于 2014-12-07 15:26:51 发布

阅读量306

点赞数

CC 4.0 BY-SA版权

分类专栏： UVa 文章标签：字符串高精度求和

本文链接：https://blog.youkuaiyun.com/Invalid_Pointer/article/details/8573020

UVa 专栏收录该内容

33 篇文章

订阅专栏

本文介绍了一个使用超级计算机处理非常大的整数相加的问题。输入由若干行组成，每行包含一个大整数，程序需要计算这些整数的总和。文章提供了两种不同的实现方法来解决这个问题。

Integer Inquiry

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

#include <stdio.h>
#include <string.h>
void plus(char n[],char s[],char m[])
{
    int i,j,k,len1,len2,r[600];
    memset(r,0,sizeof(int)*600);
    len1=strlen(n);
    len2=strlen(s);
    for(i=len1-1,k=599;i>=0;i--,k--)
        r[k]+=(n[i]-48);
    for(i=len2-1,k=599;i>=0;i--,k--)
        r[k]+=(s[i]-48);
    for(i=599;i>=0;i--)
        if(r[i]>9)
        {
            r[i-1]+=r[i]/10;
            r[i]%=10;
        }
    k=0;
    memset(m,0,sizeof(char)*600);
    while(r[k]==0&&k<=598)k++;
    for(i=k,j=0;i<=599;i++,j++)
    m[j]=r[i]+48;
}

int main()
{
    char s[600],n[600];
    scanf("%s",s);
    while(scanf("%s",n)!=EOF)
        {
            if(n[0]=='0')
            {
                printf("%s\n",s);
                memset(s,0,sizeof(char)*600);
            }
            else
            plus(n,s,s);
        }
    return 0;
}

#include <stdio.h>
#include <math.h>
#include <string.h>

void plus(char n[],char s[])
{
    int i,j,a,b;
    strrev(n);
    strrev(s);
    if(strlen(s)>strlen(n))
    {
        s[strlen(s)+1]='\0';
        s[strlen(s)]='0';
        for(i=strlen(n);i<strlen(s);i++)
        n[i]='0';
        n[i]='\0';
    }
    else
    {
        n[strlen(n)+1]='\0';
        n[strlen(n)]='0';
        for(i=strlen(s);i<strlen(n);i++)
        s[i]='0';
        s[i]='\0';
    }
    for(i=0,a=0;i<=strlen(n)-1;i++)
    {
        b=(int)s[i]-48+(int)n[i]-48+a;
        s[i]=b%10+48;
        a=b/10;
    }
    if(s[strlen(s)-1]=='0')
    s[strlen(s)-1]='\0';
    strrev(s);
}

int main()
{
    char s[105],n[105];
    scanf("%s",&s);
    while(scanf("%s",&n)!=EOF)
        {
            if(strcmp(n,"0")==0)
            {
                printf("%s\n",s);
                memset(s,0,sizeof(char)*600);
            }
            else
            plus(n,s);
        }
    return 0;
}