Package net.n1da.dev.euler

Class PE0012

java.lang.Object

net.n1da.dev.euler.core.Problem

net.n1da.dev.euler.PE0012

All Implemented Interfaces:

Solvable

public class PE0012
extends Problem

Solution for problem 12 "Highly divisible triangular number" completed on Thu, 23 Apr 2015, 22:36.

Since:

23.04.2015 22:15:50

Author:

Nico Danneberg

See Also:

Problem @ Project Euler, Solution @ Ni-Da-Net

Field Summary

Fields inherited from class net.n1da.dev.euler.core.Problem

number, title

Constructor Summary

Constructors

Constructor	Description
PE0012()	A simple constructor to set number and title.

Method Summary

Modifier and Type	Method	Description
java.lang.String	solve()	This method runs a loop to find the next element in the triangular series.

Methods inherited from class net.n1da.dev.euler.core.Problem

finish, getResult, getRuntime, prepare, toString

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Constructor Detail

PE0012

public PE0012()

A simple constructor to set number and title.

Method Detail

solve

public java.lang.String solve()

This method runs a loop to find the next element in the triangular series. For every element the dividers are counted using a second, internal loop. If the first number of dividers greater than 500 is found the outer loop is left.

Returns:

the current element of the triangular series with more than 500 divisors

See Also:

Mathe.getCountOfDivisors(long)