Pagini recente » Cod sursa (job #1890655) | Cod sursa (job #802915) | Cod sursa (job #2816592) | Cod sursa (job #612625) | Cod sursa (job #305161)
Cod sursa(job #305161)
#include<stdio.h>
int n,p[10];
int ok(int k)
{for(int i=1;i<k;i++)
if(p[i]==p[k]) return 0;
return 1;}
void scrie()
{for(int i=1;i<=n;i++) printf("%d ",p[i]);
printf("\n");}
void back(int k)
{if(k==n+1) scrie();
else
for(int i=1;i<=n;i++)
{p[k]=i;
if(ok(k)) back(k+1);}
}
int main()
{freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%d",&n);
back(1);
return 0;
}