Pagini recente » Cod sursa (job #1275735) | Cod sursa (job #770881) | Cod sursa (job #1630778) | Cod sursa (job #922804) | Cod sursa (job #1463586)
#define N 1000005
#include <fstream>
using namespace std;
ifstream f("curcubeu.in");
ofstream g("curcubeu.out");
int next[N],a[N],b[N],c[N],i,j,n,w[N];
int main()
{
f>>n>>a[1]>>b[1]>>c[1];
for(i=2;i<n;++i)
{
a[i]=(a[i-1]*i)%n;
b[i]=(b[i-1]*i)%n;
c[i]=(c[i-1]*i)%n;
}
for(i=0;i<=n;++i) next[i]=i+1;
for(i=n-1;i;--i)
{
for(j=next[a[i]-1];j<=b[i];j=next[j])
{
next[j]=next[b[i]];
w[j]=c[i];
}
}
for(i=1;i<n;++i) g<<w[i]<<'\n';
return 0;
}