@@ -0,0 +1,801 @@
+/**%0A * Each new term in the Fibonacci sequence is generated by adding the previous two terms.%0A * By starting with 1 and 2, the first 10 terms will be:1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...%0A * %3Cp%3E%0A * By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the%0A * even-valued terms.%0A *%0A * @author David Clutter%0A */%0Apublic class Problem0002 %7B%0A%0A    public static void main(final String%5B%5D args) %7B%0A        int previous = 1;%0A        int current = 2;%0A        long sum = current;%0A        while(current %3C= 4_000_000) %7B%0A            final int temp = previous + current;%0A            previous = current;%0A            current = temp;%0A            if(current %25 2 == 0) %7B%0A                sum += current;%0A            %7D%0A        %7D%0A        System.out.println(sum);%0A    %7D%0A%7D

Add problem0002