Pagini recente » Cod sursa (job #2736543) | Cod sursa (job #693034) | Cod sursa (job #1434312) | Cod sursa (job #3194050) | Cod sursa (job #154207)
Cod sursa(job #154207)
#include<stdio.h>
int v[10],i,n,j;
inline void afiseaza()
{
int aux=0;
for(int i=1;i<n && aux==0 ;i++)
for(int j=i+1;j<=n && aux==0;j++)
if(v[i]==v[j])
aux=1;
if(aux==0)
{
for(i=1;i<=n;i++)
printf("%d ",v[i]);
printf("\n");
}
}
void back(int k)
{
if(k<=n+1)
{
if(k==n+1)
afiseaza();
for(int i=1;i<=n;i++)
{
v[k]=i;
back(k+1);
}
}
}
int main()
{
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%d",&n);
back(1);
return 0;
}