Pagini recente » Cod sursa (job #758262) | Cod sursa (job #833519) | Cod sursa (job #474685) | Cod sursa (job #833526) | Cod sursa (job #2298089)
#include <stdio.h>
using namespace std;
int use[10],x[10],n;
void afis(int k)
{
for(int i=1;i<=k;i++) printf("%d ",x[i]);
printf("\n");
}
void bkt(int k){
int i;
for(i=1;i<=n;i++){
if(use[i]==0){
use[i]=1;
x[k]=i;
if(k<n) bkt(k+1);
else afis(k);
use[i]=0;
}
}
}
int main()
{freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%d",&n);
bkt(1);
return 0;
}