Cod sursa(job #682424)

Utilizator psycho21rAbabab psycho21r Data 18 februarie 2012 23:03:19
Problema Iepuri Scor 100
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.29 kb
#include <fstream>
#define MOD 666013
using namespace std;
int aux[3][3];
inline void mult(long long a[3][3], long long b[3][3])
{
    aux = {{0,0,0},{0,0,0},{0,0,0}};
    for(int i = 0; i < 3; ++i)
        for(int j = 0; j < 3; ++j)
            for(int k = 0; k < 3; ++k)
                aux[i][j] = (aux[i][j] + (a[i][k]*b[k][j]))%MOD;
    for(int i = 0; i < 3; ++i)
        for(int j = 0; j < 3; ++j)
            a[i][j] = aux[i][j];
}
int main()
{
    long long sol[3][3], x[3][3];
    int T;
    ifstream in("iepuri.in");
    in >> T;
    ofstream out("iepuri.out");
    for(long X,Y,Z,A,B,C,N;T;--T)
    {
        in >> X >> Y >> Z >> A >> B >> C >> N;
        if(N==0)
            out << X << "\n";
        else if (N==1)
            out << Y << "\n";
        else if (N==2)
            out << Z << "\n";
        else
        {
            N-=2;
            sol = {{1,0,0},{0,1,0},{0,0,1}}, x = {{0,1,0},{0,0,1},{C,B,A}};
            for(unsigned long long i = 0; (1LL<<i) <= N; ++i)
            {
                if((1LL<<i)&N)
                    mult(sol, x);
                mult(x,x);
            }
            out << (((sol[2][0]*X)%MOD + (sol[2][1]*Y)%MOD)%MOD + (sol[2][2]*Z)%MOD)%MOD << "\n";
        }
    }
    in.close();
    out.close();
    return 0;
}