很好用!!!

#include<bits/stdc++.h>
using namespace std;
struct node
{
int a[510],len;
node()
{
len=1;
memset(a,0,sizeof(a));
}
};
node operator+(node n1,node n2)
{
node n0;
n0.len=max(n1.len,n2.len);

for(int i=1;i<=n0.len;i++) n0.a[i]=n1.a[i]+n2.a[i];
for(int i=1;i<=n0.len;i++)
{
    n0.a[i+1]+=n0.a[i]/10;
    n0.a[i]%=10;
}
int i=n0.len;
while(n0.a[i+1]>0)
{
    i++;
    n0.a[i+1]+=n0.a[i]/10;
    n0.a[i]%=10;
}
while( (n0.a[i]==0) && (i>1) ) i--;
n0.len=i;
return n0;

}
int main()
{
char st[511];
node n0,n1,n2;

scanf("%s",st+1);
n1.len=strlen(st+1);
for(int i=1;i<=n1.len;i++) n1.a[n1.len-i+1]=st[i]-'0';
scanf("%s",st+1);
n2.len=strlen(st+1);
for(int i=1;i<=n2.len;i++) n2.a[n2.len-i+1]=st[i]-'0';
n0=n1+n2;
for(int i=n0.len;i>=1;i--) printf("%d",n0.a[i]);
printf("\n");
return 0;

}