Cod sursa(job #2677916)
Utilizator | Marcu Mihai marcumihai | Data | 27 noiembrie 2020 18:23:36 |
---|---|---|---|
Problema | Curcubeu | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.62 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f ("curcubeu.in");
ofstream g ("curcubeu.out");
int cul[1000005];
int nex[1000005];
int n;
int a,b,c;
int main()
{
f>>n>>a>>b>>c;
for(int x=1;x<=n;++x)
{
int i=min(a,b);
int j=max(a,b);
for(int t=i;t<=j;++t)
{
if(nex[t]!=0)
t=nex[t]+1;
else
{
cul[t]=c;
nex[t]=j;
}
}
a=(a*i)%n;
b=(b*i)%n;
c=(c*i)%n;
}
for(int i=1;i<n;++i)
g<<cul[i]<<"\n";
return 0;
}