-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path37.py
101 lines (82 loc) · 2.23 KB
/
37.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
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
import math,time
def naiti_prostie_menshe(n):
vsen = [True] * (n+1)
# esli vsen[k] == True znachit mi eshyo ne vikinuli k.
# esli vsen[k] == False, znachit mi uzhe vikinuli k.
prostie = []
koren = math.sqrt(n)
p = 2
while p <= koren:
# Zapominaem nashe prostoe chislo
prostie.append(p)
# Teper' vikidivayem iz spiska vsen, chisla kotorie delyatsya
# na p.
for i in xrange(p, n+1, p):
vsen[i] = False
# Teper' nahodim pervoy chislo v spiske vsen, kotoroe mi eshyo
# ne vikinuli, i zapominaem ego v p.
for i in xrange(p, n+1):
if vsen[i] == True:
p = i
break
# Kogda mi viydem iz cikla, vse ostavshiesya chisla v spiske
# vsen budut prostimi. Ih nado prosto dobavit' v spisok prostie
for i in xrange(p, n+1):
if vsen[i] == True:
prostie.append(i)
return prostie
a = naiti_prostie_menshe(20000)
p = []
def nam(aa):
c = str(aa)
k = []
if not aa in a:
return
else:
for i in xrange(1,len(c)):
k.append(int(c[:-i]))
k.append(int(c[i:]))
z = 0
for j in k:
if j in a:
z += 1
else:
return
if z == len(k):
p.append(aa)
i = 11
while True:
if i == 20001:
a = naiti_prostie_menshe(100100)
elif i == 100001:
a = naiti_prostie_menshe(300100)
elif i == 300001:
a = naiti_prostie_menshe(500100)
elif i == 500001:
a = naiti_prostie_menshe(700100)
elif i == 700001:
a = naiti_prostie_menshe(900100)
elif i == 900001:
a = naiti_prostie_menshe(1500100)
elif i == 1500001:
a = naiti_prostie_menshe(2000100)
elif i == 2000001:
a = naiti_prostie_menshe(2500100)
elif i == 2500001:
a = naiti_prostie_menshe(3000100)
elif i == 3000001:
a = naiti_prostie_menshe(4000100)
elif i == 4000001:
a = naiti_prostie_menshe(5000100)
elif i >= 5000001:
a = naiti_prostie_menshe(10000100)
nam(i)
#print i
i += 2
if len(p) == 11:
break
s = 0
for i in p:
s += i
print s
time.sleep(10000)