28 条题解

  • 0
    @ 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; }

    信息

    ID
    1190
    时间
    1000ms
    内存
    128MiB
    难度
    7
    标签
    递交数
    1084
    已通过
    274
    上传者