hdu1027 全排列
来源:互联网 发布:c# 阿里云服务器 编辑:程序博客网 时间:2024/05/17 20:01
Ignatius and the Princess II
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6101 Accepted Submission(s): 3605
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
解题思路:主要是学会运用全排列所使用的函数解题,然后在输入按全排列顺序中的第m个数
#include "iostream"#include "algorithm"#include<string.h>using namespace std;void permutation(int* str,int length,int flag){sort(str,str+length);int temp=1;do{ if(flag==temp) {for(int i=0;i<length-1;i++)cout<<str[i]<<" ";cout<<str[length-1];cout<<endl;break; } temp++;}while(next_permutation(str,str+length));}int main(){int n,m;while(cin>>n>>m){ int str[1001];for(int i=1;i<=n;i++) { str[i-1]=i; }permutation(str,n,m);}return 0;}
0 0
- hdu1027 全排列 qsort
- hdu1027 全排列
- hdu1027 全排列(STL函数next_permutation)
- hdu1027 求第k个全排列
- hdu1027 Ignatius and the Princess II(全排列)
- hdu1027(使用next_permutation求第m小的全排列)
- hdu1027 Ignatius and the Princess II (全排列 & STL中的神器)
- HDU1027——Ignatius and the Princess II(全排列)
- hdu1027
- hdu1027
- hdu1027
- HDU1027
- hdu1027
- hdu1027 Ignatius and the Princess II(排列问题)
- 全排列
- 全排列
- 全排列
- 全排列
- VS获取mac和ip
- spring MVC和struts2区别
- ZOJ 2314 Reactor Cooling
- 解耦的好处以及哪来的这么多好处
- 大学一年半的生活总结
- hdu1027 全排列
- 前端框架 Vue 初探
- Android如何自定义MaterialDesign主题
- 【C#】—循环语句
- Android的消息处理机制 Handler Looper Message
- 近200篇机器学习深度学习资料分享
- LFS详细搭建指南——适合初学者使用
- 虚拟机linux下安装jdk和 hadoop
- 打印数值二进制形式