KIMODIV - Kimo and Divisors
Kimo loves all sorts of properties of odd numbers. He learned a new algorithm to get all divisors of a certain number.
Help him to determine if a number has odd number of divisors.
t - the number of test cases, then t test cases follows. [t <= 1000]
Each line contains one interger: N [1 <= N <= 109]
For each test case output one line contains "YES" if the given number has odd number of divisors an "NO" otherwise.
Notein the 1st case: divisors of 4 are : (1, 2, 4) and the number of divisors is 3 (odd)in the 2nd case: divisors of 7 are : (1, 7) and the number of divisors is 2 (even)
i m totally agree with @KANISH_THE_VISTA
i think this question is ok for classical problem section
Ok, moved to tutorial.
I agree, this should probably be a tutorial problem.
thanxx 2 m17
Last edit: 2014-01-24 15:20:18
very easy...for tutorial...