def min_move(k:int, seq:list):
'''
:param k: 每次可以从当前位置移动k个糖果到其相邻位置
:param seq: 糖果序列
:return: 最少移动次数
'''
s = sum(seq)
length = len(seq)
avg = s / length
count = 0
if s % length != 0:
return False
else:
for item in seq:
if abs(item-avg) % k == 0:
if item > avg:
count += (item-avg)/2
else:
return False
return count