At first, all the lights went off, but we only care about the last one.
During the I-th walk, the status of the lamp is changed only when it is a multiple of I.
That is to say, when N has an even number of approx.
When N has an odd number, that is, when n is a full number, the last lamp will be bright.
The final abstraction is to determine whether the input number is a full limit.
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 corridorback 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 shoshould not process this input.
The output
Output"Yes"If the light is on otherwise"No", In a single line.
Sample Input
3624181910
Sample output
noyesno
Sadi Khan
Suman Mahbub
01-04-2001
AC code:
1 //#define LOCAL 2 #include <iostream> 3 #include <cstdio> 4 #include <cstring> 5 #include <cmath> 6 using namespace std; 7 8 int main(void) 9 {10 #ifdef LOCAL11 freopen("10110in.txt", "r", stdin);12 #endif13 14 unsigned int N;15 while(scanf("%d", &N) == 1 && N)16 {17 int n = (int)sqrt(N);18 if(n * n == N)19 cout << "yes" << endl;20 else21 cout << "no" << endl;22 }23 return 0;24 }
Code Jun