Pagini recente » Cod sursa (job #2134708) | Cod sursa (job #2124704) | Cod sursa (job #897040) | Cod sursa (job #642142) | Cod sursa (job #180964)
Cod sursa(job #180964)
#include<stdio.h>
FILE *f=fopen("permutari.in","r"),*g=fopen("permutari.out","w");
int n,x[100];
int posibil(int k)
{
int i,j,t=1;
for(i=1;i<=k-1&&t;i++)
for(j=i+1;j<=k&&t;j++)
if(x[i]==x[j])
t=0;
return t;
}
void back(int k)
{
int i;
for(i=1;i<=n;i++)
{
x[k]=i;
if(posibil(k))
if(k==n)
{
for(int j=1;j<=n;fprintf(g,"%d ",x[j]),j++);
fprintf(g,"\n");
}
else
back(k+1);
}
}
int main()
{
fscanf(f,"%d",&n);
int k=1;
back(k);
fclose(f);
fclose(g);
return 0;
}