Pagini recente » Cod sursa (job #1109467) | Cod sursa (job #102461) | Cod sursa (job #1901205) | Cod sursa (job #2583381) | Cod sursa (job #3161706)
#include <fstream>
using namespace std;
ifstream cin("curcubeu.in");
ofstream cout("curcubeu.out");
int n;
int A[1000000], B[1000000], C[1000000];
int p[1000000];
int viz[1000000];
void Unite(int x, int y)
{
if(r[x] > r[y])
p[y] = x + 1;
else
p[x] = y + 1;
if(r[x] == r[y]) r[y]++;
}
int main()
{
p[1] = 1;
r[1] = 1;
cin >> 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;
p[i] = i;
r[i] = 1;
}
p[n] = 0;
for(int i = n-1; i>0; i--)
{
int st = min(A[i], B[i]);
int dr = max(A[i], B[i]);
for(int j = st; j <= dr && j<n;)
{
if(viz[j] == 0)
{
viz[j] = C[i];
p[j] = dr + 1;
j++;
}
else
j = p[j];
}
}
for(int i = 1; i<n; i++)
{
cout << viz[i] << '\n';
}
}