用数组,字符串模拟

yourongyue 2023-07-28 16:23:36 20 返回题目

#include <bits/stdc++.h> using namespace std; int n1[100000], n2[100000], n3[100000]; int l1, l2, l3; string nn1, nn2; int main() { cin >> nn1 >> nn2; l1 = nn1.length(); l2 = nn2.length(); l3 = max(l1, l2); for(int i=0; i<l1; i++) n1[l1-i-1] = nn1[i]-'0'; for(int i=0; i<l2; i++) n2[l2-i-1] = nn2[i]-'0'; for(int i=0; i<l3; i++) { if(n3[i]+n2[i]+n1[i] > 9) { n3[i] += n1[i]+n2[i]-10; n3[i+1] ++; }else{ n3[i] += n1[i]+n2[i]; } } if(n3[l3]) l3++; for(int i=l3-1; i>=0; i--) cout << n3[i]; return 0; }

{{ vote && vote.total.up }}