Pagini recente » Cod sursa (job #2850159) | Cod sursa (job #196053) | Cod sursa (job #1039404) | Cod sursa (job #1425902) | Cod sursa (job #1405004)
#include <stdio.h>
#include <stdlib.h>
int v[15],f[15];
void bkt(int n,int p)
{
int i=1;
if(p>n){
for(i=1; i<=n; i++)
printf("%d ",v[i]);
printf("\n");
}
else
for(v[p]=1; v[p]<=n; v[p]++)
if(f[v[p]]==0)
{
f[v[p]]=1;
bkt(n,p+1);
f[v[p]]=0;
}
}
int main()
{
int n;
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%d",&n);
f[n+1]=1;
bkt(n,1);
return 0;
}