大数加法 424 - Integer Inquiry

最新推荐文章于 2019-02-22 09:33:35 发布

原创最新推荐文章于 2019-02-22 09:33:35 发布 · 982 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#大数运算

UVA 同时被 2 个专栏收录

82 篇文章

订阅专栏

=====大数问题=====

7 篇文章

订阅专栏

本文讲述了Chip Diller使用新超级计算机探索大数加法的过程，并提供了实现大数加法的基础算法。通过反转字符串来简化大数运算，最终输出给定大数的和。

UVa OJ

Root :: AOAPC I: Beginning Algorithm Contests (Rujia Liu) :: Volume 1. Elementary Problem Solving :: Big Number

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

就是最为基础的大数加法，通过一个reverse，将字符串反转之后比较容易处理

大数其实就是模拟，通过计算机模拟我们的手算

要注意输出时，将之前的0去掉

#include<iostream>
#include<cstdio>
#include<cstring>
#include<ctype.h>
#include<algorithm>
using namespace std;
char num[150][150];
int sum[150]={0};
int main ()
{
    int t=0,i,j,max=0;
    memset(num,0,sizeof(num));
    memset(sum,0,sizeof(sum));
    while(gets(num[t]))
    {
        if (num[t][0]=='0') break;
        int len=strlen(num[t]);
        if (max<len) max=len;
        for (i=0, j=len-1; i<j; i++, j--)
        {
            char temp;
            temp=num[t][i];
            num[t][i]=num[t][j];
            num[t][j]=temp;
        }
        t++;
    }
    for (j=0; j<=max; j++)
    {
        for (i=0; i<t; i++)
            if (isdigit(num[i][j]))
            sum[j]+=num[i][j]-'0';
        if (sum[j]>=10)
        {
            sum[j+1]+=sum[j]/10;
            sum[j]=sum[j]%10;
        }
    }
    while(sum[j]==0)
        j--;
    for (i=j; i>=0; i--)
        cout<<sum[i];
    cout<<endl;
    return 0;
}