HDU 1027 Ignatius and the Princess II
来源:互联网 发布:林书豪16赛季数据 编辑:程序博客网 时间:2024/06/12 00:26
Ignatius and the Princess II
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8906 Accepted Submission(s): 5232
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
Author
Ignatius.L
Recommend
We have carefully selected several similar problems for you: 1026 1038 1029 1008 1024
思路:此题为按字典序全排列题,直接调用C++STL库函数next_permutation可以很简单求解
#include<stdio.h>#include<algorithm>using namespace std;int a[1010];int main(){ int n, k; while(~scanf("%d%d", &n, &k)) { for(int i=0; i<n; i++) a[i]=i+1; for(int i=1; i<k; i++) next_permutation(a, a+n); for(int i=0; i<n; i++) if(i==n-1) printf("%d\n", a[i]); else printf("%d ", a[i]); } return 0;}
阅读全文
0 0
- 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
- 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
- Redis基本操作
- 谨慎使用向下转型
- 2017-10-16 1周1次课
- Android 学习笔记(三):ListView的使用
- 实验三:栈和队列的基本操作实现及其应用——顺序栈
- HDU 1027 Ignatius and the Princess II
- VS2013下SSBA库配置
- 堆
- 数据结构实验之栈与队列三:后缀式求值
- 洛谷 P2587 [ZJOI2008]泡泡堂(贪心)
- Firefox-57.0b8 编译日志
- Spring Boot属性文件application.properties配置文档(全部)
- Xilinx FPGA 学习笔记——时钟资源
- Lucene-基础篇