HDU2053_Switch Game

最新推荐文章于 2020-04-14 03:23:44 发布

原创最新推荐文章于 2020-04-14 03:23:44 发布 · 230 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#ACM

ACM-HDU 专栏收录该内容

66 篇文章

订阅专栏

Switch Game

http://acm.hdu.edu.cn/showproblem.php?pid=2053

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

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.

Author

Source

校庆杯Warm Up

#include <stdio.h>
int main()
{
	long long int n,i;
	while (scanf("%lld", &n) != EOF)
	{
		long long int count = 0;
		for (i = 1; i <= n; i++)
			if (n % i == 0)
				count ++;
		if (count % 2 == 0)
			printf ("0\n");
		else
			printf ("1\n");
	}
	return 0;
}