HDU杭电 1027 Ignatius and the Princess II
来源:互联网 发布:后悔当程序员 编辑:程序博客网 时间:2024/06/01 19:57
http://acm.hdu.edu.cn/showproblem.php?pid=1027
Ignatius and the Princess II
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6406 Accepted Submission(s): 3791
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?
"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 411 8
Sample Output
1 2 3 5 6 41 2 3 4 5 6 7 9 8 11 10
// 全排列
学会使用STL中的next_permutation(arr,arr+n);
#include <cstdio>#include <cstring>#include <algorithm>using namespace std;int arr[1010];int main(){ int n,m; while(~scanf("%d%d",&n,&m)) { for(int i=0;i<n;++i) { arr[i]=i+1; } if(m==1) { for(int i=0;i<n-1;++i) { printf("%d ",arr[i]); } printf("%d\n",arr[n-1]); } int num=1; while(next_permutation(arr,arr+n)) { num++; if(num==m) { for(int i=0;i<n-1;++i) { printf("%d ",arr[i]); } printf("%d\n",arr[n-1]); break; } } } return 0;}
0 0
- HDU杭电 1027 Ignatius and the Princess II
- 杭电1027 Ignatius and the Princess II 字典序
- 杭电OJ 1027:Ignatius and the Princess II
- 杭电1027Ignatius 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
- 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
- hdu 1027 Ignatius and the Princess II
- Ignatius and the Princess II hdu 1027
- HDU 1027 Ignatius and the Princess II
- HDU 1027 Ignatius and the Princess II
- hdu 1027 Ignatius and the Princess II
- iOS常见的面试题详解
- 三、存储器层次结构
- C++上机报告
- poj2886Who Gets the Most Candies?【线段树单点更新】
- 【CS229 lecture16】强化学习-马尔科夫决策过程(MDP)
- HDU杭电 1027 Ignatius and the Princess II
- 四、指令系统
- BC29&&hdoj5170&&hdoj5171&&hdoj5172
- 第2周项目2-谁拿胖子说事
- 八种基本类型变量
- CXF开发webservice需要的最少jar包,CXF发布和调用客户端代码
- 树状数组
- Pentaho 6.0 安装与启动教程
- Java 环境搭建