Pagini recente » Cod sursa (job #2666616) | Cod sursa (job #641933) | Cod sursa (job #213779) | Cod sursa (job #637462) | Cod sursa (job #2842916)
#include <fstream>
#include <vector>
using namespace std;
ifstream f("curcubeu.in");
ofstream g("curcubeu.out");
const int INF = 1e6 + 1;
vector <int> colour(INF), a(INF), b(INF), c(INF), urm(INF);
int main ()
{
int n, i, stanga, dreapta;
f >> n >> a[1] >> b[1] >> c[1];
for (i = 2; i <= n - 1; i += 1)
{
a[i] = (a[i - 1] * i) % n;
b[i] = (b[i - 1] * i) % n;
c[i] = (c[i - 1] * i) % n;
}
for (i = 1; i <= n - 1; i += 1)
urm[i] = i;
for (i = n - 1; i >= 1; i -= 1)
{
stanga = min (a[i], b[i]);
dreapta = max (a[i], b[i]);
for (j = stanga; j <= dreapta;)
{
if (urm[j] != j)
j = urm[j];
else
colour[j] = c[i], urm[j] = right, j += 1;
}
}
return 0;
}