Cod sursa(job #2128990)

Utilizator cezinatorCezar D cezinator Data 12 februarie 2018 13:05:13
Problema Al k-lea termen Fibonacci Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.16 kb
#include <fstream>

using namespace std;
typedef unsigned long long mat[2][2];
const int mod=666013;
ifstream fin("kfib.in");
ofstream fout("kfib.out");
unsigned long long n;
mat a,b;
void inmultire(mat a, mat b, mat c)
{
    c[0][0]=(a[0][0]*b[0][0]%mod + a[0][1]*b[1][0]%mod)%mod;
    c[0][1]=(a[0][0]*b[0][1]%mod + a[0][1]*b[1][1]%mod)%mod;
    c[1][0]=(a[1][0]*b[0][0]%mod + a[1][1]*b[1][0]%mod)%mod;
    c[1][1]=(a[1][0]*b[0][1]%mod + a[1][1]*b[1][1]%mod)%mod;
}
void a_la_n(mat a, mat b, unsigned long long n)
{
    if(n==0)
    {
        b[0][0]=b[1][1]=1;
        b[0][1]=b[1][0]=0;
    }
    else if(n==1)
    {
        b[0][0]=a[0][0];
        b[1][1]=a[1][1];
        b[0][1]=a[0][1];
        b[1][0]=a[1][0];
    }
    else
    {
        mat c;
        a_la_n(a,c,n/2);
        if(n%2==0)
        {
            inmultire(c,c,b);
        }
        else
        {
            inmultire(c,c,b);
            inmultire(b,a,b);
        }
    }
}
int main()
{
    a[0][0]=0;
    a[1][1]=a[1][0]=a[0][1]=1;
    fin>>n;
    for(int i=1;i<=n;i++)
    {
        a_la_n(a,b,i-1);
        fout<<b[1][1]<<'\n';
    }
    return 0;
}