POJ - 1503 高精度加法

题目链接

点此跳转

代码

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <iostream>
#include <sstream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <set>
#include <map>

#define LL long long
#define mem(a, b) memset(a, b, sizeof a)
#define lowbit(x) (-x&x)
#define IOS ios::sync_with_stdio(false),cin.tie(0)
#define endl '\n'

using namespace std;

vector<int> add(vector<int> &A, vector<int> &B) {
	vector<int> C;
	int la = A.size(), lb = B.size();
	for (int i = 0, t = 0; i < la || i < lb || t > 0; i ++ ) {
		t += (i < la ? A[i] : 0) + (i < lb ? B[i] : 0);
		C.push_back(t % 10);
		t /= 10;
	}
	return C;
}

int main() {
	IOS;
	
	vector<int> A, B;
	string s;
	
	cin >> s;
	for (int i = s.size() - 1; i >= 0; i -- ) {
		A.push_back(s[i] - '0');
	}
	while (cin >> s) {
		if (s == "0") break;
		
		B.clear();
		for (int i = s.size() - 1; i >= 0; i -- ) {
			B.push_back(s[i] - '0');
		}
		A = add(A, B);
	}
	
	reverse(A.begin(), A.end());
	for (int i = 0; i < A.size(); i ++ ) cout << A[i];
	cout << endl;
	
	return 0;
}