85分求调

#include<iostream>
#include<string>
#include<math.h>
using namespace std;
int p, q, r;
int dec(int n, int base) {
	string s = to_string(n);
	int ans = 0;
	for (int i = 0; i < s.size(); i++) {
		ans += (s[i] - '0') * pow(base, s.size() - i - 1);
	}
	return ans;
}
int main() {
	cin >> p >> q >> r;
	for (int i = 2; i <= 16; i++) {
		if (dec(p, i) * dec(q, i) == dec(r, i)) {
			cout << i;
			return 0;
		}
	}
	cout << 0;
	return 0;
}