Wolf and Rabbit
来源:互联网 发布:少帅汤玉麟 知乎 编辑:程序博客网 时间:2024/05/29 10:08
Wolf and Rabbit
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2997 Accepted Submission(s): 1652Problem 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
题目大意:就是求最大公约数,如果有大于1的公约数则yes
#include <iostream>using namespace std;int gcd(int a,int b){ if(b==0)return a; return gcd(b,a%b);}int main(){ int m,n; int t,ans; cin>>t; while(t--) { cin>>m>>n; // if(m==1)cout<<"NO"<<endl; int gg=gcd(m,n); if(gg==1) cout<<"NO"<<endl; else cout<<"YES"<<endl; } 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
- 进程及其相关概念
- 序列化和反序列化的简单理解
- Android播放音乐
- c++多态的实现
- ORACLE Unit03 SQL(基础查询) 、 SQL(关联查询)
- Wolf and Rabbit
- 前端菜鸟的自学之路(二)——CSS网页布局
- 3. Where's Waldorf
- iOS让controller具有右滑pop的效果
- mysql5.6数据库同步,单双多主多从配置。
- Java多线程之AbstractQueuedSynchronizer
- 使用git上传项目到码云
- 关于求职你应该知道的那些事
- 线性表学习(4)