# Project Euler problem#9 solution in C++

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

`a`

^{2}+

`b`

^{2}=

`c`

^{2}

For example, 3^{2} + 4^{2} = 9 + 16 = 25 = 5^{2}.

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;

int b;

int c;

for (a=1; a<=500; a++)

{

for (b=1; b<=500; b++)

{

c=1000-b-a;

if (a*a+b*b-c*c == 0 && a<b )

{

cout<<a<<” “<<b<<” “<<” “<<c<<” “<<a*b*c<<endl;

}

}

}

return 0;

}

###### Related articles

- Project Euler Problem# 8 solution in C++ (alikhuram.wordpress.com)
- Project Euler Problem# 6 solution in C++ (alikhuram.wordpress.com)
- Project Euler Problem#7 solution in C++ (Brute Force) (alikhuram.wordpress.com)
- Euler’s Method (jfbriere.wordpress.com)

Posted on April 22, 2013, in Programming and tagged C++, Project Euler, Project Euler solution in C++, Pythagorean triplet. Bookmark the permalink. 5 Comments.

was really smart and also clear to see 🙂 thank you

Pingback: Project Euler problem#9 solution in C++ | Khuram Ali

Pingback: Project Euler Problem#10 solution in C++ | Khuram Ali

Pingback: Project Euler Problem#11 solution in C++ | Khuram Ali

Pingback: Project Euler Problem#12 solution in C++ | Khuram Ali