Pagini recente » Cod sursa (job #1497342) | Cod sursa (job #2274985) | Cod sursa (job #1164846) | Cod sursa (job #422224) | Cod sursa (job #1120838)
#include<cstdio>
using namespace std;
int n,i,x[10],ap[10];
void back(int poz)
{
if(poz==n+1)
{
for(i=1;i<=n;i++)
{
printf("%d ",x[i]);
}
printf("\n");
return ;
}
int i;
for(i=1;i<=n;i++)
{
if(ap[i]==0)
{
ap[i]=1;
x[poz]=i;
back(poz+1);
ap[i]=0;
}
}
}
int main()
{
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%d",&n);
back(1);
return 0;
}