int gcb(int a,int b)//辗转相除法 迭代
{
while(a%b){
int tmp = a;
a = b;
b = tmp%b;
}
return b;
}
int gcb(int a,int b)//递归
{
return a%b==0? b:gcb(b,a%b);
}
int gcb(int a, int b)
{
int tmp = 1;
while(tmp)
{
tmp = a%b;
a = b;
b = tmp;
}
return a;
}
int gcb1(int a,int b)
{
if(b == 0)
return a;
return gcb1(b,a%b);
}