Pagini recente » Istoria paginii utilizator/evvaluator | Istoria paginii problema/cd | Borderou de evaluare (job #1638624) | Diferente pentru problema/minlcm intre reviziile 11 si 10 | Cod sursa (job #1099193)
#include<cstdio>
using namespace std;
const int NMAX = 30000+5;
int N;
int Next[NMAX];
int Prev[NMAX];
int main()
{
int i,j,k,p,r;
freopen("order.in","r",stdin);
freopen("order.out","w",stdout);
scanf("%d",&N);
for(i=1; i<=N; ++i)
{
Next[i]=i+1;
Prev[i]=i-1;
}
Next[N]=1;
Prev[1]=N;
for(i=k=1; i<=N; ++i)
{
for(j=1; j<=i; ++j)
k=Next[k];
p=Next[k];
r=Prev[k];
Next[r]=p;
Prev[p]=r;
printf("%d ",k);
}
return 0;
}