Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
---|---|---|---|---|---|---|---|---|---|
105327 | 毛泓博(做题专用,大号Fess) | 高精度加法 | C++ | Wrong Answer | 96 | 0 MS | 264 KB | 507 | 2023-10-06 10:42:35 |
#include<bits/stdc++.h> using namespace std; string a1,b1; int a[5005],b[5005],s[5005],lena,lenb,lens; int main() { cin>>a1>>b1; lena=a1.length(); lenb=b1.length(); lens=max(lena,lenb); for(int i=1;i<=lena;i++) a[i]=a1[lena-i]-48; for(int i=1;i<=lenb;i++) b[i]=b1[lenb-i]-48; for(int i=1;i<=lens;i++) { s[i]+=(a[i]+b[i]); if(s[i]>=10) { s[i+1]++; s[i]%=10; } } if(s[lens+1]) lens++; while(!s[lens]) lens--; for(int i=lens;i>=1;i--) cout<<s[i]; return 0; }