最大公约数gcd、最小公倍数lcm

#include <iostream>
using namespace std;

//计算最大公约数gcd、最小公倍数lcm
int calgcd(int a,int b)//greatest common divisor-gcd-最大公约数
{
	if ((a*b)!=0)
	{
		int min = (a>=b)?b:a,i;
		for (i = min; i > 1; i--)
		{
			if (a%i==0&&b%i==0)
			{
				break;
			}
		}
		return i;
	}
	else
	{
		return -1;
	}
}

int callcm(int a,int b)//least common multiple-最小公倍数
{
	if ((a*b)!=0)
	{
		int max = (a>=b)?a:b;
		for (int i = max;; ++i)
		{
			if (i%a==0&&i%b==0)
			{
				return i;
			}
		}
	}
	else
	{
		return -1;
	}
}


int main()
{
	int a,b,gcd,lcm;

	cin>>a>>b;

	gcd=calgcd(a,b);
	lcm=callcm(a,b);

	cout<<"gcd is :"<<gcd<<endl;
	cout<<"lcm is :"<<lcm<<endl;
}