Cod sursa(job #3221722)

Utilizator raresOObreja Rares raresO Data 7 aprilie 2024 21:23:23
Problema Al k-lea termen Fibonacci Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.58 kb
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("kfib.in");
ofstream g("kfib.out");

#define mod 666013

long long n, mat[3][3], rez[3][3], sol[3], aux[3][3];

void prodmat(long long a[][3], long long b[][3])
{
    for (int i = 0; i < 2; ++i)
    {
        for (int j = 0; j < 2; ++j)
        {
            for (int k = 0; k < 2; ++k)
            {
                aux[i][j] = (aux[i][j] + a[i][k] * b[k][j]) % mod;
            }
        }
    }
    for (int i = 0; i < 2; ++i)
    {
        for (int j = 0; j < 2; ++j)
        {
            a[i][j] = aux[i][j];
            aux[i][j] = 0;
        }
    }
}

void prodsmat(long long a[][3], long long s[3])
{
    for (int i = 0; i < 2; ++i)
    {
        for (int j = 0; j < 2; ++j)
        {
            aux[i][0] = (aux[i][0] + a[i][j] * s[j]) % mod;
        }
    }
    for (int i = 0; i < 2; ++i)
    {
        s[i] = aux[i][0];
        aux[i][0] = 0;
    }
}

int main()
{
    f >> n;
    if (n == 0)
        g << 0;
    else if (n == 1)
        g << 1;
    else
    {

        sol[0] = 1;
        mat[0][0] = mat[0][1] = mat[1][0] = 1;
        long long k = n - 1;
        rez[0][0] = rez[1][1] = 1;
        while (k)
        {
            if (k % 2)
            {
                prodmat(rez, mat);
                --k;
            }
            if (k)
            {
                prodmat(mat, mat);
                k /= 2;
            }
        }
        // g << rez[1][0] << '\n';
        prodsmat(rez, sol);
        g << sol[0];
    }
    return 0;
}