Cod sursa(job #1363567)

Utilizator mirceadinoMircea Popoveniuc mirceadino Data 27 februarie 2015 01:53:02
Problema Al k-lea termen Fibonacci Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.76 kb
#include<cstdio>
#include<string>
#include<cstring>

using namespace std;

#ifdef HOME
const string inputFile = "input.txt";
const string outputFile = "output.txt";
#else
const string problemName = "kfib";
const string inputFile = problemName + ".in";
const string outputFile = problemName + ".out";
#endif

const int MOD = 666013;

int N;
int B[2][2];
int M[2][2];
int F[1][2];
int P[1][2];

void expLog(int M[][2], int N) {
    if(N == 0) {
        M[0][0] = M[1][1] = 1;
        M[1][0] = M[0][1] = 0;
        return;
    }

    if(N == 1) {
        M[0][0] = B[0][0], M[0][1] = B[0][1];
        M[1][0] = B[1][0], M[1][1] = B[1][1];
        return;
    }

    int T[2][2], Q[2][2];
    int i, j, k;

    expLog(T, N / 2);
    expLog(Q, N % 2);

    M[0][0] = M[1][1] = 0;
    M[1][0] = M[0][1] = 0;

    for(i = 0; i < 2; i++)
        for(j = 0; j < 2; j++)
            for(k = 0; k < 2; k++)
                M[i][j] = (M[i][j] + T[i][k] * 1LL * T[k][j]) % MOD;

    T[0][0] = M[0][0], T[0][1] = M[0][1];
    T[1][0] = M[1][0], T[1][1] = M[1][1];

    M[0][0] = M[1][1] = 0;
    M[1][0] = M[0][1] = 0;

    for(i = 0; i < 2; i++)
        for(j = 0; j < 2; j++)
            for(k = 0; k < 2; k++)
                M[i][j] = (M[i][j] + T[i][k] * Q[k][j]) % MOD;
}

int main() {
    int i, j, k;

    freopen(inputFile.c_str(), "r", stdin);
    freopen(outputFile.c_str(), "w", stdout);

    scanf("%d", &N);

    B[0][1] = B[1][0] = B[1][1] = 1;

    F[0][0] = 0;
    F[0][1] = 1;

    if(N <= 1)
        printf("%d\n", F[N]);
    else {
        expLog(M, N - 1);

        for(i = 0; i < 1; i++)
            for(j = 0; j < 2; j++)
                for(k = 0; k < 2; k++)
                    P[i][j] = (P[i][j] + F[i][k] * 1LL * M[k][j]) % MOD;

        printf("%d\n", P[0][1]);
    }

    return 0;
}