Cod sursa(job #1736617)
Utilizator | Data | 2 august 2016 12:00:04 | |
---|---|---|---|
Problema | Generare de permutari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
using namespace std;
#define MAX 8
ifstream in("permutari.in");
ofstream out("permutari.out");
int n=3;
int v[MAX];
void print(int v[MAX]) {
for (int i=0;i<n;i++) {
out<<v[i]<<" ";
}
out<<"\n";
}
bool isValid(int i) {
for (int j=0;j<i;j++)
if (v[j]==v[i])
return false;
return true;
}
void bkt(int x) {
if (x==n) {
print(v);
return;
}
for (int i=1;i<=n;i++) {
v[x]=i;
if (isValid(x))
bkt(x+1);
}
}
int main() {
in>>n;
bkt(0);
return 0;
}