Pagini recente » Cod sursa (job #3163115) | Cod sursa (job #229306) | Cod sursa (job #3124204) | Cod sursa (job #395042) | Cod sursa (job #3191770)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("curcubeu.in");
ofstream fout("curcubeu.out");
int n,a,b,c;
vector<int> tatici;
vector<int> colorat;
vector<int> leftSide;
vector<int> rightSide;
vector<int> color;
void getNext(int& k) {
int mem = k;
while(tatici[k] != -1) {
k = tatici[k];
}
while(tatici[mem] != -1) {
const int aux = tatici[mem];
tatici[mem] = k;
mem = aux;
}
}
int main() {
fin >> n;
tatici.assign(n, -1);
colorat.assign(n, 0);
leftSide.resize(n);
rightSide.resize(n);
color.resize(n);
fin >> leftSide[1] >> rightSide[1] >> color[1];
for(int i = 2; i < n; i++) {
leftSide[i] = (1ll*leftSide[i-1]*i) % n;
rightSide[i] = (1ll*rightSide[i-1]*i) % n;
color[i] = (1ll*color[i-1]*i) % n;
}
for (int i = n-1; i > 0; i--) {
const int _left = min(leftSide[i],rightSide[i]);
const int _right = max(leftSide[i],rightSide[i]);
for (int k = _left; k <= _right; k++) {
colorat[k] = color[i];
if (tatici[k+1] != -1) {
const int _k = k;
getNext(k);
tatici[_k] = k;
} else {
tatici[k] = _right+1;
}
}
}
for (int i = 1; i < n; i++) {
fout << colorat[i] << '\n';
}
return 0;
}