(Problem 9)Special Pythagorean triplet
2013-07-24 15:55
267 查看
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.
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.
#include<stdio.h> #include<math.h> #include<string.h> #include<ctype.h> #include<stdlib.h> #include<stdbool.h> void show() { int a,b,c; for(a=1; a<333; a++) { for(c=333; c<500; c++) { b=1000-a-c; if(a*a+b*b==c*c) { printf("%d\n",a*b*c); return; } } } } int main() { show(); return 0; }
Answer: | 31875000 |
相关文章推荐
- Project Euler Problem 9: Special Pythagorean triplet
- (Problem 9)Special Pythagorean triplet
- 【Project Euler】【Problem 9】Special Pythagorean triplet
- (Problem 9)Special Pythagorean triplet
- Problem 9:Special Pythagorean triplet
- Problem 9 Special Pythagorean triplet (毕达哥拉斯三元数组...)
- Project Euler: Problem 9 Special Pythagorean triplet
- Problem 9:Special Pythagorean triplet
- Project Euler 9 Special Pythagorean triplet
- 9 Special Pythagorean triplet - Project Euler
- project euler 9 Special Pythagorean triplet
- projecteuler---->problem=9----Special Pythagorean triplet
- 欧拉计划(9)Special Pythagorean triplet
- PE 009 Special Pythagorean triplet
- projectEuler008 SpecialPythagoreanTriplet
- 欧拉项目第九题 Special Pythagorean triplet
- projecteuler---->problem=9----Special Pythagorean triplet
- Special Pythagorean triplet
- One special sort problem
- MOD Problem Time Limit: 1000 MS Memory Limit: 65536 K Total Submit: 191(64 users) Total Accepted: 69(53 users) Special Judge: No Description Give yo