-
Notifications
You must be signed in to change notification settings - Fork 1
/
PrimeTimeAgain.py
28 lines (27 loc) · 994 Bytes
/
PrimeTimeAgain.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
#succesfull/presentation error
inp = input().split()
d = int(inp[0])
p = int(inp[1])
dp = d // p
primes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97,
101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229,
233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379,
383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499]
n = 0
a = 0
for i in range(len(primes)):
check = False
if primes[i] > dp:
break
a = i
for j in range(0, p - 1):
if (primes[a] + dp) in primes:
a = primes.index(primes[a] + dp)
check = True
elif (primes[a] + dp) not in primes:
check = False
break
if check:
n += 1
a = i
print(n)