Cod sursa(job #2842880)
| Utilizator | Data | 1 februarie 2022 17:46:55 | |
|---|---|---|---|
| Problema | Curcubeu | Scor | 20 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.58 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream f("curcubeu.in");
ofstream g("curcubeu.out");
int main ()
{
int n, i, j, a, b, c;
f >> n >> a >> b >> c;
vector <int> colour(n, 0);
for (i = min (a, b); i <= max (a, b); i += 1)
colour[i] = c;
for (i = 2; i <= n - 1; i += 1)
{
a = (a * i) % n;
b = (b * i) % n;
c = (c * i) % n;
for (j = min (a, b); j <= max (a, b); j += 1)
colour[j] = c;
}
for (i = 1; i < n; i += 1)
g << colour[i] << '\n';
return 0;
}
