Problem 44884. Bridge and Torch Problem - Length of Unique Time List
Input is crossing time list. (for example x= [1 2 5 8])
Output is the length of all possible crossing time records. (for original problem y_correct= 14. In other words it is possible to cross the bridge in [15, 17, 18, 19, 21, 22, 24, 25, 27, 28, 30, 31, 34, 40] minutes.
Assumption 1: for this problem only four people will cross the bridge
Assumption 2: crossing times are integer
Crossing Model: 2 out of 4 people will cross the bridge, one of them will return. two out of 3 people will cross the bridge, one out of three people will return. Remaining two people will cross the bridge.
Solution Stats
Problem Comments
Solution Comments
Show commentsProblem Recent Solvers4
Suggested Problems
-
What is the next step in Conway's Life?
648 Solvers
-
232 Solvers
-
Back to basics 3 - Temp Directory
366 Solvers
-
279 Solvers
-
Find nearest prime number less than input number
700 Solvers
More from this Author92
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!