Pagini recente » Cod sursa (job #371356) | Cod sursa (job #470740) | Cod sursa (job #943926) | Cod sursa (job #3154098) | Cod sursa (job #2422540)
#include <fstream>
using namespace std;
ifstream cin ("order.in");
ofstream cout ("order.out");
int n;
int nxt[30005], lst[30005];
int main() {
cin >> n;
for(int i = 1; i <= n; i++)
nxt[i] = (i < n ? i + 1 : 1), lst[i] = (i > 1 ? i - 1 : n);
int poz = 1;
for(int i = 1; i <= n; i++) {
poz = nxt[poz];
for(int j = 1; j <= (i - 1) % (n - i + 1); j++)
poz = nxt[poz];
cout << poz << " ";
nxt[lst[poz]] = nxt[poz];
lst[nxt[poz]] = lst[poz];
}
return 0;
}