Pagini recente » Cod sursa (job #1166400) | Borderou de evaluare (job #307874) | Cod sursa (job #2116174) | Cod sursa (job #1568591)
#include<cstdio>
using namespace std;
int v[9],n;
bool km9[9];
void print()
{
for(int i=0; i<n; i++) printf("%d ",v[i]);
printf("\n");
}
void bt(int k)
{
for(int a=1; a<=n; a++)
{
if(!km9[a-1])
{
v[k]=a;
km9[a-1]=1;
if(k<n-1) bt(k+1);
else print();
km9[a-1]=0;
}
}
}
int main()
{
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%d",&n);
bt(0);
}