HDU 1222 Wolf and Rabbit
2016-08-03 20:49
351 查看
Wolf and Rabbit
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7473 Accepted Submission(s): 3746
[align=left]Problem Description[/align]
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.
[align=left]Input[/align]
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).
[align=left]Output[/align]
For each input m n, if safe holes exist, you should output "YES", else output "NO" in a single line.
[align=left]Sample Input[/align]
2
1 2
2 2
[align=left]Sample Output[/align]
NO
YES
判断是否互质的问题
#include<stdio.h>
int GCD(int x,int y)
{
if(x%y==0)
return y;
else
return (GCD(y,x%y));
}
int main()
{
int m,n;
int 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;
}
相关文章推荐
- 分段和分页内存管理
- POJ-1287 Networking (Kruscal)
- la4287(有向图的强连通分量和DAG)
- Java 反射的详解
- C++学习笔记(2)----模板
- 【动态规划】机器人军团
- 学习java过程中关于生产者消费者模型的一些心得
- 序列化与反序列化
- 嵌入式学习--step6--综合蜂鸣器/按键与跑马灯实验
- Linux 动态库剖析
- java使用idea、dubbox、cxf构建web service
- adjacency_matrix & adjacency_list
- robotframework+selenium2library运行常见问题
- 子集生成算法
- 子集生成算法
- HDU 1404 Digital Deletions
- 【动态规划】单调递增最长子序列
- rtems 4.11 RTC驱动 (arm, beagle)
- C++文件读写详解(ofstream,ifstream,fstream)
- 关于TabHost的详细解析