/
p027.py
53 lines (37 loc) · 1.21 KB
/
p027.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
'''Problem 27 from project Euler: Quadratic primes
https://projecteuler.net/problem=27'''
from utils import is_prime
RESULT = -59231
def primes_exp(num_a, num_b):
'''Returns how many consecutive primes a quadratic expression with
coefficients num_a and num_b returns'''
count = 1
while is_prime(count ** 2 + num_a * count + num_b):
count += 1
return count
def solve():
'''Main function'''
max_primes = 0
result = 0
max_num = 1000
for num_a in xrange(max_num):
for num_b in xrange(max_num):
# A B
tmp = primes_exp(num_a, num_b)
if max_primes < tmp:
max_primes, result = tmp, num_a * num_b
# A -B
tmp = primes_exp(num_a, -num_b)
if max_primes < tmp:
max_primes, result = tmp, num_a * (-num_b)
# -A B
tmp = primes_exp(-num_a, num_b)
if max_primes < tmp:
max_primes, result = tmp, (-num_a) * num_b
# -A -B
tmp = primes_exp(-num_a, -num_b)
if max_primes < tmp:
max_primes, result = tmp, num_a * num_b
return result
if __name__ == '__main__':
print solve()