Cod sursa(job #372673)
Utilizator | Data | 11 decembrie 2009 10:57:45 | |
---|---|---|---|
Problema | Al k-lea termen Fibonacci | Scor | Ascuns |
Compilator | cpp | Status | done |
Runda | Marime | 0.31 kb |
#include <cstdio>
#define MAXN 1000000
#define mod 666013
using namespace std;
int N, F[MAXN], i;
int main() {
freopen("kfib.in", "r", stdin);
freopen("kfib.out", "w", stdout);
scanf("%d", &N);
F[1] = F[2] = 1;
for (i = 3; i <= N; i++)
F[i] = (F[i - 1] + F[i - 2]) % mod;
printf("%d\n", F[N]);
return 0;
}