Cod sursa(job #3358406)

Utilizator edward-alexandru.iacob-daeneanuEdward Alexandru Iacob Daeneanu edward-alexandru.iacob-daeneanu Data 16 iunie 2026 17:10:43
Problema Al k-lea termen Fibonacci Scor 100
Compilator c-64 Status done
Runda Arhiva educationala Marime 0.89 kb
#include <stdio.h>
#include <string.h>

int Z[2][2], N, SOL[2][2];

void mult(int A[][2], int B[][2], int C[][2]) {
	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]) % 666013;
			
}

void lg_power(int P, int M[][2]) {
	int C[2][2], AUX[2][2], i;
	memcpy(C, Z, sizeof(Z));
	M[0][0] = 1;
    M[1][1] = 1;

	for (i = 0; (1 << i) <= P; i++) {
		if (P & (1 << i)) {
			memset(AUX, 0, sizeof(AUX));
			mult(M, C, AUX);
			memcpy(M, AUX, sizeof(AUX));
		}
		memset(AUX, 0, sizeof(AUX));
		mult(C, C, AUX);
		memcpy(C, AUX, sizeof(C));
	}
}

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