THE DRUNK JAILER POJ1218

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-n 个自然数，起初令奇数位为1。

从i<----2 to n做一个循环，如果i的倍数位为1，则改为0，如果为0，则改为1

问，循环结束后，共有多少个1.

 

Solved by Super.Jiju

这道题很容易分析，如果某数位被翻了偶数次，则该位仍为1。

事实上，如果某i位的有奇数个因子，那么他一定被翻了偶数次。

完全平方数就有这样的性质。

那么，就很容易得到答案咯

#include using namespace std; int main() {     int n=0;     int num=0;     int counts=0;     cin>>n;     while(n--)     {         counts=0;         cin>>num;         for(int i=1;i*i<=num;++i)         {             counts++;         }         cout< <     }     return 0; }