- ryu：现代芭蕾《金瓶梅》何以类春宫
- kissmyaaa：号外：兄妹闹分家， 害命殇烂赤裸裸相互残杀
- kylelong：芙蓉姐姐变得可爱鸟！
- ryu：青春无悔的Sasaki Nozomi
- ryu：“富二代”中的佼佼者
- kylelong：周末看北影美女－－景甜
- 宜修：最尴尬的第一次约会 (ZT)
- kylelong：2011浪漫七夕，看12星座的人如何说甜言蜜语
- kylelong：哪个男人更漂亮？
- shen fuen：水浒人物谜 7/29
- shen fuen：重温惠东平海城隍庙的楹联
- 三Y老豆：玩的就是尖叫声---拉斯维加斯游(17)
- 三Y老豆：世界扑克牌大赛--拉斯维加斯游(14)
- ofox：查小欣为什么拉偏架？因为她是谢霆锋的旧情人。
- 小城春秋：我欣赏这个女孩（ZT）汤唯在英国的日子
- kylelong：英文中的污辱性称呼
- ofox：锋芝离婚案中的黑手：查老三
- 三Y老豆：男厕里的尴尬---拉斯维加斯游(6)
- yulinw：中国达人秀第二季年度盛典 20110710
怎样才能逃命？ Note that it asks for two different answers.
You are one of several recently arrested prisoners. The warden, a deranged computer scientist, makes the following announcement:
You may meet together today and plan a strategy, but after today you will be in isolated cells and have no communication with one another.
I have setup a "switch room" which contains a light switch, which is either on or off. The switch is not connected to anything.
Every now and then, I will select one prisoner at random to enter the "switch room". This prisoner may throw the switch (from on to off, or vice-versa), or may leave the switch unchanged. Nobody else will ever enter this room.
Each prisoner will visit the "switch room" arbitrarily often. More precisely, for any N, eventually each of you will visit the "switch room" at least N times.
At any time, any of you may declare: "we have all visited the 'switch room' at least once". If the claim is correct, I will set you free. If the claim is incorrect, I will feed all of you to the crocodiles. Choose wisely!
Devise a winning strategy when you know that the initial state of the switch is off.
Devise a winning strategy when you do not know whether the initial state of the switch is on or off.
You may meet together today and plan a strategy, but after today you will be in isolated cells and have no communication with one another.
I have setup a "switch room" which contains a light switch, which is either on or off. The switch is not connected to anything.
Every now and then, I will select one prisoner at random to enter the "switch room". This prisoner may throw the switch (from on to off, or vice-versa), or may leave the switch unchanged. Nobody else will ever enter this room.
Each prisoner will visit the "switch room" arbitrarily often. More precisely, for any N, eventually each of you will visit the "switch room" at least N times.
At any time, any of you may declare: "we have all visited the 'switch room' at least once". If the claim is correct, I will set you free. If the claim is incorrect, I will feed all of you to the crocodiles. Choose wisely!
Devise a winning strategy when you know that the initial state of the switch is off.
Devise a winning strategy when you do not know whether the initial state of the switch is on or off.
其它[娱乐八卦]博文更多