Python/project_euler/problem_009/sol3.py at master · PreciousJac0b/Python · GitHub

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
"""
Project Euler Problem 9: https://projecteuler.net/problem=9

Special Pythagorean triplet

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 a*b*c.

References:
 - https://en.wikipedia.org/wiki/Pythagorean_triple
"""


defsolution() ->int:
"""
 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

 >>> solution()
 31875000
 """

returnnext(
iter(
 [
a*b* (1000-a-b)
forainrange(1, 999)
forbinrange(a, 999)
if (a*a+b*b== (1000-a-b) **2)
 ]
 )
 )


if__name__=="__main__":
print(f"{solution() =}")
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
"""
Project Euler Problem 9: https://projecteuler.net/problem=9

Special Pythagorean triplet

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 a*b*c.

References:
 - https://en.wikipedia.org/wiki/Pythagorean_triple
"""


defsolution() ->int:
"""
 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

 >>> solution()
 31875000
 """

returnnext(
iter(
 [
a*b* (1000-a-b)
forainrange(1, 999)
forbinrange(a, 999)
if (a*a+b*b== (1000-a-b) **2)
 ]
 )
 )


if__name__=="__main__":
print(f"{solution() =}")
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
"""
Project Euler Problem 9: https://projecteuler.net/problem=9

Special Pythagorean triplet

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 a*b*c.

References:
 - https://en.wikipedia.org/wiki/Pythagorean_triple
"""


defsolution() ->int:
"""
 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

 >>> solution()
 31875000
 """

returnnext(
iter(
 [
a*b* (1000-a-b)
forainrange(1, 999)
forbinrange(a, 999)
if (a*a+b*b== (1000-a-b) **2)
 ]
 )
 )


if__name__=="__main__":
print(f"{solution() =}")
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
"""
Project Euler Problem 9: https://projecteuler.net/problem=9

Special Pythagorean triplet

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 a*b*c.

References:
 - https://en.wikipedia.org/wiki/Pythagorean_triple
"""


defsolution() ->int:
"""
 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

 >>> solution()
 31875000
 """

returnnext(
iter(
 [
a*b* (1000-a-b)
forainrange(1, 999)
forbinrange(a, 999)
if (a*a+b*b== (1000-a-b) **2)
 ]
 )
 )


if__name__=="__main__":
print(f"{solution() =}")
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
"""
Project Euler Problem 9: https://projecteuler.net/problem=9

Special Pythagorean triplet

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 a*b*c.

References:
 - https://en.wikipedia.org/wiki/Pythagorean_triple
"""


defsolution() ->int:
"""
 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

 >>> solution()
 31875000
 """

returnnext(
iter(
 [
a*b* (1000-a-b)
forainrange(1, 999)
forbinrange(a, 999)
if (a*a+b*b== (1000-a-b) **2)
 ]
 )
 )


if__name__=="__main__":
print(f"{solution() =}")
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
"""
Project Euler Problem 9: https://projecteuler.net/problem=9

Special Pythagorean triplet

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 a*b*c.

References:
 - https://en.wikipedia.org/wiki/Pythagorean_triple
"""


defsolution() ->int:
"""
 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

 >>> solution()
 31875000
 """

returnnext(
iter(
 [
a*b* (1000-a-b)
forainrange(1, 999)
forbinrange(a, 999)
if (a*a+b*b== (1000-a-b) **2)
 ]
 )
 )


if__name__=="__main__":
print(f"{solution() =}")
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
"""
Project Euler Problem 9: https://projecteuler.net/problem=9

Special Pythagorean triplet

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 a*b*c.

References:
 - https://en.wikipedia.org/wiki/Pythagorean_triple
"""


defsolution() ->int:
"""
 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

 >>> solution()
 31875000
 """

returnnext(
iter(
 [
a*b* (1000-a-b)
forainrange(1, 999)
forbinrange(a, 999)
if (a*a+b*b== (1000-a-b) **2)
 ]
 )
 )


if__name__=="__main__":
print(f"{solution() =}")
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
"""
Project Euler Problem 9: https://projecteuler.net/problem=9

Special Pythagorean triplet

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 a*b*c.

References:
 - https://en.wikipedia.org/wiki/Pythagorean_triple
"""


defsolution() ->int:
"""
 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

 >>> solution()
 31875000
 """

returnnext(
iter(
 [
a*b* (1000-a-b)
forainrange(1, 999)
forbinrange(a, 999)
if (a*a+b*b== (1000-a-b) **2)
 ]
 )
 )


if__name__=="__main__":
print(f"{solution() =}")