Pagini recente » Cod sursa (job #1811681) | Cod sursa (job #1467911) | Cod sursa (job #203830) | Cod sursa (job #2059999) | Cod sursa (job #1799627)
#include<fstream>
using namespace std;
ifstream f("rsir.in");
ofstream g("rsir.out");
int m,i,j,x,y,u,v,p,q,z,a[1<<13],b[1<<13];
void next()
{
int aux=(a[p]+b[q]+z)%m;
p=q;
q=aux;
}
long long n;
int main()
{
f>>p>>q>>u>>v>>x>>y>>z>>m>>n;
for(i=0;i<m;++i)
a[i]=(1LL*u*i*i+1LL*x*i)%m,
b[i]=(1LL*v*i*i+1LL*y*i)%m;
for(i=1;i<=m*m&&i<=n;++i) next();
x=p;
y=q;
if(i==n+1)
{
g<<x;
return 0;
}
n-=m*m;
for(i=1;i<=n;++i)
{
next();
if(p==x&&q==y) break;
}
n=(n-i)%i;
for(i=1;i<=n;++i) next();
g<<p;
}