Project Euler #2: Even Fibonacci numbers

  • + 0 comments

    import java.util.Scanner;

    public class Solution {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int t = in.nextInt();
    
        while (t-- > 0) {
            long n = in.nextLong();
            long a = 1, b = 2, sum = 0;
    
    
            while (b <= n) {
                if (b % 2 == 0) {
                    sum += b;
                }
    
    
                long temp = a + b;
                a = b;
                b = temp;
            }
    
    
            System.out.println(sum);
        }
    
        in.close();
    } 
    

    }