Pagini recente » Cod sursa (job #1239281) | Cod sursa (job #1297603) | Cod sursa (job #1628588) | Cod sursa (job #1756775) | Cod sursa (job #2267343)
#include <fstream>
using namespace std;
ifstream f("curcubeu.in");
ofstream g("curcubeu.out");
int n,a[1000004],v[1000004],b[1000004],c[1000004],i,v2[1000004],j;
int main()
{
f>>n>>a[1]>>b[1]>>c[1];
if(a[1]>b[1])
{
swap(a[1],b[1]);
}
for(i=2; i<=n-1; i++)
{
a[i]=(1LL*a[i-1]*i)%n;
b[i]=(1LL*b[i-1]*i)%n;
c[i]=(1LL*c[i-1]*i)%n;
if(a[i]>b[i])
swap(a[i],b[i]);
}
for(i=n-1; i; i--)
{
for(j=a[i]; j<=b[i];)
{
if(v[j]==0)
{
v[j]=c[i];
v2[j]=b[i]+1;
j++;
}
else
j=v2[j];
}
}
for(i=1; i<n; i++)
g<<v[i]<<'\n';
return 0;
}