Pagini recente » Cod sursa (job #226689) | Cod sursa (job #2230582) | Cod sursa (job #2435563) | Cod sursa (job #631498) | Cod sursa (job #758404)
Cod sursa(job #758404)
#include<stdio.h>
#define max 10000
int a[max],b[max],i,j,n;
void rezolva(int j)
{
int i;
if(j==n+1)
{
printf("%d",a[1]);
for(i=2;i<=n;i++)
printf(" %d",a[i]);
printf("\n");
}
for(i=1;i<=n;i++)
{
if(b[i]==0)
{
a[j]=i;
b[i]=1;
rezolva(j+1);
b[i]=0;
}
}
}
int main()
{
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%d",&n);
rezolva(1);
}