[HDU] 1027 Ignatius and the Princess II
2017-03-27 15:50
405 查看
题目:
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和M。求N个数的第M个全排列。
分析:STL的next_permutation()怼。
代码:
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和M。求N个数的第M个全排列。
分析:STL的next_permutation()怼。
代码:
#include<iostream> #include<cstdio> #include<queue> #include<algorithm> #include<map> #include<cstring> using namespace std ; const int MAX_N = 1000+50 ; int arry[MAX_N] ; int main(){ //freopen("in.txt","r",stdin); //freopen("out.txt","w",stdout); int n , m ; while(cin>>n>>m){ for(int i = 1; i <= n ; i++) arry[i] = i ; m--; while(m--){ next_permutation(arry+1,arry+1+n); } for(int i = 1; i <= n ; i++) printf("%d%c",arry[i]," \n"[i==n]); } return 0 ; }
相关文章推荐
- HDU 1027 Ignatius and the Princess II【求第M个排列】
- HDU 1027 Ignatius and the Princess II(求由1-n组成按字典序排序的第m个序列)
- 【STL相关】hdu 1027 Ignatius and the Princess II【STL】
- HDU 1027 Ignatius and the Princess II(逆康托展开)
- HDU 1027 Ignatius and the Princess II
- hdu 1027 Ignatius and the Princess II
- HDU 1027 Ignatius and the Princess II(DFS)
- HDU 1027 Ignatius and the Princess II
- HDU 1027 Ignatius and the Princess II
- HDU 1027 Ignatius and the Princess II (next_permutation)
- HDU 1027 Ignatius and the Princess II 全排列
- hdu 1027 Ignatius and the Princess II(产生第m大的排列,next_permutation函数)
- HDU 1027--Ignatius and the Princess II【next_permutation】
- next_permutation & prev_permutation & hdu 1027 Ignatius and the Princess II
- HDU 1027 Ignatius and the Princess II
- hdu 1027 ignatius and the princess ii
- HDU:1027 Ignatius and the Princess II
- hdu 1027 Ignatius and the Princess II (STL 全排列)
- 排列-hdu_1027_Ignatius and the Princess II
- HDU-#1027 Ignatius and the Princess II(全排列+STL)