GCD of Two Numbers in C | Greatest Common Divisor Program

Write a C program to find the GCD of two numbers using FOR Loop. Greatest Common Divisor of two numbers in C. How to find the GCD of two numbers. 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.

Read: C++ Program To Find GCD Using Functions

GCD of Two Numbers in C

#include <stdio.h>

/*C program to find the GCD of two numbers using FOR Loop*/

int main()
	int num1, num2, i, hcf;

	printf("Enter Two Numbers to ind the GCD:\n");
	scanf("%d %d", &num1, &num2);

	for (i = 1; i <= num1 || i <= num2; ++i)
		if (num1 % i == 0 && num2 % i == 0)
			hcf = i;

	printf("GCD(Greatest Common Divisor) of %d and %d is %d", num1, num2, hcf);
	return 0;

The Output of GCD of Two Numbers

The Output of GCD of Two Numbers

Similar to the GCD of Two Numbers

Previous Post
Next Post

post written by:

Hi, I’m Ghanendra Yadav, SEO Expert, Professional Blogger, Programmer, and UI Developer. Get a Solution of More Than 500+ Programming Problems, and Practice All Programs in C, C++, and Java Languages. Get a Competitive Website Solution also Ie. Hackerrank Solutions and Geeksforgeeks Solutions. If You Are Interested to Learn a C Programming Language and You Don't Have Experience in Any Programming, You Should Start with a C Programming Language, Read: List of Format Specifiers in C.
Follow Me