-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path35.py
58 lines (50 loc) · 1.25 KB
/
35.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
#-*-coding:utf8;-*-
#qpy:3
#qpy:console
import time
#decorator that gets time of program
def dect(func):
def timef():
t0 = time.time()
func()
t1 = time.time()
print(t1 - t0)
return timef
def factorizer(number,limit):
f_set = set()
gate = isinstance(limit,int)
for x in range(1,int(number**0.5) + 1):
if number % x == 0:
f_set.add(x)
f_set.add(int(number / x))
Range = int(number / x)
if gate == True:
if len(f_set) > limit:
break
return list(f_set)
def prime_gen(cap):
i = 1
while i < cap:
i_fs = factorizer(i,2)
if len(i_fs) == 2:
yield i
i += 2
def digit_shifter(num):
n_len = len(str(num))
if n_len > 1:
for i in range(1,n_len):
mut_n_list = [str(num)[i % n_len] for i in range(i,i + n_len)]
yield int("".join(mut_n_list))
@dect
def main():
count = 1
for prime in prime_gen(1 * 10**6):
flag = 0
for shifted in digit_shifter(prime):
if len(factorizer(shifted,2)) > 2:
flag = 1
break
if flag == 0:
count += 1
print(count)
main()