1218THE DRUNK JAILER
2015-07-28 15:35
309 查看
THE DRUNK JAILER
Description
A certain prison contains a long hall of n cells, each right next to each other. Each cell has a prisoner in it, and each cell is locked.
One night, the jailer gets bored and decides to play a game. For round 1 of the game, he takes a drink of whiskey,and then runs down the hall unlocking each cell. For round 2, he takes a drink of whiskey, and then runs down the
hall locking every other cell (cells 2, 4, 6, ?). For round 3, he takes a drink of whiskey, and then runs down the hall. He visits every third cell (cells 3, 6, 9, ?). If the cell is locked, he unlocks it; if it is unlocked, he locks it. He
repeats this for n rounds, takes a final drink, and passes out.
Some number of prisoners, possibly zero, realizes that their cells are unlocked and the jailer is incapacitated. They immediately escape.
Given the number of cells, determine how many prisoners escape jail.
Input
The first line of input contains a single positive integer. This is the number of lines that follow. Each of the following lines contains a single integer between 5 and 100, inclusive, which is the number of cells n.
Output
For each line, you must print out the number of prisoners that escape when the prison has n cells.
Sample Input
Sample Output
Source
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 25010 | Accepted: 15692 |
A certain prison contains a long hall of n cells, each right next to each other. Each cell has a prisoner in it, and each cell is locked.
One night, the jailer gets bored and decides to play a game. For round 1 of the game, he takes a drink of whiskey,and then runs down the hall unlocking each cell. For round 2, he takes a drink of whiskey, and then runs down the
hall locking every other cell (cells 2, 4, 6, ?). For round 3, he takes a drink of whiskey, and then runs down the hall. He visits every third cell (cells 3, 6, 9, ?). If the cell is locked, he unlocks it; if it is unlocked, he locks it. He
repeats this for n rounds, takes a final drink, and passes out.
Some number of prisoners, possibly zero, realizes that their cells are unlocked and the jailer is incapacitated. They immediately escape.
Given the number of cells, determine how many prisoners escape jail.
Input
The first line of input contains a single positive integer. This is the number of lines that follow. Each of the following lines contains a single integer between 5 and 100, inclusive, which is the number of cells n.
Output
For each line, you must print out the number of prisoners that escape when the prison has n cells.
Sample Input
2 5 100
Sample Output
2 10
Source
#include<iostream> #include<cstring> using namespace std; int a[102]; int main() { int T; cin>>T; while(T--) { int n; cin>>n; memset(a,0,sizeof(a)); for(int i=1;i<=n;i++) {for(int j=1;j<=n;j++) if(j%i==0) { a[j]=!a[j]; } } int count=0; for(int i=1;i<=n;i++) if(a[i]==1) count++; cout<<count<<endl; } }
相关文章推荐
- Snail—OC学习之文件操作(读写)
- GID SID AID HID
- 【问题及解决】Elasticsearch不能正常启动do not exists on master, act as master failure
- ERROR 1205 (HY000): Lock wait timeout exceeded; try restarting transaction
- HDU 1151 Air Raid (最小路径覆盖)
- HDU 1151 Air Raid (最小路径覆盖)
- process launch failed: failed to get the task for process 1482
- 注意细节Attention To Detail之一:CSDN.NET网页的版权申明
- ontainer_of()宏
- aerospike与tair对比
- 修改git已提交的的author和email
- http://blog.csdn.net/jiajiayouba/article/details/9083757#comments
- ( linker command failed with exit code 1)错误总结
- samba错误:session setup failed: NT_STATUS_LOGON_FAILURE
- Async/Await 最佳做法
- service中AIDL的应用
- 2015 Multi-University Training Contest 3--1011 Work
- 那些没有root权限的岁月:一分钟解决mutt No mailbox
- UVa 576 - Haiku Review
- Scan IP relocate/failover其它段后不能ping通过