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): 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
    ");
    13         else
    14             printf("True
    ");
    15     }
    16     return 0;
    17 }
  • 相关阅读:
    POJ_1456 Supermarket 【并查集/贪心】
    CSS before和after伪类
    CSS anchor专为链接属性选择器
    CSS 属性选择器
    CSS float浮动
    CSS 外边距和内填充
    CSS 边框属性
    CSS 背景
    CSS 组和选择器
    CSS 引入方式
  • 原文地址:https://www.cnblogs.com/inmoonlight/p/5510319.html
Copyright © 2011-2022 走看看