Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
First solution in Clear category for Numbers Factory by ural_gorets
def checkio(number):
answer = [] #digits of answer will be stored in this list
X = 0
i = 9
while number > 1 and i > 1:
if number % i == 0: # if reminder from division is 0, then "i" is one of answer digits
answer.append(i)
number = number//i # reduce number and look for next digit
i = 10
i -= 1
if number > 10: # if somwhere in loop we deal with prime number, return 0
return X
else: # form number from founded digits
answer.sort(reverse=True)
for j in range(len(answer)):
X += answer[j]*10**j # biggest number in lower digit, smallest - in upper digit
return X
Aug. 29, 2018
