Cod sursa(job #2180281)
| Utilizator | Data | 20 martie 2018 19:11:58 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#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) {
for (int i=1;i<=n;i++) {
v[x]=i;
if (is_valid(x)) {
if (x==n) {
print();
return;
}
else
bkt(x+1);
}
}
}
int main() {
in>>n;
bkt(0);
return 0;
}
