Cod sursa(job #312116)
| Utilizator | Data | 5 mai 2009 08:44:58 | |
|---|---|---|---|
| Problema | Order | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.43 kb |
#include<fstream.h>
int main()
{
long a[1000],m,j,ver,gasit,i,n;
ifstream f("order.in");
ofstream g("order.out");
f>>n;
for(i=1;i<=n;i++)
a[i]=i;
gasit=1;
m=0;
i=1;
ver=1;
while(gasit)
{
if(i<n)
i++;
else
i=1;
if(a[i]!=0)
m++;
if(ver==m){ ver++;
g<<a[i]<<" ";
m=0;
a[i]=0;
}
gasit=0;
for(j=1;j<=n;j++)
if(a[j]!=0) gasit=1;
}
return 0;
}
