Problem #39

This one was quite simple to think up the way to find the solution...even though this way is kind of slow (takes it about 20 seconds), it gets the job done. After writing it I thought that maybe doing something like problem 205 would be much quicker, but oh well, I already have this one done now haha.

#include <iostream>
#include <cmath>

using namespace std;

bool isATriangle (int, int, int);

int main()
{
    int total = 0;
    int count = 0;
    int currTotal = 0;
    int totalTotal = 0;

    for (unsigned int p = 1; p <= 1000; p++)
    {
        currTotal = 0;
        for (unsigned int c = 1; c < p; c++)
            for (unsigned int a = 1; a < c; a++)
                if (isATriangle (a, p - c - a, c))
                    currTotal++;

        if (currTotal > totalTotal)
        {
            total = p;
            totalTotal = currTotal;
        }
    }

    cout << total << endl;

    system ("pause");
    return 0;
}

bool isATriangle (int a, int b, int c)
{
    if (static_cast<int> (pow (static_cast<double> (a), 2)) + static_cast<int> (pow (static_cast<double> (b), 2)) == static_cast<int> (pow (static_cast<double> (c), 2)))
        return true;
    return false;
}