UVA 10110 Light, more light

Light, more light

The Problem

There is man named "mabu" for switching on-off light in our University. He switches on-off the lights in a corridor. Every bulb has its own toggle switch. That is, if it is pressed then the bulb turns on. Another press will turn it off. To save power consumption (or may be he is mad or something else) he does a peculiar thing. If in a corridor there is `n' bulbs, he walks along the corridor back and forth `n' times and in i'th walk he toggles only the switches whose serial is divisable by i. He does not press any switch when coming back to his initial position. A i'th walk is defined as going down the corridor (while doing the peculiar thing) and coming back again.

Now you have to determine what is the final condition of the last bulb. Is it on or off? 
 

The Input

The input will be an integer indicating the n'th bulb in a corridor. Which is less then or equals 2^32-1. A zero indicates the end of input. You should not process this input.

The Output

Output " yes " if the light is on otherwise " no " , in a single line.

Sample Input

3
6241
8191
0

Sample Output

no
yes
no

输入一个数字n代表有n盏灯。。然后人开始走n躺。第i躺的时候。如果i是n的因子。就把i的倍数盏灯开关按一下，如果执行完毕最后一盏灯为亮，输出yes。否则输出no。。

判断因子个数。因为只有完全平方数的因子个数是奇数。非完全平方数为偶数。

只有奇数的时候。开奇数次。才会最后一个灯变成打开

所以问题转换为判断输入的数是不是完全平方数

#include <stdio.h>
#include <string.h>
#include <math.h>

long long n;

int main()
{
    while (scanf("%lld", &n) != EOF && n)
    {
	long long sb = (long long)sqrt(double(n));
	if (sb * sb == n)
	    printf("yes\n");
	else
	    printf("no\n");
    }
    return 0;
}