Cod sursa(job #2155784)
Utilizator | Data | 8 martie 2018 09:24:55 | |
---|---|---|---|
Problema | Al k-lea termen Fibonacci | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("kfib.in");
ofstream g("kfib.out");
long k, fin[10000];
int fib(long n)
{
long fib1,fib2;
if (n==1 || n==2){return 1;fin[n]=1;}
else
{
if(fin[n-1]!=0) fib1=fin[n-1];
else fib1=fib(n-1);
if(fin[n-2]!=0) fib2=fin[n-2];
else fib2=fib(n-2);
}
return(fib1+fib2);
}
int main()
{
f>>k;
g<<fib(k);
return 0;
}