Pagini recente » Cod sursa (job #1339972) | Cod sursa (job #373294) | Cod sursa (job #1648489) | Cod sursa (job #166438) | Cod sursa (job #404538)
Cod sursa(job #404538)
#include<cstdio>
const int N=9;
int sol[N],n ;
bool marcat[N];
void afisare()
{
int i;
for ( i=1 ; i<=n ; i++ )
printf("%d ",sol[i]);
printf("\n");
}
/*
bool valid(int p)
{
for (int i=1;i<=n;i++)
if (sol[i]==sol[p]) return false;
return true;
*/
void bkt (int p)
{
if (p==n+1)
{
afisare () ;
return ;
}
for ( int i=1 ; i<=n ; i++ )
{
if(marcat[i])
continue;
sol[p]=i;
marcat[i]=true;
bkt(p+1);
//if (valid(p)) bkt(p+1);
}
}
int main()
{
freopen ( "permutari.in" , "r" , stdin ) ;
freopen ( "permutari.out" , "w" , stdout ) ;
scanf("%d",&n) ;
bkt (1) ;
return 0;
}