Pagini recente » Cod sursa (job #2348305) | Cod sursa (job #740304) | Cod sursa (job #2715691) | Cod sursa (job #1071208) | Cod sursa (job #2269534)
#include <fstream>
using namespace std;
int n,a[1000005],b[1000005],c[1000005],v[1000005],urm[1000005];
int main()
{
ifstream cin("curcubeu.in");
ofstream cout("curcubeu.out");
cin>>n>>a[1]>>b[1]>>c[1];
if(a[1]>b[1]) swap(a[1],b[1]);
for(int 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(int i=n-1; i; i--)
for(int j=a[i]; j<=b[i];)
if(v[j] == 0)
{
v[j] = c[i];
urm[j] = b[i] + 1;
j++;
}
else j = urm[j];
for(int i=1; i<n; i++)
cout<<v[i]<<"\n";
return 0;
}