Esempio n. 1
0
long int ComputeDivisors(n) {
    long int factors;
    if (n%2==0) {
        factors=NumDivisors(n/2);
    }
    else {
        factors=NumDivisors(n);
    }
    return factors;
}
Esempio n. 2
0
int main()
{
	int num = 0;
	int i=1;

	while(NumDivisors(num) < 500)
	{
		num += i;
		i++;
	}

	std::cout<< "The first triangle number with over 500 factors is: " << num;
	return 0;
}