POJ1218 THE DRUNK JAILER

一、题目信息

THE DRUNK JAILER

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 19482		Accepted: 12304

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

二、算法分析

    最笨的方法，就是列一个长度为n的数组代表cell是locked还是unlocked，然后按照游戏方法，遍历n次该数组，不断改变数组中的值，这样时间复杂度是O(n*n)。但是经过观察发现，一个cell被开关的次数其实是有规律的，也就是这个cell的编号n的约数的数量；比如4，他的约数有1,2,4，所以编号为4的cell会在游戏的第1,2,4轮被开/关。又如果一个cell被开/关的最终次数为偶数次，则该cell最终也就是关闭的，这个cell里可怜的prisoner将无法上演《越狱》，只有cell编号的约数数量为奇数的，才有机会逃跑。所以，问题转换为，求一个数1~n中，有多少数有奇数个约数。

三、参考代码

我的代码运行时间为0，但是内存缺花费了156K，有谁知道，POJ里面那些孙子是怎么把内存降到0的？或者说，空间复杂度降到1？如果谁有更好的算法，欢迎一块讨论。

#include <stdio.h>
int main()
{
    short unsigned cell[101] = {0,1,1,1,2,2},i = 0,j,top,sum = 0;
    int N,n;
    for(i = 6;i <= 100;i++)
    {
        sum = 0;
        top = i>>1;
        for(j = 2;j <= top ;j++)
            !(i % j) ? sum++ :0;
        cell[i] = cell[i-1] + sum%2;
    }
    scanf("%d",&N);
    while(N--)
    {
        scanf("%d",&n);
        printf("%d\n",cell[n]);
    }
    return 0;
}