Pagini recente » Cod sursa (job #2050754) | Cod sursa (job #2364856) | Cod sursa (job #1757543) | Cod sursa (job #104986) | Cod sursa (job #1503353)
#define _CRT_SECURE_NO_DEPRECATE
#include <cstdio>
#include <cassert>
#include <cstring>
using namespace std;
#define MAXN 1000002
int N, A[MAXN], B[MAXN], C[MAXN], ans[MAXN], next[MAXN];
inline void w_int32(int &k, char end) {
char lim[16], *s;
s = lim + 15, *s = 0, *--s = end;
do {
*--s = k % 10 + '0';
k /= 10;
} while (k);
fputs(s, stdout);
}
int main()
{
assert(freopen("curcubeu.in", "r", stdin));
freopen("curcubeu.out", "w", stdout);
scanf("%d%d%d%d", &N, &A, &B, &C);
for (unsigned long long i = 1; i < N; ++i) next[i] = i,
A[i] = (A[i - 1] * i) % N,
B[i] = (B[i - 1] * i) % N,
C[i] = (C[i - 1] * i) % N;
next[N] = N;
for (int i = N - 1; i; --i) {
int l = A[i], r = B[i], aux, last, root;
if (l > r) l ^= r ^= l ^= r;
last = r + 1, root = last;
while (last != next[last]) last = next[last];
while (root != next[root]) aux = next[root], next[root] = last, root = aux;
while (l <= r) {
if (next[l] == l) ans[l] = C[i];
next[l] = root;
l = next[l + 1];
}
}
for (int i = 1; i < N; ++i) w_int32(ans[i], '\n');
return 0;
}