hdoj Ignatius and the Princess II (全排列)
2016-03-05 13:31
381 查看
Ignatius and the Princess II
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6360 Accepted Submission(s): 3761
[align=left]Problem Description[/align]
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?
[align=left]Input[/align]
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.
[align=left]Output[/align]
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.
[align=left]Sample Input[/align]
6 4
11 8
[align=left]Sample Output[/align]
1 2 3 5 6 4
1 2 3 4 5 6 7 9 8 11 10
#include<stdio.h> #include<string.h> #include<algorithm> #define INF 0x3f3f3f3f #define ll long long #define N 100010 using namespace std; int a ; int main() { int n,m; while(scanf("%d%d",&n,&m)!=EOF) { for(int i=1;i<=n;i++) a[i]=i; int k=1; while(next_permutation(a+1,a+n+1))//全排列函数 { k++; if(k==m) break; } for(int i=1;i<n;i++) printf("%d ",a[i]); printf("%d\n",a ); } return 0; }
相关文章推荐
- HBase—扫描器
- 地址的层次性
- CocoaPods安装及使用
- Understanding the JVM Reading Notes 1
- Codeforces Round #341 (Div. 2)C. Wet Shark and Flowers(数学期望)
- linux ---jenkins的安装与配置
- 作死之旅: 数据动态可视化
- hdu-5437 Alisha’s Party (优先队列)
- 一起看代码来玩玩QT之18 QSqlDatabase (three 将database 通过 QTableView显示到界面上,并且增删改查
- Android开发问题记录(一)——启动Eclipse报错:发现了以元素 'd:skin' 开头的无效内容
- opencv学习三
- Java web学习(二)
- ViewPager实现无限循环,左右滑动,定时轮播及内存泄漏处理
- 2..移动APP开发使用什么样的原型设计工具比较合适?
- 光线与包围盒(AABB)的相交检测算法
- PHP中不同编码的汉字占的字节数不同gbk,GBK,UTF-8,utf-8
- 白话Spring(基础篇)---AOP(实例篇-3)
- PAT (Advanced Level) Practise 1025 PAT Ranking (25)
- P酱的冒险旅途(思维)
- linux 下的编程效率分享