Question

Python Program :
Prof. SRS is on a trip with a set of students of his course. He has taken several packets of candies to be distributed among the
students. Unfortunately, the sizes of the packets are not the same and the professor would like to distribute the candies in an
unbiased way. A solution is to open all the packets and move some candies from the larger packets to the smaller ones so that
each packet contains equal number of candies. Your task is to determine the minimum number of such moves to ensure all
packets have the same number of candies.
(One move indicates picking one candy from a packet and moving it to the other)
Input Format:
The first line of the input contains space separated integers indicating the sizes of each packet.
Output Format:
Display a single integer indicating the minimum number of moves required to equalize the size of each packet.
If it is not possible to equalize, display-1 as output.​

Answer 1

d=[int(i) for i in input().split()]

s=sum(d)

result=0

if s%len(d)==0:

 for i in range(len(d)):

   if d[i]<(s//len(d)):

     result=result+((s//len(d))-d[i])

 print(result,end='')

else:

 print('-1',end='')