32 条题解
-
0
#include <bits/stdc++.h>//114514廖浩宇 using namespace std; int a1[501],b1[501],c1[501];//初始化 int lia,lsb; string sb1,sb2; int main(){ cin >> sb1 >> sb2;//我劝你给我点个赞 lia=sb1.size(); lsb=sb2.size(); for (int i = 0; i < lia; i++) a1[lia-i] = sb1[i] - '0'; for (int i = 0; i < lsb; i++) b1[lsb-i] = sb2[i] - '0'; int lcp = max(lia,lsb) + 1; for (int i = 1; i <= lcp; i++) { c1[i] += a1[i] + b1[i]; c1[i+1] = c1[i] / 10; c1[i] %= 10; } while(c1[lcp] == 0 && lcp > 1) lcp--; for (int i = lcp; i >= 1; i--) cout << c1[i]; } -
0
#include<bits/stdc++.h> using namespace std; const int N=1e5+10; const int INF=0x3f3f3f3f; char a[N],b[N]; int a1[N],b1[N],c1[N],lenc,x; int main(){ cin>>a>>b; int lena=strlen(a); int lenb=strlen(b); for(int i=0;i<lena;i++) a1[i]=a[lena-i-1]-'0'; for(int j=0;j<lenb;j++) b1[j]=b[lenb-j-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; string s1,s2; int a[505],b[505],c[505]; int la,lb; int main() { cin >> s1 >> s2; la = s1.size(); lb = s2.size(); for(int i = 0; i < la;i++) a[la - i] = s1[i] - '0'; for(int i = 0; i < lb;i++) b[lb - i] = s2[i] - '0'; int lc = max(la,lb)+1; for(int i=1;i <= lc;i++) { c[i] += a[i] +b[i]; c[i + 1 ] = c[i]/10;\ c[i] %= 10; } while(c[lc] == 0 && lc > 1)lc--; for(int i = lc; i >= 1; i--) cout << c[i]; return 0; } -
0
#include <math.h> #include <stack> #include <stdio.h> #include <iostream> #include <vector> #include <iomanip> #include <string.h> #include <algorithm> #include<bits/stdc++.h> using namespace std; int a[510],b[510],c[510]; int la,lb; string s1,s2; ; int main(){ cin >> s1 >> s2; la=s1.size(); lb=s2.size(); for (int i=0; i<la; i++){ a[la-i]=s1[i]-'0'; } for (int i=0; i<lb; i++){ b[lb-i]=s2[i]-'0'; } int lc = max(la,lb)+1; for (int i=1; i<=lc; i++){ c[i]+=a[i]+b[i]; c[i+1]=c[i]/10; c[i]%=10; } while(c[lc]==0&&lc>1)lc--; for (int i=lc; i>=1; i--)cout <<c[i]; return 0; } -
0
#inlude<iostream> using namespace std; string s1,s2; int a[505],b[505],c[505]; int la,lb; int main() { cin >> s1 >> s2; la = s1.size(); lb = s2.size(); for(int i = 0; i < la;i++) a[la - i] = s1[i] - '0'; for(int i = 0; i < lb;i++) b[lb - i] = s2[i] - '0'; int lc = max(la,lb)+1; for(int i 1;i <= lc;i++) { c[i] += a[i] +b[i]; c[i + 1 ] = c[i]/10;\ c[i] %= 10; } while(c[lc] == 0 && lc > 1)lc--; for(int i = lc; i >= 1; i--) cout << c[i]; return 0; } -
0
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; const int INF = 0x3f3f3f3f; int main() { char aa[1000],bb[1000],cc[1000]; cin >> aa >> bb; int a[1000],b[1000],c[1000]; memset(a,0,sizeof(a)); memset(b,0,sizeof(b)); memset(c,0,sizeof(c)); int lena = strlen(aa); int lenb = strlen(bb); for(int i = 0;i < lena;i++) a[i] = aa[lena - i - 1] - '0'; for(int i = 0;i < lenb;i++) b[i] = bb[lenb - i - 1] - '0'; int len = max(lena,lenb); for(int i = 0;i < len;i++) { c[i] +=a[i] + b[i]; if(c[i] > 9) { c[i+1]+= c[i]/10; c[i]%=10; } } if(c[len]!=0) len++; for(int i= len - 1;i >=0;i--) cout << c[i]; return 0; } -
0
/***************************************** 备注： ******************************************/ #include <queue> #include <math.h> #include <stack> #include <stdio.h> #include <iostream> #include <vector> #include <iomanip> #include <string.h> #include <algorithm> using namespace std; #define LL long long const int N = 1e5 + 10; const int INF = 0x3f3f3f3f; int a[N] ,b[N] ,c[N]; int main() { string aa,bb; cin >> aa >> bb; int lena = aa.size(); int lenb = bb.size(); for(int i = 0 ; i < lena ; i++) a[ lena- 1 - i ] = aa[i] - '0'; for(int i = 0 ; i < lenb ; i++) b[ lenb- 1 - i ] = bb[i] - '0'; // 数字对齐的过程 int len = max(lena , lenb); for(int i = 0 ; i < len ; i++) { c[i] += a[i] + b[i]; if(c[i] > 9) { c[i+1]++; c[i] -= 10; } } if(c[len] != 0) len++; for(int i = len - 1; i >= 0 ;i--) cout <<c[i]; return 0; } -
-1
#include <iostream> using namespace std; string a,b; int a1[520],b1[520],c1[520],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; } -
-4
#include <bits/stdc++.h> using namespace std; const int maxn = 550; char sa[maxn],sb[maxn]; int a[maxn],b[maxn],c[maxn]; int main(){ scanf("%s",sa); scanf("%s",sb); memset(c,0,sizeof(c)); int la = strlen(sa); int lb = strlen(sb); 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'; int lc = la > lb ? la : lb; for(int i = 0 ; i < lc ; i++){ c[i] += a[i] + b[i]; if(c[i] >= 10){ c[i+1] = c[i]/10; c[i] = c[i]%10; } } if(c[lc] > 0) lc++; int cnt = lc - 1; while(c[cnt] == 0) cnt--; for(int i = cnt ; i >= 0 ; i--) printf("%d",c[i]); return 0; } -
-4
#include using namespace std; int a[100010],b[100010],c[100010]; int main() { string aa,bb; cin>>aa>>bb; int lena=aa.size(); int lenb=bb.size(); for(int i=0;i<lena;i++) a[lena-1-i]=aa[i]-'0'; for(int i=0;i<lenb;i++) b[lenb-1-i]=bb[i]-'0'; int len=max(lena,lenb); for(int i=0;i<len;i++) { c[i]+=a[i]+b[i]; if(c[i]>9) { c[i+1]++; c[i]-=10; } } if(c[len]!=0) len++; for(int i=len-1;i>=0;i--) cout<<c[i]; return 0; }
-
-5
#include <iostream> #include <cstring> using namespace std; int main() { string a,b; cin >> a >> b; int x[1000],y[1000]; memset(x,0,sizeof(x)); memset(y,0,sizeof(y)); int lena=a.size(); int lenb=b.size(); for(int i = 0; i < lena; i++)x[i]=a[lena-1-i]-'0'; for(int i = 0; i < lenb; i++)y[i]=b[lenb-1-i]-'0'; int len = lena > lenb ? lena : lenb; for(int i = 0; i < len ; i++){ x[i]+=y[i]; x[i+1]+=x[i]/10; x[i]%=10; } if(x[len])len++; for(int i = len - 1; i >= 0; i--){ cout << x[i]; } }
