Jack and Jill were passing through a jungle on there way. They
encountered a monster who told they will be only be allowed to
escape when
they solve a puzzle for him. They did't have choice so agreed.
Given N number of empty buckets, we need to minimize steps to fill
required number of fruits in each bucket. Only below mentioned
operations are allowed to add fruits.
1. Double the count of fruits - All buckets will double the number of
fruits in single operation.
2. Increment individual bucket fruit count by 1.Single operation for
each bucket
3. We cannot remove/decrease number of fruits in a bucket.
CONSTRAINTS:
1<=target[i]<=1000, where target[i] is the element at index Y.
1<=i<= 1000
Answers
Answered by
8
Answer:
the numerical ratio of displacement to distance for a moving object is
Answered by
0
Answer:
Jack and Jill were going through a jungle to the city.
They encountered a monster who told them they will only be allowed to escape when they solve a puzzle for him. They didn’t have a choice so they agreed.
Explanation:
Either you can increment fruit count by 1 in each bucket i.e. Incremental Operation
You can double the fruits in each bucket i.e. Doubling Operation.
Function Description:
Provide implementation for method play_the_game(target). play_the_game has the following parameter(s):
target: an integer list denoting numbers of fruits required at nth position.
Example:
Input: 23
Output: 4
To get the target bucket from (0, 0), we first increment both elements by 1 (2 operations), then double the array (1 operation). Finally increment second element (1 more operation)
Input: 16 16 16
Output: 7
Similar questions