Cod sursa(job #777807)
| Utilizator | Data | 13 august 2012 14:50:08 | |
|---|---|---|---|
| Problema | Order | Scor | 65 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.44 kb |
#include<fstream>
using namespace std;
int n,m,i,j,nod,urm[30001],pas,nr,tata[30001];
int main()
{
ifstream f("order.in");
ofstream g("order.out");
f>>n;
for(i=1;i<=n;++i)
urm[i]=i+1,tata[i]=i-1;
urm[n]=1;
tata[1]=n;
i=2;
while(nod<n)
{
nod++;
pas=nod-1;
while(pas)
{
--pas;
i=urm[i];
}
urm[tata[i]]=urm[i];
tata[urm[i]]=tata[i];
g<<i<<" ";
i=urm[i];
}
return 0;
}
