Cod sursa(job #3346492)
| Utilizator | Data | 13 martie 2026 22:40:16 | |
|---|---|---|---|
| Problema | Al k-lea termen Fibonacci | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
#define MOD 666013
using namespace std;
int main(void)
{
std::ios::sync_with_stdio(false);
int k;
cin >> k;
int a = 0, b = 1, c;
if (k < 1) {
cout << k;
return 0;
}
k -= 1;
while (k > 0) {
c = b;
b = ((1LL * a % MOD) + (1LL * b % MOD)) % MOD;
a = c;
k--;
}
cout << b << "\n";
return 0;
}