Pagini recente » Cod sursa (job #891668) | Cod sursa (job #163561) | Cod sursa (job #711102) | Cod sursa (job #812459) | Cod sursa (job #2180273)
#include <fstream>
#include <iostream>
using namespace std;
#define MAX 8
int n,v[MAX];
ifstream in("permutari.in");
ofstream out("permutari.out");
void print() {
for (int i=0;i<n;i++)
out<<v[i]<<" ";
out<<endl;
}
bool is_valid(int x) {
for (int i=0;i<x;i++)
if (v[i]==v[x])
return false;
return true;
}
void bkt(int x) {
if (x==n) {
print();
return;
}
for (int i=1;i<=n;i++) {
v[x]=i;
if (is_valid(x))
bkt(x+1);
}
}
int main() {
in>>n;
bkt(0);
return 0;
}