Pagini recente » Cod sursa (job #653036) | Cod sursa (job #1268881) | Cod sursa (job #3270225) | Cod sursa (job #3214019) | Cod sursa (job #2944603)
#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];
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(ans[j]==0)
ans[j]=c[i];
}
}
for(i=1;i<n;i++)
g<<ans[i]<<'\n';
return 0;
}