Calculating of integer logarithm base 2 is pretty easy in near any computer language - you just find the largest '1' in binary representation, and rest becomes
This would be the general problem statement: A prisoner escapes from the jail by jumping over N walls each with height of each wall given in an array. He can