Cod sursa(job #779310)
| Utilizator | Data | 17 august 2012 14:18:15 | |
|---|---|---|---|
| Problema | Order | Scor | 65 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.45 kb |
#include<fstream>
using namespace std;
int i,j,t,p,inc,n,m,urm[300001],pas,nr,tata[300000],rez;
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;
tata[1]=n,urm[n]=1;
t=2;
while(pas<n)
{
++pas;
i=pas-1;
if(i>pas-1)
i=i%(pas-1);
while(i)
--i,t=urm[t];
urm[tata[t]]=urm[t];
tata[urm[t]]=tata[t];
g<<t<<" ";
t=urm[t];
}
return 0;
}
