// Light, more light (turn on and off the light) // PC/Ultraviolet IDs: 110701/10110, popularity: A, success rate: average level: 1 // verdict: accepted // submission date: 2011-06-10 // UV Run Time: 0.304 S // All Rights Reserved (c) 2011, Qiu. Metaphysis # Yeah dot net // For a non-vertex number greater than 1, its factors always appear in pairs, which is the key to solving the problem. For N> = 1, if n is the number of squares, the total number of its factors is an odd number; otherwise, it is an even number. The corresponding question is that after an odd number of lights are on, if the number is an even number, you can determine whether the number/N is the number of bytes. # Include <iostream> # include <cmath> using namespace STD; int main (int ac, char * AV []) {unsigned int N; while (CIN> N, N) {int T = SQRT (n); cout <(T * t = N )? "Yes": "no") <Endl;} return 0 ;}