201111621413
int gcd(int a, int b)
{
int count,result=1;
count = sqrt(max(a,b));
for(int i = 0 ; i < count; i++)
{
if(a%(count-i) == 0 && b%(count-i) == 0)
result = count -i;
}
}
完善后的程序
//计算最大公约数
int gcd(int a, int b)
{
int count,result=1;
count = sqrt(max(a,b));
for(int i = 0 ; i < count; i++)
{
if(a%(count-i) == 0 && b%(count-i) == 0)
result = count -i;
}
}
编程结果