Cod sursa(job #412036)
| Utilizator | Data | 5 martie 2010 12:19:04 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include<fstream>
#define nmax 20
using namespace std;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
int x[nmax],valid[nmax],n;
void afisare()
{for(int i=1;i<=n;i++)
fout<<x[i]<<" ";
fout<<'\n';
}
void back(int k)
{if(k<=n)
{for(x[k]=1;x[k]<=n;x[k]++)
if(valid[x[k]]==0)
{valid[x[k]]=1;
back(k+1);
valid[x[k]]=0;
}
}
else afisare();
}
int main()
{fin>>n;
back(1);
fin.close();
fout.close();
return 0;
}
