Pagini recente » Cod sursa (job #3239043) | Cod sursa (job #1061829) | Cod sursa (job #707007) | Cod sursa (job #1098223) | Cod sursa (job #1244967)
#include <iostream>
#include <cstdio>
using namespace std;
int sol[10],n,v[10],ok[20];
void afis ()
{
for ( int i = 1 ; i <= n ; ++i )
printf("%d " , sol[i] );
printf ("\n");
}
void back (int k)
{
if (k==n+1){
afis();
}
else
for ( int i = 1 ; i <= n ; ++i )
{
if (ok[i]==0){
sol[k]=i;
ok[i]=1;
back (k+1);
ok[i]=0;
}
}
}
int main()
{
freopen ("permutari.in" , "r" , stdin ) ;
freopen ("permutari.out" , "w" , stdout ) ;
scanf ("%d" , &n );
back(1);
return 0;
}