Project Euler 9 Special Pythagorean triplet
2013-10-08 13:30
246 查看
Project Euler 9 Special Pythagorean triplet
''' 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. ''' from math import * a=0 while a<1000: b=0 while b<1000 : c=1000-a-b if a<b and b<c and a*a+b*b==c*c: print a*b*c b+=1 a+=1
相关文章推荐
- project euler 9 Special Pythagorean triplet
- 9 Special Pythagorean triplet - Project Euler
- 【Project Euler】【Problem 9】Special Pythagorean triplet
- Project Euler: Problem 9 Special Pythagorean triplet
- 欧拉项目第九题 Special Pythagorean triplet
- Project Euler Problem 9: Special Pythagorean triplet
- PE 009 Special Pythagorean triplet
- Problem 9:Special Pythagorean triplet
- projectEuler008 SpecialPythagoreanTriplet
- (Problem 9)Special Pythagorean triplet
- (Problem 9)Special Pythagorean triplet
- Special Pythagorean triplet
- 欧拉计划(9)Special Pythagorean triplet
- Problem 9 Special Pythagorean triplet (毕达哥拉斯三元数组...)
- Problem 9:Special Pythagorean triplet
- (Problem 9)Special Pythagorean triplet
- projecteuler---->problem=9----Special Pythagorean triplet
- projecteuler---->problem=9----Special Pythagorean triplet
- Project Euler 103:Special subset sums: optimum 特殊的子集和:最优解
- Project Euler 106:Special subset sums: meta-testing 特殊的子集和:元检验