Pagini recente » Cod sursa (job #262433) | Cod sursa (job #2879836) | Cod sursa (job #1085172) | Cod sursa (job #672655) | Cod sursa (job #2187320)
#include <iostream>
#include <fstream>
#define nmax 1000002
using namespace std;
ifstream fin("curcubeu.in");
ofstream fout("curcubeu.out");
int n,a[nmax],b[nmax],c[nmax],poz,urm[nmax],st,dr,v[nmax];
int main()
{
fin>>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;
}
for(int i = n -1 ; i >= 1; i--)
{
st=min(a[i],b[i]);
dr=max(a[i],b[i]);
poz=st;
while(poz<=dr)
{
if(v[poz]!=0)
{
poz=urm[poz];
}
else
{
v[poz]=c[i];
urm[poz]=dr+1;
poz++;
}
}
}
for(int i =1 ; i < n ;i++)
fout<<v[i]<<'\n';
return 0;
}