结题报告：POJ_1218

一、原题：

链接：http://poj.org/problem?id=1218

THE DRUNK JAILER

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 15122		Accepted: 9683

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.

 

二、Source Code:

Source Code

Problem: 1218		User: mervyn_diane
Memory: 228K		Time: 0MS
Language: C++		Result: Accepted

• #include<iostream> using namespace std; int main() { int cases, n, i, j, count; int a[120]; cin >> cases; for( int c = 0; c < cases; c++ ) { count = 0; cin >> n; for( i = 1; i <= n; i++ ) a[i] = 1; for( i = 1; i <= n; i++ ) { for( j = 1; j <= n; j++ ) { if( j % i == 0 ) //判断指定的number a[ j ]++; } } for( i = 1; i <= n; i++ ) { if( a[i] % 2 == 0 ) count++; } cout << count << endl; } return 0; }

三、总结：

1、先给定一个数组（总的房间数量），设置成1（表示lock状态）。然后遍历n次，每次给a[i]加1，表示状态的改变。搞定之后，根据数组元素的值，如果是偶数表示是开的，that is， 人逃走了，否则，还在；

2、读懂题意，认真写code。