搜索专题: HDU1027Ignatius and the Princess II
来源:互联网 发布:贵州省人口老龄化数据 编辑:程序博客网 时间:2024/05/29 18:17
Ignatius and the Princess II
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8497 Accepted Submission(s): 5002
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
#include<iostream>#include<cstring>#include<cstdio>using namespace std;const int N = 1000 + 5;bool visit[N];int a[N],n,m,cnt;void DFS(int cur){ if(cnt>=m) return; if(cur > n ){ cnt++; if(cnt == m) for(int i=1;i<=n;i++) printf("%d%c",a[i],i<n?' ':'\n'); return; } for(int i=1;i<=n;i++){ if(!visit[i]){ visit[i] = true; a[cur] = i; DFS(cur + 1); visit[i] = false; } }}int main(){ while(scanf("%d %d",&n,&m)==2){ cnt = 0; DFS(1); }}
阅读全文
0 0
- 搜索专题: HDU1027Ignatius and the Princess II
- hdu1027Ignatius and the Princess II
- HDU1027Ignatius and the Princess II(排序)
- hdu1027Ignatius and the Princess II <vector>
- 【全排列】HDU1027Ignatius and the Princess II/HDU1716排列2
- 搜索专题: HDU1026Ignatius and the Princess I
- 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
- 1027 Ignatius and the Princess II
- HDOJ 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 )
- hdoj1027 Ignatius and the Princess II
- HDU 1027 Ignatius and the Princess II
- js:利用文档就绪函数动态改变页面内容(innerHTML、innerText)
- 欢迎使用CSDN-markdown编辑器
- Vuex
- 国内地图数据纠偏实践:以高德地图为例
- java终极面试题目总结
- 搜索专题: HDU1027Ignatius and the Princess II
- .gitignore文件配置和无效解决办法
- 史上最简单的git教程
- css_day05_margin,line-height相关小知识点
- Knight Tournament
- Leetcode 300. Longest Increasing Subsequence
- Linux下QT中执行shell命令
- 多属性决策
- 监督学习与无监督学习