Quantcast
Channel: flounderCode()
Viewing all articles
Browse latest Browse all 10

Project Euler #2

$
0
0

 

Check the link here for more info on Project Euler

PROBLEM: 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.

//BTG 2.10.14

public class euler{
    public static void main(String[] args){
    
   int prev, next, sum;
   prev = 1;
   next = 2;
   int answer = 0;
   
   
   //fibonacci logic
   for (int i = 0; next < 4000000; i++ ){
           sum = prev + next;
           prev = next;
           next = sum;
               //even # logic
               if(prev % 2 == 0){
                   answer += prev;
               }
       }
       System.out.println(answer);
    }
}


Viewing all articles
Browse latest Browse all 10

Trending Articles