p****t
发帖数: 1 | 1 Three wise men are locked in three rooms. Each day there there is, or there
is no light in each room.
During a certain finite initial period there is no rule about how the rooms
are illuminated, and after one of two cases are possible:
1. Each day exactly one room is illuminated
2. Each day exactly two rooms are illuminated
This lasts infinitely.
(Let's assume that wise men can't die during this process, for exemple each
next day is twice shorter than previous one)
I other words wise men are giv | k*****l
发帖数: 59 | 2 Those locked in room which is not illuminated say the number is 1,
Those locked in room which is illuminated say the number is 2.
This strategy will guarantee 2 and only 2 of them will give the correct
answer.
there
rooms
each
【在 p****t 的大作中提到】
: Three wise men are locked in three rooms. Each day there there is, or there
: is no light in each room.
: During a certain finite initial period there is no rule about how the rooms
: are illuminated, and after one of two cases are possible:
: 1. Each day exactly one room is illuminated
: 2. Each day exactly two rooms are illuminated
: This lasts infinitely.
: (Let's assume that wise men can't die during this process, for exemple each
: next day is twice shorter than previous one)
: I other words wise men are giv
|
|
