Ignatius and the Princess II (HDU 1027) ——next_permutation排列函数
来源:互联网 发布:sql教学视频 编辑:程序博客网 时间:2024/05/22 01:45
Ignatius and the Princess II
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4431 Accepted Submission(s): 2639
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
程序如下:
//next_permutation:使一个数列或字符串变成比它小(字典序)的数列或字符串,是按排序一个一个变的//prev_permutation:与上面正好相反#include<cstdio>#include<algorithm>//函数所需头文件using namespace std;int main(){ int m,n,i,a[1010]; while(~scanf("%d%d",&n,&m)) { for(i=1; i<=n; i++) a[i]=i; int k=1; do { if(k==m) { for(i=1; i<=n; i++) { if(i==1) printf("%d",a[i]); else printf(" %d",a[i]); } break; } k++; }while(next_permutation(a+1,a+n+1)); printf("\n"); } return 0;}
0 0
- Ignatius and the Princess II (HDU 1027) ——next_permutation排列函数
- HDU——1027Ignatius and the Princess II(next_permutation函数)
- HDU 1027 Ignatius and the Princess II(全排列next_permutation函数)
- HDU.1027 Ignatius and the Princess II【全排列:关于next_permutation问题】(3.14)
- HDU 1027 Ignatius and the Princess II(stl,next_permutation)
- HDU 1027 Ignatius and the Princess II next_permutation函数(也可以用DFS......)
- HDU 1027 Ignatius and the Princess II(全排列)
- next_permutation & prev_permutation & hdu 1027 Ignatius and the Princess II
- HDU 1027 Ignatius and the Princess II (next_permutation)
- HDU 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函数
- HDOJ 1027 Ignatius and the Princess II(找出第m大排列,STL,next_permutation()函数的简单使用)
- Ignatius and the Princess II( next_permutation() )
- HDU 1027 Ignatius and the Princess II(next_permutation()的应用)
- HDU 1027 Ignatius and the Princess II 全排列
- hdu 1027 Ignatius and the Princess II 全排列
- HDU 1027 Ignatius and the Princess II (STL全排列)
- JavaScript对象模型-执行模型
- 求从1到n这n个整数的十进制表示中1出现的次数
- Projections(投影)小例子
- C# 对Ini文件操作(C# ini文件操作类)
- 智能手机支付何去何从
- Ignatius and the Princess II (HDU 1027) ——next_permutation排列函数
- 获取线程级别的session
- 数据结构与算法(5)--线性表
- 一个MFC调用脚本的类(javascript ,vbscript)
- ALLEGRO 静态铜 动态铜 正片 负片
- 事务的四大特性
- 批量为shp文件加字段并赋值文件名
- C语言 # 与 ## 的妙用
- PCB覆铜的作用