全wa求助,不知道问题在哪

P1601 A+B Problem(高精)

``` #include<iostream> #include<vector> #include<string> using namespace std; vector<int> add(vector<int>&A , vector<int>&B)//计算A+B { vector<int> c; int t=0; for(int i=0;i<A.size()||i<B.size();i++) {if(i<A.size()) t+=A[i]; if(i<B.size()) t+=B[i]; c.push_back(t%10); t/=10; } if(t)c.push_back(1); return c; } int main() { string a,b; getline(cin,a); getline(cin,b); vector<int>A,B; for(int i=a.size()-1;i>=0;i--) {A.push_back(a[i]-'0'); } for(int i=b.size()-1;i>=0;i--) {B.push_back(b[i]-'0'); } vector<int> c=add(A,B);//auto通过后面的变量来判断是什么类型 for(int i=c.size()-1;i>=0;i--) cout<<c[i]; return 0; } ```
by hehe123313 @ 2023-09-26 12:46:24


方法1(Python) ```python a=input() b=input() print(int(a)+int(b)) ``` 方法2(C++) ```cpp #include<bits/stdc++.h> using namespace std; string ak,ioi; int iakioi[114514],ioiakme[114514],akioi[114514],noip; int main(){ cin>>ak>>ioi; int csp_j=ak.size(),csp_s=ioi.size(); for(noip=csp_j-1;noip>=0;noip--)iakioi[csp_j-noip]=ak[noip]-48; for(noip=csp_s-1;noip>=0;noip--)ioiakme[csp_s-noip]=ioi[noip]-48; for(noip=1;noip<=max(csp_j,csp_s);noip++) { akioi[noip]+=iakioi[noip]+ioiakme[noip]; if(akioi[noip]>=10) { akioi[noip+1]++; akioi[noip]-=10; } } if(akioi[max(csp_j,csp_s)+1])cout<<akioi[max(csp_j,csp_s)+1]; for(int noip=max(csp_j,csp_s);noip>=1;noip--)cout<<akioi[noip]; } ``` ((((((((((
by GoodLuckCat @ 2023-09-26 12:58:41


|