Pagini recente » Cod sursa (job #317448) | Cod sursa (job #2060713) | Cod sursa (job #2058180) | Cod sursa (job #1663490) | Cod sursa (job #1077037)
#include<stdio.h>
#define NMAX 1000010
int n;
int cul[NMAX],a[NMAX],b[NMAX],c[NMAX],next[NMAX];
int main()
{
freopen("curcubeu.in","r",stdin);
freopen("curcubeu.out","w",stdout);
int i,j,aux;
scanf("%d%d%d%d",&n,&a[1],&b[1],&c[1]);--n;
a[1]%=(n+1);b[1]%=(n+1);c[1]%=(n+1);
for(i=2;i<=n;++i)
{
a[i]=((long long)a[i-1]*i)%(n+1);
b[i]=((long long)b[i-1]*i)%(n+1);
c[i]=((long long)c[i-1]*i)%(n+1);
if(a[i]>b[i])
{
aux=a[i];
a[i]=b[i];
b[i]=aux;
}
}
for(i=1;i<=n+1;++i)next[i]=i;
for(i=n;i>=1;--i)
{
for(j=a[i];j<=b[i];++j)
{
if(!cul[j])
{
cul[j]=c[i];
next[j]=next[b[i]+1];
}
else
j=next[j]-1;
}
}
for(i=1;i<=n;++i)
printf("%d\n",cul[i]);
return 0;
}