forked from zhuzhuor/Euler
/
p68.py
executable file
·58 lines (50 loc) · 1.14 KB
/
p68.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
#!/usr/bin/env pypy
from itertools import permutations as perm
def transform(lis):
mat = []
for i in range(5):
row = [None] * 3
row[0] = lis[i]
row[1] = lis[i + 5]
row[2] = lis[(i + 1) % 5 + 5]
mat.append(row)
# make it unique
# starting from the lowest outer value
lowest = 100
position = None
for i in range(5):
if lowest > mat[i][0]:
lowest = mat[i][0]
position = i
mat = mat[position:] + mat[:position]
return mat
def is_gon(gon):
s = sum(gon[0])
for i in range(1, 5):
if sum(gon[i]) != s:
return False
return True
result = 0
result_p = None
result_g = None
gen = perm(range(1, 11))
for p in gen:
if 10 not in p[:5]:
# make sure 16-digit
continue
g = transform(p)
if is_gon(g):
r = ''
for i in range(5):
for j in range(3):
r += str(g[i][j])
assert len(r) == 16
if int(r) > result:
result = int(r)
result_p = p
result_g = g
else:
continue
print result
print result_p
print result_g