杭电oj HDOJ 2053 Switch Game
题目来源:http://acm.hdu.edu.cn/showproblem.php?pid=2053
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 ).
题目大意
假设有无数个标号的灯泡刚开始处于关闭状态,对这些灯做一系列的操作,第i步操作是把所有标号为i的倍数的灯泡改变状态(把“关”变为“开”,把“开”变为“关”)。现在要求给出无穷多步操作后第n个灯泡的状态。
解题思路
当i是n的一个因数时,第n个灯泡就会在第i步操作的时候改变其状态。i大于n以后,第n个灯泡的状态就不会再改变了!如果n有奇数个因数,最后灯泡就是“关闭”状态,如果有偶数个因数,最后灯泡就是“开启”状态!
本人的C++解决方案
/*
我严重怀疑HDOJ平台对于“iostream头文件”的引用有问题
已经不是一次出现使用cin和cout平台提示“编译错误”
而使用scanf和printf则会AC的情况了!
*/
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
// #include <iostream>
using namespace std;
int main()
{
int n, i, count;
/*
while (cin >> n) {
count = 0;
for (i = 1; i <= n; i++) {
if (n % i == 0) {
count++;
}
}
if (count % 2 == 0) {
cout << 0;
}
else {
cout << 1;
}
cout << endl;
}
*/
while (scanf("%d", &n) != EOF) {
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;
}
代码通过HDOJ平台运行检查,如发现情况,欢迎指出和纠正,谢谢!