HDU 1027 Ignatius and the Princess II 【next_permutation(a,a+n)的应用】
2014-10-28 15:01
429 查看
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?
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
#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; }
相关文章推荐
- 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 (HDU 1027) ——next_permutation排列函数
- HDU 1027 Ignatius and the Princess II (next_permutation)
- HDU 1027 Ignatius and the Princess II (产生第m大的排列,STLmap中的next_permutation(array,array+n);)
- next_permutation & prev_permutation & hdu 1027 Ignatius and the Princess II
- hdu Ignatius and the Princess II_STL next_permutation的用法
- HDU 1027 Ignatius and the Princess II next_permutation函数(也可以用DFS......)
- HDU——1027Ignatius and the Princess II(next_permutation函数)
- hdu 1027 Ignatius and the Princess II(产生第m大的排列,next_permutation函数)
- HDUOJ 1027 Ignatius and the Princess II(next_permutation)
- HDU 1027 Ignatius and the Princess II 排列生成
- HDU-#1027 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
- HDU 1027 Ignatius and the Princess II 全排列
- HDU 1027 Ignatius and the Princess II