We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
importjava.util.*;importjava.math.*;publicclassbetweenSets{//Finding LCM of ARRAY apublicstaticintlcm(inta,intb){return(Math.abs(a*b))/gcd(a,b);}publicstaticintfindLcm(int[]a,intsize){intresult1=a[0];for(inti=1;i<size;i++){result1=lcm(a[i],result1);}returnresult1;}//Finding GCD of ARRAY bpublicstaticintgcd(inta,intb){if(b==0)returna;returngcd(b,a%b);}publicstaticintfindGcd(int[]b,intsize2){intresult=b[0];for(inti=1;i<size2;i++){result=gcd(b[i],result);}returnresult;}publicstaticvoidmain(Stringargs[]){Scanners=newScanner(System.in);intsize=s.nextInt();//Size of Array aintsize2=s.nextInt();//Size of Array bint[]a=newint[size];int[]b=newint[size2];for(inti=0;i<size;i++){a[i]=s.nextInt();}for(inti=0;i<size2;i++){b[i]=s.nextInt();}intL=findLcm(a,size);//LCM of aintG=findGcd(b,size2);//GCD of b// System.out.println(L);//System.out.println(G);intcount=0;// Count the number of multiples of LCM that evenly divides the GCDfor(inti=L;i<=G;i+=L){if(G%i==0)count++;}System.out.println(count);}}
Between Two Sets
You are viewing a single comment's thread. Return to all comments →
Passes all the test cases