-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathBetweenTwoSets.java
44 lines (44 loc) · 1.06 KB
/
BetweenTwoSets.java
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
import java.util.Scanner;
public class BetweenTwoSets{
public static void main(String[] args){
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int m = in.nextInt();
int[] a = new int[n];
for(int a_i=0;a_i<n; a_i++){
a[a_i] = in.nextInt();
}
int[] b = new int[m];
for(int b_i=0;b_i <m; b_i++){
b[b_i] = in.nextInt();
}
int f=lcm(a);
int l=gcd(b);
int count=0;
for(int i=f,j=2;i<=l;i=f*j,j++){
if(l%i==0){ count++;}
}
System.out.println(count);
in.close();
}
private static int gcd(int a,int b){
return b==0?a:gcd(b,a%b);
}
private static int gcd(int[] input){
int result=input[0];
for(int i=1; i<input.length;i++){
result=gcd(result, input[i]);
}
return result;
}
private static int lcm(int a,int b){
return a*(b/gcd(a,b));
}
private static int lcm(int[] input) {
int result = input[0];
for (int i=1;i<input.length;i++){
result = lcm(result,input[i]);
}
return result;
}
}