【HDU】 1027 Ignatius and the Princess II
来源:互联网 发布:淘宝客单价怎么计算 编辑:程序博客网 时间:2024/06/08 13:58
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 1024 1035 1030
题意:求全排列的第m个序列
AC代码:
#include<cstdio>#include<algorithm>using namespace std;int main(){int n,m;int a[1000+5];while(~scanf("%d %d",&n,&m)){for(int i=0;i<n;++i){a[i]=i+1;}int j=0;while(next_permutation(a,a+n)) //STL中的库函数,进行全排列。循环一次找到下一个排列 {j++;if(j==m-1){for(int i=0;i<n;i++)printf("%d%c",a[i],i==n-1?'\n':' ');break;}}}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
- MySQL数值函数
- SSM实现文件上传下载总结
- weblogic安装
- Echarts 如何设置多个图表自适应窗口大小
- RabbitMQ
- 【HDU】 1027 Ignatius and the Princess II
- 2017年Android第三方框架排行榜
- Python 获取二进制中1的位置
- Spring单例模式与线程安全
- Win10不能直接拖文件进行打开解决 办法
- JavaEE学习12--JDBC(上)
- as 导入eclipse项目报错:Error:Application and test application id cannot be the same: both are 'com.hjy.act
- 商城项目--产品的加减中的watch监听
- 外网远程桌面连接内网服务器教程(超详细)