Pagini recente » Cod sursa (job #406129) | Cod sursa (job #890697) | Cod sursa (job #1444880) | Cod sursa (job #2585327) | Cod sursa (job #3203708)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("curcubeu.in");
ofstream fout("curcubeu.out");
int n,v[1000005],a[1000005],b[1000005],c[1000005],d[1000005];
int main()
{
fin>>n>>a[1]>>b[1]>>c[1];
for(int i=2;i<=n-1;i++)
{
a[i]=(1LL*a[i]*i)%n;
b[i]=(1LL*b[i]*i)%n;
c[i]=(1LL*c[i]*i)%n;
if(a[i]>b[i]){swap(a[i],b[i]);}
}
for(int i=n-1;i>=1;i--)
{
for(int j=a[i];j<=b[i];)
{
if(!v[j])
{
v[j]=c[i];
d[j]=b[i]+1;
j++;
}
else{j=d[j];}
}
}
for(int i=1;i<=n-1;i++)
{
Fout<<v[i]<<'\n';
}
fin.close();
fout.close();
return 0;
}