这里有两种代码,但核心原理是相同的。
#include<iostream>
#include<cstdio>
#include<cstring>
#include <algorithm>
using namespace std;
string a,b,ans;
int main(){
cin>>a>>b;
int aa=a.length();
int bb=b.length();
int ll=max(aa,bb);
int ss=min(aa,bb);
reverse(a.begin(), a.end());
reverse(b.begin(), b.end());
for (int i = 0; i < ss; i++) {
ans += a[i] + b[i] - '0';
}
if (aa < bb) {
for (int i = ss; i < ll; i++) {
ans += b[i];
}
} else if (aa > bb) {
for (int i = ss; i < ll; i++) {
ans += a[i];
}
}ans += '0';
for (int i = 0; i < ll + 1; i++) {
if (ans[i] > '9') {
ans[i + 1]++;
ans[i] -= 10;
}
}
reverse(ans.begin(), ans.end());
for (int i = ans.find_first_not_of('0'); i < ll + 1; i++) {
if (i == -1) {
cout << 0;
return 0;
}
cout << ans[i];
}
return 0;
}
#include<bits/stdc++.h>
using namespace std;
string s1,s2;
int a[305];
int b[305];
int c[305];
int main() {
cin>>s1>>s2;
for(int i=0;i<=200;i++)
{
a[i]=0;
b[i]=0;
c[i]=0;
}
for(int i=200;i>200-s1.size();i--)
{
a[i]=s1[s1.size()+i-200-1]-'0';
}
for(int i=200;i>200-s2.size();i--)
{
b[i]=s2[s2.size()+i-200-1]-'0';
}
int lmax=max(s1.size(),s2.size());
for(int i=200;i>200-lmax;i--)
{
c[i]+=a[i]+b[i];
if(c[i]>=10&&i!=200-lmax+1)
{
c[i-1]+=1;
c[i]-=10;
}
}
if(c[200-lmax+1]>=10)
{
cout<<"1";
c[200-lmax+1]-=10;
}
bool f=0;
for(int i=200-lmax+1;i<=200;i++)
{
if(c[i]!=0)
{
f=1;
}
if(f==1)
cout<<c[i];
}
return 0;
}