THE DRUNK JAILER - POJ 1218 水题
2014-06-26 12:25
459 查看
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
题意:一个人在第k轮条k的倍数的房间,将锁的门开开,没锁的门锁上。一共有n轮,n个房间,问最后开着的房间有多少个。
思路:直接打表。
AC代码如下:
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 22919 | Accepted: 14449 |
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
题意:一个人在第k轮条k的倍数的房间,将锁的门开开,没锁的门锁上。一共有n轮,n个房间,问最后开着的房间有多少个。
思路:直接打表。
AC代码如下:
#include<cstdio> #include<cstring> using namespace std; int num[110]; int sum[110]; int main() { int i,j,k,t; for(i=1;i<=100;i++) { for(j=i;j<=100;j+=i) if(num[j]==0) num[j]=1; else num[j]=0; for(j=1;j<=i;j++) sum[i]+=num[j]; } scanf("%d",&t); while(t--) { scanf("%d",&k); printf("%d\n",sum[k]); } }
相关文章推荐
- poj 1218 THE DRUNK JAILER【水题】
- POJ 1218 THE DRUNK JAILER(水题)
- 【水题】POJ-1218 THE DRUNK JAILER
- POJ 1218 THE DRUNK JAILER(数论)
- POJ 1218 THE DRUNK JAILER
- POJ 1218 THE DRUNK JAILER——关灯问题
- poj 1218 THE DRUNK JAILER
- POJ 1218 THE DRUNK JAILER
- poj 1218 THE DRUNK JAILER
- POJ 1218 THE DRUNK JAILER
- POJ 1218 THE DRUNK JAILER
- THE DRUNK JAILER POJ 1218
- poj 1218 THE DRUNK JAILER
- poj 1218 THE DRUNK JAILER
- 统计次数poj1218——THE DRUNK JAILER
- poj1218——THE DRUNK JAILER
- poj1218 THE DRUNK JAILER!
- POJ1218----THE DRUNK JAILER
- POJ - 1218 THE DRUNK JAILER
- POJ 1218 THE DRUNK JAILER