HDUOJ 1027 Ignatius and the Princess II(next_permutation)
2017-08-05 19:52
459 查看
Ignatius and the Princess II
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8566 Accepted Submission(s): 5044
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?
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 4
11 8
Sample Output
1 2 3 5 6 4
1 2 3 4 5 6 7 9 8 11 10
Author
Ignatius.L
Recommend
We have carefully selected several similar problems for you: 1026 1038 1029 1008 1024
很简单的一道全排列题 就是最后的输出格式要注意一下 一行数据的最后一个数后面没有空格了 Presentation Error(程序输出格式有误)还是第一次见 以后注意
#include<cstdio> #include<algorithm> #include<iostream> using namespace std; int main(){ int a[1010]; int m,n; while(~scanf("%d %d",&m,&n)) { for(int i=0;i<m;i++) a[i]=i+1; for(int j=1;j<n;j++) { next_permutation(a,a+m); } for(int k=0;k<m-1;k++) printf("%d ",a[k]); printf("%d\n",a[m-1]); } return 0; }
相关文章推荐
- 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(a,a+n)的应用】
- HDU 1027 Ignatius and the Princess II(stl,next_permutation)
- Ignatius and the Princess II (HDU 1027) ——next_permutation排列函数
- HDU 1027 Ignatius and the Princess II (产生第m大的排列,STLmap中的next_permutation(array,array+n);)
- 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函数去做的)
- HDU.1027 Ignatius and the Princess II【全排列:关于next_permutation问题】(3.14)
- HDU——1027Ignatius and the Princess II(next_permutation函数)
- Ignatius and the Princess II( next_permutation() )
- 1/20集训一 STL I.(next_permutation 寻找第N小序列子串) Ignatius and the Princess II
- hdu 1027 Ignatius and the Princess II(产生第m大的排列,next_permutation函数)
- HDU1027 Ignatius and the Princess II 【next_permutation】【DFS】
- Combinatorics——HDUOJ 1027 - Ignatius and the Princess II
- HDOJ 1027 Ignatius and the Princess II - next_permutation函数
- hdu Ignatius and the Princess II_STL next_permutation的用法
- HDU 1027 Ignatius and the Princess II next_permutation函数(也可以用DFS......)