Pagini recente » Cod sursa (job #68133) | Cod sursa (job #2816715) | Cod sursa (job #1010424) | Cod sursa (job #77596) | Cod sursa (job #1989719)
#include<fstream>
using namespace std;
#define MAX 8
int perm[MAX];
bool checked[MAX];
void writeSol(int n,ofstream &out){
for(int i=0;i<n;i++) out<<perm[i]<<" ";
out<<"\n";
}
void back(int k, int n, ofstream &out){
if(k==n) writeSol(n,out);
for(int i=1;i<=n;i++)
if(!checked[i]){
perm[k]=i;
checked[i]=true;
back(k+1,n,out);
checked[i]=false;
}
}
int main(){
ifstream in; ofstream out;
in.open("permutari.in"); out.open("permutari.out");
out.clear();
int n;
in>>n;
back(0,n,out);
in.close(); out.close();
return 0;
}