Problem :- Write a C Program to Find GCD ( greatest common divisor ) of two Numbers Using For Loop .
Logic :- In mathematics, the greatest common divisor (gcd) of two or more integers, which are not all zero, is the largest positive integer that divides each of the integers. For example, the gcd of 8 and 12 is 4.
Try Yourself C++ Program To Find GCD Using Functions
Solution :-
Output:-
Logic :- In mathematics, the greatest common divisor (gcd) of two or more integers, which are not all zero, is the largest positive integer that divides each of the integers. For example, the gcd of 8 and 12 is 4.
The greatest common divisor is also known as the greatest common factor (gcf), highest common factor (hcf),greatest common measure (gcm),or highest common divisor wikipedia
Try Yourself C++ Program To Find GCD Using Functions
Solution :-
#include
int main()
{
//GHANENDRA YADAV
int num1, num2, i, hcf;
printf("Enter Two Integers :\n");
scanf("%d %d", &num1, &num2);
for(i=1; i<=num1 || i<=num2; ++i)
{
if(num1%i==0 && num2%i==0)
hcf=i;
}
printf("H.C.F of %d and %d is %d", num1, num2, hcf);
return 0;
}
Output:-
0 Comments: