Pagini recente » Cod sursa (job #3278931) | Cod sursa (job #2577721) | Cod sursa (job #1355819) | Cod sursa (job #2803199) | Cod sursa (job #2630875)
#include <iostream>
#include<fstream>
using namespace std;
int n,s[20];
ifstream f("permutari.in");
ofstream g("permutari.out");
void citeste(){
f>>n;}
void afiseaza()
{ for (int i=1;i<=n;i++) g<<s[i]<<" ";g<<"\n"; }
int valid(int k)
{ for(int i=1;i<k;i++) if (s[i]==s[k]) return 0; return 1; }
void bkt (int k)
{ if(k==n+1) afiseaza();
else for(int i=1;i<=n;i++)
{ s[k]=i;if (valid(k)) bkt (k+1); } }
int main(){ citeste(); bkt(1); return 0;}