mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-28 07:21:07 +00:00
23 lines
546 B
Python
23 lines
546 B
Python
|
from __future__ import print_function
|
||
|
|
'''
|
||
|
|
Permuted multiples
|
||
|
|
Problem 52
|
||
|
|
|
||
|
|
It can be seen that the number, 125874, and its double, 251748, contain exactly the same digits, but in a different order.
|
||
|
|
|
||
|
|
Find the smallest positive integer, x, such that 2x, 3x, 4x, 5x, and 6x, contain the same digits.
|
||
|
|
'''
|
||
|
|
i = 1
|
||
|
|
|
||
|
|
while True:
|
||
|
|
if sorted(list(str(i))) == \
|
||
|
|
sorted(list(str(2*i))) == \
|
||
|
|
sorted(list(str(3*i))) == \
|
||
|
|
sorted(list(str(4*i))) == \
|
||
|
|
sorted(list(str(5*i))) == \
|
||
|
|
sorted(list(str(6*i))):
|
||
|
|
break
|
||
|
|
|
||
|
|
i += 1
|
||
|
|
|
||
|
|
print(i)
|