返回列表 回復 發帖
第2的....直覺告訴我
0000000000
友華
我已經想很久了- j* [+ ^% R' }+ n
實在太難TVBNOW 含有熱門話題,最新最快電視,軟體,遊戲,電影,動漫及日常生活及興趣交流等資訊。0 Z# L# F- d# Q7 \
只好來看答案了
no2,,3,4應該沒那麼容易死瓜

回復第 1 帖由 蘭昀 所發的帖子

number 4 has the best chance to live
% r! c% i" P2 c/ g  r5 Tassume number 1, 2, 3 and 4, pick number a, b, c and d.TVBNOW 含有熱門話題,最新最快電視,軟體,遊戲,電影,動漫及日常生活及興趣交流等資訊。  _7 `' q( g- U* `/ C- E
number 4 knows how many left in the bag which is 100-a-b-c
# m. Z% W& R( U9 ]4 s( U4 h6 h* x/ X1 btake the average of (100-a-b-c)
, ^9 [) @" R5 gthen number 4 knows a or b or c must be greater or less than average of (100-a-b-c)
, D7 ~# R, e; N2 ]公仔箱論壇and number 4 can squeeze himself into the average and what number 5 picks.tvb now,tvbnow,bttvb, Q* _: B! Z6 I0 b# ]& G5 Y6 T4 {" R
so number 4 will have the best chance.
' r4 a3 S( I/ A& B' MTVBNOW 含有熱門話題,最新最快電視,軟體,遊戲,電影,動漫及日常生活及興趣交流等資訊。  L0 k# C0 e9 e- S# W% j1 D
i hope this is a good logic hehe
同意楼上 Number 4 係最安全!! Number5 係一定死咖了!! 不过我就唔知 Number 1,2,3 边个唔好彩jie !!- C5 \5 V. X; I( v
玩心理咖话!! 5号 好大压力!! 因为就算佢知剩下几多豆 佢豆好难判断所以!!!TVBNOW 含有熱門話題,最新最快電視,軟體,遊戲,電影,動漫及日常生活及興趣交流等資訊。) z* `& d9 |, d: f4 z! H6 J
2 L. g+ F& l5 ^( z- h5 v
如果绝D咖哇!!  全部豆色!!! 1号摞97粒 剩下3粒 一人一粒  大家一锅熟 哈哈!!!!(因为一人要一粒 所以佢哋冇得拣  只可以摞一粒!!)
想不到!!答案呢?
應該是第三ㄍ吧
no 2 !!! no 2 !!!                   5.39.217.76% Q1 m! r  X0 T" ~8 y
* F' S  t6 g$ f
             no 1 take 20 ( can be any ) no 2 take 19 ( can be any ) , no 3, 4, 5, take 18, 18, 18.
) b" v: h" F  N- H- R. o9 tTVBNOW 含有熱門話題,最新最快電視,軟體,遊戲,電影,動漫及日常生活及興趣交流等資訊。So they will all die !!                                                      
( s! J: V# f! n! K: f" N5.39.217.76, E+ X7 \, k3 }! T+ D
tvb now,tvbnow,bttvb: X# d% |; Y) S; r

7 u6 Z7 {9 ^* q: N* A6 H1 E! T公仔箱論壇! x) L4 ]$ Z  ^8 V  O

7 o# y* W- r+ `: X6 ztvb now,tvbnow,bttvbJust Joking !!!
The best chance is #3 because all he needs is take #1 + #2 divide by 2. e.g. #1+#2=28 then he take 14. This is the best chance to avoid being highest or lowest and worst case scenario is he equals #1 & #2. However because all 5 knows this simple theory so I think they all died because they all ended up picking the same number of beans.公仔箱論壇" V# [% y5 v8 L7 }4 W7 I' T8 u

3 p3 E7 t; B. Ttvb now,tvbnow,bttvbStarting from #1, he knows he cannot pick anything bigger then 49 because if he did, then #2 only have to leave 3 beans for #3 #4 & #5 then he'll live. e.g. #1 picked 53 then #2 picks 100-53-3=44.  then A,C,D,E all died. e.g. #1=53, #2=(100-53-3)=44, #3=1, #4=1, #5=1. The best chance for #1 is to pick anything less then or equal the median 20 (100 divided by 5). In fact anything between 3-20 won't change the result. Let's say #1 pick 20.  公仔箱論壇5 D1 |% B, e: Y) T; {* I3 @, b
5.39.217.76" k3 A# e; [) T% R. L6 o
Now #2 knows whatever he picks, #3 will take the median between him & #1 e.g. now #1 picked 20, if he pick 6 then #3 will pick 13 putting him either being the lowest or highest. He cannot allow that so the best chance is to match #1, so he picked 20 as well.
+ S5 H* l2 h: i5 L4 x4 |TVBNOW 含有熱門話題,最新最快電視,軟體,遊戲,電影,動漫及日常生活及興趣交流等資訊。
! @: J3 a+ F- ^0 g1 I" A* z7 vTVBNOW 含有熱門話題,最新最快電視,軟體,遊戲,電影,動漫及日常生活及興趣交流等資訊。#3 did the obvious choice 40 divided by 2 =20, so he picked 20
( o  x' I' L( Otvb now,tvbnow,bttvb
( M4 |) q; o+ m" Y& K, S- Ktvb now,tvbnow,bttvb#4 base on knowing the median rule take 60 divided by 3 =20, so he picked 20 as well.
' s: v7 Z& H. t9 K3 p公仔箱論壇
6 ]$ ~( h0 i) X& P1 t- m公仔箱論壇#5 same as above, he takes 80 divided by 4 =20, picked 20 as well.tvb now,tvbnow,bttvb. O' @0 F0 }& `$ J
5.39.217.76+ @" I" C0 }" u  b; k2 g8 }
Ended all have the same number and all died.
我猜NO4,公仔箱論壇1 E. l+ T$ h" F1 @4 l
因為他可以取前面三位豆子的平均數,
0 ~* m6 k" N& O' P# m7 I5.39.217.76也可以防止豆子不夠讓NO5墊底。
最后一个人最安全!因为当四个人拿完之后,他可以拿quarter of 之前拿的总数,咁样嘅话,佢係最大或者最小的几率係最低嘅```而前面几个人,用呢种方法摞会係最大或者最小的几率会比5号大D...而呢种方法係最有效避免最大或者最小嘅
) q1 E" g% A+ Q' u0 M4 Y4 Mtvb now,tvbnow,bttvb
' c9 o' ~0 n" lTVBNOW 含有熱門話題,最新最快電視,軟體,遊戲,電影,動漫及日常生活及興趣交流等資訊。[ 本帖最後由 289675283 於 2006-12-15 01:21 AM 編輯 ]
[-X  所謂IQ題唔喺可以用普通思維gē,5.39.217.76; U  r' l- o% I- n) y; j: X
5.39.217.76: W0 D9 G6 |" M! D; o0 p
答案應該喺 :抓豆子不多不少的那個囚犯存活率是最大的
想想
返回列表