HDOJ 5675-ztr loves math【数学】

ztr loves math

 

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 1436    Accepted Submission(s): 554

 

 

Problem Description

ztr loves research Math.One day,He thought about the "Lower Edition" of triangle equation set.Such as n=x2−y2.

He wanted to know that ,for a given number n,is there a positive integer solutions?

 

 

Input

There are T test cases. 
The first line of input contains an positive integer T(T<=106) indicating the number of test cases.

For each test case:each line contains a positive integer ,n<=1018.

 

 

Output

If there be a positive integer solutions,print True,else print False

 

 

Sample Input

4 6 25 81 105

 

 

Sample Output

False True True True

Hint

For the fourth case,$105 = 13^{2}-8^{2}$

解题思路：

不知道为什么。。。。自己暴力测试出来的规律。4的倍数和奇数都可以。4和1特判。

#include<stdio.h>
#include<string.h>
#include<algorithm>
#define LL long long
using namespace std;
int main(){
	int n;
	scanf("%d",&n);
	while(n--){
		LL a;
		scanf("%lld",&a);
//		int cp=0;
//		for(int i=0;i<=1000;i++){
//			for(int j=0;j<=1000;j++){
//				if(a==(i*i-j*j)){
//					cp=1;
//					break;
//				}
//			}
//			if(cp==1) break;
//		}
//		if(cp==1)
//		printf("T\n");
//		else
//		printf("F\n");
		if(a==1||a==4){
			printf("False\n");
			continue;
		}

		if(a%4==0)
		{
			printf("True\n");
			continue;
		}
		if(a%2==1){
			printf("True\n");
			continue;
		}
	
		printf("False\n");
	}
	return 0;
}