Cod sursa(job #482160)
Utilizator | Data | 2 septembrie 2010 18:07:42 | |
---|---|---|---|
Problema | Al k-lea termen Fibonacci | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include <fstream>
using namespace std;
#define MAXN 1000000
#define mod 666013
ifstream fin("kfib.in");
ofstream fout("kfib.out");
int N, F[MAXN], i;
int main() {
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]<<"\n";
return 0;
}