P1604 任意进制数相加

原题链接：

洛谷 P1604https://www.luogu.com.cn/problem/P1604

输入样例·1

4
123
321

输出样例·1

1110

解题思路

输入使用字符串存储，注意32进制包含多个字母。

使用高精度加法，注意考虑进制的概念：十进制满十进一，十六进制满十六进一，三十二进制满32进一......

代码

#define _CRT_SECURE_NO_WARNINGS 1
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int n;
bool cmp(vector<int>& A, vector<int>& B) {
	if (A.size() != B.size())return A.size() > B.size();
	for (int i = A.size() - 1; ~i; i--)
		if (A[i] != B[i])
			return A[i] > B[i];
	return true;
}
vector<int>sum(vector<int>& A, vector<int>& B, int n) {
	vector<int>C;
	int t = 0;
	for (int i = 0; i < A.size(); i++) {
		if (i < B.size())t += A[i] + B[i];
		else t += A[i];
		C.push_back(t % n);
		t /= n;
	}
	if (t > 0)C.push_back(t);
	while (C.size() > 1 && C.back() == 0)C.pop_back();
	reverse(C.begin(), C.end());
	return C;
}
int main() {
	string a, b;
	cin >> n >> a >> b;
	vector<int>A, B, C;
	for (int i = a.size() - 1; i >= 0; i--) {
		if (a[i] >= '0' && a[i] <= '9')A.push_back(a[i] - '0');
		else A.push_back(a[i] - 'A' + 10);
	}
	for (int i = b.size() - 1; i >= 0; i--) {
		if (b[i] >= '0' && b[i] <= '9')B.push_back(b[i] - '0');
		else B.push_back(b[i] - 'A' + 10);
	}
	if (cmp(A, B))C = sum(A, B, n);
	else C = sum(B, A, n);
	for (int i = 0; i < C.size(); i++)
		if (C[i] > 9)cout << (char)(C[i] - 10 + 'A');
		else cout << C[i];
	return 0;
}