Project Euler #2: Even Fibonacci numbers

  • + 0 comments
    public class Solution {
    
            public static void main(String[] args) {
                    Scanner in = new Scanner(System.in);
                    int t = in.nextInt();
    
                    for(int a0 = 0; a0 < t; a0++){
                            long n = in.nextLong();
                            long sum = 0;
                            long x1=1, x2=2;
    
                            while(x2 <= n){
                                    if(x2 % 2 == 0){
                                            sum += x2;
                                    }
    
                                    long next = x1 + x2;
                                    x1 = x2;
                                    x2 = next;   
                            }
                            System.out.println(sum);
                    }
            }
    }