1222 Wolf and Rabbit
来源:互联网 发布:苹果mac系统os 编辑:程序博客网 时间:2024/05/19 20:46
Wolf and Rabbit
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
其实理解了题意后,就是m和n找最大公约数是否为1
#include<cstdio>#include<algorithm>using namespace std;int gcd(int a,int b){ return b>0?gcd(b,a%b):a;}int main(){ int p,n,m,i; scanf("%d",&p); while(p--) { scanf("%d%d",&m,&n); if(gcd(max(m,n),min(m,n))==1) printf("NO\n"); else printf("YES\n"); } return 0;}
阅读全文
0 0
- 1222 Wolf and Rabbit
- 1222 Wolf and Rabbit
- hdu 1222 Wolf and Rabbit
- HDU 1222 Wolf and Rabbit
- hdu 1222 Wolf and Rabbit
- hdu 1222 Wolf and Rabbit
- HDU 1222 Wolf and Rabbit
- hdu--1222 Wolf and Rabbit
- hdu 1222 Wolf and Rabbit
- hdu 1222 Wolf and Rabbit
- HDU 1222 Wolf and Rabbit
- Wolf and Rabbit(hdu 1222)
- 【HDU】 1222 Wolf and Rabbit
- HDU 1222 Wolf and Rabbit
- hdoj 1222 Wolf and Rabbit
- HDOJ 1222 Wolf and Rabbit
- Wolf and Rabbit hd 1222
- 【HD 1222】Wolf and Rabbit
- docker容器和数据库数据分离
- 关于bootstrap-treeview数型结构的转化及使用、增删改等操作
- MD5对密码进行加密,用Apache codec 替换Sun内部API sun.misc.BASE64Encoder
- shell编程之结构化命令if-then
- 4步教你开发风控评分模型
- 1222 Wolf and Rabbit
- IIS配置支持跨域请求
- hadoop MapReduce集群模式调整匹配及shell脚本处理
- 传统企业转向互联网,如何快速提升研发效能?
- 关于Nginx部署多个项目(多个Tomcat)
- requests爬取小说
- 1009. 说反话 (20)
- C++ 标识符的作用域
- 禁地