Cacher is the code snippet organizer for pro developers

/**
 * 
 * projecteuler002 - even fibonacci numbers
 *
 * 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, ...
 * Find the sum of all the even-valued terms in the sequence
 * which do not exceed four million.
 */

#include <iostream>

int main(int argc, char *argv[])
{
    int fib = 1, prev_fib = 0, tmp_fib = 0;
    int sum = 0;
    while (fib + prev_fib < 4000000) {
        tmp_fib = fib;
        fib += prev_fib;
        prev_fib = tmp_fib;
        if (fib %2 == 0) {
            sum += fib;
        }
        std::cout << fib << " ";
    }
    std::cout << std::endl
              <<"sum of even-valued terms in Fibonacci series = "
              << sum << std::endl;
    return 0;
}