P27, P56, P130, P315, P357, P425: Split long lines and tweaked parentheses in Python solutions.

Author: nayuki

python/p027.py

@@ -10,7 +10,8 @@
 
 
 def compute():
-	ans = max(((a, b) for a in range(-999, 1000) for b in range(2, 1000)), key=count_consecutive_primes)
+	ans = max(((a, b) for a in range(-999, 1000) for b in range(2, 1000)),
+		key=count_consecutive_primes)
 	return str(ans[0] * ans[1])
 
 

python/p056.py

@@ -8,7 +8,8 @@
 
 
 def compute():
-	ans = max(sum(int(c) for c in str(a**b)) for a in range(100) for b in range(100))
+	ans = max(sum(int(c) for c in str(a**b))
+		for a in range(100) for b in range(100))
 	return str(ans)
 
 

python/p130.py

@@ -12,7 +12,8 @@
 
 
 def compute():
-	cond = lambda i: i % 5 != 0 and not eulerlib.is_prime(i) and (i - 1) % find_least_divisible_repunit(i) == 0
+	cond = lambda i: (i % 5 != 0) and (not eulerlib.is_prime(i)) \
+		and ((i - 1) % find_least_divisible_repunit(i) == 0)
 	ans = sum(itertools.islice(filter(cond, itertools.count(7, 2)), 25))
 	return str(ans)
 

python/p315.py

@@ -11,7 +11,9 @@
 
 def compute():
 	isprime = eulerlib.list_primality(20000000)
-	ans = sum(sam_transitions_minus_max_transitions(i) for (i, p) in enumerate(isprime) if i >= 10000000 and p)
+	ans = sum(sam_transitions_minus_max_transitions(i)
+		for (i, p) in enumerate(isprime)
+		if i >= 10000000 and p)
 	return str(ans)
 
 

python/p357.py

@@ -52,7 +52,7 @@ def is_prime_generating(n):
 			for d in range(2, eulerlib.sqrt(n) + 1))
 
 	ans = sum(n for n in range(LIMIT + 1)
-		if (isprime[n + 1] and is_prime_generating(n)))
+		if isprime[n + 1] and is_prime_generating(n))
 	return str(ans)
 
 

python/p425.py

@@ -52,7 +52,8 @@ def compute():
 					heapq.heappush(queue, (nextpmax, m))
 			tempdigits[i] = digits[i]  # Restore the digit
 
-	ans = sum(i for i in range(len(isprime)) if (isprime[i] and (pathmax[i] is None or pathmax[i] > i)))
+	ans = sum(i for i in range(len(isprime))
+		if isprime[i] and (pathmax[i] is None or pathmax[i] > i))
 	return str(ans)