Cod sursa(job #1872765)

Utilizator dragomirmanuelDragomir Manuel dragomirmanuel Data 8 februarie 2017 16:21:02
Problema Al k-lea termen Fibonacci Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.98 kb
#include <iostream>
#include <cstring>
#include <cstdio>

#define mod 666013

using namespace std;

int K;

void ProdMat(int a1[2][2], int b1[2][2], int c[2][2])
{
    int a[2][2], b[2][2], c1[2][2];

    for(int i=0; i<2; ++i)
        for(int j=0; j<2; ++j)
        {
            a[i][j]=a1[i][j];
            b[i][j]=b1[i][j];
        }

    for(int i=0; i<2; ++i)
        for(int j=0; j<2; ++j)
        {
            c[i][j]=0;
            for(int k=0; k<2; ++k)
                c[i][j]=(c[i][j]+(long long)(a[i][k])*(b[k][j])%mod)%mod;
        }
}

int resoudre(int k)
{
    int mat[2][2]= {{0,1},{1,1}};
    int rez[2][2]= {{0,1},{1,1}};

    do
    {
        if(k%2==1)
            ProdMat(rez,mat,rez);

        ProdMat(mat,mat,mat);

        k/=2;
    }while(k);

    return rez[0][0];
}

int main()
{
    freopen("kfib.in", "r", stdin);
    freopen("kfib.out", "w", stdout);

    scanf("%d", &K);
    cout<<resoudre(K);
    return 0;
}