题目：https://pintia.cn/problem-sets/994805260223102976/problems/994805263297527808
坑点在如果一个没都没输出，那么最后要输出0，否则最后一个测试点会挂

代码

  1. #include<cstdio>
  2. #include<iostream>
  3. #include<string>
  4. #include<vector>
  5. #include<algorithm>
  6. using namespace std;
  8. int main(){
  9.     string table, a, b;
  10.     int carry = 0;
  11.     vector<int> ans;
  12.     cin>>table>>a>>b;
  13.     int max_len = max(table.size(), max(a.size(), b.size()));
  14.     //全部补零
  15.     while(table.size() != max_len) table.insert(0, "0");
  16.     while(a.size() != max_len) a.insert(0, "0");
  17.     while(b.size() != max_len) b.insert(0, "0");
  18.     //开始计算
  19.     for(int i = max_len - 1; i >= 0; i--){
  20.         int fenmu = (table[i] - '0');
  21.         if(fenmu == 0) fenmu = 10;
  22.         int temp = (a[i] - '0' + b[i] - '0' + carry) % fenmu;
  23.         carry = (a[i] - '0' + b[i] - '0' + carry) / fenmu;
  24.         ans.push_back(temp);
  25.     }
  26.     ans.push_back(carry);
  27.     int flag = 0;
  28.     for(int i = ans.size() - 1; i >= 0; i--){
  29.         if(ans[i] == 0 && flag == 0){
  30.             continue;
  31.         } else {
  32.             cout<<ans[i];
  33.             flag = 1;
  34.         }
  35.     }
  36.     if(flag == 0) printf("%d", 0);
  37.     return 0;
  38. }