Pagini recente » Cod sursa (job #2485408) | Cod sursa (job #1973911) | Cod sursa (job #2781692) | Cod sursa (job #1114677) | Cod sursa (job #2482106)
#include <iostream>
#include <fstream>
using namespace std;
int sel[10],v[10],n;
ifstream fin ("permutari.in");
ofstream fout ("permutari.out");
bool valid (int k){
int i;
for (i = 0; i < n; ++i)
sel[i] = 0;
for (i = 0; i < k; ++i)
if (sel[v[i]])
return 0;
else
sel[v[i]] = 1;
return 1;
}
void bkt (int k){
if (k == n){
for (int i = 0; i < n; ++i)
fout << v[i] + 1 << " ";
fout << '\n';
return ;
}
for (int i = 0; i < n; ++i){
v[k] = i;
if (valid (k))
bkt (k + 1);
v[k] = 0;
}
}
int main()
{
fin >> n;
bkt (0);
return 0;
}