Second solution of Project Euler

Link of second problem

#include "stdafx.h"
#include <iostream>
using namespace std;          

void findout() {                  //efekanpulatli.blogspot.com        second problem's solution
 int tot=2,dizi[10000];
 dizi[0] = 1;
 dizi[1] = 2;
 for(int i=2;dizi[i-1]<4000000;i++) {

  dizi[i] = dizi[i-1] +  dizi[i-2];
  if(dizi[i] % 2 == 0) {
  tot+=dizi[i];
  cout << "fibonacci row :" << dizi[i] << "----------" << "tot after plus :" << tot << "----------" << endl;
  }

 }

 cout << "Result :" <<  tot << " efekanpulatli.blogspot.com"<< endl;
}
int main()
{
 findout();
system("pause");
return 0;
}