Pagini recente » Cod sursa (job #2548677) | Cod sursa (job #3219812) | Cod sursa (job #45303) | Cod sursa (job #2219478) | Cod sursa (job #2965131)
#include <iostream>
#include <fstream>
#include <map>
using namespace std;
const int NMAX = 1e6 + 1;
int n, a, b, c, t[NMAX], rang[NMAX];
void formeaza_multime(int x, int col)
{
t[x] = x;
rang[x] = col;
}
int gaseste_multime(int x)
{
if (x != t[x])
{
t[x] = gaseste_multime(t[x]);
}
return t[x];
}
void uneste(int x, int y, int c)
{
t[y] = x;
rang[x] = c;
rang[y] = c;
}
void reuneste(int x, int y, int c)
{
uneste(gaseste_multime(x), gaseste_multime(y), c);
}
int main()
{
ifstream fin("curcubeu.in");
ofstream fout("curcubeu.out");
fin >> n >> a >> b >> c;
for (int i = 1; i <= n - 1; i++)
{
formeaza_multime(i, 0);
}
if (a > b)
{
swap(a, b);
}
reuneste(a, b, c);
for (int i = 2; i <= n - 1; i++)
{
a = (a * i) % n;
b = (b * i) % n;
c = (c * i) % n;
if (a > b)
{
swap(a, b);
}
reuneste(a, b, c);
}
for (int i = 1; i <= n - 1; i++)
{
fout << rang[gaseste_multime(i)] << '\n';
}
}