HDU 5675 ztr loves math

Posted 月夜下

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了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): 896    Accepted Submission(s): 347


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".

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
 
 
 
解析:枚举x和y,得到对应的n,打表找规律。
 
 
 
 1 #include <cstdio>
 2 
 3 long long n;
 4 int t;
 5 
 6 int main()
 7 {
 8     scanf("%d",&t);
 9     while(t--){
10         scanf("%I64d",&n);
11         if(n == 1 || n == 4 || n%4 == 2)
12             printf("False\n");
13         else
14             printf("True\n");
15     }
16     return 0;
17 }

 

以上是关于HDU 5675 ztr loves math的主要内容,如果未能解决你的问题,请参考以下文章

hdu5676 ztr loves lucky numbers(dfs)

[HDU5677]ztr loves substring

[HDOJ5676]ztr loves lucky numbers(状压枚举,打表,二分)

HDOJ5657 CA Loves Math

bzoj 3309 DZY Loves Math —— 莫比乌斯反演+数论分块

HDU 4879 ZCC loves march (并查集,set,map)