Pagini recente » Cod sursa (job #2719941) | Cod sursa (job #591552) | Cod sursa (job #596501) | Cod sursa (job #2581214) | Cod sursa (job #2751272)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
int main(){
int n;
ifstream fin("order.in");
ofstream fout("order.out");
fin >> n;
int copii[n+1];
vector < int > eliminati;
for( int i = 1; i <= n; i++ ){
copii[i] = i;
}
int pas = 1;
int start = 1;
while( n != 0 ){
int eliminat = (start+pas)%n;
if( eliminat == 0 ) eliminat = n;
fout << copii[eliminat] << " ";
for( int i = eliminat; i < n; i++ ){
copii[i] = copii[i+1];
}
if( eliminat == n ) start = 1;
else start = eliminat-1;
n--;
pas++;
}
}