-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathday088.c
40 lines (33 loc) · 781 Bytes
/
day088.c
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
#include <stdio.h>
int gcd(int num1, int num2){
if(num1 == 0 || num2 == 0)
return 0;
if(num1 == num2)
return num1;
if(num1>num2)
return gcd(num1-num2, num2);
return gcd(num1, num2-num1);
}
int lcm(int num1, int num2){
return (num1*num2) / gcd(num1, num2);
}
int min(int num1, int num2){
return num1<num2?num1:num2;
}
int main(void) {
int arr[50], arr_size;
printf("Enter the size of the array\n");
scanf("%d", &arr_size);
printf("Enter %d elements\n", arr_size);
for(int i=0; i<arr_size; i++)
scanf("%d", &arr[i]);
int count = 0;
for(int i=0; i<arr_size; i++){
for(int j=i+1; j<arr_size; j++){
if(lcm(arr[i], arr[j]) > min(arr[i], arr[j]))
count++;
}
}
printf("Result is %d", count);
return 0;
}