Pagini recente » Cod sursa (job #1099165) | Cod sursa (job #732110) | Cod sursa (job #2286646) | Cod sursa (job #1032906) | Cod sursa (job #2632911)
#include <fstream>
using namespace std;
ifstream fin("curcubeu.in");
ofstream fout("curcubeu.out");
struct {int l, r, c;} q[1000000];
int u[1000000];
int v[1000000];
int main()
{
int n, i, a, b, c, j, k;
fin >> n >> a >> b >> c;
q[1] = {min(a, b), max(a, b), c};
u[0] = 1;
u[1] = 2;
for (i = 2; i<n; i++)
{
a = (1ll*a*i)%n;
b = (1ll*b*i)%n;
c = (1ll*c*i)%n;
q[i] = {min(a, b), max(a, b), c};
u[i] = i+1;
}
for (i = n-1; i>=1; i--)
{
for (j = u[q[i].l-1]; j<=q[i].r;)
{
v[j] = q[i].c;
k = u[j];
u[j] = u[q[i].r];
j = k;
}
}
for (i = 1; i<n; i++)
fout << v[i] << '\n';
return 0;
}