Pagini recente » Cod sursa (job #1438795) | Cod sursa (job #1503278) | Cod sursa (job #2795141) | Cod sursa (job #11185) | Cod sursa (job #1129306)
/*
Keep It Simple!
*/
#include<stdio.h>
int v[10],N;
int valid(int k)
{
for(int i=1;i<k;i++)
if(v[i] == v[k])
return 0;
return 1;
}
void Print(int k)
{
for(int i=1;i<=k;i++)
printf("%d ",v[i]);
printf("\n");
}
void Back(int k)
{
for(int i=1;i<=N;i++)
{
v[k] = i;
if(valid(k))
{
if(k == N)
Print(k);
else if( k<N )
Back(k+1);
}
}
}
int main()
{
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%d",&N);
Back(1);
}