POJ 1218 THE DRUNK JAILER
2014-08-03 01:02
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
Greater New York 2002
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 23392 | Accepted: 14734 |
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
Greater New York 2002
#include <stdio.h> #include <string.h> int main() { int n; scanf("%d",&n); while(n--) { int a[101]; int m; scanf("%d",&m); for(int i=1;i<=m;i++) a[i]=0; for(int i=1;i<=m;i++) for(int j=2;j*i<=m;j++) a[j*i]=!a[j*i]; int count=0; for(int i=1;i<=m;i++) if(!a[i]) count++; printf("%d\n",count); } return 0; }
相关文章推荐
- THE DRUNK JAILER POJ 1218
- POJ 1218 THE DRUNK JAILER
- POJ 1218 THE DRUNK JAILER(水题)
- poj 1218 THE DRUNK JAILER
- poj1218——THE DRUNK JAILER
- poj 1218 THE DRUNK JAILER
- THE DRUNK JAILER - POJ 1218 水题
- poj 1218 THE DRUNK JAILER【水题】
- POJ 1218 THE DRUNK JAILER(数论)
- POJ 1218 THE DRUNK JAILER
- 【水题】POJ-1218 THE DRUNK JAILER
- poj1218--THE DRUNK JAILER(求约数的个数)
- POJ - 1218 THE DRUNK JAILER
- (Relax ST1.6)POJ 1218 THE DRUNK JAILER(求1-n之间有多少个平方数)
- poj1218——THE DRUNK JAILER
- poj1218 THE DRUNK JAILER!
- POJ 1218 THE DRUNK JAILER
- POJ 1218 THE DRUNK JAILER
- POJ_1218_THE DRUNK JAILER
- poj 1218 THE DRUNK JAILER