HDU 1027(全排列)
来源:互联网 发布:kanahei知乎 编辑:程序博客网 时间:2024/06/01 23:04
Ignatius and the Princess II
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8458 Accepted Submission(s): 4981
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
思路:使用STL中的next_permutation()函数产生比当前排列大的排列
代码:
#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;
int n,m;
int s[1010];
int main(){
while(scanf("%d%d",&n,&m)==2) {
for(int i=0; i<n; i++)
s[i] = i+1;
int t=1;
bool flag=false;
while(next_permutation(s, s+n)) {
if(flag) break;
t++;
if(t == m){
flag = true;
for(int i=0; i<n; i++){
if(i!=0)
printf(" ");
printf("%d",s[i]);
}
}
}
printf("\n");
}
}
#include <iostream>
#include <algorithm>
using namespace std;
int n,m;
int s[1010];
int main(){
while(scanf("%d%d",&n,&m)==2) {
for(int i=0; i<n; i++)
s[i] = i+1;
int t=1;
bool flag=false;
while(next_permutation(s, s+n)) {
if(flag) break;
t++;
if(t == m){
flag = true;
for(int i=0; i<n; i++){
if(i!=0)
printf(" ");
printf("%d",s[i]);
}
}
}
printf("\n");
}
}
阅读全文
0 0
- hdu 1027(全排列)
- HDU 1027(全排列)
- HDU 1027 全排列
- HDU 1027 全排列
- HDU-1027-全排列
- hdu 1027全排列
- HDU 1027 全排列 (STL_permution)
- hdu 1716 排列2 (全排列)
- HDU 1027 Ignatius and the Princess II(全排列)
- hdu 1027 字典序全排列
- hdu 1027 全排列函数next_permutation运用
- HDU 1027 A - 怎么了【全排列】
- HDU-2616 全排列
- hdu 2610 全排列
- HDU 1716 排列2(全排列函数的应用)
- HDU-1716()(全排列+重集排列)
- hdu 1716 全排列算法
- HDU 4068 全排列+模拟
- errno
- HDFS-源码分析(1)-序列化基础
- ImageLoader的简单应用
- [LeetCode] 611. Valid Triangle Number
- 李阳英语全集
- HDU 1027(全排列)
- WIN XP SP2系统经常性死机问题解决历程
- 多态
- 周志华《Machine Learning》 学习笔记系列--目录
- Java集合——ArrayList
- 程序员面试金典:无缓存交换、井字棋
- laravel上传图片步骤
- gulp与webpack的区别
- poj 1039 直线与直线相交的问题