void main(){
int result = divisor(78,24);
printf("%d\n",result);
}//main
//求最大公约数
int divisor(int m, int n){
int r;
while ((r = m%n) != 0){//辗转相除法
m = n;
n = r;
}//while
return n;
}//divisor
void main(){
int result = divisor(78,24);
printf("%d\n",result);
}//main
//求最大公约数
int divisor(int m, int n){
int r;
while ((r = m%n) != 0){//辗转相除法
m = n;
n = r;
}//while
return n;
}//divisor