Pagini recente » Cod sursa (job #1911694) | Cod sursa (job #354398) | Cod sursa (job #1600991) | Cod sursa (job #315191) | Cod sursa (job #1536378)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("order.in");
ofstream fout("order.out");
int Lim, pos = 1;
vector < int > v;
int main(){
int n;
fin >> n;
Lim = n;
v.resize(n);
for(int i = 0; i < n; i++) v[i] = i + 1;
for(int i = 1; i <= n; i++){
if(pos + i - 1 < Lim){
pos += i - 1;
fout << v[pos] << " ";
v.erase(v.begin() + pos);
} else {
pos = i - 1 - (Lim - pos);
pos = pos % Lim;
fout << v[pos] << " ";
v.erase(v.begin() + pos);
}
Lim--;
}
return 0;
}