hdu 1027 全排列函数next_permutation运用
2015-04-26 22:22
267 查看
Ignatius and the Princess II
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5511 Accepted Submission(s): 3236
[align=left]Problem Description[/align]
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?
[align=left]Input[/align]
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.
[align=left]Output[/align]
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.
[align=left]Sample Input[/align]
6 4 11 8
[align=left]Sample Output[/align]
1 2 3 5 6 4 1 2 3 4 5 6 7 9 8 11 10
[align=left]Author[/align]
Ignatius.L
#include <stdio.h> #include <algorithm> #define maxn 10010 using namespace std; int main() { int n,m; int sequence[maxn]; while(scanf("%d%d",&n,&m)!=EOF) { for(int i=1;i<=n;i++) sequence[i]=i; m--; while(m--) next_permutation(sequence+1,sequence+n+1);//对sequence数组全排列; for(int i=1;i<=n;i++) { if(i==1) printf("%d",sequence[i]); else printf(" %d",sequence[i]); } printf("\n"); } return 0; }
顺便附上hdu1716的 next_permutation的代码:
#include <stdio.h> #include <algorithm> using namespace std; int main() { int num[4]; int check[4]; int count=0; while(1) { for(int i=0;i<4;i++) { scanf("%d",&num[i]); } if(num[0]==0&&num[1]==0&&num[2]==0&&num[3]==0) break; if(count!=0) printf("\n"); count++; sort(num,num+4); int k=0; for(int i=0;i<4;i++) { if(num[i]!=0) check[k++]=num[i]; } k=0; int t=check[0]; int si=0; do { if(num[0]==0) continue; if(num[0]!=t) { t=num[0]; printf("\n"); si=0; } if(si!=0) printf(" "); for(int i=0;i<4;i++) { printf("%d",num[i]); } si++; }while(next_permutation(num,num+4)); printf("\n"); } return 0; }
相关文章推荐
- hdu 1027 全排列函数next_permutation运用
- HDU-1027 组合数 STL-next_permutation
- HDU 1027 Ignatius and the Princess II 【next_permutation(a,a+n)的应用】
- hdu 1027 STL next_permutation
- HDU 1027 Ignatius and the Princess II【STL- next_permutation全拍列】
- hdu_1027(好吧。。。牛。。。next_permutation也可以水过)
- HDU 1027 STL中next_permutation的应用
- hdu--1027-next_permutation||dfs
- HDU 1027 Ignatius and the Princess II(next_permutation()的应用)
- C++标准库:<algorithm>next_permutation() HDU - 1027
- Ignatius and the Princess II (HDU 1027) ——next_permutation排列函数
- 全排列next_permutation的用法 HDU 1027 PKU 3187 1146 1731
- HDU 1027 Ignatius and the Princess II (next_permutation)
- next_permutation & prev_permutation & hdu 1027 Ignatius and the Princess II
- hdu 1027 输出第m个全排列(next_permutation)
- HDU 1027--Ignatius and the Princess II【next_permutation】
- hdu 1027 hdu 1716 (next_permutation的使用)
- 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(stl,next_permutation)