HDU 5675 ztr loves math（数学）

ztr loves math

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

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}$
   
   
   
    
  
  

 

Source

BestCoder Round #82 (div.2)

 

Recommend

wange2014   |   We have carefully selected several similar problems for you:   5877  5876  5875  5874  5873 

n被称作智慧数， 每个大于1的奇数与每个大于4且是4的倍数的数都是智慧数，而被4除余数为2的偶数都不是智慧数，最小智慧数为3，从5开始，智慧数是5，7，8，9，11，12，13，15，16，17，19，20…即2个奇数，1个4的倍数，3个一组依次排列下去． 显然1不是“智慧数”，

证明

http://baike.so.com/doc/3328060-3505077.html

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int main()
{
	int t,i,j,k,l;
	__int64 n;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%I64d",&n);
		if(n<3||n==4||n%4==2)
		{
			printf("False\n");
		}
		else
		printf("True\n");
	}
	return 0;
 }