Cod sursa(job #1829210)

Utilizator NarniussAnghelache Bogdan Narniuss Data 14 decembrie 2016 16:23:29
Problema Al k-lea termen Fibonacci Scor 60
Compilator cpp Status done
Runda Arhiva educationala Marime 1.17 kb
#include <iostream>
#include <fstream>
#include <cstring>
#define mod 666013
using namespace std;

ifstream f("kfib.in");
ofstream g("kfib.out");

int Z[3][3], C[3][3], AUX[3][3], A[3][3];

inline void multiply(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] += 1LL * A[i][k] * B[k][j] % mod;
        }
    }
}

inline void power(int k, int M[][3])
{
    int i;

    for(i = 0 ; (1 << i) <= k ; i++)
    {
        if((1 << i) & k)
        {
            memset(AUX, 0, sizeof(AUX));
            multiply(C, M, AUX);            /** C = M * **/
            memcpy(C, AUX, sizeof(AUX));
        }
        memset(AUX, 0, sizeof(AUX));
        multiply(M, M, AUX);
        memcpy(M, AUX, sizeof(AUX));

        

    }
}
int main()
{
    int n;
    Z[0][0] = 0;
    Z[0][1] = 1;
    Z[1][0] = 1 ;
    Z[1][1] = 1;
    C[0][0] = 1;
    C[1][1] = 1;
    f>>n;
    if(n==0) g<<"0";
    else if(n==1 || n==2) g<<"1";
    else
    {
        power(n-1, Z);
        g<<C[1][1];
    }

    return 0;
}