Konsistent Karl is taking a specific contest with the following rules:
Karl can solve the first five problems in one minute each, the next five in two minutes each, and the last five in three minutes each. What is the maximum possible score Karl can earn?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Assign to each problem a value in the following way:
value ( problem n ) = time taken n
This table summarizes the values
Solving the first 6 most valuable problems, namely problems 5 , 1 0 , 1 5 , 1 4 , 1 3 , 9 takes 1 4 minutes, we now have 1 minute left to solve problem 4 . Hence the maximum we can obtain is
5 + 1 0 + 1 5 + 1 4 + 1 3 + 9 + 4 = 7 0