2115 - 求三个数的最小公倍数

2 5 3

30

Solution C

#include <stdio.h>

int f(int a,int b)
{
    if ( !(a%b) )   return b;
    return f(b,a%b);
}

int main(void)
{
    int a,b,c;
    int res;

    scanf("%d %d %d",&a,&b,&c);
    res = a * b / f(a,b);
    res = res * c / f(res,c);
    printf("%d\n",res);
    return 0;
}

Solution C++

#include <iostream>
using namespace std;
int main()
{
	long a;
	long b;
	long c;
	long max;
	int i=2;
	cin >>a >>b>>c;
	if(a>b&&a>c)
		max=a;
	if(b>a&&b>c)
		max=b;
	if(c>a&&c>b)
		max=c;
	while(max%a!=0||max%b!=0||max%c!=0)
	{
		max=max++;
		
	}
	cout <<max<<endl;
	return 0;
}