Ignatius and the Princess II(bfs)
来源:互联网 发布:mysql时间函数 编辑:程序博客网 时间:2024/05/29 02:52
Ignatius and the Princess II
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 8071 Accepted Submission(s): 4751
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
0 0
- Ignatius and the Princess II(bfs)
- HDU1027(Ignatius and the Princess II)
- Ignatius and the Princess II( next_permutation() )
- Ignatius and the Princess II
- Ignatius and the Princess II
- Ignatius and the Princess II
- Ignatius and the Princess II
- Ignatius and the Princess II
- HDU1026——Ignatius and the Princess I(BFS)
- HDU-1026 Ignatius and the Princess I (BFS)
- Ignatius and the Princess I(hdu1026,带权值的bfs)
- hdu 1026 Ignatius and the Princess I(BFS)
- hdu1026 Ignatius and the Princess I(BFS+路径记录)
- hdu 1026 Ignatius and the Princess I(BFS)
- hdu1026 Ignatius and the Princess I(bfs+路径)
- hdu1026 Ignatius and the Princess I (bfs)
- hdu 1026 Ignatius and the Princess I(bfs)
- HDU 1026 Ignatius and the Princess I (BFS)
- Java 逻辑与 位与 逻辑或 位或
- Brocade 光纤交换机改密码
- NYOJ 202 红黑树
- java多线程系列--AQS-01之独占锁原理浅析
- NPM常用指令
- Ignatius and the Princess II(bfs)
- fully_connected_feed代码说明
- Android加载大图
- u-boot移植
- Python UnicodeEncodeError: 'gbk' codec can't encode character 解决方法
- UIImage和NSData相互转换
- leetcode345: Reverse Vowels of a String
- hrbust1530 pie
- 组合数(dfs)