世界上最好的题解😄

#include<bits/stdc++.h>
using namespace std;
int main(){
	char a[555],b[555];
	int x[1111]={0};
	int l1,l2,i,m;
	scanf("%s%s",&a,&b);
	l1=strlen(a);
	l2=strlen(b);
	for(i=1;i<=l1;i++){x[i]=a[l1-i]-48;}
	for(i=1;i<=l2;i++){x[i]+=b[l2-i]-48;}
	if(l1>l2)m=l1;
	else m=l2;
	for(i=1;i<=m;i++){
		if(x[i]>=10){
			x[i]-=10;
			++x[i+1];
		}
	}
	if(x[m+1]>0){++m;}
	for(i=m;i>=1;--i){printf("%d",x[i]);}
	return 0;
}

看完别忘了点赞呦👀️

来一发正常高精

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
void add(int a[],int b[],int c[],int la,int lb,int &lc){
int t=0;
for(int i=0;i<lc;i++){
c[i]=a[i]+b[i]+t;
t=c[i]/10;
c[i]=c[i]%10;
}
if(t){
c[lc++]=t;
}
}
int main(){
//freopen(".in","r",stdin);
//freopen(".out","w",stdout);
ios::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
char s[505],t[505];
int a[505],b[505],c[505];
cin>>s>>t;
int la=strlen(s),lb=strlen(t),lc=max(la,lb);
for(int i=0;i<la;i++){
a[i]=s[la-i-1]-'0';
}
for(int i=0;i<lb;i++){
b[i]=t[lb-i-1]-'0';
}
add(a,b,c,la,lb,lc);
for(int i=0;i<lc;i++){
cout<<c[lc-i-1];
}
return 0;
}

$python$ yyds

a=int(input())
b=int(input())
print(a+b)

题解挺丰富，我来这补点儿测试数据，70个，愿Hydro采纳 链接：https://pan.quark.cn/s/6beabf7c7793 提取码：ePzq

爱Hydro求过审👀️

#include<iostream>
#include<string>
using namespace std;
const int N = 510;
int a[N], b[N], c[N];
int main()
{
string str1;
string str2;
cin >> str1;//输出
cin >> str2;//输出
for (int i = 0; i < str1.size(); i ++)
a[str1.size()-1 - i] = str1[i] - '0';//转换为int
for (int i = 0; i < str2.size(); i ++)
b[str2.size()-1 - i] = str2[i] - '0';//转换为int
int ans = max(str1.size(), str2.size());
for (int i = 0; i < ans; i ++){
c[i] += a[i] + b[i];
c[i+1] = c[i] / 10;//进位
c[i] %= 10;
}
ans += 1;
if (c[ans-1] == 0 && ans > 1)
ans -= 1;
for (int i = 0; i < ans; i ++)//输出
cout << c[ans-1-i];
return 0;
}

#include <bits/stdc++.h> using namespace std; char x[101],y[101]; int main(){ int v,ans=0; int x1[101],y1[101],c[10001],m[10001]; memset(c,0,sizeof(c)); memset(x1,0,sizeof(x1)); memset(y1,0,sizeof(y1)); int la,lb,t1=-1,t2=-1,maxn=0; scanf("%s",x); scanf("%s",y); la=strlen(x); lb=strlen(y); maxn=max(la,lb); for(int i=0;i<la;i++){ x1[la-1-i]=x[i]-'0'; } for(int i=0;i<lb;i++){ y1[lb-1-i]=y[i]-'0'; } for(int i=0;i<maxn;i++){ m[i]=c[i]; c[i]=(x1[i]+y1[i]+c[i])%10; c[i+1]=(x1[i]+y1[i]+m[i])/10; } if(c[maxn]>0){ maxn++; } for(int i=maxn-1;i>=0;i--){ cout<<c[i]; } cout<<"\n"; return 0; }