Cod sursa(job #666637)
Utilizator | Eternal Heroe EternalHeroe | Data | 22 ianuarie 2012 12:37:18 |
---|---|---|---|
Problema | Generare de permutari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
using namespace std;
int N;
int X[20];
ifstream fin("permutari.in");
ofstream fout("permutari.out");
int cont(int k) {
int i;
for (i=1;i<k;i++)
if (X[i] == X[k])
return 0;
return 1;
}
void back(int k) {
if (k>N) {
for (int j = 1; j<=N;j++)
fout<<X[j]<<" ";
fout<<"\n";
return;
}
int i;
for (i=1;i<=N;i++) {
X[k] = i;
if (cont(k))
back(k+1);
}
}
int main() {
fin>>N;
back(1);
return 0;
}