Cod sursa(job #634373)
Utilizator | Data | 16 noiembrie 2011 02:36:54 | |
---|---|---|---|
Problema | Al k-lea termen Fibonacci | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.28 kb |
#include <fstream>
#define NMAX 1000000
#define MOD 666013
using namespace std;
ifstream in("kfib.in");
ofstream out("kfib.out");
int n, F[NMAX],i;
int main()
{
in>>n;
F[1]=F[2]=1;
for(i=3;i<=n;i++)
{
F[i]=F[i-1]+F[i-2] % MOD;
}
out<<F[n];
}