Cod sursa(job #2069575)
| Utilizator | Data | 18 noiembrie 2017 16:25:00 | |
|---|---|---|---|
| Problema | Al k-lea termen Fibonacci | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
std :: ifstream cin("kfib.in");
std :: ofstream cout("kfib.out");
#define NMAX 10000000
#define Modulo 666013;
long n, result[NMAX];
void fib(long n){
result[0] = 0;
result[1] = 1;
result[2] = 2;
for(long i = 3; i < n; i++){
result[i] = result[i - 1] + result[i - 2];
}
cout << result[n - 1] % Modulo;
}
int main(){
cin >> n;
fib(n);
return 0;
}