28 条题解
-
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]; }
信息
- ID
- 1190
- 时间
- 1000ms
- 内存
- 128MiB
- 难度
- 7
- 标签
- 递交数
- 1085
- 已通过
- 275
- 上传者