标签：
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?
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.
If there be a positive integer solutions,print True,else print False
4 6 25 81 105
False
True
True
True
For the fourth case,$105 = 13^{2}-8^{2}$
1 #include <iostream> 2 #include <cstdio> 3 #include <cstring> 4 using namespace std; 5 #define ll long long 6 ll n; 7 int main() 8 { 9 int t; 10 scanf("%d",&t); 11 while(t--){ 12 scanf("%I64d",&n); 13 if(n==1 || n==4){ 14 printf("False\n"); 15 continue; 16 } 17 if(n%2==1 || n%4==0){ 18 printf("True\n"); 19 }else{ 20 printf("False\n"); 21 } 22 } 23 return 0; 24 }
标签：
原文地址：http://www.cnblogs.com/UniqueColor/p/5452773.html
