Wolf and Rabbit(gcd)
来源:互联网 发布:淘宝 美孚 618 活动 编辑:程序博客网 时间:2024/05/22 01:31
链接:点击打开链接
Wolf and Rabbit
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5298 Accepted Submission(s): 2658
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
杭州电子科技大学第三届程序设计大赛
Recommend
Ignatius.L | We have carefully selected several similar problems for you: 1207 1299 1219 2175 1995
HDU 1222 Wolf and Rabbit
该题是一题找规律题,当n与m都是偶数或是倍数是就存在这样的洞,
方法一:
#include<stdio.h>
#include<stdlib.h>
int
main()
{
int
n,m,N;
scanf
(
"%d"
,&N );
for
(
int
i=1; i<=N; i++ )
{
scanf
(
"%d%d"
,&n,&m );
if
( n==1 || m==1)
printf
(
"NO\n"
);
else
{
if
( (n%2==0) && (m%2==0) )
printf
(
"YES\n"
);
else
{
if
( (n%m==0)||(m%n==0) )
printf
(
"YES\n"
);
else
printf
(
"NO\n"
);
}
}
}
return
0;
}
由第一种方法得到,我们可用Gcd()函数,当公约数大于1时就代表安全。
#include<stdio.h>
int
Gcd(
int
a,
int
b )
{
return
b==0?a:Gcd( b,a%b );
}
int
main()
{
int
T,n,m;
scanf
(
"%d"
,&T );
while
( T-- )
{
scanf
(
"%d%d"
,&n,&m );
if
( Gcd( n,m )>1 )
printf
(
"YES\n"
);
else
printf
(
"NO\n"
);
}
return
0;
}
0 0
- Wolf and Rabbit(gcd)
- hdu 1222 Wolf and Rabbit (GCD)
- HDU 1222 Wolf and Rabbit(gcd)
- Wolf and Rabbit (GCD)【HDU】-1222
- hdu 1222 Wolf and Rabbit(gcd)
- HDU--Wolf and Rabbit(GCD)
- 【HDU1222】 Wolf and Rabbit(GCD)
- 【杭电oj】1222 - Wolf and Rabbit(GCD)
- 【杭电-oj】-1222-Wolf and Rabbit(GCD)
- 杭电-1222 Wolf and Rabbit (GCD)
- hdoj 1222 Wolf and Rabbit 【GCD】
- HDU 1222 wolf and rabbit [gcd]
- HDU-1222-Wolf and Rabbit【GCD】
- Wolf and Rabbit(最大公约数)
- Wolf and Rabbit(欧几里得)
- HDU Wolf and Rabbit &&189 兔子的烦恼(一)【gcd】
- (gcd,lcm,互质) 康纳的表情包--SDUT,Wolf and Rabbit--HDOJ
- HDOJ 1222 Wolf and Rabbit ( GCD 和思维 )
- android.view.inputmethod
- 第七周项目三——简单分支问题(一)
- IOS XMPP的实践
- GitHub上最火的40个Android开源项目
- C#中的多播委托笔记总结
- Wolf and Rabbit(gcd)
- AFNetworking超时时间设置
- 游戏面试 《影之刃》思考
- 55555555555
- 【产品经理】如果再让我做一回产品经理
- ios xmpp 发送语音图片解决方案
- HTML添加永远处于底部的footer
- 动态规划原理(算法导论)
- 关于C++中的虚拟继承的一些总结