Hdoj 1027 Ignatius and the Princess II
2018-01-09 21:32
363 查看
Problem Description
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
Author
Ignatius.L
题目分析
这是求n个数的第m个全排列,我们可以用DFS深搜做或者直接用用STL里面的next_permutation,意思是生成下一个全排列
Code
更多问题请关注个人博客,不定时更新
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
Author
Ignatius.L
题目分析
这是求n个数的第m个全排列,我们可以用DFS深搜做或者直接用用STL里面的next_permutation,意思是生成下一个全排列
Code
#include<iostream> #include<cstdio> #include<algorithm> #include<cmath> #include<cctype> #include<cstring> #include<cstdlib> #include<vector> using namespace std; typedef __int64 ll; const int MAXM = 10001; int a[MAXM]; void init(int n) { for(int i=0;i<n;i++) a[i] = i+1; } int main() { int n,m; while(cin>>n>>m) { int cnt = 1; init(n); vector<int> qwe(a,a+n); while(next_permutation(qwe.begin(),qwe.end())) { cnt++; if(m==cnt) break; } for(int i=0;i<n;i++) { printf(i==n-1 ? "%d\n" : "%d ",qwe[i]); } } return 0 ; }
更多问题请关注个人博客,不定时更新
相关文章推荐
- HDOJ HDU 1027 Ignatius and the Princess II
- Java hdoj 1027 Ignatius and the Princess II
- HDOJ 1027 Ignatius and the Princess II
- hdoj 1027 Ignatius and the Princess II 【逆康托展开】
- [HDOJ1027]Ignatius and the Princess II
- HDOJ 1027 Ignatius and the Princess II
- HDOJ 1027 Ignatius and the Princess II - next_permutation函数
- HDOJ 1027-Ignatius and the Princess II【全排列】
- 【HDOJ】1027 Ignatius and the Princess II
- hdoj1027 Ignatius and the Princess II(全排列)
- HDOJ 1027 Ignatius and the Princess II
- HDOJ 题目1027 Ignatius and the Princess II(STL)
- HDOJ--1027--Ignatius and the Princess II(利用next_permutation函数去做的)
- HDOJ 1027 Ignatius and the Princess II
- hdoj 1027 Ignatius and the Princess II
- hdoj 1027 Ignatius and the Princess II 【逆康托展开】
- HDOJ1027 Ignatius and the Princess II&&STL神器
- hdoj--1027--Ignatius and the Princess II(dfs)
- hdoj 1027 Ignatius and the Princess II 【全排列】【STL】
- hdoj 1027 Ignatius and the Princess II (全排列)