hdu2053 Switch Game

 

Switch Game

 

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

 

 

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.

 

 

 

题意：经过无穷次操作后，第i盏灯的状态是0还是1 
第i次操作将所有是i的倍数的灯的状态都反转

 

#include<iostream>
#include<cstdio>
using namespace std;

int main()
{
	int n;
	while(cin>>n)
	{
		int count=0;
		for(int i=1;i<=n;i++)//遍历，计算第i盏灯变换的总次数 
			if(n%i==0)count++;
		if(count%2==0)cout<<0<<endl;//灯的初始状态是0，偶数次变换后是0，奇数次是1 
		else cout<<1<<endl;
	}
	return 0;
}