【杭电oj】1027 - Ignatius and the Princess II(STL - 全排列)
来源:互联网 发布:历年双十一淘宝销售额 编辑:程序博客网 时间:2024/05/17 04:32
点击打开题目
Ignatius and the Princess II
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6900 Accepted Submission(s): 4083
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
用STL的全排列函数就好做多了。
代码如下:
#include <cstdio>#include <algorithm>using namespace std;int main(){int n,k;int num[1000+11];while (~scanf ("%d %d",&n,&k)){for (int i = 1 ; i <= n ; i++)num[i] = i;k--;while (k--)next_permutation (num + 1 , num + 1 + n);for (int i = 1 ; i < n ; i++)printf ("%d ",num[i]);printf ("%d\n",num[n]);}return 0;}
0 0
- 【杭电oj】1027 - Ignatius and the Princess II(STL - 全排列)
- HDU 1027 Ignatius and the Princess II (STL全排列)
- hdu 1027 Ignatius and the Princess II (STL 全排列)
- hdoj 1027 Ignatius and the Princess II 【全排列】【STL】
- hdu 1027 Ignatius and the Princess II(STL全排列)
- 【HDU 1027 Ignatius and the Princess II】+ 全排列 + STL
- 杭电ACM OJ 1027 Ignatius and the Princess II 全排列的第N个 康托展开
- 杭电OJ 1027:Ignatius and the Princess II
- HDU 1027 Ignatius and the Princess II(全排列)
- HDU-#1027 Ignatius and the Princess II(全排列+STL)
- hdu1027 Ignatius and the Princess II (全排列 & STL中的神器)
- HDU 1027 Ignatius and the Princess II 全排列
- hdu 1027 Ignatius and the Princess II 全排列
- HDU 1027 Ignatius and the Princess II 全排列
- HDOJ 1027Ignatius and the Princess II(全排列)
- HDOJ 1027-Ignatius and the Princess II【全排列】
- hdoj 1027 Ignatius and the Princess II(全排列变形)
- hdu 1027 Ignatius and the Princess II (全排列)
- webGL第三课
- sdut 1482 二元多项式
- Arithmetic problem | 求出 N 座大楼的外轮廓线
- gradle版本不一致,解决办法
- ssm(springMVC + spring+MyBatis) 小例
- 【杭电oj】1027 - Ignatius and the Princess II(STL - 全排列)
- 使用Maven搭建Struts2+Spring3+Hibernate4的整合开发环境
- 利用OpenCV读取大华网络摄像头
- FLASH禁止覆盖绝对定位 wmode="opaque"
- Tricky Sum(纯数学计算)
- php共享内存shmop初探
- Volatility 为Centos6.6系统做profile方法
- C/C++问题汇总
- Linux Shell中的特殊符号和含义简明总结(包含了绝大部份)