(hdu 2.2.4)Wolf and Rabbit(一个圆有n个数,每次数m个数,看能否遍历这个圆)
来源:互联网 发布:淘宝客服遇到的问题 编辑:程序博客网 时间:2024/06/09 18:05
题目:
Wolf and Rabbit
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2021 Accepted Submission(s): 1146Problem 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
杭州电子科技大学第三届程序设计大赛
Recommend
Ignatius.L
题目分析:
这道题其实和http://blog.csdn.net/hjd_love_zzt/article/details/43194213 hdu step 1.2.2这道题是一模一样的,
只是把情景换一下而已。这道题实际抽象以下就是“一个圆有n个数,每次数m个数,看能否遍历这个圆” 。这实际上
判断一下n,m是否负责就行。判断互质的过程用到了求最大公约数的方法。
代码如下:
/* * c.cpp * * Created on: 2015年2月2日 * Author: Administrator */#include <iostream>#include <cstdio>using namespace std;int gcd(int a,int b){int temp;while(b != 0){temp = b;b = a%b;a = temp;}return 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;}
1 0
- (hdu 2.2.4)Wolf and Rabbit(一个圆有n个数,每次数m个数,看能否遍历这个圆)
- HDU Wolf and Rabbit
- hdu 1222 Wolf and Rabbit
- HDU 1222 Wolf and Rabbit
- HDU--Wolf and Rabbit(GCD)
- 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
- HDU 1222Wolf and Rabbit
- hdu 1222 Wolf and Rabbit
- 【HDU-1222】 Wolf and Rabbit
- Maximum Depth of Binary Tree
- Java版四则运算简易计算器
- iOS 学习资料整理
- groovy脚本使用map
- Linux期末复习知识点小结(四)——进程
- (hdu 2.2.4)Wolf and Rabbit(一个圆有n个数,每次数m个数,看能否遍历这个圆)
- Android学习笔记--环境搭建
- sql Update 多表
- android基础学习之android图片的三级缓存
- Domino Calendar REST API性能调优 之 系统崩溃篇
- 四种方式实现SQLServer 分页查询
- ios开发之:UILabel行间距。label内容自适应
- KPI考核指标
- 黑马程序员 —— Java高级视频_IO输入与输出(第十九天)1