Cod sursa(job #682290)

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