Greatest Common Divisor

The greatest common divisor (gcd), sometimes known as the greatest common factor (gcf) or highest common factor (hcf), of two non-zero integers, is the largest positive integer that divides both numbers without remainder.

A common factor is a number which is a factor of two different problems; thus, in 1 x 4 the factors are 1, 2 and 4 (1 x 4 = 4; 2 x 2 = 4) and in 1 x 6 the factors are 1, 2, 3 and 6 (1 x 6 = 6; 2 x 3 = 6}; therefore the common factors of the two problems are 1 and 2, with 2 being the highest common factor.

Here’s a code for Greatest Common Divisor…

INPUT:

#include <stdio.h>

#include <conio.h>

int main()

{

int num, choice = 0;

int a, counter, center;

scanf(“%d”, &num);

while (choice != num){

scanf(“%d%d”, &a, &counter);

printf(“\n”);

for(counter=1;counter!=1;counter++){

center = counter;

counter = a % counter;

a = center;

}

printf(“#%d – %d\n”, (choice + 1), a);

choice++;

}

getch();

}

OUTPUT:

//Reminders: Don't just copy and paste the code, try to understand it. It's for your own benefit.

~ by smush143 on March 6, 2009.