-
Notifications
You must be signed in to change notification settings - Fork 68
/
10677.cpp
58 lines (43 loc) · 1.04 KB
/
10677.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
#include <iostream>
#include <cmath>
#include <vector>
using namespace std;
#define REP(i, b, n) for (int i = b; i < n; i++)
#define rep(i, n) REP(i, 0, n)
vector<int> convert(int number, int base) {
vector<int> result;
while (number) {
result.push_back(number % base);
number /= base;
}
return result;
}
int convert2(vector<int> &converted, int base) {
int result = 0;
rep (i, converted.size()) {
result += converted[i] * pow(base, i);
}
return result;
}
int main(void) {
int n;
int B1, B2, r1, r2;
cin >> n;
while (n--) {
cin >> B1 >> B2 >> r1 >> r2;
int result = -1;
for (int i = r2 - 1; i > r1; i--) {
vector<int> converted = convert(i, B1);
int tmp = convert2(converted, B2);
if (tmp % i == 0) {
result = i;
break;
}
}
if (result == -1)
cout << "Non-existent." << endl;
else
cout << result << endl;
}
return 0;
}