Pagini recente » Cod sursa (job #1775723) | Cod sursa (job #1482627) | Cod sursa (job #2209220) | Cod sursa (job #339350) | Cod sursa (job #1725952)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("curcubeu.in");
ofstream fout("curcubeu.out");
vector<int> A;
vector<int> B;
vector<int> C;
vector<int> colored;
vector<int> Next;
int N;
int main()
{
int N, A1, B1, C1;
fin>>N>>A1>>B1>>C1;
A.resize(N+1);
B.resize(N+1);
C.resize(N+1);
colored.resize(N+1, 0);
Next.resize(N+1);
A[1] = A1; B[1] = B1; C[1]=C1;
for (int i = 2; i <= N-1; i++)
{
A[i] = (A[i-1]*i)%N;
B[i] = (B[i-1]*i)%N;
C[i] = (C[i-1]*i)%N;
}
for (int i = 1; i <= N-1;i++)
Next[i] = i+1;
for (int i = N-1; i >=1; i--)
{
if (A[i] > B[i])
{
A[i] ^= B[i];
B[i] ^= A[i];
A[i] ^= B[i];
}
for (int j = A[i]; j<=B[i];j++)
{
if (colored[j] != 0)
{
j = Next[j];
j--;
}
else
{
colored[j] = C[i];
j = B[i]+1;
}
}
}
for (int i = 1; i <= N-1;i++)
fout<<colored[i]<<endl;
return 0;
}