【ACM Steps】Wolf and Rabbit
来源:互联网 发布:linux vi文件编辑命令 编辑:程序博客网 时间:2024/06/05 20:23
Wolf and Rabbit
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1252 Accepted Submission(s): 726Problem 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 <iostream>using namespace std;int gcd(int x,int y){int c;if(x<c){c=x;x=y;y=c;}if(y==0)return x;else return gcd(y,x%y); }int main(){int n;cin>>n;while(n--){int a,b;cin>>a>>b;if(gcd(a,b)==1) cout<<"NO"<<endl;else cout<<"YES"<<endl;}return 0;}
- 【ACM Steps】Wolf and Rabbit
- HD ACM Wolf and Rabbit
- [ACM - 数论]Wolf and Rabbit
- HDU ACM 1222 Wolf and Rabbit
- 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
- Windows7使用OpenOffice SDK的配置 (2)
- 配置mongodb分片群集(sharding cluster)
- 文件操作与ASCII文件流
- Qt 的几个核心机制总结之 事件管理
- Memcached 配置
- 【ACM Steps】Wolf and Rabbit
- 对话框中菜单的标记
- 程序员的数学--笔记
- 探索推荐引擎内部的秘密,第 2 部分: 深入推荐引擎相关算法 - 协同过滤
- ultraedit设置默认打开格式
- 关于UI_USER_INTERFACE_IDIOM() & UIDevice.model
- VC+ADO 连接ACCESS和SQL SERVER的方法
- 网格计算、集群计算、云计算、分布式计算(一)
- WPF App下无法多个窗口按序ShowDialog