Pagini recente » Cod sursa (job #2263975) | Cod sursa (job #1358697) | Cod sursa (job #1367315) | Cod sursa (job #2438315) | Cod sursa (job #1719547)
#include <iostream>
#include <fstream>
using namespace std;
int main(){
int i,j,n,v[30001],poz=1,ii,primadata=1;
ifstream in("order.in");
ofstream out("order.out");
in >> n;
for(i=1;i<=n;i++)v[i]=i;
for(i=1;i<=n;i++){
ii=i;
if(poz==n-i+2)primadata=1;
for(j=1;j<=ii;j++){
poz++;
if(poz>n-i+1)poz=1;
}
if(primadata==1)primadata=0;else
poz--;
out << v[poz] << ' ';
v[poz]=0;
for(j=poz;j<=n-i+1;j++)v[j]=v[j+1];
}
}