Details of the problem ...
Input is crossing time list. (for example x= [1 2 5 8])
Output is the minimum time. (for original problem y_correct= 15)
Assumption 1: for this problem only four people will cross the bridge
Assumption 2: crossing times are integer
Count from 0 to N^M in base N.
Smallest distance between a point and a rectangle
Clockwise or Counterclockwise
yet another flying fly (YAFF)
Find the biggest empty box
Get Next Combination
Fill the Matrix - 2
Decrypt a secret message!
Lunar Arithmetic (Multiplication)
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office