HDOJ -- 1222 Wolf and Rabbit
来源:互联网 发布:seo渠道 编辑:程序博客网 时间:2024/05/21 10:53
Wolf and Rabbit
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Problem 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),那么狼一定能进完所有的洞;否则,陷入循环。
#include<stdio.h>int gcd(int a,int b){if(a%b==0)return b;return gcd(b,a%b);}//递归求最大公约数 int main(){int m,n,t;scanf("%d",&t);while(t--){scanf("%d%d",&m,&n);if(gcd(m,n)==1) printf("NO\n"); else printf("YES\n");}return 0;}
0 0
- hdoj 1222 Wolf and Rabbit
- HDOJ 1222 Wolf and Rabbit
- HDOJ -- 1222 Wolf and Rabbit
- 【杂题】 HDOJ 1222 Wolf and Rabbit
- hdoj 1222 Wolf and Rabbit 【GCD】
- 1222 Wolf and Rabbit
- 1222 Wolf and Rabbit
- [数论]HDOJ 1222 Wolf and Rabbit 欧几里得算法
- HDOJ 1222 Wolf and Rabbit(数学解题技巧)
- HDOJ 1222 Wolf and Rabbit(判断互质,水)
- HDOJ 1222 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
- 最全iOS开发之第三方库
- Qt---按钮
- php异步任务处理 (php-resque)
- 概率dp LightOJ 1030 Discovering Gold
- Ural 1028. Stars(树状数组)
- HDOJ -- 1222 Wolf and Rabbit
- Git删除远程Tag、分支
- 自动拨打电话,自动发送短信,测试类
- 多校赛第七场
- 罪犯转移问题思考——2016百度编程题
- (OK) Fedora 24 开机自动启动脚本 - rc.local - rc-local.service
- Java SE学习笔记-多态
- Python基础入门—常用函数笔记
- C#控制台基础 泛型中default的用法,值类型位0,引用类型为null