THE DRUNK JAILER (数论)
2014-01-11 20:43
369 查看
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
2 5 100
Sample Output
2 10
代码
相关文章推荐
- Fail2ban用来作DDOS防守工具,不知够不够份量
- zabbix 邮件报警(基于sendmail)
- A - No Brainer解题报告
- Cain使用教程
- OC中的内存管理retain总结
- UBUNTU开机时出现“waiting for network configuration” 问题的解决
- DllMain 用法
- 信号之kill和raise函数
- hdu 3487 Play with Chain(Splay)
- poj 1273 Drainage Ditches (最大流Dinic)
- grails gson
- Saints Leading Choice on Futures Board in NFL Pres
- Grid Infrastructure Single Client Access Name (SCAN) Explained (文档 ID 887522.1)
- 安卓AIDL的简单使用 (复杂情况下,在此基础扩展)
- paip.环境配置整合 ibatis mybatis proxool
- paip.环境配置整合 ibatis mybatis proxool
- paip.环境设置 mybatis ibatis cfg 环境设置
- paip.环境设置 mybatis ibatis cfg 环境设置
- 每天学点English Email(道谢1)
- 浙大ZOJ 1012 Mainframe问题解决