hdu1027Ignatius and the Princess II <vector>
来源:互联网 发布:巨人网络估值 编辑:程序博客网 时间:2024/06/03 18:57
搜分类是数学或者STL,看题解数学的方法没看懂,STL的vector真心赞
http://blog.sina.com.cn/s/blog_9f7ea4390101101u.html 讲next_permutation 好东西啊
本题属于链接的最后一种情况吧
#include <iostream>#include<cstdio>#include<algorithm>#include<vector>using namespace std;int n,m,i;int main(){ while(cin>>n>>m) { vector<int>ivec; ivec.clear(); vector<int>::iterator iter; for(i=1;i<=n;i++) ivec.push_back(i); for(i=1;i<m;i++) next_permutation(ivec.begin(),ivec.end()); for(i=0,iter=ivec.begin();iter!=ivec.end();++i,++iter)//iter之前一直写成i编译提示我需要运算符重载orz cout<<(i==0?"":" ")<<*iter; cout<<endl; } return 0;}
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
0 0
- hdu1027Ignatius and the Princess II <vector>
- hdu1027Ignatius and the Princess II
- HDU1027Ignatius and the Princess II(排序)
- 搜索专题: HDU1027Ignatius and the Princess II
- 【全排列】HDU1027Ignatius and the Princess II/HDU1716排列2
- 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
- HDU 1027 Ignatius and the Princess II
- Linux tcpdump命令详解
- 第七节 linux c的基本应用
- 【面试题】-反转句子
- [Phonegap+Sencha Touch] 移动开发5、Sencha touch结合Phonegap使用
- SSH:java.lang.ClassNotFoundException
- hdu1027Ignatius and the Princess II <vector>
- EL表达式的判断
- 第八节linux文件系统
- [文摘] Zend Guard 5.5版本破解方式和加密后永不过期的操作方法
- CENTOS 6.5 配置YUM安装NGINX
- 关于程序员面试宝典书上一道删除单链表头元素的函数的题小结
- phpcms 动态调用 图片
- 第九节 标准输入输出
- 什么是姿态角(Euler角)pitch yaw roll