2問目。足りない。。

未だできてないけど。

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>
#include <time.h>

using namespace std;

int main()
{
	int l=0;
	int r=1;
	unsigned long int m=0;

	int ans =0;
	
	for(int i=1;i<=4000000;i++){
		m=l+r;
		//cout<<m<<endl;
		if(m%2==0)ans=ans+m;
		l=r;
		r=m;

		
	}
	 cout<<ans<<endl;

}