-
Notifications
You must be signed in to change notification settings - Fork 68
/
11827.cpp
82 lines (65 loc) · 1.08 KB
/
11827.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
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
#include <iostream>
#include <algorithm>
#include <sstream>
#include <string>
using namespace std;
int gcd2(int a, int b) {
while (b) {
a %= b;
swap(a, b);
}
return a;
}
int gcd(int a, int b) {
int shift;
int diff;
if (a == 0 || b == 0)
return a | b;
for (shift = 0; ((a | b) & 1) == 0; shift++) {
a >>= 1;
b >>= 1;
}
while ((a & 1) == 0)
a >>= 1;
do {
while ((b & 1) == 0)
b >>= 1;
if (a < b) {
b -= a;
} else {
diff = a - b;
a = b;
b = diff;
}
b >>= 1;
} while (b != 0);
return a << shift;
}
int main(void) {
int n, m;
int tmp;
int best;
int nums[110];
string input;
cin >> n;
getline(cin, input); // \n
while (n--) {
m = 0;
best = 0;
stringstream ss;
getline(cin, input);
ss << input;
while (ss >> nums[m]) {
m++;
}
for (int i = 0; i < m - 1; i++) {
for (int j = i + 1; j < m; j++) {
tmp = gcd(nums[i], nums[j]);
if (tmp > best)
best = tmp;
}
}
cout << best << endl;
}
return 0;
}