Pagini recente » Cod sursa (job #2787761) | Cod sursa (job #870495) | Cod sursa (job #968676) | Cod sursa (job #1953778) | Cod sursa (job #2437715)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("curcubeu.in");
ofstream fout("curcubeu.out");
const int NMAX = 1000010;
int pos[NMAX],cul[NMAX];
bool viz[NMAX];
int a[NMAX],b[NMAX],c[NMAX];
int main()
{
int n;
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--)
{
int l = min(a[i],b[i]);
int r = max(a[i],b[i]);
for(int j = l;j<=r;j++)
{
if(viz[j])
j=pos[j];
else
{
viz[j]=true;
cul[j]=c[i];
pos[j]=r+1;
}
}
}
for(int i = 1;i<=n-1;i++)
fout<<cul[i]<<'\n';
return 0;
}