A+B高精 problem代码

以下是一份C++代码，可以解决A+B高精问题：

#include #include #include using namespace std;

vector add(vector &a, vector &b) { vector c; int t = 0; for (int i = 0; i < a.size() || i < b.size(); i++) { if (i < a.size()) t += a[i]; if (i < b.size()) t += b[i]; c.push_back(t % 10); t /= 10; } if (t) c.push_back(1); return c; }

int main() { string sa, sb; vector a, b; cin >> sa >> sb; for (int i = sa.size() - 1; i >= 0; i--) a.push_back(sa[i] - '0'); for (int i = sb.size() - 1; i >= 0; i--) b.push_back(sb[i] - '0'); auto c = add(a, b); for (int i = c.size() - 1; i >= 0; i--) printf("%d", c[i]); return 0; }