def split(n, numberlist):
numberlist.clear()
while(n > 0):
mod = n % 10
n = int( n / 10)
numberlist.append(mod)
return numberlist
def combine(list, k):
temp = 0
for i in range(k):
temp1 = list[i] * pow(10, k - i -1)
temp = temp + temp1
return temp
if n < 10:
return n * 10 - n #加入2位數的磁力數判斷,如果差值爲個位數的情況
else:
split(n, list)
list.sort()
listmin = list.copy()
list.reverse()
max = combine(list, len)
min = combine(listmin, len)
return max - min
len = len(str(n))
list = []
L = []
lst = []
n = differ(n)
counter = Counter()
while 10 not in counter.values():
L.append(n)
n = differ(n)
counter = Counter(L)
print(d)
if d[key] > 8:
lst.append(key)