用LUA（和C++）刷PAT (Advanced Level) ——1065 A+B and C

其实用longlong处理一下越界就好，浮点数精度不够。

#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>

using namespace std;

int getDigit(int index, string s, bool flag)
{
    if(index < 0) return 0;
    if(s[index] == '-') return 0;
    return (s[index] - '0') * (flag ? 1 : -1);
}

bool compare(string a, string b, string c)
{
    int max_length = max(max(a.length(), b.length()),c.length()) + 1;
    vector<int> result(max_length);
    bool a_flag = a[0] != '-', b_flag = b[0] != '-', c_flag = c[0] != '-';
    int a_index = a.length(), b_index = b.length(), c_index = c.length();
    for (int i = max_length - 1; i >= 0 ; i--){
        result[i] = getDigit(-- a_index, a, a_flag) + getDigit(-- b_index, b, b_flag) - getDigit(-- c_index, c, c_flag);
    }
    int carry = 0;
    for (int i = max_length - 1; i >= 0 ; i--){
        result[i] += result[i] + carry;
        carry = floor(result[i] * 1.0 / 10);
        result[i] -= carry * 10;
    }
    if(carry != 0)
        return carry > 0;
    for (int i = 0 ; i < max_length; i++)
        if(result[i] != 0)
            return true;
    return false;
}

int main()
{
    int N;
    cin>>N;
    for(int i = 1; i <= N ; i++)
    {
        string a, b, c;
        cin>>a>>b>>c;
        cout<<"Case #"<<i<<": "<<(compare(a, b, c) ? "true" : "false");
        if(i<N)
            cout<<endl;
    }
}