162.3853

来源: HF: 2008-09-27 04:56:41 [] [旧帖] [给我悄悄话] 本文已被阅读: 次 (561 bytes)
本文内容已被 [ HF: ] 在 2008-10-02 14:54:46 编辑过。如有问题,请报告版主或论坛管理删除.
Based on previous discussion, the solution should have the following feature: (1)person 1 always drive (2) they all arive at the terminal at the same time.

Assume the total time it takes for them to finish is t,
and assume for each person i, the total time that he rides the car is t_i, for i = 2,3,4,5
we have
2(t-t_2)+10t_2 = 1000
3(t-t_3)+10t_3 = 1000
4(t-t_4)+10t_4 = 1000
5(t-t_5)+10t_5 = 1000
10[(t_2+t_3+t_4+t_5)/2-(t-(t_2+t_3+t_4+t_5)/2))] = 1000

Solve for t to get t = 162.3853

Anything wrong with this method?

所有跟帖: 

sorry, wrong (again) -HF:- 给 HF: 发送悄悄话 (36 bytes) () 09/27/2008 postreply 05:01:49

回复:sorry, wrong (again) -火球魔法- 给 火球魔法 发送悄悄话 火球魔法 的博客首页 (357 bytes) () 09/29/2008 postreply 09:42:37

请您先登陆,再发跟帖!

发现Adblock插件

如要继续浏览
请支持本站 请务必在本站关闭/移除任何Adblock

关闭Adblock后 请点击

请参考如何关闭Adblock/Adblock plus

安装Adblock plus用户请点击浏览器图标
选择“Disable on www.wenxuecity.com”

安装Adblock用户请点击图标
选择“don't run on pages on this domain”