projecteuler---->problem=9----Special Pythagorean triplet
title:
A Pythagorean triplet is a set of three natural numbers, a b c, for which,
a2 + b2 =
c2
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:
a2 +
b2 =
c2 (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()