Cod sursa(job #3288868)

Utilizator solicasolica solica solica Data 24 martie 2025 16:46:56
Problema Al k-lea termen Fibonacci Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.78 kb
/*
  ____   ___  _     ___ ____    _
 / ___| / _ \| |   |_ _/ ___|  / \
 \___ \| | | | |    | | |     / _ \
  ___) | |_| | |___ | | |___ / ___ \
 |____/ \___/|_____|___\____/_/   \_\

*/
#include <bits/stdc++.h>

using namespace std;

#define pb push_back
#define int long long int
#define pii pair<int,int>

const int NMAX = 2e5+9;

const int MOD = 666013;

int binpow(int n, int k)
{
    if (k==0)
    {
        return 1;
    }
    int x=binpow(n,k/2)%MOD;
    if (k%2==0)
    {
        return x*x%MOD;
    }
    else
    {
        return x*x%MOD*n%MOD;
    }
}

struct matrix
{
    int n,m,a[3][3];
};

matrix prod (matrix a, matrix b)
{
    matrix c;
    c.n=a.n;
    c.m=b.m;
    for (int i=1; i<=c.n; i++)
    {
        for (int j=1; j<=c.m; j++)
        {
            c.a[i][j]=0;
            for (int k=1; k<=a.m; k++)
            {
                c.a[i][j]+=a.a[i][k]*b.a[k][j];
                c.a[i][j]%=MOD;
            }
        }
    }
    return c;
}

matrix exp_rapida (matrix a, int n)
{
    if (n==1)
    {
        return a;
    }
    matrix aux=exp_rapida (a,n/2);
    if (n%2==0)
    {
        return prod (aux,aux);
    }
    return prod (a,prod (aux,aux));
}

ifstream fin ("kfib.in");
ofstream fout ("kfib.out");

#define cin fin
#define cout fout

void run_case ()
{
    int n;
    cin>>n;
    matrix a;
    a.n=a.m=2;
    a.a[1][1]=0;
    a.a[1][2]=a.a[2][1]=a.a[2][2]=1;
    matrix aexp=exp_rapida (a,n);
    matrix f0;
    f0.n=2,f0.m=1;
    f0.a[1][1]=0,f0.a[2][1]=1;
    matrix fn=prod (aexp,f0);
    cout<<fn.a[1][1];
}

signed main ()
{
    ios_base::sync_with_stdio(0);
    cin.tie(NULL),cout.tie ();
    int teste;
    teste=1;
    while (teste--)
    {
        run_case();
    }
}