From 1b4f2f2fa69f5081407a2095f60a7ccabc94b1cc Mon Sep 17 00:00:00 2001 From: daviddoji Date: Fri, 30 Sep 2022 21:08:04 +0200 Subject: [PATCH] Adopted new convention from template --- src/Python/Problems001-050/Problem039.py | 13 +++++++------ 1 file changed, 7 insertions(+), 6 deletions(-) diff --git a/src/Python/Problems001-050/Problem039.py b/src/Python/Problems001-050/Problem039.py index f2d979d..4b22390 100644 --- a/src/Python/Problems001-050/Problem039.py +++ b/src/Python/Problems001-050/Problem039.py @@ -1,4 +1,4 @@ -#!/usr/bin/env python3 +#!/usr/bin/env python """ Created on 05 Jun 2021 @@ -22,16 +22,17 @@ def compute(): For which value of p ≤ 1000, is the number of solutions maximised? """ + ans, val = 0, 0 for p in range(2, 1001, 2): sol = 0 for a in range(1, p): - for b in range(a+1, p-2*a): + for b in range(a + 1, p - 2 * a): c = p - (a + b) if a**2 + b**2 == c**2: - sol += 1 + sol += 1 elif a**2 + b**2 > c**2: - # As we continue our innermost loop, the left side + # As we continue our innermost loop, the left side # gets bigger, right gets smaller, so we're done here break if sol > ans: @@ -39,6 +40,6 @@ def compute(): return val -if __name__ == "__main__": - print(f"Result for Problem 39: {compute()}") +if __name__ == "__main__": + print(f"Result for Problem 39 is {compute()}")