Pagini recente » Cod sursa (job #1171873) | Cod sursa (job #2711386) | Cod sursa (job #2171862) | Cod sursa (job #2653468) | Cod sursa (job #352811)
Cod sursa(job #352811)
#include <stdio.h>
#include <string.h>
#include <fstream.h>
#include <iostream.h>
const int n_max = 10001;
const int m = 666013;
int main()
{
int i,x,y,z,a,b,c,t;
long long n, sol = 1;
ifstream f("lgput.in");
ofstream g("lgput.out");
f>>t;
for(i=1;i<=t;i++)
{f>>x>>y>>z>>a>>b>>c>>n;
x=x%m;
y=y%m;
z=z%m;
a=a%m;
b=b%m;
c=c%m;
if(n>3)
{for (i=0;(1<<i)<=n;i++)
{
if(((1<<i)&n)>0)
sol=(((x*a)%m+(y*b)%m)%m+(z*c)%m)%m;
x=y%m;
y=z%m;
z=sol;
}
g<<sol<<endl;
}
else if(n==1) g<<x;
else if(n==2) g<<y;
else if(n==3) g<<z;
}
return 0;
}