Cod sursa(job #1383062)
| Utilizator | Data | 9 martie 2015 21:05:42 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
using namespace std;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
int n,st[10];
bool uz[10];
void afisare()
{
for(int i = 1; i <= n; i++)
fout<<st[i]<<' ';
fout<<'\n';
}
void back(int k)
{
if(k-1==n) afisare();
else
{
for(int i = 1; i <= n; i++)
if(!uz[i])
{
st[k]=i; uz[i]=1;
back(k+1);
uz[i]=0;
}
}
}
int main()
{
fin>>n;
back(1);
return 0;
}
