#2333
by 张艺潇（哈） @ 2017-12-07 19:56:06
@[魑魅魍魉魈](/space/show?uid=47584) 倒序存储
by Lolierl @ 2017-12-07 20:07:22
@[Lolierl](/space/show?uid=22930) 什么倒序存储，我的也全WA了
by Hurt @ 2017-12-08 00:19:32
```cpp
#include<iostream>
#include<string>
using namespace std;
int aa[1001],bb[1001];
string a,b;
void xj()
{
for(int i=0;i<max(a.size(),b.size());i++)
{
aa[i]+=bb[i];
if(aa[i]>9){aa[i]-=10;aa[i+1]++;}
}
int j=1000;
while(aa[j]==0)
j--;
for(int i=j;i>=0;i--)
cout<<aa[i];
}
int main()
{
cin>>a>>b;
if(a=="0"&&b=="0"){cout<<0;return 0;}
for(int i=0;i<a.size();i++)
aa[i]=a[a.size()-i-1]-48;//倒序存储，数位对齐
for(int i=0;i<b.size();i++)
bb[i]=b[b.size()-i-1]-48;
xj();
return 0;
}
@[Hurt](/space/show?uid=52219)
```
by Lolierl @ 2017-12-08 18:40:32
@[Lolierl](/space/show?uid=22930) 谢谢dalao
by Hurt @ 2017-12-08 18:47:20