Cod sursa(job #2283390)

Utilizator danielsociuSociu Daniel danielsociu Data 15 noiembrie 2018 14:53:43
Problema Al k-lea termen Fibonacci Scor 60
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.94 kb
#include <fstream>
std::ifstream cin("kfib.in");
std::ofstream cout("kfib.out");
#define ll long long
#define MOD 666013
ll sol[3][3],nr[3][3],k;

void inmultire(ll a[][3],ll b[][3]){
    ll aux1[3][3],aux2[3][3];
    for(int i=0;i<2;i++)
        for(int j=0;j<2;j++)
            aux1[i][j]=a[i][j];
    for(int i=0;i<2;i++)
        for(int j=0;j<2;j++)
            aux2[i][j]=b[i][j];
    for(int i=0;i<2;i++)
        for(int j=0;j<2;j++)
            a[i][j]=0;
    for(int i=0;i<2;i++)
        for(int j=0;j<2;j++)
            for(int k=0;k<2;k++)
                a[i][j]+=((1LL*aux1[i][k]*aux2[k][j])%MOD);
}

void ridput(ll sol[3][3],ll k){
    sol[0][0]=sol[1][1]=1;
    nr[0][1]=nr[1][0]=nr[1][1]=1;
    for(int i=0;(1<<i)<=k;i++){
        if((1<<i)&k)
            inmultire(sol,nr);
        inmultire(nr,nr);
    }
}

int main()
{
    if(k==1){cout<<0;return 0;}
    cin>>k;
    ridput(sol,k-1);
    cout<<sol[1][1];
}