Wolf and Rabbit
来源:互联网 发布:守望先锋性能数据rtt 编辑:程序博客网 时间:2024/06/05 17:12
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.
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<m,n<2147483648).
Output
For each input m n, if safe holes exist, you should output "YES", else output "NO" in a single line.
Sample Input
21 22 2
Sample Output
NOYES
#include<stdio.h>
int GCD(int a,int b){
if(a%b==0)
return b;
else
return GCD(b,a%b);
}
int main()
{
int a,b,t,m,n,p;
scanf("%d",&p);
while(p--)
{
scanf("%d%d",&m,&n);
t=GCD(m,n);
if(t==1)
printf("NO\n");
else
printf("YES\n");
}
return 0;
}
0 0
- HDU1222:Wolf and Rabbit
- 1222 Wolf and Rabbit
- Wolf and Rabbit tzc
- hdu1222-Wolf and Rabbit
- Wolf and Rabbit
- Wolf and Rabbit
- HDU1222 Wolf and Rabbit
- Wolf and Rabbit
- HDOJ1222--Wolf and Rabbit
- Wolf and Rabbit<hdoj1222>
- A - Wolf and Rabbit
- Wolf and Rabbit
- Wolf and Rabbit
- Wolf and Rabbit
- Wolf and Rabbit hdu1222
- Wolf and Rabbit
- Wolf and Rabbit
- wolf and rabbit
- loadrunner访问https后端服务
- Redis 持久化
- Xamarin学习:点按按钮累加次数并显示
- http://blog.csdn.net/angelbosj/article/details/7981247
- UVa 11407 - Squares
- Wolf and Rabbit
- 2016HDU多校联赛-HDU-5723-Abandoned country(最小生成树 邻接表DFS)
- Codeforces Round #363 (Div. 2) D. Fix a Tree (并查集)
- SAP Function ALV 02(单、双击设置)
- Windows7下Apache2.x与PHP5.2.6的傻瓜式配置(图文+分步解析)
- if(0 == 'hello') = true (神奇的php)
- 92. Reverse Linked List II
- Linux中安装PHP的PDO MySQL扩展的详细解决方案
- 实现页面三级联动以及弹出隐藏框