求最大公约数及最小公倍数

普通版

#include <stdio.h>
int main()
{
	int M, N;
	scanf("%d %d", &M, &N);
	int div, mul;
	int i, k;
	for(i = 1; i < M; i++)
	{
		if(M % i == 0&& N % i == 0 ) div = i; 
	}
	for(i = M; i % M != 0 || i % N != 0; i++)
       ;
    mul = i;
	printf("%d %d", div, mul);
	return 0;
}

辗转相除版（求最大公倍数）

#include <stdio.h>
int main()
{
	int M, N;
	scanf("%d %d", &M, &N);
	int complement = M % N;
	while(complement)
	{
		M = N;
		N = complement;
		complement = M % N;
	}
	printf("%d", N);
	return 0;
}

#include <stdio.h>
int main()
{
	int a,b;
	scanf("%d %d",&a,&b);
	
	int r;
	r = a%b;
	while(r != 0)
	{
		a = b;
		b = r;
		r = a % b;
	}
	printf("%d", b);
	
	return 0;
}

退化版，无脑暴力

#include <stdio.h>
int main()
{
	int m, n;
	scanf("%d %d",&m,&n);
	int i;
	for(i=m;i>0;i--)
	{
		if(m%i==0&&n%i==0)
		   break;
	}
	printf("%d\n",i);
	printf("%d\n",m*n/i);
	return 0;
 } 

高阶版AI

#include <stdio.h>
int gcd(int a,int b);
int lcm(int a,int b);
int main()
{
	int a,b;
	scanf("%d %d",&a,&b);
	int maxcommondivisor=gcd(a,b);
	int mincommonmultiple=lcm(a,b);
	printf("%d %d",maxcommondivisor,mincommonmultiple);
	return 0; 
}
int gcd(int a,int b)
{
	if(b==0) return a;
	else return gcd(b,a%b);
}
int lcm(int a,int b)
{
	return (a*b) / gcd(a,b);
}