Cod sursa(job #1960063)
Utilizator | Data | 10 aprilie 2017 10:25:45 | |
---|---|---|---|
Problema | Order | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.52 kb |
#include <fstream>
using namespace std;
ifstream fin("order.in");
ofstream fout("order.out");
#define nmax 30005
int n, v[nmax];
int main()
{
int i, j, nr, poz;
fin>>n; fin.close();
nr=n;
j=i=1;
while(nr)
{
poz=1;
while(poz<=i)
{
j++;
if(j==n+1)
j=1;
if(!v[j])
poz++;
}
fout<<j<<' ';
v[j]=1;
nr--;
i++;
}
fout.close();
return 0;
}