Project Euler #26

euler26.py

def seqlen(n):
    rem = []
    x = 1
    while 1:
        x = (10 * x) % n
        if x == 1:
            rem.append(x)
            break
        elif x == 0:
            break
        elif x not in rem:
            rem.append(x)
        else:
            break
    return len(rem)

print max((seqlen(x), x) for x in range(1, 1000))[1]