HDU1027 Ignatius and the Princess II
2016-03-04 20:53
218 查看
Ignatius and the Princess II
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6304 Accepted Submission(s): 3729
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
Author
Ignatius.L
题意:求n个数(1~n)的全排列的第m个。
分析:next_permutation()函数轻松搞定。
<span style="font-size:18px;">#include <iostream> #include <cstdio> #include <cstring> #include <stack> #include <queue> #include <map> #include <set> #include <vector> #include <cmath> #include <algorithm> using namespace std; const double eps = 1e-6; const double pi = acos(-1.0); const int INF = 0x3f3f3f3f; const int MOD = 1000000007; #define ll long long #define CL(a,b) memset(a,b,sizeof(a)) #define MAXN 100010 int n,m; int s[1010]; int main() { while(scanf("%d%d",&n,&m)==2) { for(int i=0; i<n; i++) s[i] = i+1; int t=1; bool flag=false; while(next_permutation(s, s+n)) { /* for(int i=0; i<n; i++) { if(i!=0)printf(" "); printf("%d",s[i]); } printf("\n"); */ if(flag) break; t++; if(t == m) { flag = true; for(int i=0; i<n; i++) { if(i!=0)printf(" "); printf("%d",s[i]); } } } printf("\n"); } } </span>
相关文章推荐
- OC_协议代理
- 多态计算机程序
- python下RSA 加密/解密,签名/验证
- 浅析HashMap源码
- SQLException: Communications link failure
- 数据库连接池的工作原理
- hitTest:方法练习 - 点击事件穿透
- 支持向量机通俗导论(理解SVM的三层境界)
- hdu 1027 Ignatius and the Princess II
- hadoop中URI理解
- 我的第一篇博客
- Xshell 缺少 mfc110.dll
- 使用Python的netCDF4和matplotlib.basemap包进行气象数据的可视化
- 【BZOJ1098】[POI2007]办公楼biu【BFS/DFS】【链表优化】【补图】
- OC_内存管理:MRC与ARC
- typedef的使用3——使用经过typedef定义的函数构成的函数数组
- 求最小公倍数(公式法)的实现
- POJ3581 Sequence(后缀数组)
- 大论文中对参考文献添加操作相关总结
- 文件缓存