Cod sursa(job #970738)
Utilizator | Data | 7 iulie 2013 18:12:03 | |
---|---|---|---|
Problema | Order | Scor | 30 |
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 a[100001],m,j,nr,gasit,i,n;
int main()
{
f>>n;
for(i=1;i<=n;i++)
a[i]=i;
gasit=1;
i=1;
nr=1;
while(nr<=n)
{
if(i<n)
i++;
else
i=1;
if(a[i]!=0)
m++;
if(nr==m)
{
nr++;
g<<a[i]<<" ";
m=0;
a[i]=0;
}
gasit=0;
}
return 0;
}