HDU 1222 Wolf and Rabbit(gcd)
来源:互联网 发布:大数据分析系统架构 编辑:程序博客网 时间:2024/05/21 08:38
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
就和丢手绢一样。 。 。 判断m与n是否互质
#include<cstdio>#include<iostream>#include<algorithm>#include<cstring>#include<cmath>using namespace std;int gcd(int a,int b){ return b ? gcd(b,a%b):a;}int main(){ int t; scanf("%d",&t); while(t--) { int a,b; scanf("%d%d",&a,&b); if(gcd(a,b) == 1) { printf("NO\n"); } else { printf("YES\n"); } } return 0;}
0 0
- hdu 1222 Wolf and Rabbit (GCD)
- HDU 1222 Wolf and Rabbit(gcd)
- Wolf and Rabbit (GCD)【HDU】-1222
- hdu 1222 Wolf and Rabbit(gcd)
- HDU 1222 wolf and rabbit [gcd]
- HDU-1222-Wolf and Rabbit【GCD】
- HDU--Wolf and Rabbit(GCD)
- Wolf and Rabbit(gcd)
- HDU 1222(Wolf and Rabbit)
- Wolf and Rabbit (HDU 1222)
- 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
- gperftools编译与使用
- Gradle使用手册(一):为什么要用Gradle?
- 线程池
- ASP.NET 链接MySQL数据库
- 归并排序空间复杂度O(1)的实现
- HDU 1222 Wolf and Rabbit(gcd)
- 实现360手机助手TabHost的波纹效果
- cocos2d-x基础——基本代码框架
- 汇编语言 王爽 第二版 实验15
- 分布式之RPC的协议以及错误处理
- ubuntu 分卷
- Jsp到数据库中文乱码解决方法
- js如何判断客户端类型
- springmvc mybatis 基于全注解事务配置注意事项