Project Euler #2: Even Fibonacci numbers

  • + 0 comments
    int main(){
        int t;
        cin >> t;
        for(int a0 = 0; a0 < t; a0++){
            long n;
            cin >> n;
            long long x=0,y=1,sum=0;
            long long total=0;
            while(sum<=n){
                if(sum % 2==0){
                    total=total+sum;
                    }
                sum=x+y;
                x=y;
                y=sum;
            }
            cout<<total<<endl;
        }
        return 0;
    }