Cod sursa(job #2206798)
| Utilizator | Data | 23 mai 2018 20:27:51 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
using namespace std;
ifstream cin("permutari.in");
ofstream cout("permutari.out");
int n, k, st[10000], fr[10000];
void Afis()
{
for(int i = 1; i <= n; i++)
cout << st[i] << " ";
cout << '\n';
}
void BT(int p)
{
if(p == n+1)
Afis();
else
for(int i = 1; i <= n; i++)
{
if(fr[i] == 0)
{
st[p] = i;
fr[i]++;
BT(p+1);
fr[i]--;
}
}
}
int main()
{
cin >> n;
BT(1);
return 0;
}
