Cod sursa(job #1413946)

Utilizator teo.serbanescuTeo Serbanescu teo.serbanescu Data 2 aprilie 2015 11:14:04
Problema Al k-lea termen Fibonacci Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.6 kb
#include <fstream>

using namespace std;

fstream f("kfib.in", ios::in);
fstream g("kfib.out", ios::out);

const long long modulo = 666013;

long long n, a[3][3], sol[3][3], b[3][3], i, j, k;

void exp()
{
    while (n > 0)
    {
        if (n & 1)
        {
            for (i = 1; i <= 2; i++)
            {
                for (k = 1; k <= 2; k++)
                {
                    b[i][k] = 0;
                    for (j = 1; j <= 2; j++) b[i][k] = (b[i][k] + (sol[i][j] * a[j][k]) % modulo) % modulo;
                }
            }
            for (i = 1; i <= 2; i++)
            {
                for (k = 1; k <= 2; k++) {
                                            sol[i][k] = b[i][k];
                                            b[i][k] = 0;
                }
            }
            n--;
        }
        for (i = 1; i <= 2; i++)
        {
            for (k = 1; k <= 2; k++)
                {
                    b[i][k] = 0;
                    for (j = 1; j <= 2; j++) b[i][k] = (b[i][k] + (a[i][j] * a[j][k]) % modulo) % modulo;
                }
        }
        for (i = 1; i <= 2; i++)
            {
                for (k = 1; k <= 2; k++) {
                                            a[i][k] = b[i][k];
                                            b[i][k] = 0;
                }
            }
        n = n >> 1;
    }
}

int main()
{
    f >> n;
    n -= 2;
    a[1][1] = 0; a[1][2] = 1; a[2][1] = 1; a[2][2] = 1;
    sol[1][1] = 1; sol[1][2] = 0; sol[2][1] = 0; sol[2][2] = 1;
    exp();
    g << (sol[1][2] + sol[2][2]) % modulo;
    return 0;
}