Pagini recente » Cod sursa (job #1826577) | Cod sursa (job #988145) | Cod sursa (job #2472174) | Cod sursa (job #2297832) | Cod sursa (job #3309622)
#include <fstream>
using namespace std;
ifstream cin("curcubeu.in");
ofstream cout("curcubeu.out");
int v[1000005],a[1000005],b[1000005],c[1000005],sol[1000005],pr[1000005];
int p(int i)
{
if(i==pr[i])
return i;
return pr[i]=p(pr[i]);
}
int main()
{
int n;
cin>>n>>a[1]>>b[1]>>c[1];
for(int i=0;i<=n;i++)
pr[i]=i;
if(a[1]>b[1])
swap(a[1],b[1]);
for(int i=2;i<n;i++)
{
a[i]=(1LL*a[i-1]*i)%n;
b[i]=(1LL*b[i-1]*i)%n;
c[i]=(1LL*c[i-1]*i)%n;
if(a[i]>b[i])
swap(a[i],b[i]);
}
for(int i=n-1;i>=1;i--)
{
int j=p(a[i]);
while(j<=b[i])
{
sol[j]=c[i];
pr[j]=b[i]+1;
j=p(j+1);
}
}
for(int i=1;i<=n-1;i++)
cout<<sol[i]<<"\n";
return 0;
}