Pagini recente » Cod sursa (job #2392206) | Cod sursa (job #1519982) | Cod sursa (job #784625) | Cod sursa (job #1937730) | Cod sursa (job #2942395)
#include <fstream>
using namespace std;
int A[1000005],B[1000005],C[1000005],nexxt[1000005],ans[1000005];
int main()
{
ifstream cin("curcubeu.in");
ofstream cout("curcubeu.out");
int n;
cin>>n>>A[1]>>B[1]>>C[1];
for(int 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(int i=n;i>=1;i--)
{
int st=min(A[i],B[i]),dr=max(A[i],B[i]);
for(int j=st;j<=dr;)
if(nexxt[j]==0)
{
nexxt[j]=dr+1;
ans[j]=C[i];
j++;
}
else
j=nexxt[j];
}
for(int i=1;i<n;i++)
cout<<ans[i]<<"\n";
return 0;
}