Pagini recente » Cod sursa (job #408587) | Cod sursa (job #50996) | Cod sursa (job #699221) | Cod sursa (job #2533527) | Cod sursa (job #779307)
Cod sursa(job #779307)
#include<fstream>
using namespace std;
int i,j,t,p,inc,n,m,urm[300001],pas,nr,tata[300000],rez;
int main()
{
ifstream f("order.in");
ofstream g("order.out");
f>>n;
for(i=1;i<=n;++i)
urm[i]=i+1,tata[i]=i-1;
tata[1]=n,urm[n]=1;
i=1;
nr=1;
pas=inc=1;
while(pas<=n)
{
i+=pas;
++pas;
j=i%n;
t=inc;
while(nr<j)
++nr,t=urm[t];
urm[tata[t]]=urm[t];
tata[urm[t]]=tata[t];
g<<t<<" ";
if(t==inc)
inc=urm[t];
nr=2;
}
return 0;
}