hello kity

148077

# HDU 1222（Wolf and Rabbit）约瑟夫最小公倍数问题

spoiler posted @ 2011年4月18日 21:53 in 规律及递归经典题 , 1818 阅读
 Problem Description There is a hill with n holes around. The holes are signed from 0 to n-1. A rabbit must hide in one of the holes. A wolf searches the rabbit in anticlockwise order. The first hole he get into is the one signed with 0. Then he will get into the hole every m holes. For example, m=2 and n=6, the wolf will get into the holes which are signed 0,2,4,0. If the rabbit hides in the hole which signed 1,3 or 5, she will survive. So we call these holes the safe holes. Input The input starts with a positive integer P which indicates the number of test cases. Then on the following P lines,each line consists 2 positive integer m and n(0

#include<iostream>
#include<cstdio>
using namespace std;
int gcd(int x,int y){
int c;
if(x<y){
c=x;	x=y;
y=c;
}
if(y==0)
return x;
else
return gcd(y,x%y);
}
int main(){
int cas,n,m;
scanf("%d",&cas);
while(cas--){
scanf("%d %d",&m,&n);
printf(gcd(n,m)==1?"NO\n":"YES\n");
}
return 0;
}


(输入验证码)
or Ctrl+Enter