杭电1222 Wolf and Rabbit

原创 2015年11月17日 20:24:17

Wolf and Rabbit

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 6381    Accepted Submission(s): 3187


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
2 1 2 2 2
 

Sample Output
NO YES
 

Author
weigang Lee
 

Source
 

Recommend
Ignatius.L   |   We have carefully selected several similar problems for you:  1207 2175 1997 2511 2184 
输入两个数,互质的话就是 no 否则 就是yes:
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<algorithm>
using namespace std;
__int64 m,n,i,j,k,l,x,y;
int ac(__int64 a,__int64 b)//辗转相除法
{
	x=min(a,b);
	y=max(a,b);
	j=1;
	while(j)
	{
		j=y%x;
		y=x;
		x=j;
	}
	return y;
}
int main()
{
	scanf("%I64d",&k);
	while(k--)
	{
		scanf("%I64d%I64d",&m,&n);
		if(ac(m,n)==1)
		printf("NO\n");
		else
		printf("YES\n");
	}
}


版权声明:本文为博主原创文章,未经博主允许不得转载。

杭电-1222Wolf and Rabbit

Wolf and Rabbit Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Other...
  • nvliba
  • nvliba
  • 2015年12月01日 18:19
  • 302

【杭电1222】Wolf and Rabbit

Wolf and Rabbit Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)...

hdu1222-Wolf and Rabbit

Wolf and Rabbit Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Othe...

HDU 1222 Wolf and Rabbit (扩展欧几里德应用)

HDU 1222 Wolf and Rabbit (扩展欧几里德应用)

HDU 1222 Wolf and Rabbit 幸存的兔子

原题 http://acm.hdu.edu.cn/showproblem.php?pid=1222题目大意: 兔子一共有n个窝,狼每次走m步,如果一直不会找到兔子,输出YES。暴力解决就是开一个长...

hdu--1222 Wolf and Rabbit

/** \brief hdu 1222 Wolf and Rabbit * * \param date 2014/7/22 * \param state AC * \return * */...

hdu 1222 Wolf and Rabbit(递归)

Wolf and Rabbit Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)...

【HDU-1222】 Wolf and Rabbit

点击打开链接 Wolf and Rabbit Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Ja...

HDU 1222 Wolf and Rabbit(公约数)

HDU 1222 Wolf and Rabbit(公约数)

HDOJ -- 1222 Wolf and Rabbit

Wolf and Rabbit Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Other...
  • ah_yeah
  • ah_yeah
  • 2016年08月10日 20:54
  • 84
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:杭电1222 Wolf and Rabbit
举报原因:
原因补充:

(最多只允许输入30个字)