for(int i=0;i<la;i++)a[i]=sa[la-i-1]-'0';
这一行改为：
for(int i=0;i<la;i++)a[la-i-1]=sa[i]-'0';
by littewhite @ 2023-12-04 20:11:23
下一行也是
by littewhite @ 2023-12-04 20:11:56
以及最后：
```cpp
for(int i=0;i<lc;i++){
c[i]+=(a[i]+b[i])%10;
c[i+1]+=(a[i]+b[i])/10;
}
```
改为：
```cpp
for(int i=0;i<lc;i++)
{
c[i] = a[i]+b[i]+c[i];
if(c[i]>=10)
{
c[i+1]=1;
c[i] -= 10;
}
}
```
by littewhite @ 2023-12-04 20:15:32
你再试试
by littewhite @ 2023-12-04 20:16:12
这下变全wa了
by xingjielong @ 2023-12-04 20:19:32
抱歉，消息没收完整
by xingjielong @ 2023-12-04 20:20:39
@[xingjielong](/user/1143897) 没事
by littewhite @ 2023-12-04 20:21:32
```cpp
#include<bits/stdc++.h>
using namespace std;
char sa[1000],sb[1000];
int main(){
memset(sa,0,sizeof(sa));
memset(sb,0,sizeof(sb));
scanf("%s%s",sa,sb);
int a[1000],b[1000],c[1000];
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
memset(c,0,sizeof(c));
int la= strlen(sa);
int lb= strlen(sb);
int lc= max(la,lb);
for(int i=0;i<la;i++)a[la-i-1]=sa[i]-'0';
for(int i=0;i<lb;i++)b[lb-i-1]=sb[i]-'0';
for(int i=0;i<lc;i++){
c[i] = a[i]+b[i]+c[i];
if(c[i]>=10){
c[i+1]=1;
c[i] -= 10;
}
}
if(c[lc] >0)lc++;
for(int i=lc-1;i>=0;i--){
cout << c[i];
}
return 0;
}
```
全wa QAQ
by xingjielong @ 2023-12-04 20:23:11
先给你一份代码，我来debug
```cpp
#include <bits/stdc++.h>
using namespace std;
string sa, sb;
int la, lb, lans, a[1010], b[1010], c[1010], ans[1010];
void change(string x, int y[], int lx)
{
for (int i = 0; i < lx; i++)
{
y[lx - i - 1] = x[i] - '0';
}
return;
}
int main()
{
cin >> sa >> sb;
la = sa.length();
lb = sb.length();
memset(a, 0, sizeof(a));
memset(b, 0, sizeof(b));
change(sa, a, la);
change(sb, b, lb);
lans = la > lb ? la : lb;
memset(c, 0, sizeof(c));
memset(ans, 0, sizeof(ans));
for (int i = 0; i <= lans; i++)
{
ans[i] = a[i] + b[i] + c[i];
if (ans[i] >= 10)
{
c[i + 1] = 1;
ans[i] -= 10;
}
}
if (ans[lans] > 0) lans++;
for (int i = lans - 1; i >= 0; i--)
{
cout << ans[i];
}
return 0;
}
```
by littewhite @ 2023-12-04 20:30:29
谢谢
by xingjielong @ 2023-12-04 20:34:29