Cod sursa(job #1586667)
Utilizator | Data | 1 februarie 2016 16:16:14 | |
---|---|---|---|
Problema | Al k-lea termen Fibonacci | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include <fstream>
#define MAXN 1000000
#define mod 666013
using namespace std;
ifstream f("kfib.in");
ofstream g("kfib.out");
int N, F[MAXN], i;
int main() {
f>>n;
F[1] = F[2] = 1;
for (i = 3; i <= N; i++)
F[i] = (F[i - 1] + F[i - 2]) % mod;
g<<F[n];
g.close(); return 0;
}