#!/usr/bin/env python
#-*-coding:utf-8-*-

'''

'''

import timeit


def loop(n):
    for i in range(10, 10000000):
        if str(i)[0] != '1':
            continue
        f = [1 for j in range(2, n+1) if sorted(list(str(i))) != sorted(str(i*j))]
        if len(f) == 0:
            return i


if __name__ == '__main__':
    print loop(6)
    print timeit.Timer('problem_052.loop(6)', 'import problem_052').timeit(1)

@@ -40,16 +40,237 @@
 *-%0A%0A'''%0A
+It can be seen that the number, 125874, and its double, 251748,%0Acontain exactly the same digits, but in a different order.%0A%0AFind the smallest positive integer, x,%0Asuch that 2x, 3x, 4x, 5x, and 6x, contain the same digits.
 %0A'''%0A%0Aim

add problem sentence