//求最大公约数
int is(int a,int b){
while (a % b != 0) {
int c = a % b;
a = b;
b = c;
}
return b;
}
//求最大公约数
int is(int a,int b){
while (a % b != 0) {
int c = a % b;
a = b;
b = c;
}
return b;
}