HDOJ 2053

最新推荐文章于 2024-03-21 13:44:32 发布

machineliker

最新推荐文章于 2024-03-21 13:44:32 发布

阅读量331

点赞数 3

分类专栏： HDOJ 文章标签：算法数据结构

本文链接：https://blog.csdn.net/weixin_45778081/article/details/136760952

版权

HDOJ 专栏收录该内容

103 篇文章 0 订阅

订阅专栏

文章描述了一道编程问题，涉及一串灯，对每个灯的倍数执行状态切换。最终输出第n盏灯在无限次操作后的状态。给定输入n，程序通过检查n是否为某个灯的倍数来确定最终状态。

摘要由CSDN通过智能技术生成

Switch Game

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

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

Author
LL

Source
校庆杯Warm Up

解题思路
题目大意是有一串灯，从1到n，对其倍数上的灯进行condition的改变。实质上就是位置n如果是其倍数就改变condition，其余情况就不改变。

#include<stdio.h>
#include<cstring>
#include<iostream>
using namespace std;
int main() {
	int n;
	while (scanf("%d", &n) != EOF) {
		int lamp = -1;
		for (int i = 1; i <= n; i++)
			if (n % i == 0)
				lamp *= -1;
		if (lamp == 1)
			printf("1\n");
		else
			printf("0\n");
	}
	return 0;
}