Cod sursa(job #1151672)
Utilizator | Crivat Victor victor_crivat | Data | 24 martie 2014 11:52:30 |
---|---|---|---|
Problema | Order | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.5 kb |
#include <fstream>
using namespace std;
int n,i,j,a[10000],poz,m;
ifstream f("order.in");
ofstream g("order.out");
int main()
{f>>n;
m=n;
for (i=1;i<=n;i++) a[i]=i;
poz=2;
for (i=1;i<=m;i++)
{
if (poz<=n) { g<<a[poz]<<" ";
for (j=poz+1;j<=n;j++) a[j-1]=a[j];
poz+=i;
n--;
}
else {poz%=n;
g<<a[poz]<<" ";
for (j=poz+1;j<=n;j++) a[j-1]=a[j];
n--;
}
}
f.close();
g.close();
return 0;
}