Pagini recente » Cod sursa (job #2330604) | Cod sursa (job #2832485) | Cod sursa (job #1280037) | Cod sursa (job #3152928) | Cod sursa (job #2059605)
#include <fstream>
using namespace std;
ifstream f("curcubeu.in");
ofstream g("curcubeu.out");
long long A, B, C, N, a, b, c;
int v[1000001], nr;
int main()
{
f >> N >> A >> B >> C;
for(int i = N - 1; i >= 1 && nr < N - 1; i--)
{
a = (A * i) % N;
b = (B * i) % N;
c = (C * i) % N;
if(a > b) swap(a, b);
for(int j = a; j <= b; j++)
if(v[j] == 0) v[j] = c, nr++;
}
for(int i = 1; i < N; i++)
g << v[i] << '\n';
return 0;
}