pku1218

THE DRUNK JAILER
Time Limit:1000MS    Memory Limit:10000K
Total Submit:5173 Accepted:3416

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

第一次的诡异code：

var a,n,i:longint;
begin
readln(n);
for i:=1 to n do begin
readln(a);
writeln(trunc(sqrt(a)));
end;
end.
结果：

    

            
2295747
            
parachutes
            
1218
            
Accepted
            
8K
            
0MS
            
Pascal
            
113B
            
2007-07-01 19:53:05
        
    

第二次的正规code：
var k,m,n,i,j,total,l:longint;
      a:array[1..1000] of boolean;
procedure change(x:longint);
var j:longint;
begin
j:=0;
while j<=n do begin
j:=j+x;
if a[j]=true then a[j]:=false else a[j]:=true;
end;
end;
begin
readln(m);
for k:=1 to m do begin
    readln(n);
    total:=0;
    fillchar(a,sizeof(a),false);
    for i:=1 to n do change(i);
    for l:=1 to n do if a[l] then inc(total);
writeln(total);
end;
end.

    

            
2295801
            
parachutes
            
1218
            
Accepted
            
8K
            
0MS
            
Pascal
            
424B
            
2007-07-01 20:28:07
        
    

竟然都可以ac。。。。

迷茫中，谁来证明一下第一种方法的正确性。。。