Cod sursa(job #1536858)
Utilizator | Data | 26 noiembrie 2015 18:48:49 | |
---|---|---|---|
Problema | Al k-lea termen Fibonacci | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 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;
}