-
Notifications
You must be signed in to change notification settings - Fork 0
/
Euler551.py
69 lines (47 loc) · 1.08 KB
/
Euler551.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
"""Let a0, a1, a2, ... be an integer sequence defined by:
a0 = 1;
for n > 1, an is the sum of the digits of all preceding terms.
The sequence starts with 1, 1, 2, 4, 8, 16, 23, 28, 38, 49, ...
You are given a106 = 31054319.
Find a1015.
"""
def getDigitsSum(x):
sum = 0
while x:
sum += x % 10
x /= 10
return sum
def seq(x):
NEXT = 1
s = [NEXT]
print NEXT, 1, NEXT % 9
for i in xrange(2,x):
NEXT += getDigitsSum(NEXT)
print NEXT, NEXT/9, NEXT % 9 , " ", i
s.append(NEXT)
return s
def seq2(x):
NEXT = 1
s = [NEXT]
#print NEXT, 1, NEXT % 9
for i in xrange(2,x):
NEXT += getDigitsSum(NEXT)
#print NEXT, NEXT/9, NEXT % 9 , " ", i
s.append(NEXT)
return s
#for i in seq(10**15): print i
print seq(100)
print "\n" * 5
print seq(100)
x = [1,2,4,8,7,5]
N = 0
n = x[(N+6)%6]
for i in range(100):
x = [1,2,4,8,7,5]
if i % 9 in x:
if i in seq2(100):
print i, "init"
else:
print i
#0,0,2,4,4,2,6,6,8,4,4,8
#print sum(getDigits(52))