Pagini recente » Cod sursa (job #838913) | Cod sursa (job #19018) | Cod sursa (job #2595496) | Cod sursa (job #2719792) | Cod sursa (job #3235031)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("kfib.in");
ofstream fout("kfib.out");
const int mod = 666013;
int rasp[2][2] = {{1, 0}, {0, 1}};
int fibo[2][2] = {{0, 1}, {1, 1}};
int k;
static inline void Prod(int a[2][2], int b[2][2]) {
long long c[2][2] = {{0, 0}, {0, 0}};
for(int i = 0; i <= 1; i++) {
for(int j = 0; j <= 1; j++) {
for(int k = 0; k <= 1; k++) c[i][j] += a[i][k] * b[k][j];
}
}
for(int i = 0; i <= 1; i++) {
for(int j = 0; j <= 1; j++) a[i][j] = c[i][j] % mod;
}
}
static inline void Put(int k) {
while(k) {
if(k & 1) Prod(rasp, fibo);
Prod(fibo, fibo);
k >>= 1;
}
}
int main() {
fin >> k;
Put(k - 1);
fout << rasp[1][1];
return 0;
}