POJ1218THE DRUNK JAILER 快速和一般方法两种解法
来源:互联网 发布:spss数据缺失值处理 编辑:程序博客网 时间:2024/04/29 09:10
THE DRUNK JAILER
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 22155 Accepted: 14012
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.
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
25100
Sample Output
210
由于最大才为100,所以就算是用枚举一个个的去改变数值最后也能通过,但是如果好好思考下其实很简单,就是一个数学规律,或许大神和菜鸟的区别就在于此,虽然题目简单但是值得我们去思考和延伸..........
-----------------AC代码----------------------------------
菜鸟方法:
#include<stdio.h>#define MAX 101int main(){int a[MAX],x,i,j,k,n,m,y;scanf("%d",&m);for(y=0;y<m;y++){scanf("%d",&n);for(i=1;i<=n;i++){a[i]=1;}k=1;while(k<=n){for(j=k;j<=n;j+=k){ a[j]=-a[j];}k++;}x=0;for(i=1;i<=n;i++) if(a[i]==-1) x++;printf("%d\n",x); }return 0;}
大神方法:
#include<stdio.h>#include<stdlib.h>#include<math.h>int main(){ int n,x,i; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d",&x); printf("%d\n",(int)sqrt((double)x)); } system("pause"); return 0;}
1 0
- POJ1218THE DRUNK JAILER 快速和一般方法两种解法
- poj1218THE DRUNK JAILER
- THE DRUNK JAILER POJ1218
- pku_1218 THE DRUNK JAILER
- The Drunk Jailer
- poj1218 THE DRUNK JAILER!
- POJ1218 THE DRUNK JAILER
- POJ - THE DRUNK JAILER
- POJ1218:THE DRUNK JAILER
- 1350_The Drunk Jailer
- Poj1218_THE DRUNK JAILER(水题)
- hdu1337-The Drunk Jailer
- POJ1218----THE DRUNK JAILER
- The Drunk Jailer
- THE DRUNK JAILER (数论)
- THE DRUNK JAILER
- THE DRUNK JAILER(poj1218)
- THE DRUNK JAILER
- android使用webview
- Linux C一站式学习习题答案11.5.1
- SQL的主键和外键的作用
- 吴绛雪的回文诗
- 【c++系列】map容器实现的word count
- POJ1218THE DRUNK JAILER 快速和一般方法两种解法
- C# dataGridView1 绑定数据库
- ACM-简单题之大明A+B——hdu1753
- Ubuntu升级g++-4.8以支持C++11
- Linux C一站式学习习题答案11.5.2
- PLSQL性能优化方法
- 截断二进制指数退避算法(JAVA版)
- ============================================================ 博文原创,转载请声明出处 电子咖啡(原id蓝岩) ==============
- pat 1053