Cod sursa(job #971335)
Utilizator | Antonesi Florean Costin costin7856 | Data | 8 iulie 2013 22:19:06 |
---|---|---|---|
Problema | Order | Scor | 65 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.45 kb |
#include<fstream>
#define dim 300009
using namespace std;
ifstream f("order.in");
ofstream g("order.out");
int copil[dim],n,nr,pas,x;
int main()
{
f>>n;
nr=n;
for(int i=1;i<=n;i++)
copil[i]=i+1;
copil[n]=1;
pas=1;
x=1;
while(nr)
{
for(int j=1;j<=pas-2;j++)
x=copil[x];
g<<copil[x]<<" ";
copil[x]=copil[copil[x]];
pas++;
nr--;
x=copil[x];
}
}