Problem #12

This one took me a bit to re-create. I had to get it to work quickly, I was able to get it to run fairly quickly, it now runs to completion in just under three seconds on my computer.

#include <iostream>
#include <ctime>
#include <cmath>

using namespace std;

int numberOfDivisors (int);

int main() 
{
    clock_t start = clock();
    int total = 1;
    int count = 1;

    while (numberOfDivisors (total) < 500)
        total += ++count;


    cout << total << endl 
         << "Process took " << (static_cast<double> (clock()) - start) / CLOCKS_PER_SEC << " seconds." << endl;
    system("pause");
    return 0;
}

int numberOfDivisors (int num)
{
    int total = 0;

    for (unsigned int i = 1; i <= sqrt (static_cast<double> (num)); i++)
        if (num % i == 0)
            if (i == sqrt (static_cast<double> (num)))
            {
                if (i * i == num)
                    total++;
            }
            else
                total+=2;
    return total;
}