通过代码:
#include <bits/stdc++.h> #define LL long long using namespace std; LL p, q, r, b = 2; LL HEX(LL _n, LL _b) { LL sum = 0; char a[10] = {}; sprintf(a,"%lld",_n); int len = strlen(a); for(LL i = 0; i < len; i ++) sum += (a[len - i - 1] - '0') * pow(_b, i); return sum; } int main() { scanf("%lld%lld%lld", &p, &q, &r); while(b <= 40) { if(HEX(p,b) * HEX(q,b) == HEX(r,b)) { printf("%lld", b); return 0; } b ++; } printf("0"); return 0; }
1413:确定进制
最新推荐文章于 2024-04-19 10:07:48 发布