informaticaaa.MyForum.ro

cosmin · Administrator Data inscrierii: 30/Apr/2010 Mesaje: 12

#include<iostream>
using namespace std;
int main()
{
int f[100],n;
cout<<"n=";cin>>n;
f[0]=0;
f[1]=f[2]=1;
for(int i=2;i<=n;i++)
f[i]=f[i-1]+f[i-2];
cout<<f[n];
return 0;
}

#include<iostream>
using namespace std;
int fibonacci(int n)
{
int u=0;
int v=1;
int i,t;
if(n==0 || n==1)
return n;
for(i=2;i<=n;i++)
{
t=u+v;
u=v;
v=t;
}
return v;
}
int main()
{
int n,i;
cout<<"n=";cin>>n;
cout<<fibonacci(n);
}

#include<iostream>
using namespace std;
int fibonaci(int n)
{
if(n==0) return 0;
if(n==2) return 1;
if(n==1) return 1;
return fibonaci(n-1)+fibonaci(n-2);
}
int main()
{
int n;
cout<<"n=";cin>>n;
cout<<fibonaci(n);
return 0;
}

tabernaculum · Trimis: 13/07/2012 12:49 Titlul subiectului:

Thank for really interesting information.

tabernaculum · Trimis: 15/07/2012 09:03 Titlul subiectului:

It's much esiear to understand when you put it that way!

tabernaculum · Trimis: 16/07/2012 21:49 Titlul subiectului:

This is awesome!