Wolf and Rabbit
2016-07-20 10:05
387 查看
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
2
1 2
2 2
Sample Output
NO
YES
#include<stdio.h>
int GCD(int a,int b)
{
if(a%b==0)
return b;
else
return GCD(b,a%b);
}
int main()
{
int a,b,t,m,n,p;
scanf("%d",&p);
while(p--)
{
scanf("%d%d",&m,&n);
t=GCD(m,n);
if(t==1)
printf("NO\n");
else
printf("YES\n");
}
return 0;
}
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
2
1 2
2 2
Sample Output
NO
YES
#include<stdio.h>
int GCD(int a,int b)
{
if(a%b==0)
return b;
else
return GCD(b,a%b);
}
int main()
{
int a,b,t,m,n,p;
scanf("%d",&p);
while(p--)
{
scanf("%d%d",&m,&n);
t=GCD(m,n);
if(t==1)
printf("NO\n");
else
printf("YES\n");
}
return 0;
}
相关文章推荐
- java实现的AES加密算法完整实例
- svn 设置文件可执行权限
- C# 根据身份证号码获取简易信息
- C++学习笔记——二分查找及其STL库函数
- Redis 持久化
- Python新手学习基础之运算符——算术运算符
- 350. Intersection of Two Arrays II
- LayoutInflater
- android多线程
- svn 遇到的问题
- Android RecyclerView 使用完全解
- IOS 学习笔记
- Java 包中重要接口介绍
- rand和srand的用法
- BeautifulSoup 常用方法
- Git
- sql server 2008 R2 不允许保存更改,您所做的更改要求删除并重新创建以下表
- Android 推送到底哪家强
- 静态库Xcode7
- oracle安装