Cod sursa(job #3295970)
| Utilizator | Data | 10 mai 2025 12:06:53 | |
|---|---|---|---|
| Problema | Al k-lea termen Fibonacci | Scor | 20 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
using namespace std;
#define MOD 666013;
ifstream fin("kfib.in");
ofstream fout("kfib.out");
int fibonacci_dp(int k) {
if (k == 0) return 0;
if (k == 1) return 1;
int dp_prev2 = 0;
int dp_prev1 = 1;
int current = 0;
for (int i = 2; i <= k; ++i) {
current = (dp_prev1 + dp_prev2) % MOD;
dp_prev2 = dp_prev1;
dp_prev1 = current;
}
return current;
}
int main() {
int k;
fin >> k;
fout << fibonacci_dp(k);
return 0;
}
