Cod sursa(job #1127683)
Utilizator | Data | 27 februarie 2014 13:23:56 | |
---|---|---|---|
Problema | Al k-lea termen Fibonacci | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <fstream>
using namespace std;
int N, F[1000001], i,mod;
int main() {
ifstream fin("kfib.in");
ofstream fout("kfib.out");
mod=666013;
fin>>N;
F[1] = F[2] = 1;
for (i = 3; i <= N; i++)
F[i] = (F[i - 1] + F[i - 2]) % mod;
fout<<F[N];
fin.close();
fout.close();
return 0;
}