Wolf and Rabbit
来源:互联网 发布:做网络彩票销售员好吗 编辑:程序博客网 时间:2024/05/21 14:56
Wolf and Rabbit
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4499 Accepted Submission(s): 2259
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.
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
Author
weigang Lee
Source
杭州电子科技大学第三届程序设计大赛
#include<iostream>#include<cstdio>using namespace std;long long gcd(long long a,long long b){if(b == 0) return a;else return gcd(b,a%b);}int main(){ int p; long long m,n; scanf("%d",&p); while(p--) { cin>>m>>n; if(gcd(m,n)==1) printf("NO\n"); else printf("YES\n"); } return 0;}
Recommend
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
- windows平台编译phoneme经验总结
- NYOJ 14 会场安排问题 快排
- 我在南大的七年
- shell脚本 文件合并 - 字符串处理
- 版本控制详细说明
- Wolf and Rabbit
- java总结
- Android之Broadcast(广播)
- js学习(四)闭包
- Working Practice-非紧要业务不要使用模式对话框
- 畅通工程
- hibernate的缓存机制
- oracle goto语句介绍
- 编译Mysql 5.5时报do_abi_check错误