Pagini recente » Cod sursa (job #1968361) | Cod sursa (job #1811199) | Cod sursa (job #2417787) | Cod sursa (job #286499) | Cod sursa (job #833579)
Cod sursa(job #833579)
#include<cstdio>
#define MAXN 65536
int n,arb[MAXN],value,index;
void UpdateArb(int nod,int st,int dr)
{
if(st==dr)
{
arb[nod]=value;
return;
}
int mij=(st+dr)/2;
if(index<=mij)
UpdateArb(nod*2,st,mij);
else
UpdateArb(nod*2+1,mij+1,dr);
arb[nod]=arb[nod*2]+arb[nod*2+1];
}
void QueryArb(int nod,int st,int dr,int s)
{
if(st==dr)
{
index=st;
return;
}
int mij=(st+dr)/2;
if(arb[nod*2]>=s)
QueryArb(nod*2,st,mij,s);
else
QueryArb(nod*2+1,mij+1,dr,s-arb[nod*2]);
}
int main()
{
freopen("order.in","r",stdin);
freopen("order.out","w",stdout);
int i,next;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
value=1;
index=i;
UpdateArb(1,1,n);
}
value=0;
next=1;
for(i=1;i<=n;i++)
{
next=(next+i+arb[1])%arb[1];
if(next==0) next=arb[1];
QueryArb(1,1,n,next);
UpdateArb(1,1,n);
printf("%d ",index);
next--;
}
return 0;
}