Question

Because 7 8 9! Actually, this is mathematically impossible. "Cannibal numbers" as they're called can only eat numbers that are smaller than them, or the same size. After eating another number, the number that gets eaten disappears, and the number that ate them increases by 1 For example, given the following set of numbers, let's pretend that 9** is the cannibal. [27, 9, 3, 8, 11] 9 could start by eating 3 or 8. Let's say it eats 3, then the numbers would be: [27, 10, 8, 11] Then it could eat 8, so the numbers would be: [27, 11, 8, 11 And lastly, it could eat 11 [27, 12, 8] Your task is to write a program that, given a list of numbers and a target number, determines how many numbers in the list can become exactly that number For instance, in our example, two numbers could reach the value of 10. As we saw, 9 took on that value in the example. However, if 8 were the cannibal, it could: Eat 3 to become 9 . Eat 9 to become 10 So it could also hold the value of 10. For a target value of 11, the answer would also be 2, because 9 can become 11, and 11 is already 11. Your function may be passed a string of values separated by commas instead of a list--1 out of 4 points will be awarded for handling this case correctly. def cannibal (1, target): #YOUR CODE HERE

test cases

cannibal([27, 9, 3, 8, 11], 11) == 2

cannibal([27, 9, 3, 8, 11], 50) == 0

cannibal([3, 3, 3, 2, 2, 2, 1, 1, 1], 4) == 9

cannibal("1,2,3,4,5", 5) == 4

Answer 1

Hello, please comment if there is any more requirement from the question. I will be happy to help. Please give a thumbs up if the solution helped you.

Answer:

I think the third test case is wrong.

Please use tabs properly as python is sensitive to tabs. Thanks.

Hi, I think that the third test case is incorrect. Can you please recheck once.

from sys import stdin

def cannibal(numbers, query):
   count =0
   for n in numbers:
       if n>=query:
           count=count+1
   cannibals, available = 0, len(numbers)
   sortedNumbers = sorted(numbers)
   sortedNumbers.reverse()
   print(sortedNumbers)
   i =0
   while i< len(numbers):

       tempNumber=sortedNumbers[i]
       j = len(numbers)-1
       while j>=0:
           if i==j:
               j=j-1
               continue
           if tempNumber>sortedNumbers[j]:
               tempNumber=tempNumber+1
               sortedNumbers[j]=None
               if tempNumber==query:
                   count=count+1
                   break
           j=j-1
       i=i+1
   return count;
print(cannibal([27, 9, 3, 8, 11], 11))
print(cannibal([27, 9, 3, 8, 11], 50))