crimson_b1ade
Well-known Member
- Joined
- Sep 27, 2008
- Messages
- 1,557
AE> 10 (10)
<A p 1 (11)<>AD> 5 (16)
<A p 1 (17)<>AC> 3 (20)
AB> 2 (23)
"A" goes back to get everyone else since he's the fastest.
23 minutes. does this work?
<A p 1 (11)<>AD> 5 (16)
<A p 1 (17)<>AC> 3 (20)
AB> 2 (23)
"A" goes back to get everyone else since he's the fastest.
23 minutes. does this work?
5 men of equal weight need to cross a bridge in the fastest time possible.
The bridge is not very sturdy so only 2 men can cross the bridge at the same time.
The men only have 1 torch. It is very dark so the bridge can only be traversed if someone is carrying the torch. The men crossing the bridge must carry the torch (the way cannot be shone by someone holding the torch from either end) and they must stay together during the crossing.
This means that once 2 men have crossed the bridge, the torch has to be taken carried back to the other side to the remaining men otherwise they would not be able to cross. The torch cannot be thrown back (or some other workaround): it must be carried back.
The men have different fitness levels which means that it takes them different amounts of time to cross the bridge:
Code:Man A 1 minute Man B 2 minutes Man C 3 minutes Man D 5 minutes Man E 10 minutes
So, for example, if Man A and Man E cross the bridge together it would take them 10 minutes because they must stay together.
There are no tricks in this question. They all must cross the bridge (no swimming etc...); it is a straightforward maths problem: what is the quickest way for them to cross the bridge?