Euler #2

Yosh, tantangan Euler #2 (https://projecteuler.net/archives), belum mahir dengan for nih -,- jadi lama 😀

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.

#Maksud soalnya jumlah dari deret bilangan fibonaci yang genapnya aja misalkan deretnya 1, 2, 3, 5, 8, 13, 21, 34, berarti jumlah yang genapnya 2+8+34 = 44, mungkin itu maksud soalnya kali ya :p


#include <iostream>
using namespace std;
int main ()
{
int first=1, second=1, next,b,sum=0;
cout<<"Masukan Sebuah Bilangan : " ; cin>>b ;
for (int a=0;a<b;a++)
{
if (first%2==0){
sum += first;}
cout<<"\n"<<first;
next = first + second;
first = second;
second = next;
}

cout<<"\n"<<sum;

system ("pause");
return 0;
}
Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s