http://poj.org/problem?id=1833
题意:给定一个n值,代表1~n个数的全排列,然后给定一个m值,代表在给定序列的后第m个全排列,下一行给定初始序列;
解析:读入序列,使用while循环m次next_permutation进行全排列
next_permutation用法http://www.cplusplus.com/reference/algorithm/next_permutation/
#include<map>
#include<set>
#include<list>
#include<cmath>
#include<ctime>
#include<deque>
#include<stack>
#include<bitset>
#include<cstdio>
#include<vector>
#include<cstdlib>
#include<cstring>
#include<iomanip>
#include<numeric>
#include<sstream>
#include<utility>
#include<iostream>
#include<algorithm>
#include<functional>
using namespace std ;
int main()
{
int Case , n , k ;
int op1[ 10005 ] , op2[ 10005 ] ;
cin >> Case ;
while( Case-- )
{
cin >> n >> k ;
for( int i = 0 ; i < n ; ++i )
{
scanf( "%d" , &op1[ i ] ) ;
}
//sort( op1 , op1 + n ) ;
/* for( int i = 0 ; i < n ; ++i )
printf( "%d\n" , op1[ i ] );
do
{
for( int i = 0 ; i < n ; ++i )
printf( "%d" , op1[ i ] );
printf( "\n" ) ;
}while( next_permutation( op1 , op1 + n ) );*/
while( k-- )
next_permutation( op1 , op1 + n ) ;
for( int i = 0 ; i < n - 1 ; ++i )
printf( "%d " , op1[ i ] );
printf( "%d\n" , op1[ n - 1 ] ) ;
}
return 0;
}