Problem 12

Problem

The sequence of triangle numbers is generated by adding the natural numbers. So the 7^th triangle number would be 1 + 2 + 3 + 4 + 5 + 6 + 7 = 28. The first ten terms would be:

1, 3, 6, 10, 15, 21, 28, 36, 45, 55, ...

Let us list the factors of the first seven triangle numbers:

 1: 1
 3: 1,3
 6: 1,2,3,6
10: 1,2,5,10
15: 1,3,5,15
21: 1,3,7,21
28: 1,2,4,7,14,28

We can see that 28 is the first triangle number to have over five divisors.

What is the value of the first triangle number to have over five hundred divisors?

Code

#include <iostream>
#include <math.h>
using namespace std;

static int pos = 0;
static int triangleNumber = 0;
void getTriangleNumber()
{
    pos++;
    triangleNumber += pos;
}

int countDivisor(int num)
{
    int count = 0;
    int max = sqrt(num);
    for (int i = 1; i <= max; i++)
    {
        if (num%i == 0)
        {
            //cout << "num:" << num << ",i:" << i << endl;
            count+=2;
        }
    }
    return count;
}

int main()
{
    for (int i = 0; i != 1000000; i++)
    {
        getTriangleNumber();
        int count = countDivisor(triangleNumber);
        //cout << i+1 << ":" << triangleNumber << "\tcount:" << count << endl;
        if (count > 500)
        {
            cout << triangleNumber << " " << i << endl;
            break;
        }
    }
    /*for (int i=7; i <= 1000000; i++)
    {
        int v = triangleNumber(i);
        int count = countDivisor(v);
        cout << "count:" << count << ",v=" << v << endl;
        if (count > 500)
        {
            cout << v << " " << i << endl;
            break;
        }
    }*/
}