hdu1027
2016-03-05 11:55
253 查看
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u
Submit Status
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
Sample Output
这道题目用c++中的一个函数next_permutation(),找出全排列,过程中技术查找就可以。
Submit Status
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
这道题目用c++中的一个函数next_permutation(),找出全排列,过程中技术查找就可以。
#include<stdio.h> #include<algorithm> #include<iostream> using namespace std; int a[1010]; int main() { int n,m; while(scanf("%d%d",&n,&m)!=EOF) { for(int i=1;i<=n;i++) a[i]=i; int num=1; while(num<m) { next_permutation(a+1,a+1+n); num++; } for(int i=1;i<n;i++) printf("%d ",a[i]); printf("%d\n",a ); } return 0; }
相关文章推荐
- java小程序
- 如何查看 apahce 已经加在的模块
- iOS:App Extension Keyboard自定义高度
- IT十八掌作业_java基础第二天_进制转换原理和补码存储方式作业
- Git详解之二 Git基础
- Lua_第 14 章 Packages
- 使用基于ThinkPHP3.2.3的ThinkAdmin创建手机电脑通用的表白墙(二)自动判断设备以显示不同界面
- nyoj 合并游戏(状态压缩dp)
- JavaScript之 理解prototype(原型)
- STM32学习笔记(五) ------ I/O的几种工作模式及其应用场合
- 非mapreduce生成Hfile,然后导入hbase当中
- mysql5.6命令行执行sql文件,中文数据乱码解决办法
- vs2015多行注释与取消多行注释
- 非mapreduce生成Hfile,然后导入hbase当中
- 测试restful工具
- Android最简单的左右滑动轮播图,以及自动滚动
- Fedora安装搜狗输入法
- LeetCode : Median of Two Sorted Arrays [java]
- 华为荣耀3x畅玩版解锁
- 产生30个两位数以内的式子程序