I\'m having some trouble with this problem in Project Euler.
Here\'s what the question asks:
Each new term in the Fibonacci sequence is generated by adding t
int sum = 2; for(int f1 = 1, f2 = 2, f3 = 0; !((f3 = (f1 + f2)) > 4000000); f1 = f2, f2 = f3) sum += f3 * (~f3 & 1);