题目:Now our hero finds the door to the BEelzebub feng5166. He opens the door and finds feng5166 is about to kill our pretty Princess. But now the BEelzebub has to beat our hero first. feng5166 says, “I have three question for you, if you can work them out, I will release the Princess, or you will be my dinner, too.” Ignatius says confidently, “OK, at last, I will save the Princess.”
“Now I will show you the first problem.” feng5166 says, “Given a sequence of number 1 to N, we define that 1,2,3…N-1,N is the smallest sequence among all the sequence which can be composed with number 1 to N(each number can be and should be use only once in this problem). So it’s easy to see the second smallest sequence is 1,2,3…N,N-1. Now I will give you two numbers, N and M. You should tell me the Mth smallest sequence which is composed with number 1 to N. It’s easy, isn’t is? Hahahahaha…”
Can you help Ignatius to solve this problem?
Input:
The input contains several test cases. Each test case consists of two numbers, N and M(1<=N<=1000, 1<=M<=10000). You may assume that there is always a sequence satisfied the BEelzebub’s demand. The input is terminated by the end of file.
Output:
For each test case, you only have to output the sequence satisfied the BEelzebub’s demand. When output a sequence, you should print a space between two numbers, but do not output any spaces after the last number.
Sample Input:
6 4
11 8
Sample Output:
1 2 3 5 6 4
1 2 3 4 5 6 7 9 8 11 10
题目大意:
输入一个数N,规定1,2,3,…,N-1,N为第一排列顺序,第二排列顺序为1,2,3,…,N,N-1。输入两个数N、M,输出1到N的第M个排列。
答题思路:
使用next_permutation()函数对数列进行排序,定义一个初值为0的变量,在循环语句中逐渐做自增运算,并于M的数值进行判断,若此变量与M数值相等,则跳出循环,并按照当前数列顺序将数组输出。
通过代码:
#include<bits/stdc++.h>
using namespace std;
int a[2000];
int main()
{
int n,m,x;
while(cin>>n>>m)
{
x=0;
for(int i=1; i<=n; i++)
a[i]=i;
do
{
x++;
if(x==m)
break;
}
while(next_permutation(a,a+n+1));
for(int i=1; i<n; i++)
cout<<a[i]<<" ";
cout<<a[n]<<endl;
}
return 0;
}