Cod sursa(job #1855481)
Utilizator | Data | 23 ianuarie 2017 18:16:37 | |
---|---|---|---|
Problema | Al k-lea termen Fibonacci | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <iostream>
#include <fstream>
#define MAX 1000000
#define mod 666013
using namespace std;
ifstream fin("kfib.in");
ofstream fout("kfib.out");
int N,F[MAX];
int Fibo(int N)
{
if(N==1 || N==2) return 1;
if(!F[N])
F[N]=Fibo(N-1)+Fibo(N-2);
return F[N];
}
int main()
{
fin>>N;
fout<<(Fibo(N)%mod);
}