Problem :
A Pythagorean triplet is a set of three natural numbers, a < b <c, for which,
There exists exactly one Pythagorean triplet for which a + b + c = 1000.
Find the product abc.
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.
Solution :
#include<iostream> using namespace std; int main() { int a,b,c; for(a=1;a<1000;a++) for(b=a+1;b<1000;b++) for(c=b+1;c<1000;c++) { if((a+b+c)==1000) { if((a*a+b*b)==c*c) { cout<<"Answer :"<<(a*b*c); return 0; } } }
No comments:
Post a Comment