Cod sursa(job #1151667)
| Utilizator | Data | 24 martie 2014 11:51:14 | |
|---|---|---|---|
| Problema | Order | Scor | 25 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.85 kb |
#include <fstream>
using namespace std;
ifstream f("order.in");
ofstream g("order.out");
int a[30000],n, m=0, i=1, j;
bool ok[30000];
int main()
{
f>>n;
for (j=1; j<=n; j++) ok[j]=true;
while (m<=n)
{
int nr=0;
j=i;
bool t=false;
while (t==false)
{
if (nr<m+1)
{
j++;
j%=n;
if (j==0) j=n;
if (ok[j]==true)
{
nr++;
if (nr==m+1)
{
a[++m]=j;
ok[j]=false;
i=j;
break;
}
}
}
}
if (m==n) break;
}
for (i=1; i<=m; i++) g<<a[i]<<" ";
return 0;
}
