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): 133 Accepted Submission(s): 64
Problem Description
ztr loves research Math.One day,He thought about the "Lower Edition" of triangle equation set.Such as . 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 indicating the number of test cases. For each test case:each line contains a positive integer ,.
Output
If there be a positive integer solutions,print ,else print
Sample Input
4
6
25
81
105Sample Output
False
True
True
True
#include <iostream>
#include <string.h>
#include <stdlib.h>
#include <algorithm>
#include <math.h>
#include <stdio.h>
#include <string>
#include <map>
using namespace std;
__int64 n;
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
scanf("%I64d",&n);
if((n&1))
{
if(n==1)
{
printf("False\n");
continue;
}
else
{printf("True\n");continue;}
}
else
{
if(n%4==0&&n!=4)
{
printf("True\n");
continue;
}
else
{
printf("False\n");
continue;
}
}
}
return 0;
}本文参与 腾讯云自媒体分享计划，分享自作者个人站点/博客。
原始发表：2016-05-01 ，如有侵权请联系 cloudcommunity@tencent.com 删除
评论
登录后参与评论
推荐阅读
目录