脑筋急转弯，几个不同因子就有几次状态转换-＞只需看是不是平方数M - Switch Game

https://vjudge.net/contest/423078#status/YZZan/M/0/

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


  

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.

Hint

hint

AC代码：

#include<cstdio>
#include<iostream>
#include<iomanip>
#include<cmath>
#pragma warning (disable:4996)
#include<string>
using namespace std;
const int maxn = 100000 + 5;
const int INF = 0x7fffffff;
int main() {
	int n;
	while (scanf("%d", &n) != EOF) {
		int sqt = sqrt(n);
		if (sqt*sqt == n)printf("1\n");
		else printf("0\n");
	}
	return 0;
}