#include <iostream>
using namespace std;
int gcd(int m,int n);
int lcm(int m,int n);
int main()
{
int m,n,k=0;
while(cin>>m>>n)
{++k;
cout<<"Case "<<k<<":"<<endl;
if(gcd(m,n)==0)
cout<<"no GCD"<<endl;
else
cout<<"GCD"<<"("<<m<<","<<n<<")"<<" = "<<gcd(m,n)<<endl;
if(lcm(m,n)==0)
cout<<"no LCM"<<endl<<endl;
else
cout<<"LCM"<<"("<<m<<","<<n<<")"<<" = "<<lcm(m,n)<<endl<<endl;
}
return 0;
}
int gcd(int m,int n)
{
int r;
if(m==0&&n==0)
return 0;
while(n)
{r=m%n;
m=n;
n=r;
}
return m;
}
int lcm(int m,int n)
{
int a;
if(m==0||n==0)
return 0;
a=gcd(m,n);
if(a==0)
return 0;
else
return m/a*n;
}
最大公因数最小公倍数
最新推荐文章于 2024-05-20 20:16:31 发布