Cod sursa(job #471072)
| Utilizator | Data | 16 iulie 2010 19:51:37 | |
|---|---|---|---|
| Problema | Order | Scor | 65 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.38 kb |
#include<fstream>
using namespace std;
ifstream f("order.in");
ofstream g("order.out");
int cop[30001],n,nr,step,i,j;
int main()
{ f>>n;
nr=n;
for(i=1;i<=n;i++)
cop[i]=i+1;
cop[n]=1;
step=1 , i=1;
while(nr)
{ for(j=1;j<step-1;j++)
i=cop[i];
g<<cop[i]<<" ";
cop[i]=cop[cop[i]];
step++;
nr--;
i=cop[i];
}
f.close();
g.close();
return 0;
}
