Pagini recente » Borderou de evaluare (job #343741) | Cod sursa (job #343679)
Cod sursa(job #343679)
#include <iostream>
#include <fstream>
using namespace std;
#define LIM 1000005
int N,A[LIM],B[LIM],C[LIM],i,j,nr[LIM],aux[LIM],x,p;
int main()
{
ifstream f("curcubeu.in");
ofstream g("curcubeu.out");
f>>N>>A[1]>>B[1]>>C[1];
f.close();
if (A[1]>B[1])
{
x=A[1];
A[1]=B[1];
B[1]=x;
}
for (i=2;i<N;++i)
{
A[i]=( (long long) A[i-1]*i)%N;
B[i]=( (long long) B[i-1]*i)%N;
C[i]=( (long long) C[i-1]*i)%N;
if (A[i]>B[i])
{
x=A[i];
A[i]=B[i];
B[i]=x;
}
aux[i-1]=i;
}
for (i=N-1;i>0;--i)
{
p=A[i];
while (p<=B[i])
{
if (nr[p]==0) nr[p]=C[i];
x=0;
p=aux[p];
aux[x]=B[i]+1;
}
}
for (i=1;i<N;++i)
g<<nr[i]<<endl;
g.close();
return 0;
}