最大公约数、最小公倍数

#include <iostream>
using namespace std;
/*最大公约数*/
int gcd(int a, int b)
{
int min = 0;
if (a <= 0 || b <= 0)
return -1;
if (a > b)
min = b;
else
min = a;
while (min)
{
if (a%min == 0 && b%min == 0)
return min;
min--;
}
return -1;
}
/*最小公倍数*/
int lcm(int a, int b)
{
int max = 0;
if (a <= 0 || b <= 0)
return -1;
if (a > b)
max = a;
else
max = b;
while (max)
{
if (max%a == 0 && max%b == 0)
return max;
max++;
}
return -1;
}
int main()
{
int a = 4, b = 6;
int c = 0;
int d = 0;
c = gcd(a, b);
d = lcm(a, b);
cout << "最大公约数:"<< c << endl;
cout << "最大公倍数:" << d << endl;

return 0;
}