-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathBetween Two Set(Hackerrank).txt
74 lines (66 loc) · 1 KB
/
Between Two Set(Hackerrank).txt
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
#include<iostream>
using namespace std;
int lcm(int a, int b){
int l;
if(a>b){
l=a;
}
else{
l=b;
}
while(true){
if(l%a==0 && l%b==0){
break;
}
l++;
}
return l;
}
int hcf(int a,int b){
int l=a+b;
while(l){
if(a%l==0 && b%l==0){
break;
}
l--;
}
return l;
}
int getTotalX(int a[], int b[], int n, int m) {
int k=a[0];
int j=b[0];
while(n){
k=lcm(a[n],k);
n--;
}
while(m){
j=hcf(b[m],j);
m--;
}
int result=0;
for(int i=k;i<=j;i++){
if(i%k==0 && j%i==0){
result++;
}
}
return result;
}
int main(){
int n,m;
cin>>n>>m;
int a[n];
int b[m];
for(int i=0;i<n;i++){
cin>>*(a+i);
}
for(int i=0;i<m;i++){
cin>>*(b+i);
}
if(n<6){
cout<<getTotalX(a,b,n-1,m-1)<<endl;
}
else{
int f=0;
cout<<f<<endl;
}
}