Pagini recente » Cod sursa (job #1846928) | Cod sursa (job #2288881) | Cod sursa (job #1802517) | Cod sursa (job #795702) | Cod sursa (job #1711163)
#include <fstream>
using namespace std;
ifstream f("curcubeu.in");
ofstream g("curcubeu.out");
int i,j,n,nr,a[1<<20],b[1<<20],c[1<<20],nxt[1<<20],sol[1<<20];
char v[20],s[1<<23];
int main()
{
f>>n>>a[1]>>b[1]>>c[1];
if(a[1]>b[1]) a[1]^=b[1]^=a[1]^=b[1];
for(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]) a[i]^=b[i]^=a[i]^=b[i];
}
for(i=n;i;--i)
for(j=a[i];j<=b[i];)
if(sol[j])
{
int lip=j;
j=nxt[j];
nxt[lip]<b[i]+1?nxt[lip]=b[i]+1:nxt[lip]=nxt[lip];
}
else
{
sol[j]=c[i];
nxt[j]=b[i]+1;
++j;
}
for(i=1;i<n;++i)
{
int x=sol[i];
v[0]=0;
if(!x) v[++v[0]]='0';
while(x)
{
v[++v[0]]=char('0'+x%10);
x/=10;
}
for(j=v[0];j;--j) s[++nr]=v[j];
s[++nr]='\n';
}
g<<(s+1);
return 0;
}