最大公约数和最小公倍数

方法1

#include <stdio.h>

int main()
{
	int gcd(int, int);
	int mcm(int, int, int);
	int u, v, h, l;
	
	printf("please input two numbers: ");
	scanf("%d,%d", &u, &v);
	
	h = gcd(u, v);
	printf("output greatest common divisor: ");
	printf("%d\n", h);
	
	l = mcm(u, v, h);
	printf("output minimum common multiple: ");
	printf("%d\n", l);
	
	return 0;
} 

int gcd(int u, int v)
{
	int t, r;
	
	if (v > u)
	{
		t = u;
		u = v;
		v = t;
	}
	while ((r = u % v) != 0)
	{
		u = v;
		v = r;
	}
	 
	return (v);
}

int mcm(int u, int v, int h)
{
	return (u * v / h);
}

方法2

#include <stdio.h>

int Gcd, Mcm;                                           //Gcd和Mcm是全局变量 

int main()
{
	void gcd(int, int);
	void mcm(int, int);
	int u, v;
	
	printf("please input two numbers: ");
	scanf("%d,%d", &u, &v);
	
	gcd(u, v);                                          //调用gcd函数 
	printf("output greatest common divisor: ");
	printf("%d\n", Gcd);
	
	mcm(u, v);                                         //调用mcm函数 
	printf("output minimum common multiple: ");
	printf("%d\n", Mcm);
	
	return 0;
} 

void gcd(int u, int v)
{
	int t, r;
	
	if (v > u)
	{
		t = u;
		u = v;
		v = t;
	}
	while ((r = u % v) != 0)
	{
		u = v;
		v = r;
	}
	Gcd = v;                                          //求出最大公约数赋给全局变量Gcd 
}

void mcm(int u, int v)
{
	Mcm = u * v / Gcd;                               //求出最小公倍数赋给全局变量Mcm 
}