Pagini recente » Cod sursa (job #1448161) | Cod sursa (job #1102305) | Cod sursa (job #3289909) | Cod sursa (job #2595592) | Cod sursa (job #2356550)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("iepuri.in");
ofstream out("iepuri.out");
const int mod=666013;
int X,Y,Z,A,B,C,N,T;
int D1,D2,D3,Dn;
void Read()
{
in >> X >> Y >> Z >> A >> B >> C >> N;
D1 = X;
D2 = Y;
D3 = Z;
}
void Solve(int k)
{
for(int i = 3;i <= k; ++i)
{
Dn = (A * D3 + B * D2 + C * D1) % mod;
D1= D2;
D2= D3;
D3= Dn;
cout<<Dn<<' '<<i;
}
out<<D3;
out<<'\n';
}
int main()
{
in >> T;
while(T--)
{
Read();
Solve(N);
}
return 0;
}