Cod sursa(job #1037911)
Utilizator | Data | 20 noiembrie 2013 20:59:57 | |
---|---|---|---|
Problema | Al k-lea termen Fibonacci | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
#define MOD 666013
#define MAXN 1000000
using namespace std;
ifstream cin ("kfib.in");
ofstream cout ("kfib.out");
int N, F[MAXN];
int main ()
{
cin >> N ;
F[1] = F[2] = 1 ;
for( int i = 3; i <= N; ++ i)
F[i] = F[ i - 1 ] + F[ i - 2 ] % MOD ;
cout << F[N];
cin.close();
cout.close();
return 0;
}