擅长:python、mysql、java
<blockquote>
<p>A Pythagorean triplet is a set of three natural numbers, a < b < c, for > which a2 + b2 = c2.
There exists exactly one Pythagorean triplet for which a + b + c = 1000.</p>
</blockquote>
<p>这会有用的</p>
<pre><code>def pythagorean_tiplet():
a = 1
while(a < 1000):
b = a + 1 # note this, b is starting from a + 1, since b starting from 0 is useless and will only add to the running time.
while (b < 1000):
result = a**2 + b**2
c = math.sqrt(result)
if (( a + b + c) == 1000 and (a < b < c)): #test for conditions
return a * b * c
b += 1
a += 1
print(pythagorean_tiplet())
</code></pre>
<p>这个
算法绝对不适用于周长s>;1000000。
有一种更快的算法可以用来解决这个问题。您可以搜索<code>parametrisation of Pythagorean triplets</code></p>