Codeforces B. Square Difference

最新推荐文章于 2022-07-20 08:45:22 发布

晒太阳的大熊猫

最新推荐文章于 2022-07-20 08:45:22 发布

阅读量259

点赞数

本文链接：https://blog.csdn.net/weixin_43888067/article/details/102789177

版权

B. Square Difference

time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
Alice has a lovely piece of cloth. It has the shape of a square with a side of length a centimeters. Bob also wants such piece of cloth. He would prefer a square with a side of length b centimeters (where b<a). Alice wanted to make Bob happy, so she cut the needed square out of the corner of her piece and gave it to Bob. Now she is left with an ugly L shaped cloth (see pictures below).

Alice would like to know whether the area of her cloth expressed in square centimeters is prime. Could you help her to determine it?

Input
The first line contains a number t (1≤t≤5) — the number of test cases.

Each of the next t lines describes the i-th test case. It contains two integers a and b (1≤b<a≤1011) — the side length of Alice’s square and the side length of the square that Bob wants.

Output
Print t lines, where the i-th line is the answer to the i-th test case. Print “YES” (without quotes) if the area of the remaining piece of cloth is prime, otherwise print “NO”.

You can print each letter in an arbitrary case (upper or lower).

Example
inputCopy
4
6 5
16 13
61690850361 24777622630
34 33
outputCopy
YES
NO
NO
YES
Note
The figure below depicts the first test case. The blue part corresponds to the piece which belongs to Bob, and the red part is the piece that Alice keeps for herself. The area of the red part is 6²−5²=36−25=11, which is prime, so the answer is “YES”.

在这里插入图片描述
In the second case, the area is 16²−13²=87, which is divisible by 3.

In the third case, the area of the remaining piece is 61690850361²−24777622630²=3191830435068605713421. This number is not prime because 3191830435068605713421=36913227731⋅86468472991.

In the last case, the area is 34²−33²=67.

**题意：**大的正方形面积 - 小的正方形面积是质数则 YES 否则 NO

思路：
质数 * 质数 = 合数
质数 * 合数 = 合数
质数 * 1 = 质数
因为 a²- b² = (a-b)*(a+b)
所以只需要判断 (a-b) = 1 ，(a+b) 为质数
上代码：

#include<bits/stdc++.h>
using namespace std;

int main()
{
	int t;
	scanf("%d",&t);
	while(t--)
	{
		long long a,b;
		scanf("%lld %lld",&a,&b);
		long long c=a+b;
		int flag=0;
		for(int i=2;i<=sqrt(a+b);i++)
		{
			if(c%i==0)
			{
				flag=1;
				break;
			}
		}
		if(flag == 0 && (a-b) == 1)
		printf("YES\n");
		else
		printf("NO\n");
	}
	return 0;
}