Pagini recente » Cod sursa (job #618098) | Rating Oprea Ionut-Alexandru (johnski) | Cod sursa (job #570745) | Cod sursa (job #2007487) | Cod sursa (job #149024)
Cod sursa(job #149024)
#include<stdio.h>
int n,s[100];
int verif(int k)
{ for(int j=1;j<k;j++)
if(s[j]==s[k]) return 0;
return 1;
}
void afis()
{ for(int i=1;i<=n;i++)
printf("%d ",s[i]);
printf("\n");
}
void back(int k)
{ if(k>n) afis();
else for(int i=1;i<=n;i++)
{ s[k]=i;
if(verif(k))
back(k+1);
}
}
int main()
{ freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%d",&n);
back(1);
return 0;
}