HDU1222 FLY

2020-01-28 13:42:53 阅读：361 来源： 互联网

标签：FLY get ll holes signed HDU1222 YES include

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

#include <algorithm>
#include <iostream>
#include <cstring>
#include <cmath>
#include <cstdio>
using namespace std;
#define ll long long
ll gcd(ll a, ll b)
{
	return b==0?a:gcd(b,a%b);
}               //模板
int main()
{
	int p;
	scanf("%d",&p);
	while(p--){
		ll m, n;
		scanf("%lld%lld",&m,&n);
		if(gcd(m,n)==1)
			printf("NO\n");
		else
			printf("YES\n");
	}
	return 0;
}

Flying_fish101 发布了20 篇原创文章 · 获赞 0 · 访问量 1028 私信关注

标签：FLY,get,ll,holes,signed,HDU1222,YES,include
来源： https://blog.csdn.net/Flyingfish101/article/details/104098961

本站声明： 1. iCode9 技术分享网（下文简称本站）提供的所有内容，仅供技术学习、探讨和分享；
2. 关于本站的所有留言、评论、转载及引用，纯属内容发起人的个人观点，与本站观点和立场无关；
3. 关于本站的所有言论和文字，纯属内容发起人的个人观点，与本站观点和立场无关；
4. 本站文章均是网友提供，不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属；如您发现该文章侵犯了您的权益，可联系我们第一时间进行删除；
5. 本站为非盈利性的个人网站，所有内容不会用来进行牟利，也不会利用任何形式的广告来间接获益，纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。