Package net.n1da.dev.euler

Class PE0010

java.lang.Object

net.n1da.dev.euler.core.Problem

net.n1da.dev.euler.PE0010

All Implemented Interfaces:

Solvable

public class PE0010
extends Problem

Solution for problem 10 "Summation of primes" completed on Fri, 10 Apr 2015, 14:57.

Since:

10.04.2015 19:55:07

Author:

Nico Danneberg

See Also:

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

Field Summary

Fields

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

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

number, title

Constructor Summary

Constructors

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

Method Summary

Modifier and Type	Method	Description
void	prepare()	Initializes the sieve with number from 0 to max.
java.lang.String	solve()	Runs the algorithm of the "Sieve of Eratosthenes" and sums up 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.

sum

private long sum

The sum of found primes.

sieve

private Sieve sieve

The storage for the "Sieve of Eratosthenes".

See Also:

Sieve

Constructor Detail

PE0010

public PE0010()

A simple constructor to set number and title.

Method Detail

prepare

public void prepare()

Initializes the sieve with number from 0 to 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 sums up every found prime factor.

Returns:

the sum of all primes below max

See Also:

Sieve.next(), Sieve of Eratosthenes @ Wikipedia