Pagini recente » Cod sursa (job #1603780) | Cod sursa (job #2845896) | Cod sursa (job #812138) | Cod sursa (job #892442) | Cod sursa (job #2570941)
#include <fstream>
#define Nmax 1000010
using namespace std;
ifstream fin("curcubeu.in");
ofstream fout("curcubeu.out");
int a[Nmax],b[Nmax],c[Nmax],n,sol[Nmax],jump[Nmax];
int main()
{
int i;
fin>>n>>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--)
{
int p=min(a[i],b[i]);
int u=max(a[i],b[i]);
for (int j=p;j<=u;j++)
{
if (sol[j]==0)
sol[j]=i;
else
j=jump[sol[j]];
}
jump[i]=u;
}
for (i=1;i<n;i++)
fout<<c[sol[i]]<<"\n";
return 0;
}