-
Notifications
You must be signed in to change notification settings - Fork 1
/
092.py
57 lines (49 loc) · 1.09 KB
/
092.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
#! /usr/bin/env python
def addn(n):
# if use str: run for double time -_-b
#return sum([ int(s)**2 for s in str(n)])
sum = 0
while n > 0:
sum += (n%10)**2
n = n/10
return sum
def find1():
# run for 57s
s89 = set([89])
s1 = set([1])
for n in xrange(1,10000000):
i = n
chains = [i]
while True:
if i in s89:
s89.update(chains)
break
if i in s1:
s1.update(chains)
break
i = addn(i)
chains.append(i)
return len(s89)
def find2():
# run for 49s
count = 0
arr = [0]*10000002
arr[1]=2
arr[89]=1
for n in xrange(1,10000000):
i = n
c = [i]
while True:
if arr[i] == 1:
for p in c:
arr[p] = 1
count +=1
break
if arr[i] == 2:
for p in c:
arr[p] = 2
break
i = addn(i)
c.append(i)
return count
print find2()