Pagini recente » Cod sursa (job #1149433) | Cod sursa (job #333414) | Monitorul de evaluare | fmi-no-stress-3/solutii | Cod sursa (job #277714)
Cod sursa(job #277714)
#include<stdio.h>
int a[10],b[10];
void back(int k,int len)
{
if(k-1 == len)
{
for(int i = 1; i <= len;i++)
printf("%d ",a[i]);
printf("\n");
}
else
{
for(int i = 1; i <= len; i++)
{ if(!b[i])
{
a[k] = i;
b[i] = 1;
back(k+1,len);
b[i] = 0;
} }
}
}
int main()
{
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
int n;
scanf("%d",&n);
back(1,n);
fclose(stdin); fclose(stdout);
return 0;
}