/
problem303.py
72 lines (58 loc) · 1.17 KB
/
problem303.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
59
60
61
62
63
64
65
66
67
68
69
70
71
72
#!/usr/bin/env python
#
def isans(num):
for x in str(num):
if int(x) > 2:
return False
return True
def multi(num):
n = 1
while True:
if isans(num * n):
break
n += 1
return n
def lst(num):
a = []
for x in str(num):
a.append(int(x))
a.reverse()
return a
def num(lst):
a = 0
for i, x in enumerate(lst):
a += x * 10 ** i
return a
def incr(tri):
pos = 0
while True:
if pos < len(tri):
buff = tri[pos]
buff += 1
if buff < 3:
tri[pos] = buff
return tri
tri[pos] = 0
pos += 1
else:
tri.insert(len(tri), 1)
return tri
if __name__ == '__main__':
# ans = 0
# n = 0
# for x in range(1, 10000):
# n = multi(x)
# print x, n, x*n
# ans += n
# print ans
ans = 0
for x in range(1, 10000):
print x
n = 1
while True:
if n % x == 0:
ans += n/x
break
else:
n = num(incr(lst(n)))
print ans + 1