HackerRank C Solution - Between Two Sets

Complete the getTotalX function in the editor below. It should return the number of integers that are betwen the sets.

getTotalX has the following parameter(s):

a: an array of integers
b: an array of integers

1. #include<stdio.h>
3. int gcd(int a, int b) { if (a == 0) return b; return gcd(b % a, a); } int lcm(int x, int y ) {
5. if(x==0)
6. return 0;
7. return (x*y)/gcd(x,y);
8. }
10. int main() { int n,m; scanf("%d %d",&n,&m); int a[n],b[m];
12. for(int i=0; i<n; i++)
13. {
14. scanf("%d",&a[i]);
15. }
16. for(int j=0; j<m; j++)
17. {
18. scanf("%d",&b[j]);
19. }
22. int x=a[0];
23. int y=b[0];
25. for(int i=0; i<n; i++)
26. {
28. x=lcm(x,a[i]);
31. }
32. for(int j=0; j<m; j++)
33. {
34. y=gcd(y,b[j]);
35. }
37. int k=1;
38. int count=0;
39. int num=x;
40. while(x<=y)
41. {
43. if(y%(x)==0) count++;
45. k++;
46. x=num*k;
47. }
48. printf("%d",count);
49. }