HDU 1027 Ignatius and the Princess II 【next_permutation(a,a+n)的应用】
来源:互联网 发布:小米手机自动更新软件 编辑:程序博客网 时间:2024/06/07 07:19
Ignatius and the Princess II
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4859 Accepted Submission(s): 2924
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
#include<cstdio>#include<algorithm>using namespace std;int main(){ int n,m,t,i,a[1010]; while(scanf("%d %d",&n,&m)!=EOF) { for(i=0; i<n; i++) a[i]=i+1; t=0; do { t++; if(t==m) { printf("%d",a[0]); for(i=1; i<n; i++) printf(" %d",a[i]); printf("\n"); break; } }while(next_permutation(a,a+n)); } return 0;}
0 0
- HDU 1027 Ignatius and the Princess II 【next_permutation(a,a+n)的应用】
- HDU 1027 Ignatius and the Princess II(next_permutation()的应用)
- 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)
- HDU 1027 Ignatius and the Princess II【STL- next_permutation全拍列】
- Ignatius and the Princess II( next_permutation() )
- HDOJ 1027 Ignatius and the Princess II - next_permutation函数
- HDUOJ 1027 Ignatius and the Princess II(next_permutation)
- 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问题】(3.14)
- HDU 1027 Ignatius and the Princess II next_permutation函数(也可以用DFS......)
- 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 )
- 【夏苗苗】给你的表单加上验证
- Javascript模块化编程(一):模块的写法
- 数据库索引 类型
- 好的交互设计师是怎样成长的?
- ios 键盘遮盖TextField的解决方法
- HDU 1027 Ignatius and the Princess II 【next_permutation(a,a+n)的应用】
- JAVA字符串格式化-String.format()的使用
- Oracle数字处理函数
- 恶意抢注商标事件层出 国内知识产权保护堪忧
- 极速购吧---天天九块九包邮
- Centos下报“is not in the sudoers file”错误
- top命令
- zoj2770
- 一种利用js实现的仿淘宝商品评价功能的方法