HDU Little Boxes C++高精

Little boxes on the hillside.
Little boxes made of ticky-tacky.
Little boxes.
Little boxes.
Little boxes all the same.
There are a green boxes, and b pink boxes.
And c blue boxes and d yellow boxes.
And they are all made out of ticky-tacky.
And they all look just the same.

Input

The input has several test cases. The first line contains the integer t (1 ≤ t ≤ 10) which is the total number of test cases.
For each test case, a line contains four non-negative integers a, b, c and d where a, b, c, d ≤ 2^62, indicating the numbers of green boxes, pink boxes, blue boxes and yellow boxes.

Output

For each test case, output a line with the total number of boxes.

Sample

Input	Output
4 1 2 3 4 0 0 0 0 1 0 0 0 111 222 333 404	10 0 1 1070

高精加法 

代码:

#include<iostream>
#include<vector>
#include<cstring>
#include<string>
using namespace std;
vector<int> add(vector<int>A, vector<int>B)
{
	vector<int >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()
{
	int n;
	scanf("%d", &n);
	while (n--)
	{
		string a, b, c, d;
		vector<int>A, B, C, D, S;
		cin >> a >> b >> c >> d;
		for (int i = a.size() - 1; i >= 0; i--)A.push_back(a[i] - '0');
		for (int i = b.size() - 1; i >= 0; i--)B.push_back(b[i] - '0');
		for (int i = c.size() - 1; i >= 0; i--)C.push_back(c[i] - '0');
		for (int i = d.size() - 1; i >= 0; i--)D.push_back(d[i] - '0');
		auto X = add(A, B);
		auto Y = add(C, D);
		auto Q = add(X, Y);

		for (int i = Q.size() - 1; i >= 0; i--)
			cout << Q[i];
		cout << endl;
	}
}