Pagini recente » Cod sursa (job #322089) | Cod sursa (job #147947) | Cod sursa (job #829926) | Cod sursa (job #2460637) | Cod sursa (job #2105642)
#include<fstream>
using namespace std;
ifstream fin("curcubeu.in");
ofstream fout("curcubeu.out");
int n,i,aux;
int a[1000005],b[1000005],c[1000005],v[1000005],nex[1000005];
int main(){
fin>>n;
for(i=1;i<=n;i++){
nex[i]=i;
}
fin>>a[1]>>b[1]>>c[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;
}
for(i=n-1;i>=1;i--){
if(a[i]>b[i]){
swap(a[i],b[i]);
}
aux=a[i];
while(aux<=b[i]){
if(v[aux]!=0){
aux=nex[aux];
}
else{
v[aux]=c[i];
nex[aux]=b[i]+1;
aux++;
}
}
}
for(i=1;i<n;i++){
fout<<v[i]<<"\n";
}
return 0;
}