7.18
来源:互联网 发布:unity3d程序员简历 编辑:程序博客网 时间:2024/06/05 15:44
Ignatius and the Princess II
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3732 Accepted Submission(s): 2248
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
解题思路: 这题我直接用全排列,因为数不太大,要弄求第几个排列,就调用next_peimutation几次,然后在输出
源代码:
#include <cstdio>#include <iostream>#include <algorithm>using namespace std;int main(){ int i,j; int n,m; int a[1001]; while (~scanf("%d %d",&n,&m)) { for (i=1;i<=n;i++) a[i]=i; for (i=1;i<m;i++)//第一次有序所以只需执行m-1次 { next_permutation(a+1,a+1+n); } for (i=1;i<=n;i++) { printf("%d",a[i]); if (i!=n) printf(" "); } printf("\n"); } return 0;}
阅读全文
0 0
- 7.18
- 7.18
- 7.18
- 7.18
- 7.18
- 7.18
- 7.18
- 7.18
- 7.18
- 7.18
- 7.18
- 7.18
- 7.18小雨
- 7.18计划
- 建议7.18
- 7.18计划
- MZOI-7.18
- C++7.18
- 自省
- 13.3小米笔记本安装ubuntu(linux)后无法正常打开wifi的解决方法
- Tensorflow:深度神经网络DNN预测波士顿房价(boston house price)【一】
- Python 中 import 的机制与实现
- 蓝牙的OSAL框架介绍
- 7.18
- python之百度首页搜索设置的鼠标捕获功能代码(2017年新款百度首页)
- excel中利用vba合并多个sheet页和合并多个excel文档
- C语言:返回指针的函数,函数声明、定义和调用,嵌套调用
- django-QuerySet
- 性能优化:Trove集合库
- POJ 1751Highways(Prim存储路径模板)
- Android消息机制笔记
- 单链表的中间元素