UVA 424 - Integer Inquiry（大数加法）

最新推荐文章于 2016-10-11 21:31:00 发布

原创最新推荐文章于 2016-10-11 21:31:00 发布 · 518 阅读

0 ·

CC 4.0 BY-SA版权

UVA 同时被 2 个专栏收录

41 篇文章

订阅专栏

大数

6 篇文章

订阅专栏

本文介绍了一种使用C++实现的大数加法算法。通过字符数组处理任意长度的整数相加问题，并提供了完整的源代码及样例输入输出。适用于需要进行大数运算的场景。

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 <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>

using namespace std;

char sum[111]={0};

void temp(char a[])
{
    int len=strlen(a);
    for(int i=0;i<len/2;i++)
    {
        swap(a[i],a[len-1-i]);
    }
}

void add(char a[],char b[])
{
    temp(a);
    temp(b);
    int lena=strlen(a);
    int lenb=strlen(b);
    int i,d,e=0;
    for(i=0;i<lena&&i<lenb;i++)
    {
        d=a[i]-'0'+b[i]-'0'+e;
        e=d/10;
        sum[i]=d%10+'0';
    }
    if(i<lena)
    {
        for(;i<lena;i++)
        {
            d=a[i]-'0'+e;
            e=d/10;
            sum[i]=d%10+'0';
        }
    }
    else
    {
        for(;i<lenb;i++)
        {
            d=b[i]-'0'+e;
            e=d/10;
            sum[i]=d%10+'0';
        }
    }
    if(e>0) sum[i++]=e+'0';
    sum[i]='\0';
    temp(sum);
}

int main()
{
    char s[111];
    while(cin>>s)
    {
        if(s[0]=='0')
        {
            cout<<sum<<endl;
            break;
        }
        add(sum,s);
    }
    return 0;
}