Ignatius and the Princess II( next_permutation() )
2016-03-05 20:41
357 查看
Ignatius and the Princess II
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6366 Accepted Submission(s): 3767
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
题目大意:给N个连续的自然数,进行排列,问第M小的序列。解题思路:next_permutation()函数解决排列问题 include<stdio.h> #include<string.h> #include<algorithm> using namespace std; int a[1100]; int main() { int n,m; while(scanf("%d%d",&n,&m)!=EOF) { memset(a,0,sizeof(a)); int i; for(i=0;i<n;i++) a[i]=i+1; for(i=1;i<=m-1;i++)//循环m-1次的原因:最小的那个序列是它刚开始时的顺序。 { next_permutation(a,a+n);//升序排列 } for(i=0;i<n-1;i++) printf("%d ",a[i]); printf("%d\n",a[n-1]); } return 0; }
相关文章推荐
- android开发之定制ListView(加载图片)
- C++析构函数为什么要为虚函数
- 前端学习总结(九)MongoDB——最出色的文档型数据库
- Spring进阶之路(6)-抽象Bean与工厂Bean以及获取Bean的id
- 如何使用Git客户端图形化进行文件(代码)上传
- 命名空间与多重继承
- 【Stanford CNN课程笔记】5. 神经网络解读1 几种常见的激活函数
- usaco 1.5.3 sprime
- BZOJ 3874: [Ahoi2014]宅男计划
- EVC在双核PC上调试速度慢的原因
- PAT程序设计考题——甲级1009(计算两个多项式相乘的积)
- Atom 精选实用快捷键
- 数据结构之堆栈与队列
- java特种兵读书笔记(5-8)——其他并发编程知识
- bootstrap学习笔记之二
- C#基础之三大结构
- 关于String自己例子
- 详解Google Authenticator工作原理
- 构造函数及析构函数与虚函数的关系
- 删除重复文件