32 条题解
-
7
#include <iostream> using namespace std; #define ll long long const int N =1e5+10; const int INF =0x3f3f3f3f; string a,b; int a1[N],b1[N],c1[N],lena,lenb,lenc,x; int main() { cin>>a>>b; lena=a.size(); lenb=b.size(); for(int i=0;i<lena;i++) { a1[i]=a[lena-i-1]-'0'; } for(int i=0;i<lenb;i++) { b1[i]=b[lenb-i-1]-'0'; } lenc=max(lena,lenb); for(int i=0;i<lenc;i++) { c1[i]=a1[i]+b1[i]+x; x=c1[i]/10; c1[i]%=10; } c1[lenc]=x; while(c1[lenc]==0&&lenc>0) { lenc--; } for(int i=lenc;i>=0;i--) { cout<<c1[i]; } return 0; } -
5
caozhaoyang LV 6 @ 2023-11-29 18:29:59
全宇宙最简单老师教过的题的题解。点个赞吧，求求了！
#include using namespace std; int c[600]; int a1[510],b1[510]; int len1,len2,len3,x; string a,b; int main(){ cin>>a>>b; len1=a.size(); len2=b.size(); for(int i=0;i<len1;i++)a1[i]=a[len1-i-1]-'0'; for(int i=0;i<len2;i++)b1[i]=b[len2-i-1]-'0'; len3=max(len1,len2); for(int i=0;i<len3;i++){ c[i]=a1[i]+b1[i]+x; x=c[i]/10; c[i]%=10; } c[len3]=x; while(c[len3]==0&&len3>0){ len3--; } for(int i=len3;i>=0;i--)cout<<c[i]; return 0; }-
lvyouheng @ 2026-3-15 11:21:12
666
-
-
4
#include #include using namespace std; const int N=1e5+10; const int INF=0x3f3f3f3f; string a,b; int lena,lenb,lenc,a1[N],b1[N],c1[N],z=0; int main(){ cin>>a>>b; lena=a.size(); lenb=b.size();
for(int i=0;i<lena;i++) a1[i]=a[lena-i-1]-'0'; for(int i=0;i<lenb;i++) b1[i]=b[lenb-i-1]-'0'; lenc=max(lena,lenb); for(int i=0;i<lenc;i++) { c1[i]=a1[i]+b1[i]+z; z=c1[i]/10; c1[i]%=10; } c1[lenc]=z; while(c1[lenc]==0&&lenc>0) lenc--; for(int i=lenc;i>=0;i--) cout<<c1[i];}
-
0
#include #include<string.h> #include<stdio.h> #include const int N=1e5+10; const int INF=0x3f3f3f3f; using namespace std;
int a[N],b[N];
int main(){ string x,y; cin>>x>>y; int len1=x.size(); int len2=y.size();
for(int i=0;i<len1;i++) a[i]=x[len1-1-i]-'0'; for(int i=0;i<len2;i++) b[i]=y[len2-1-i]-'0'; int len=max(len1,len2); for(int i=0;i<len;i++){ a[i]+=b[i]; if(a[i]>9) { a[i+1]++; a[i]%=10; } } if(a[len]!=0) len++; for(int i=len-1;i>=0;i--) cout<<a[i]; return 0;}
-
0
#include using namespace std; #define ll long long const int N =1e5+10; const int INF =0x3f3f3f3f; string a,b; int a1[N],b1[N],c1[N],lena,lenb,lenc,x; int main() { cin>>a>>b; lena=a.size(); lenb=b.size(); for(int i=0;i<lena;i++) { a1[i]=a[lena-i-1]-'0'; } for(int i=0;i<lenb;i++) { b1[i]=b[lenb-i-1]-'0'; } lenc=max(lena,lenb); for(int i=0;i<lenc;i++) { c1[i]=a1[i]+b1[i]+x; x=c1[i]/10; c1[i]%=10; } c1[lenc]=x; while(c1[lenc]==0&&lenc>0) { lenc--; } for(int i=lenc;i>=0;i--) { cout<<c1[i]; } return 0; }
-
0
ts2024stu008 LV 8 @ 2025-8-11 21:36:02
#include <bits/stdc++.h> #include <iostream> #include <iomanip> #include <cmath> #include <stdio.h> #include <cstdio> #include <algorithm> #include <string> #include <string.h> #include <cstring> #include <stack> #include <queue> #include <math.h> using namespace std; const int N = 1e5+10; const int INF = 0x3f3f3f3f; char a[N],b[N],c[N]; int lena,lenb,lenc,a1[N],b1[N],c1[N],x; int main() { cin >> a >> b; lena=strlen(a); lenb=strlen(b); for(int i=0;i<lena;i++) { a1[i]=a[lena-i-1]-'0'; } for(int i=0;i<lenb;i++) { b1[i]=b[lenb-i-1]-'0'; } lenc=max(lena,lenb)-1; for(int i=0;i<=lenc;i++) { c1[i]=a1[i]+b1[i]+x; x=c1[i]/10; c1[i]%=10; } if(x) { c1[++lenc]=x; } for(int i=lenc;i>=0;i--) { cout << c1[i]; } return 0; }有标志认证，属三无产品，请大家放心食用
-
0
#include<bits/stdc++.h> using namespace std; string a1,b1; int a[500],b[500],c[500]; int main(){ cin>>a1>>b1; int lena=a1.size(); int lenb=b1.size(); for(int i=1;i<=lena;i++)a[i]=a1[lena-i]-'0'; for(int i=1;i<=lenb;i++)b[i]=b1[lenb-i]-'0'; int lenc=1; while(lenc<=lena||lenc<=lenb){ c[lenc]+=a[lenc]+b[lenc]; if(c[lenc]>=10){ c[lenc]-=10; c[lenc+1]++; } lenc++; } lenc--; if(c[lenc+1]!=0)lenc++; for(int i=lenc;i>=1;i--)cout<<c[i]; return 0; }
-
0
#include<bits/stdc++.h> using namespace std; string a1,b1; int a[500],b[500],c[500]; int main(){ cin>>a1>>b1; int lena=a1.size(); int lenb=b1.size(); for(int i=1;i<=lena;i++)a[i]=a1[lena-i]-'0'; for(int i=1;i<=lenb;i++)b[i]=b1[lenb-i]-'0'; int lenc=1; while(lenc<=lena||lenc<=lenb){ c[lenc]+=a[lenc]+b[lenc]; if(c[lenc]>=10){ c[lenc]-=10; c[lenc+1]++; } lenc++; } lenc--; if(c[lenc+1]!=0)lenc++; for(int i=lenc;i>=1;i--)cout<<c[i]; return 0; }
-
0
#include <bits/stdc++.h> using namespace std; string a,b; int a1[510],b1[510],c1[510],lena,lenb,lenc; int x; int main(){ cin>>a>>b; lena=a.size(); lenb=b.size(); for(int i=0;i<lena;i++){ a1[i]=a[lena-i-1]-'0'; } for(int i=0;i<lenb;i++){ b1[i]=b[lenb-i-1]-'0'; } lenc=max(lena-1,lenb-1); for(int i=0;i<=lenc;i++){ c1[i]=a1[i]+b1[i]+x; x=c1[i]/10; c1[i]%=10; } c1[++lenc]=x; while(c1[lenc]==0&&lenc>0){ lenc--; } for(int i=lenc;i>=0;i--){ cout<<c1[i]; } return 0; } -
0
// Anthony //<< fixed << setprecision (); //for ( int i = ;i <= ; i++) //printf ( "%6d" , a) //int = %d //longlong = %lld //fload = %f //double = %lf //char = %c //char[] = %s //"0" = 48 //"9" = 57 //"A" = 65 //"Z" = 90 //"a" = 97 //"z" = 122 //note: #include #include <math.h> #include #include <stdio.h> #include #include #include #include <string.h> #include #include <time.h> #include <unistd.h> using namespace std; const int N = 1e5 + 10; const int INF = 0x3f3f3f3f; string a , b; int lena , lenb , lenc , a1[N] , b1[N] , c1[N] , x; int main() { cin >> a >> b; lena = a.size(); lenb = b.size(); for ( int i = 0; i < lena; i++) { a1[i] = a[lena - i - 1] - '0'; } for ( int i = 0; i < lenb; i++) { b1[i] = b[lenb - i - 1] - '0'; } lenc = max ( lena , lenb); for ( int i = 0; i < lenc; i++) { c1[i] = a1[i] + b1[i] + x; x = c1[i] / 10; c1[i] %= 10; } c1[lenc] = x; while ( c1 [ lenc ] == 0 && lenc > 0) { lenc--; } for ( int i = lenc; i >= 0; i--) { cout << c1[i]; }
return 0;}
-
0
zhousixing1
LV 7
@ 2024-3-17 14:50:12
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; const int INF = 0x3f3f3f3f; string a , b; int lena , lenb , lenc , a1[N] , b1[N] , c1[N] , x; int main() { cin >> a >> b; lena = a.size(); lenb = b.size(); for (int i = 0 ; i <= lena ; i++){ a1[i] = a[lena - i - 1] - '0'; } for (int i = 0 ; i <= lenb ; i++){ b1[i] = b[lenb - i - 1] - '0'; } lenc = max(lena , lenb); for (int i = 0 ; i <= lenc ; i++){ c1[i] = a1[i] + b1[i] + x; x = c1[i] / 10; c1[i] %= 10; } c1[lenc] = x; while (c1[lenc] == 0 && lenc > 0){ lenc--; } for (int i = lenc ; i >= 0 ; i--){ cout << c1[i]; }
return 0;}
-
0
#include <iostream> using namespace std; #define ll long long const int N =1e5+10; const int INF =0x3f3f3f3f; string a,b; int a1[N],b1[N],c1[N],lena,lenb,lenc,x; int main() { cin>>a>>b; lena=a.size(); lenb=b.size(); for(int i=0;i<lena;i++) { a1[i]=a[lena-i-1]-'0'; } for(int i=0;i<lenb;i++) { b1[i]=b[lenb-i-1]-'0'; } lenc=max(lena,lenb); for(int i=0;i<lenc;i++) { c1[i]=a1[i]+b1[i]+x; x=c1[i]/10; c1[i]%=10; } c1[lenc]=x; while(c1[lenc]==0&&lenc>0) { lenc--; } for(int i=lenc;i>=0;i--) { cout<<c1[i]; } return 0; } -
0
#include #include using namespace std; const int N=1e5+10; const int INF=0x3f3f3f3f; string a,b; int lena,lenb,lenc,a1[N],b1[N],c[N],z; int main(){ cin>>a>>b; lena=a.size(); lenb=b.size();
for(int i=0;i<lena;i++) a1[i]=a[lena-i-1]-'0'; for(int i=0;i<lenb;i++) b1[i]=b[lenb-i-1]-'0'; lenc=max(lena,lenb); for(int i=0;i<lenc;i++) { c[i]=a1[i]+b1[i]+z; z=c[i]/10; c[i]%=10; } c[lenc]=z; while(c[lenc]==0&&lenc>0) lenc--; for(int i=lenc;i>=0;i--) cout<<c[i];}
-
0
#include #include using namespace std; const int N=1e5+10; const int INF=0x3f3f3f3f; string a,b; int lena,lenb,lenc,a1[N],b1[N],c[N],z; int main(){ cin>>a>>b; lena=a.size(); lenb=b.size();
for(int i=0;i<lena;i++) a1[i]=a[lena-i-1]-'0'; for(int i=0;i<lenb;i++) b1[i]=b[lenb-i-1]-'0'; lenc=max(lena,lenb); for(int i=0;i<lenc;i++) { c[i]=a1[i]+b1[i]+z; z=c[i]/10; c[i]%=10; } c[lenc]=z; while(c[lenc]==0&&lenc>0) lenc--; for(int i=lenc;i>=0;i--) cout<<c[i];}
-
0
yangbinzhen1 LV 7 @ 2023-11-25 19:23:07
#include <bits/stdc++.h> using namespace std; int a1[100005], b1[100005], c1[100005], x; int main() { string a,b; cin >> a >> b; int lena = a.size(); int lenb = b.size(); for (int i = 0; i < lena; i++) { a1[i] = a[lena - i - 1] - '0'; } for (int i = 0; i < lenb; i++) { b1[i] = b[lenb - i - 1] - '0'; } int lenc = max(lena, lenb); for (int i = 0; i < lenc; i++) { c1[i] = a1[i] + b1[i] + x; x = c1[i] / 10; c1[i] %= 10; } c1[lenc] = x; while (c1[lenc] == 0 && lenc > 0) { lenc--; } for (int i = lenc; i >= 0; i--) { cout << c1[i]; } return 0; }
-
0
zhangmanlin LV 6 @ 2023-11-25 19:22:15
#include #include #include #include #include using namespace std; const int N=1e5+10; const int INF=0x3f3f3f3f; int a1[N],b1[N],c1[N],lena,lenb,lenc,x; string a,b; int main() { cin>>a>>b; lena=a.size(); lenb=b.size(); for(int i=0;i<lena;i++) { a1[i]=a[lena-i-1]-'0'; } for(int i=0;i<lenb;i++) { b1[i]=b[lenb-i-1]-'0'; } lenc=max(lena,lenb); for(int i=0;i<lenc;i++) { c1[i]=a1[i]+b1[i]+x; x=c1[i]/10; c1[i]%=10; } c1[lenc]=x; while(c1[lenc]==0&&lenc>0) lenc--; for(int i=lenc;i>=0;i--) { cout<<c1[i]; }
return 0; }
-
0
#include <iostream> #include <iomanip> #include <cmath> #include <string> #include <cstring> #include <algorithm> #include <cstdio> using namespace std; const int N = 1e5+10; string a , b; int a1[N] , b1[N] , c1[N] , lena , lenb , lenc , x; int main() { cin>>a >>b; lena = a.size(); lenb = b.size(); for(int i = 0;i < lena;i++) { a1[i] = a[lena - i - 1] - '0'; } for(int i = 0;i < lenb;i++) { b1[i] = b[lenb - i - 1] - '0'; } lenc = max(lena , lenb); for(int i = 0 ; i < lenc;i++) { c1[i] = a1[i] + b1[i] + x; x = c1[i] / 10; c1[i] %= 10; } c1[lenc] = x; while(c1[lenc] == 0 &&lenc > 0) { lenc--; } for(int i = lenc; i >= 0;i--) { cout<<c1[i]; } return 0; } -
0
#include<iostream> #include<string.h> using namespace std; const int INF=0x3f3f3f3f; const int N=2e5+10; string a,b; int lena,lenb,lenc,a1[N],b1[N],c1[N],x; int main(){ cin>>a>>b; lena=a.size(); lenb=b.size(); for(int i=0;i<lena;i++){ a1[i]=a[lena-i-1]-'0'; } for(int i=0;i<lenb;i++){ b1[i]=b[lenb-i-1]-'0'; } lenc=max(lena,lenb); for(int i=0;i<=lenc;i++){ c1[i]=a1[i]+b1[i]+x; x=c1[i]/10; c1[i]%=10; } while(c1[lenc]==0&&lenc>0){ lenc--; } for(int i=lenc;i>=0;i--){ cout<<c1[i]; } } -
0
#include<iostream> using namespace std; const int N = 1e5 + 10; string a , b; int a1[N] , b1[N] , c1[N] , lena , lenb , lenc , x; int main(){ cin >> a >> b; lena = a.size(); lenb = b.size(); lenc = max(lena , lenb); for(int i = 0;i < lena;i ++){ a1[i] = a[lena - i - 1] - '0'; }for(int i = 0;i < lenb;i ++){ b1[i] = b[lenb - i - 1] - '0'; }for(int i = 0;i < lenc;i ++){ c1[i] = a1[i] + b1[i] + x; x = c1[i] / 10; c1[i] %= 10; } c1[lenc] = x; while(c1[lenc] == 0 && lenc > 0){ lenc --; }for(int i = lenc;i >= 0;i --){ cout << c1[i]; } return 0; }
zhuqirui
LV 9
@ 2023-11-25 19:21:55
