mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-10-07 06:09:28 +00:00
a1ea76bcf3
* optimization for problem09 in project_euler
* added benchmark code
* fixup! Format Python code with psf/black push
* Update project_euler/problem_09/sol1.py
Co-authored-by: Christian Clauss <cclauss@me.com>
* updating DIRECTORY.md
* Update project_euler/problem_09/sol1.py
* fixup! Format Python code with psf/black push
Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
Co-authored-by: Christian Clauss <cclauss@me.com>
37 lines
788 B
Python
37 lines
788 B
Python
"""
|
|
Problem Statement:
|
|
|
|
A Pythagorean triplet is a set of three natural numbers, a < b < c, for which,
|
|
|
|
a^2 + b^2 = c^2
|
|
|
|
For example, 3^2 + 4^2 = 9 + 16 = 25 = 5^2.
|
|
|
|
There exists exactly one Pythagorean triplet for which a + b + c = 1000.
|
|
Find the product abc.
|
|
"""
|
|
|
|
|
|
def solution():
|
|
"""
|
|
Returns the product of a,b,c which are Pythagorean Triplet that satisfies
|
|
the following:
|
|
|
|
1. a**2 + b**2 = c**2
|
|
2. a + b + c = 1000
|
|
|
|
# The code below has been commented due to slow execution affecting Travis.
|
|
# >>> solution()
|
|
# 31875000
|
|
"""
|
|
return [
|
|
a * b * (1000 - a - b)
|
|
for a in range(1, 999)
|
|
for b in range(a, 999)
|
|
if (a * a + b * b == (1000 - a - b) ** 2)
|
|
][0]
|
|
|
|
|
|
if __name__ == "__main__":
|
|
print(solution())
|