1503 Integer Inquiry

Integer Inquiry

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 25308		Accepted: 9827

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.

Sample Input

123456789012345678901234567890
123456789012345678901234567890
123456789012345678901234567890
0

Sample Output

370370367037037036703703703670

Source

East Central North America 1996

大数加法，10年的时候就看到华科复试有这么个题目，原来还是有出处的。显然用c/c++甚至java中内置的任何数据类型都不行，都会超出范围。只能用字符串保存输入数据了，而计算过程就需要自己模拟加法过程，一位一位的加，考虑进位等。

用栈实现起来较为方便，当然自己用数组也行。

后面应该还有高精度（浮点数）乘法，原理类似。

代码如下：

#include <iostream>
#include <stack>


using namespace std;

string add(const string &a, const string &b)
{
    //string res;
    stack<char> sa,sb,sc;
    int carry=0;

    size_t its=0;
    while(its!=a.length())
    {
        sa.push(a[its]);
        its++;
    }
    its=0;
    while(its!=b.length())
    {
        sb.push(b[its]);
        its++;
    }

    while(!sa.empty() && !sb.empty())
    {
        int t = sa.top()-'0' + sb.top()-'0'+carry;
        if(t>9)
        {
            carry = 1;
            t -= 10;
        }
        else
        {
            carry = 0;
        }
        sc.push(t+'0');
        sa.pop();
        sb.pop();
    }
    while(!sa.empty())
    {
        int t = sa.top()-'0'+carry;
        if(t>9)
        {
            carry = 1;
            t -= 10;
        }
        else
        {
            carry =0;
        }
        sc.push(t+'0');
        sa.pop();
    }
    while(!sb.empty())
    {
        int t = sb.top()-'0'+carry;
        if(t>9)
        {
            carry = 1;
            t -= 10;
        }
        else
        {
            carry=0;
        }
        sc.push(t+'0');
        sb.pop();
    }
    if(carry)
        sc.push('1');

    string res;
    while(!sc.empty())
    {
        res.push_back(sc.top());
        sc.pop();
    }
    return res;

}

int main()
{
    string str;
    string res;

    while(cin>>str)
    {
        if(str=="0")
            break;
        res=add(res,str);

    }
    cout<<res<<endl;

    return 0;
}