深搜之全排列问题

#include<bits/stdc++.h>

using namespace std;

int n,m,a[100],s=0,b[100];

int CJ( int );

int JF();

 

int CJ( int x)

{

     int i;

     for ( int i=1;i<=n;i++)

     {

         if (!b[i])

         {

             a[x]=i;

             b[i]=1;

             if (x==n)

             JF();

             else

             CJ(x+1);

             b[i]=0;

         }  

     }

}

int JF()

{

         for ( int k=1;k<=n;k++)

         cout<<a[k]<< " " ;

         cout<< "\n" ;

}

int main()

{

     cin>>n;

     CJ(1);

}

转载于:https://www.cnblogs.com/5t2y0/p/9464888.html