Pagini recente » Cod sursa (job #3174938) | Cod sursa (job #1857446) | Cod sursa (job #2281033) | Cod sursa (job #3157951) | Cod sursa (job #945009)
Cod sursa(job #945009)
#include <fstream>
#define Nmax 1000005
using namespace std;
ifstream in("curcubeu.in");
ofstream out("curcubeu.out");
int a[Nmax],b[Nmax],c[Nmax],urm[Nmax],cul[Nmax];
int main(){
int n,m,M;
in>>n>>a[1]>>b[1]>>c[1];
urm[1]=1;
for(int i=2;i<n;i++){
a[i]=((a[i-1]%n)*(i%n))%n;
b[i]=((b[i-1]%n)*(i%n))%n;
c[i]=((c[i-1]%n)*(i%n))%n;
urm[i]=i;
}
for(int i=n-1;i>0;i--){
m=min(a[i],b[i]); M=max(a[i],b[i]);
while(m<=M){
while(m<=M && urm[m]!=m) m=urm[m];
if(m<=M) cul[m]=c[i], urm[m++]=M+1;
}
}
for(int i=1;i<n;++i) out<<cul[i]<<'\n';
out.close(); return 0;
}