Pagini recente » Cod sursa (job #3233403) | Cod sursa (job #1031095) | Cod sursa (job #2789830) | Cod sursa (job #2958102) | Cod sursa (job #2944611)
#include<bits/stdc++.h>
#define int long long
using namespace std;
ifstream f("curcubeu.in");
ofstream g("curcubeu.out");
int a[1000005],b[1000005],c[1000005],ans[1000005],fun[1000005];
signed main()
{
int n,i,j;
f>>n>>a[1]>>b[1]>>c[1];
for(i=2;i<n;i++)
a[i]=(a[i-1]*i)%n,b[i]=(b[i-1]*i)%n,c[i]=(c[i-1]*i)%n;
for(i=n-1;i>=1;i--)
{
int l=min(a[i],b[i]);
int r=max(a[i],b[i]);
for(j=l;j<=r;j++)
{
if(fun[j]==0)
{
ans[j]=c[i];
fun[j]=r;
}
else
{
j=fun[j];
}
}
}
for(i=1;i<n;i++)
g<<ans[i]<<'\n';
return 0;
}