codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

72C.md (1157B)


      1 Source: https://codeforces.com/problemset/problem/72/C
      2 
      3 C. Extraordinarily Nice Numbers
      4 
      5 time limit per test
      6 
      7 2 seconds
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 stdin
     16 
     17 output
     18 
     19 stdout
     20 
     21 The positive integer *a* is a divisor of the positive integer *b* if and only if there exists a positive integer *c* such that *a* × *c* = *b*.
     22 
     23 King Astyages thinks a positive integer *x* is extraordinarily nice if the number of its even divisors is equal to the number of its odd divisors.
     24 
     25 For example 3 has two positive divisors 3 and 1, both of which are odd, so 3 is not extraordinarily nice. On the other hand 2 is only divisible by 2 and 1, so it has one odd and one even divisor. Therefore 2 is extraordinarily nice.
     26 
     27 Given a positive integer *x* determine whether it's extraordinarily nice.
     28 
     29 Input
     30 
     31 The input contains only a single integer *x* (1 ≤ *x* ≤ 103).
     32 
     33 Output
     34 
     35 Write a single yes or no. Write yes if the number is extraordinarily nice and no otherwise.
     36 
     37 You don't need to care about capital or small letters. The output is case-insensitive.
     38 
     39 Examples
     40 
     41 Input
     42 
     43 ```
     44 2
     45 ```
     46 
     47 Output
     48 
     49 ```
     50 yes
     51 ```
     52 
     53 Input
     54 
     55 ```
     56 3
     57 ```
     58 
     59 Output
     60 
     61 ```
     62 no
     63 ```