Your task is to Calculate a
+ b
.
There are multiple test cases. Each test case contains only one line. Each line consists of a pair of integers a
and b
( 1 <= a
, b
<=1016 ) , separated by a space. Input is followed by a single line with a
= 0, b
= 0, which should not be processed.
For each pair of input integers a and b you should output the sum of a and b in one line, and with one line of output for each line in input.
1 5 10 20 10000000000000000 10000000000000000 0 0
6 30 20000000000000000
原本以为定义个longlong就能解决问题,有试了double,结果发现两个类型都都会失去精度;然后只能用数组,结果数组没初始化,好久都没发现,不细心啊
#include <iostream>
#include <cstdio>
#include <cstring>
#include <set>
#include<algorithm>
#include<math.h>
#include<string>
using namespace std;
int main()
{
string str1,str2;int a[200],b[200],c[200];
while(cin>>str1>>str2&&str1!="0")
{
memset(a,0,sizeof(a));memset(b,0,sizeof(b));
reverse(str1.begin(),str1.end());
reverse(str2.begin(),str2.end());
for(int i=0;i<str1.length();i++)
{
a[i]=str1[i]-48;
}
for(int i=0;i<str2.length();i++)
{
b[i]=str2[i]-48;
}
int j=0,x=0;
while(j<str2.length()||j<str1.length())
{
c[j]=a[j]+b[j]+x;x=c[j]/10;c[j]%=10;j++;
}
c[j]=x;if(0==x)j--;
for(int i=j;i>-1;i--)cout<<c[i];
cout<<endl;
}
}