Pagini recente » Cod sursa (job #2267957) | Cod sursa (job #2351348) | Cod sursa (job #1337055) | Cod sursa (job #1649234) | Cod sursa (job #1535497)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
int a[10], k, n;
bool valid(int k) {
for(int i = 1; i < k; i ++)
if(a[k] == a[i])
return false;
return true;
}
void afisare() {
for(int i = 1; i <= n; i++)
g << a[i] << " ";
g << endl; // !!
}
void bkt(int k) {
if(k == n + 1)
afisare();
int i;
for(i = 1; i <= n; i ++)
{
a[k] = i;
if(valid(k)) {
bkt(k + 1);
}
}
}
int main()
{
f >> n;
bkt(1);
return 0;
}