HDOJ 1027 Ignatius and the Princess II(找出第m大排列,STL,next_permutation()函数的简单使用)
来源:互联网 发布:java开发必备技能 编辑:程序博客网 时间:2024/05/29 18:25
Ignatius and the Princess II
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 5645 Accepted Submission(s): 3320
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
nest_permutation函数的简单介绍见本博客上一篇博文。
此题求1~n的数列的第m大的数列。
代码如下:
#include<stdio.h>#include<algorithm> using namespace std;int a[1010];int main(){int n,m,i;while(scanf("%d%d",&n,&m)!=EOF){for(i=0;i<n;i++) a[i]=i+1;while(--m)next_permutation(a,a+n);for(i=0;i<n-1;i++) printf("%d ",a[i]);printf("%d\n",a[n-1]);}return 0;}
0 0
- HDOJ 1027 Ignatius and the Princess II(找出第m大排列,STL,next_permutation()函数的简单使用)
- HDOJ--1027--Ignatius and the Princess II(利用next_permutation函数去做的)
- HDU 1027 Ignatius and the Princess II(stl,next_permutation)
- HDOJ 1027 Ignatius and the Princess II - next_permutation函数
- Ignatius and the Princess II (HDU 1027) ——next_permutation排列函数
- hdoj 1027 Ignatius and the Princess II 【全排列】【STL】
- HDOJ 题目1027 Ignatius and the Princess II(STL)
- hdoj 1072 Ignatius and the Princess II 【next_permutation() 找第m个数】
- Ignatius and the Princess II( next_permutation() )
- HDU.1027 Ignatius and the Princess II【全排列:关于next_permutation问题】(3.14)
- hdoj Ignatius and the Princess II (全排列)
- HDU 1027 Ignatius and the Princess II【STL- next_permutation全拍列】
- HDU 1027 Ignatius and the Princess II(全排列next_permutation函数)
- HDU——1027Ignatius and the Princess II(next_permutation函数)
- HDU 1027 Ignatius and the Princess II next_permutation函数(也可以用DFS......)
- HDOJ 1027 Ignatius and the Princess II (DFS全排列)
- HDOJ 1027Ignatius and the Princess II(全排列)
- HDOJ 1027-Ignatius and the Princess II【全排列】
- 论坛的一些相关总结(全相位和频谱细化)
- MarkdownPad2注册码
- Comments
- Linux中gedit打开包含中文内容文件乱码的问题
- 怎样自定义枚举类
- HDOJ 1027 Ignatius and the Princess II(找出第m大排列,STL,next_permutation()函数的简单使用)
- 我们如何看Java的开发环境???
- CMD格式 清理磁盘
- 互联网的长在线、心跳和断线重连
- PropertySheet Modifier API
- 如何在Swift中创建自定义控件
- 线性规划问题求解的几种可能结果及判定方法
- linux下小工具使用
- C#显示当前日期时间