HDU1337(hash)
来源:互联网 发布:淘宝店铺交易数据分析 编辑:程序博客网 时间:2024/05/22 04:46
The Drunk Jailer
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 885 Accepted Submission(s): 735
Problem 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
#include<iostream>
using namespace std;
int hash[110];
int main()
{
int i,j,t,n,num;
cin>>t;
while(t--)
{
num=0;
cin>>n;
memset(hash,0,sizeof(hash));
for(i=1;i<=n;i++)
{
for(j=i;j<=n;j=j+i)
{
if(hash[j]==0)
hash[j]=1;
else
hash[j]=0;
}
}
for(i=1;i<=n;i++)
{
if(hash[i]==1)
num++;
}
cout<<num<<endl;
}
return 0;
}
- HDU1337(hash)
- HDU1337(hash)
- hdu1337 水题
- hdu1337-The Drunk Jailer
- hdu1337(模拟/完全平方数)
- hash
- Hash
- hash
- hash
- Hash
- hash
- Hash
- HASH
- hash
- hash
- HASH
- hash
- hash
- 2013百度校园招聘-机器学习和数据挖掘工程师-笔试题
- Android系统手机端抓包方法
- UVa 572Oil Deposits
- NYOJ网络的可靠性
- PHP学习系列之错误处理和异常捕获
- HDU1337(hash)
- ContentProvider内容提供者(一)
- 服务端部分
- Calculate Linux 13 Beta 1 发布
- sqlserver日历表
- UVa 10617 - Again Palindrome
- EDK10.1的ModelSim仿真库的生成
- 整型和字符串的相互转化
- js定时器