-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path0406-1.cpp
More file actions
44 lines (39 loc) · 944 Bytes
/
0406-1.cpp
File metadata and controls
44 lines (39 loc) · 944 Bytes
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
#include <string>
#include <vector>
using namespace std;
int gcd(int a, int b)
{
if(b > a) return gcd(b, a);
if(b == 0) return a;
return gcd(b, a % b);
}
vector<int> A;
vector<int> B;
int check(int x, vector<int> & array)
{
for(int j = 0; j < array.size(); j++)
{
if(array[j] % x == 0)
{
return 0;
}
}
return x;
}
int solution(vector<int> arrayA, vector<int> arrayB) {
int answer = 0;
if(arrayA.size() == 1)
{
if(arrayA[0] % arrayB[0] != 0) answer = max(answer, arrayB[0]);
if(arrayB[0] % arrayA[0] != 0) answer = max(answer, arrayA[0]);
return answer;
}
int gcdA = gcd(arrayA[0], arrayA[1]);
int gcdB = gcd(arrayB[0], arrayB[1]);
for(int i = 2; i < arrayA.size(); i++)
{
gcdA = gcd(gcdA, arrayA[i]);
gcdB = gcd(gcdB, arrayB[i]);
}
return max(check(gcdA, arrayB), check(gcdB, arrayA));
}