Cod sursa(job #500406)

Utilizator vlad_DVlad Dumitriu vlad_D Data 12 noiembrie 2010 05:49:00
Problema Al k-lea termen Fibonacci Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.86 kb
#include <iostream>

using namespace std;
int N;
int mat[3][3], aux[3][3];
int mod = 666013;
inline void mult(int A[][3], int B[][3], int C[][3]) {
	int i, j, k;
	for (i = 0; i < 2; ++i)
		for (j = 0; j < 2; ++j)
			for (k = 0; k < 2; ++k)
				C[i][j] = (C[i][j] + 1LL * A[i][k] * B[k][j]) % mod;
}
inline void power(int P, int M[][3]) {
	int C[3][3], aux2[3][3];
	memcpy(C, mat, sizeof(mat));
	M[0][0] = M[1][1] = 1;
	for (int i = 0; (1 << i) <= P; ++i) {
		if (P & (1 << i)) {
			memset(aux2, 0, sizeof(aux2));
			mult(M, C, aux2);
			memcpy(M, aux2, sizeof(aux2));
		}
		memset(aux2, 0, sizeof(aux2));
		mult(C, C, aux2);
		memcpy(C, aux2, sizeof(aux2));
	}

}
int main() {
	freopen("kfib.in", "r", stdin);
	freopen("kfib.out", "w", stdout);
	scanf("%d", &N);
	mat[0][0] = 0; mat[0][1] = 1;
	mat[1][0] = 1; mat[1][1] = 1;
	power(N-1, aux);
	printf("%d\n", aux[1][1]);
	return 0;
}