projecteuler---->problem=9----Special Pythagorean triplet

title:

A Pythagorean triplet is a set of three natural numbers, a
b
c, for which,

a² + b² =
c²

For example, 3² + 4² = 9 + 16 = 25 = 5².

There exists exactly one Pythagorean triplet for which a + b +
c = 1000.

Find the product abc.

翻译：

勾股数组就是三个自然数a, b, c：

a² +
b² =
c² (a < b < c)

比如，3² + 4² = 9 + 16 = 25 = 5²。

现存在唯一的勾股数组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()