Cod sursa(job #1712545)

Utilizator SirbuSirbu Ioan Sirbu Data 3 iunie 2016 01:37:09
Problema Al k-lea termen Fibonacci Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.95 kb
#include <fstream>
#define mod 666013
using namespace std;
ifstream fin("kfib.in");
ofstream fout("kfib.out");
int y[2][2]={1,0,0,1};
int z[2][2]={0,1,1,1};
int sol[2][2];
int main()
{

    int n;
    fin >> n;
    n--;
    while (n>1)
    {
      if (n%2==0)
      {
        sol[0][0]=(1LL*z[0][0]*z[0][0]%mod +1LL*z[0][1]*z[1][0]%mod)%mod;
        sol[0][1]=(1LL*z[0][0]*z[0][1]%mod +1LL*z[0][1]*z[1][1]%mod)%mod;
        sol[1][0]=(1LL*z[1][0]*z[0][0]%mod +1LL*z[1][1]*z[1][0]%mod)%mod;
        sol[1][1]=(1LL*z[1][0]*z[0][1]%mod +1LL*z[1][1]*z[1][1]%mod)%mod;
        for (int i=0;i<2;i++)
          for (int j=0;j<2;j++)
            z[i][j]=sol[i][j];
        n=n/2;
      }
      else
      {
        sol[0][0]=(1LL*z[0][0]*y[0][0]%mod +1LL*z[0][1]*y[1][0]%mod)%mod;
        sol[0][1]=(1LL*z[0][0]*y[0][1]%mod +1LL*z[0][1]*y[1][1]%mod)%mod;
        sol[1][0]=(1LL*z[1][0]*y[0][0]%mod +1LL*z[1][1]*y[1][0]%mod)%mod;
        sol[1][1]=(1LL*z[1][0]*y[0][1]%mod +1LL*z[1][1]*y[1][1]%mod)%mod;
         for (int i=0;i<2;i++)
          for (int j=0;j<2;j++)
            y[i][j]=sol[i][j];

        sol[0][0]=(1LL*z[0][0]*z[0][0]%mod +1LL*z[0][1]*z[1][0]%mod)%mod;
        sol[0][1]=(1LL*z[0][0]*z[0][1]%mod +1LL*z[0][1]*z[1][1]%mod)%mod;
        sol[1][0]=(1LL*z[1][0]*z[0][0]%mod +1LL*z[1][1]*z[1][0]%mod)%mod;
        sol[1][1]=(1LL*z[1][0]*z[0][1]%mod +1LL*z[1][1]*z[1][1]%mod)%mod;
         for (int i=0;i<2;i++)
          for (int j=0;j<2;j++)
            z[i][j]=sol[i][j];

        n=(n-1)/2;
      }
    }

    sol[0][0]=(1LL*z[0][0]*y[0][0]%mod +1LL*z[0][1]*y[1][0]%mod)%mod;
    sol[0][1]=(1LL*z[0][0]*y[0][1]%mod +1LL*z[0][1]*y[1][1]%mod)%mod;
    sol[1][0]=(1LL*z[1][0]*y[0][0]%mod +1LL*z[1][1]*y[1][0]%mod)%mod;
    sol[1][1]=(1LL*z[1][0]*y[0][1]%mod +1LL*z[1][1]*y[1][1]%mod)%mod;
     for (int i=0;i<2;i++)
          for (int j=0;j<2;j++)
            z[i][j]=sol[i][j];

    fout << z[1][1] << "\n";

    return 0;
}