Pagini recente » Cod sursa (job #1698123) | Cod sursa (job #2772687) | Cod sursa (job #3167992) | Cod sursa (job #2430719) | Cod sursa (job #1667836)
#include <iostream>
#include <fstream>
using namespace std;
int n, p[10], u[10];
ifstream fin("permutari.in");
ofstream fout("permutari.out");
void afisare(){
for(int i=1; i<=n; i++) fout<<p[i]<<" ";
fout<<endl;
}
void generare(int k){
if (k-1==n) afisare(); else
for(int i=1; i<=n; i++){
if(!u[i]) {p[k]=i; u[i]=1;
generare(k+1);
u[i]=0;
}
}
}
int main()
{fin>>n;
generare(1);
return 0;
}