Cod sursa(job #972200)
| Utilizator | Data | 11 iulie 2013 11:29:42 | |
|---|---|---|---|
| Problema | Order | Scor | 65 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.57 kb |
#include<fstream>
using namespace std;
ifstream f("order.in");
ofstream g("order.out");
int n,m,i,j,nod,b[30001],nr,a[30001],mod;
int main()
{
f>>n;
for(i=1;i<=n;++i)
{
b[i]=i+1;
a[i]=i-1;
}
b[n]=1;
a[1]=n;
i=2;
while(nod<n)
{
mod=nod;
nod++;
nr=nod-1;
if(nr>mod)
nr=nr%mod;
while(nr)
{
nr--;
i=b[i];
}
b[a[i]]=b[i];
a[b[i]]=a[i];
g<<i<<" ";
i=b[i];
}
return 0;
}
