本文介绍了一种寻找特定勾股数组的方法，即三个自然数a、b、c满足a² + b² = c²，且a + b + c = 1000，通过编程手段实现了勾股数组的查找，并给出了其乘积。
title:
A Pythagorean triplet is a set of three natural numbers, a 
b c, for which,
a
2 +
b
2 =
c
2
For example, 32 + 42 = 9 + 16 = 25 = 52.
There exists exactly one Pythagorean triplet for which a + b + c = 1000.
Find the product abc.
勾股数组就是三个自然数a, b, c：
a
2 +
b
2 =
c
2
(a < b < c)
比如，32 + 42 = 9 + 16 = 25 = 52。
现存在唯一的勾股数组a, b, c，且a + b + c = 1000。请求出这三个数的乘积。
def resu():
for i in range(1,1000):
for j in range(1,1000):
k=1000-i-j
if i*i+j*j==k*k:
print i*j*k
return
resu()
扫一扫
86
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
