Pagini recente » Cod sursa (job #1321661) | Cod sursa (job #2903220) | Cod sursa (job #718238) | Cod sursa (job #1079004) | Cod sursa (job #2500937)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("curcubeu.in");
ofstream g ("curcubeu.out");
int a[100001], b[100001], c[100001],jump[100001],v[100001], n;
int main()
{
f>>n>>a[1]>>b[1]>>c[1];
for(int 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;
if(a[i]>b[i])
swap(a[i], b[i]);
jump[i]=i+1;
}
int aux;
for(int i=n;i>0;--i)
{
for(int j=a[i];j<=b[i]; aux=jump[j], jump[j]=b[i]+1, j=aux)
{
if(v[j]==0)
v[j]=c[i];
}
}
for(int i=1;i<n;++i)
g<<v[i]<<"\n";
return 0;
}