Switch Game

最新推荐文章于 2021-03-20 23:16:41 发布

原创最新推荐文章于 2021-03-20 23:16:41 发布 · 730 阅读

0 ·

CC 4.0 BY-SA版权

Switch Game

Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 13593 Accepted Submission(s): 8280

Problem Description

There are many lamps in a line. All of them are off at first. A series of operations are carried out on these lamps. On the i-th operation, the lamps whose numbers are the multiple of i change the condition ( on to off and off to on ).

Input

Each test case contains only a number n ( 0< n<= 10^5) in a line.

Output

Output the condition of the n-th lamp after infinity operations ( 0 - off, 1 - on ).

Sample Input

1
5

Sample Output

1
0

Hint
hint
 

Consider the second test case:

The initial condition	   : 0 0 0 0 0 …
After the first operation  : 1 1 1 1 1 …
After the second operation : 1 0 1 0 1 …
After the third operation  : 1 0 0 0 1 …
After the fourth operation : 1 0 0 1 1 …
After the fifth operation  : 1 0 0 1 0 …

The later operations cannot change the condition of the fifth lamp any more. So the answer is 0.

#include <iostream>
using namespace std;
int main()
{
int n,i,j;
while(cin>>n)
{
j=0;
for(i=1;i<=n;i++)
{
if(n%i==0)
j++;
}
if(j%2==0)
cout<<"0"<<endl;
else
cout<<"1"<<endl;
}
return 0;

}

注意：题意是有无限多的电灯排成一列，一开始都是关，操作无限多次，第i次操作会把编号为i和i的倍数的电灯改变状态。问最后第i盏电灯的状态是开还是关。