HDOJ 1047 水题 大数

题目：http://acm.hdu.edu.cn/showproblem.php?pid=1047

#include<bits/stdc++.h>
#define INF 1e18
#define inf 1e9
#define min(a,b) a<b?a:b
#define max(a,b) a>b?a:b
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define IOS ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
using namespace std ;
typedef long long ll;
typedef unsigned long long ull;
const ll _max = 10005;
string add(string s1,string s2){  
    int arr1[5000],arr2[5000],arr3[5000];
    memset(arr1,0,sizeof(arr1));
    memset(arr2,0,sizeof(arr2));
    memset(arr3,0,sizeof(arr3));
    reverse(s1.begin(),s1.end());
    reverse(s2.begin(),s2.end());
    int len = max(s1.length(),s2.length());
    for(int i = 0 ; i < s1.length() ; i++)
        arr1[i] += s1[i]-'0';
    for(int i = 0 ; i < s2.length() ; i++)
        arr2[i] += s2[i]-'0';
    for(int i = 0 ; i < len ; i++)
        arr3[i] += arr1[i] + arr2[i];
    string ret =string(len+1,'0');
    for(int i = 0 ; i < len+1 ; i++){
        arr3[i+1] += arr3[i]/10;
        arr3[i] %= 10;
        ret[i] += arr3[i];
    }
    reverse(ret.begin(),ret.end());
    for(int i = 0 ; i < len+1 ; i++)
        if(ret[i] != '0'){
            ret = ret.substr(i);
            break;
        }
    if (ret==string(len+1,'0')) ret="0"; 
    return ret;
}
int main(){
    IOS;
    int n;
    cin>>n;
    cin.get();
    while(n--){
        cin.get();
        string ans="0",s;
        while(cin>>s){
            if(s=="0") break;
            ans = add(ans,s);
        }
        cout<<ans<<endl;
        if(n) cout<<endl;
    }
    return 0;
}