/**
 * @see <a href="https://projecteuler.net/problem=2">Even Fibonacci numbers</a>
 * Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be:
 * 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...
 * By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even-valued terms.
 */

public final class P0001 {

    public static void main(final String[] args) {
        //TBD
    }
}
@@ -425,17 +425,17 @@
 ass P000
-1
+2
  %7B%0A%0A    
@@ -493,13 +493,524 @@
     
-//TBD
+long previousNumber = 0;%0A        long currentNumber = 1;%0A        long fibonacciNumber = 0;%0A        long sumOfEvenFibonacci = 0;%0A        for(; fibonacciNumber %3C 4000000; ) %7B%0A            fibonacciNumber = currentNumber + previousNumber;%0A            previousNumber = currentNumber;%0A            currentNumber = fibonacciNumber;%0A            if(fibonacciNumber %25 2 == 0) %7B%0A                sumOfEvenFibonacci += fibonacciNumber;%0A            %7D%0A        %7D%0A        System.out.println(%22Answer for P0002: %22 + sumOfEvenFibonacci);
 %0A   

Add solution for P0002 in Java.