Pagini recente » Cod sursa (job #1132195) | Cod sursa (job #2418329) | Cod sursa (job #1683507) | Cod sursa (job #2352218) | Cod sursa (job #2750612)
//#include <iostream>
#include <fstream>
using namespace std;
int nex[30005],pre[30005];
int main()
{
ifstream cin("order.in");
ofstream cout("order.out");
int n;
cin>>n;
for(int i=1;i<=n;i++){
nex[i]=i+1;
pre[i]=i-1;
if(i==1){
pre[i]=n;
}
if(i==n){
nex[i]=1;
}
}
int cur=1;
for(int i=1;i<=n;i++){
int ciclu=i;
ciclu%=(n-i+1);
if(ciclu==0)
cur=nex[cur];
for(int j=1;j<=ciclu;j++){
cur=nex[cur];
}
cout<<cur<<" ";
nex[pre[cur]]=nex[cur];
pre[nex[cur]]=pre[cur];
}
return 0;
}