HDU ACM 1222 Wolf and Rabbit
2016-03-18 00:00
302 查看
原题描述
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.
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 2
2 2
Sample Output
NOYES
解题思路
试验得出当m和n互质时,不存在安全的洞。所以本题可以转化为求最大公因数。当最大公因数为1,则m和n互质,不存在安全洞;当最大公因数大于1,存在安全洞。
参考代码
/* HDU ACM 1222 Wolf and Rabbit Author: Scarb 2016-3-15 */ #include <iostream> using namespace std; __int64 gcd(__int64 a, __int64 b) // a > b { if (a < b)return gcd(b, a); if (!b)return a; return gcd(b, a%b); } int main() { int p; __int64 m, n; cin >> p; while(p--) { cin >> m >> n; if (gcd(m, n) == 1)cout << "NO\n"; else cout << "YES\n"; } }
相关文章推荐
- 将数字转换为人民币大写
- Qt入门-提示、警告、错误、询问、关于对话框
- nginx: [error] invalid PID number
- php动态程序生成静态文件示例
- php中session_save_path另一种用法
- W5200模块调试笔记
- SpringMVC注解总结
- SpringMVC中传参乱码解决方案
- 我在OSC的第一条博客
- 百度地图---之---路径规划
- 获取公众号所有用户的信息
- 获取微信用户信息
- 获取微信用户信息
- Android SDK Manager国内不能下载和下载缓慢的问题
- sql之left join、right join、inner join的区别
- 蜂窝教育Android培训 增强学员职场竞争力
- angularJS跳转返回刷新
- 大话设计模式—原型模式
- SQL个性化排序
- 论毛姆传