POJ1503: Integer Inquiry(连续多个大整数加法运算)

时间:2023-03-09 07:58:11
POJ1503: Integer Inquiry(连续多个大整数加法运算)
 #include<iostream>
#include<cstring>
using namespace std;
string sum;
const int max_len = ;
string tool(string a){
int dif = max_len - a.length();
string s = "";
for(int i=;i<dif;i++){
s += '';
}
s+=a;
return s;
}
void solve(string a){
a = tool(a);
sum = tool(sum);
string ssum;
ssum = tool(ssum); for(int i=max_len-;i>=;i--){
int temp = (sum[i] -'') + (a[i] - '');
int c = ssum[i]-''+temp;
ssum[i] = c% + '';
ssum[i-] = (ssum[i-]-''+c/) + '';
} sum = ssum;
}
int main(){
string a; sum = "";
while(cin>>a && a!=""){
solve(a);
}
int i;
for(i=;i<max_len;i++){
if(sum[i]!='') break;
}
for(int j=i;j<max_len;j++){
cout<<sum[j];
}cout<<endl;
}