杭电1222
来源:互联网 发布:拼模特卡软件 编辑:程序博客网 时间:2024/05/01 13:06
Wolf and Rabbit
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7323 Accepted Submission(s): 3658
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
Author
weigang Lee
Source
杭州电子科技大学第三届程序设计大赛
#include<stdio.h>
int GCD(int a,int b)
{
int c=a%b;
while(c)
{
a=b;b=c;
c=a%b;
}
return b;
}
int main()
{
long long i,m,n;
int t;
scanf("%d",&t);
while(t--)
{
scanf("%lld%lld",&m,&n);
if(GCD(m,n)==1)
printf("NO\n");
else
printf("YES\n");
}
return 0;
}
int GCD(int a,int b)
{
int c=a%b;
while(c)
{
a=b;b=c;
c=a%b;
}
return b;
}
int main()
{
long long i,m,n;
int t;
scanf("%d",&t);
while(t--)
{
scanf("%lld%lld",&m,&n);
if(GCD(m,n)==1)
printf("NO\n");
else
printf("YES\n");
}
return 0;
}
0 0
- 杭电1222
- 杭电1222
- 【杭电1222】互质
- 杭电
- 杭电
- 杭电
- 杭电1222 Wolf and Rabbit
- 杭电-1222Wolf and Rabbit
- 【杭电】[1222]Wolf and Rabbit
- 【杭电 1222】Wolf and Rabbit
- 【杭电1222】Wolf and Rabbit
- 杭电 1234 和 杭电 2115
- 杭电2056之Rectangles 杭电
- 杭电ACM1061Rightmost Digit
- 杭电2099 7.11
- 杭电ACM 1003
- 杭电 ACM 2016
- 杭电ACM1466
- Java_Ant详解
- 菜鸟都能理解的Android中View的事件分发机制及滑动冲突处理
- 浅析多线程同步
- SpannableStringBuilder的用法
- 深度剖析:如何实现一个 Virtual DOM 算法
- 杭电1222
- KdPrint使用方法
- 小记——inotify文件监控
- Android 让WebView完美支持https双向认证(SSL)
- 第17周 啊哈算法 图的遍历算法-Dijkstra单源最短路径算法
- 【机器学习】局部加权线性回归
- python 映射类型(字典)内建方法
- java学习之checkbox和choice
- Cow Marathon(两次dfs求树的直径)