hdu 1027 next_permutation

hdu 1027 next_permutation

next_permutation  求全排列的的下一个

#include < iostream >
#include < algorithm >
#include  < functional >
using   namespace  std;
int  data[ 1010 ];

int  main()
{
     int  n,m;
     while (scanf( " %d%d " , & n, & m) != EOF)
    {
         for ( int  i  =   0 ; i  <  n; i  ++ )
            data[i]  =  i + 1 ;
        sort(data,data + n);
        m  -- ;
         while (m -- )
            next_permutation(data,data + n);
         for ( i  =   0 ;i < n;i ++ )
            printf(i  == 0   ? " %d " : "  %d " ,data[i]);
        printf( " \n " );

    }
     return   0 ;
}