Cod sursa(job #2040632)
| Utilizator | Data | 16 octombrie 2017 08:07:16 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
using namespace std;
ifstream in("permutari.in");
ofstream out("permutari.out");
int n,st[10],f[10];
bool valid(int k){
for (int i=1;i<=k-1;i++)
if (st[i]==st[k]) return false;
return true;
}
void afisare()
{
for (int i=1; i<=n; i++)
out<<st[i]<<" ";
out<<'\n';
}
void bkt(int k)
{
if (k==n+1) afisare();
for (int i=1; i<=n; i++)
{
st[k]=i;
if(valid(k))
bkt(k+1);
}
}
int main()
{
in>>n;
bkt(1);
return 0;
}
