project euler 41.problem

 # coding=utf-8
import math
 
def isPandigital(n):
    List = [1, 2, 3, 4, 5, 6 ,7, 8, 9]
    
    if len(n) == 9:
        n = int(n)
        while n!=0:
            tmp = n % 10
            n /= 10
            if List[tmp-1] != 0:
                List[tmp-1] = 0
            else:
                return False
    return True
 
def primecheck(n):
    if n == 2 or n == 3:
        return True
    if n % 2 == 0 or n == 1:
        return False
    for i in range(3, int(math.sqrt(n)) + 1, 2): 
        if n % i == 0:
            return False
    return True
 
def permute(list):
    if not list:
        return [list]
    else:
        res = []
        for i in range(len(list)):
            rest = list[:i] + list[i+1:]
            for x in permute(rest):
                res.append(list[i:i+1]+x)
        return res
 
def listSumming(list):
    result = 0
    for i in range(0, len(list)):
        result += list[len(list)-i-1]* (10 ** i)
    return result
 
 
list = [1,2,3,4,5,6,7,8,9]
ppmax = 0
for i in range(0, 10):
    for j in permute(list[:len(list)-i]):
        output = listSumming(j)
        if primecheck(output):
            if output > ppmax:
                ppmax = output
print ppmax
 

C:\Users\soicem\Desktop\연습용 폴더>python test.py

7652413