Cod sursa(job #2196156)
Utilizator | Data | 18 aprilie 2018 17:31:40 | |
---|---|---|---|
Problema | Iepuri | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.58 kb |
#include <iostream>
#include <fstream>
#include <vector>
#define modulo 666013
#define nmax 200000000
using namespace std;
ifstream fin("iepuri.in");
ofstream fout("iepuri.out");
int32_t N;
int main()
{
int T;
fin>>T;
while(T--)
{
int x,y,z,a,b,c;
int N;
fin>>x>>y>>z>>a>>b>>c>>N;
N=N-2;//avem deja calculate primele
while(N--)
{
int rez=(a*z+b*y+c*x)%666013;
x=y;
y=z;
z=rez;
}
fout<<z<<'\n';
}
return 0;
}