C Language: The method of greatest common divisor and least common multiple

Euclidean algorithm, also known as Euclid. two positive integers A and B (A>b), their greatest common divisor equals the greatest common divisor between the remainder C and the smaller number B. least common multiple = two number of product/greatest common divisor

#include <stdio.h>
int Get1 (int a, int b)
{
if (a < b)
{
int C = A;
A = b;
b = C;
}
while (a%b! = 0)
{
b = a%b;
A = b;
}
return b;
}
int Get2 (int a,int b)
{
Return A*b/get1 (A, b);
}
int main ()
{
printf ("Greatest common divisor%d\n", Get1 (200, 15));
printf ("Min.%d", Get2 (200, 15));
return 0;
}

C Language: The method of greatest common divisor and least common multiple