Package net.n1da.dev.euler

Class PE0007

java.lang.Object

net.n1da.dev.euler.core.Problem

net.n1da.dev.euler.PE0007

All Implemented Interfaces:

Solvable

public class PE0007
extends Problem

Solution for problem 7 "10001st prime" completed on Thu, 9 Apr 2015, 23:34.

Since:

09.04.2015 23:25:27

Author:

Nico Danneberg

See Also:

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

Field Summary

Fields

Modifier and Type	Field	Description
private int	cnt	The count of found primes.
private int	max	The maximum number to search to.
private Sieve	sieve	The storage for the "Sieve of Eratosthenes".

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

number, title

Constructor Summary

Constructors

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

Method Summary

Modifier and Type	Method	Description
void	prepare()	Initializes the sieve with the maximum of max
java.lang.String	solve()	Runs the algorithm of the "Sieve of Eratosthenes" and count every found prime factor.

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

finish, getResult, getRuntime, toString

Methods inherited from class java.lang.Object

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

Field Detail

max

private int max

The maximum number to search to.

cnt

private int cnt

The count of found primes.

sieve

private Sieve sieve

The storage for the "Sieve of Eratosthenes".

See Also:

Sieve

Constructor Detail

PE0007

public PE0007()

A simple constructor to set number and title.

Method Detail

prepare

public void prepare()

Initializes the sieve with the maximum of max

Specified by:

prepare in interface Solvable

Overrides:

prepare in class Problem

See Also:

Sieve(int)

solve

public java.lang.String solve()

Runs the algorithm of the "Sieve of Eratosthenes" and count every found prime factor. If the 10001. is found, it is returned.

Returns:

the 100001. prime factor

See Also:

Sieve.next(), Sieve of Eratosthenes @ Wikipedia