Cod sursa(job #1423911)

Utilizator greenadexIulia Harasim greenadex Data 22 aprilie 2015 23:29:34
Problema Iepuri Scor 90
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.41 kb
#include <fstream>
#include <cstring>

using namespace std;

ifstream fin("iepuri.in");
ofstream fout("iepuri.out");

const int p = 666013;
int t, x, y, z, a, b, c, init[1][3], matr[3][3], sol[3][3], temp[3][3];
long long n;

void matrix_mult(int A[3][3], int B[3][3], int C[3][3], int na){
    for (int i = 0; i < na; i++)
        for (int j = 0; j < 3; j++){
            C[i][j] = 0;
            for (int k = 0; k < 3; k++)
                C[i][j] = (C[i][j] + 1LL * A[i][k] * B[k][j]) % p;
        }
}

int main()
{
    fin >> t;
    for (; t; t--){
        fin >> x >> y >> z >> a >> b >> c >> n;
        init[0][0] = x; init[0][1] = y; init[0][2] = z;
        memset(matr, 0, sizeof(matr));
        matr[1][0] = 1; matr[2][1] = 1; matr[0][2] = c; matr[1][2] = b; matr[2][2] = a;
        memset(sol, 0, sizeof(sol));
        sol[0][0] = sol[1][1] = sol[2][2] = 1;
        memset(temp, 0, sizeof(temp));
        for (long long i = 0; (1 << i) <= n - 2; i++){
            if ( (1 << i) & (n-2) ){
                memset(temp, 0, sizeof(temp));
                matrix_mult(sol, matr, temp, 3);
                memcpy(sol, temp, sizeof(sol));
            }
            memset(temp, 0, sizeof(temp));
            matrix_mult(matr, matr, temp, 3);
            memcpy(matr, temp, sizeof(matr));
        }
        matrix_mult(init, sol, temp, 1);
        fout << temp[0][2] << '\n';
    }
    return 0;
}