#define _CRT_SECURE_NO_WARNINGS 1
#include <stdio.h>
int main()/*求两个数的最小公倍数*/
{
int a = 0;
int b = 0;
scanf("%d%d", &a, &b);
int m = a > b ? a : b;
while (1)
{
if (m % a == 0 && m % b == 0)
{
printf("%d", m);
break;
}
m++;
}
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);
}
int main()
{
int a = 0;
int b = 0;
scanf("%d %d", &a, &b);
printf("%d", lcm(a, b));
return 0;
}
int main()/*辗转相除法求两个数的最大公约数*/
{
int a = 0;
int b = 0;
scanf("%d%d", &a, &b);
int m = 0;
while (m = a % b)
{
a = b;
b = m;
}
printf("%d", b);
return 0;
}
int gcd(int a, int b)/*利用更相减损法求两个数的最大公约数*/
{
if (a == b)
return a;
if (a < b)
return gcd(a, b - a);
if (a > b)
return gcd(a - b, b);
}
int main()
{
int a = 0;
int b = 0;
scanf("%d%d", &a, &b);
printf("%d", gcd(a, b));
return 0;
}
欢迎大家分享一些新的算法!