Project Euler - Problem 2

gistfile1.c

/*
 * 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, ...
 * By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even-valued terms.
*/

#include <stdio.h>

int previousSteps[] = {1,2};
int total = 2;

int main(void){
	
	int nextInSequence = 0;
	
	while(nextInSequence < 4000000){
		nextInSequence = previousSteps[0] + previousSteps[1];

		if(nextInSequence%2==0)total+=nextInSequence;
		
		previousSteps[0] = previousSteps[1];
		previousSteps[1] = nextInSequence;
	}
	
	printf("\nTOTAL: %i\n", total);
	
  return 0;
}