All pastes #1625613 Raw Edit

Eulero 2

public text v1 · immutable
#1625613 ·published 2009-10-17 19:09 UTC
rendered paste body
/*
Esercizio n° 02;
Funzionamento:
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.


*/
using System;
class NomeProgramma
{
	static void Main()
	{
		int limite = 4000000;
		int sommadispari = 1;
		int somma = 0;
		int x = 1;
		int y = 2;
		int appo;
		while (y < limite)
		{ 
			if (y < limite)
			{
				somma += x + y;
				if (somma % 2 == 0)
				{
					sommadispari += somma;
				}
				appo = y;
				y = somma;
				x = appo;
			}
		}
		Console.Write("Somma = {0}", sommadispari);
		
	}
}