杭电(hdu)2053 Switch Game 水题
2015-08-24 10:49
357 查看
Switch Game
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 13113 Accepted Submission(s): 7970
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 Hinthint 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.
测试数据量不大,可以简单粗暴,这道题也就是水题;
#include <iostream> #include <cstring> using namespace std; int main() { int n; int count; while(cin>>n) { count=0; for(int i=1;i<=n;i++) { if(n%i==0) { count++; } } if(count%2==0)cout<<"0"<<endl; else cout<<"1"<<endl; } return 0; }
相关文章推荐
- poj 3461 Oulipo (KMP入门)
- HTMLParser使用
- [leetcode][math] Missing Number
- Hadoop错误5_配置Hadoop环境变量时export‘=’not a valid identifier的一个原因
- WindowsAPI之RegOpenKey和RegSetValueEx函数
- oracle 估算undo脚本
- STM32独立看门狗
- EF中对一个或多个实体验证失败
- 23种设计模式
- Android与服务器端数据交互(http协议整合struts2+android)
- 树根 Digital root
- mysql中的replace into和 on duplicate key update
- LINUX笔记7
- IOS常用宏定义
- JAP和Spring整合的三种方式
- Struts2与Servlet的关系
- 计算机中二进制原码、反码、补码的计算
- BZOJ 1093 [ZJOI2007]最大半连通子图
- Rhel 7 nfs install
- D3D显示YUV图像