Cod sursa(job #971160)
Utilizator | Antonesi Florean Costin costin7856 | Data | 8 iulie 2013 17:28:43 |
---|---|---|---|
Problema | Order | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.65 kb |
#include<fstream>
#define dim 30009
using namespace std;
long n,pas,copil,t[dim];
int main()
{
ifstream f("order.in");
ofstream g("order.out");
f>>n;
for(int i=1;i<=n;i++)
t[i]=1;
pas=1;
for(int i=1;i<=n;i++)
{
copil=0;
while(copil!=i)
{
if(t[pas]==1&&pas<=n)
{
copil++;
if(copil!=i)
pas++;
}
if(!t[pas])
pas++;
if(pas>n)
pas=1;
}
t[pas]=0;
if(pas==n)
g<<1<<" ";
else
g<<pas+1<<" ";
}
}