zoukankan      html  css  js  c++  java
  • 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 n=x2y2.

    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
    #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
    ");
                continue;
            }
            else
                {printf("True
    ");continue;}
        }
        else
        {
            if(n%4==0&&n!=4)
            {
                printf("True
    ");
                continue;
            }
            else
            {
                printf("False
    ");
                continue;
            }
        }
        }
        return 0;
    }
    

  • 相关阅读:
    常用的系统操作需要的响应时间
    几种RAID技术比较
    iptables详解
    mount命令详解
    解决CSocket高数据传输问题
    VC++ ComBox下拉菜单看不到值
    封装MySQL C API 基本操作
    MySQL存储过程和存储函数
    MYSQL 常用命令
    VS2005连接MySQL C API
  • 原文地址:https://www.cnblogs.com/dacc123/p/8228670.html
Copyright © 2011-2022 走看看