Pagini recente » Cod sursa (job #989267) | Cod sursa (job #1105762) | Cod sursa (job #612642) | Cod sursa (job #959961) | Cod sursa (job #2352191)
#include <fstream>
#include <cstdio>
using namespace std;
ifstream cin("curcubeu.in");
const int N = (int)1e6 + 7;
int n;
int a[N];
int b[N];
int c[N];
int r[N];
int urm[N];
int main()
{
cin >> n;
cin >> a[1] >> b[1] >> c[1];
r[1]=-1;
for(int i = 2; i < n; i++)
{
a[i] = a[i - 1] * (long long)i % n;
b[i] = b[i - 1] * (long long)i % n;
c[i] = c[i - 1] * (long long)i % n;
r[i] = -1;
}
for(int i = n - 1; i >= 1; i--)
{
int st = min(a[i], b[i]);
int dr = max(a[i], b[i]);
int kol = c[i];
for(int j = st; j <= dr;)
{
if(r[j] == -1)
{
r[j] = kol;
urm[j] = dr + 1;
}
else
{
j = urm[j];
}
}
}
freopen("curcubeu.out","w",stdout);
for(int i = 1; i < n; i++)
{
r[i] = max(0, r[i]);
printf("%d\n",r[i]);
}
return 0;
}