Cod sursa(job #395655)
| Utilizator | Data | 13 februarie 2010 16:43:12 | |
|---|---|---|---|
| Problema | Al k-lea termen Fibonacci | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
#define MOD 666013
using namespace std;
ifstream fin("kfib.in");
ofstream fout("kfib.out");
long f[100000000],n;
int Fibo(unsigned long i );
int main()
{
fin >> n;
fout << Fibo(n) % MOD;
fin.close();
fout.close();
return 0;
}
int Fibo(unsigned long i )
{
if ( f[i] != 0 ) return f[i];
if ( i == 0 ) return f[i] = 0;
if ( i == 1 ) return f[i] = 1;
return f[i] = Fibo(i-1)+Fibo(i-2);
}