admin管理员组文章数量:1558100
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
大体题意:就是说给出的数是从1到这个数都除一遍,如果除尽,则把当前的状态改变为相反的状态.
被大神称为纯水题
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
using namespace std;
int main()
{
int t,n;
int a[10010],b[10010];
cin>>t;
while(t--)
{
cin>>n;
for(int i=1; i<=n; i++)
{
a[i]=i;
b[a[i]]=0;
}
for(int i=1; i<=n; i++)
{
for(int j=1; j<=n; j++)
if(a[j]%i==0)
{
b[a[j]]++;
}
}
int c=0;
for(int i=1; i<=n; i++)
{
if(b[a[i]]%2==1)
c++;
}
cout<<c<<endl;
}
return 0;
}
版权声明:本文标题:THE DRUNK JAILER POJ 1218 内容由热心网友自发贡献,该文观点仅代表作者本人, 转载请联系作者并注明出处:https://m.elefans.com/dongtai/1727342035a1109533.html, 本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如发现本站有涉嫌抄袭侵权/违法违规的内容,一经查实,本站将立刻删除。
发表评论