2 条题解
-
0
A + B PROBLEM
这道题一看就知道要用 高精度加法，废话不多说 上代码
#include <bits/stdc++.h> using namespace std; char a[505], b[505]; int j, len1, len2, c[505], a1[505], b1[505], len; int main() { cin >> a; cin >> b; len1 = strlen(a); len2 = strlen(b); for (int i = len1 - 1; i >= 0; i--) { a1[len1 - i] = a[i] - '0'; } for (int i = len2 - 1; i >= 0; i--) { b1[len2 - i] = b[i] - '0'; } for (int i = 1; i <= max(len1, len2); i++) { c[i] += a1[i] + b1[i]; if (c[i] >= 10) { c[i + 1] += 1; c[i] -= 10; if (i == max(len1, len2)) len++; } len++; } for (int i = len; i >= 1; i--) cout << c[i]; return 0; }
oysh
LV 5
@ 2023-10-30 13:37:19
- 1
