HDU 1027.Ignatius and the Princess II【全排列】【数学】【1月3】
来源:互联网 发布:什么是java迭代器 编辑:程序博客网 时间:2024/05/16 09:16
Ignatius and the Princess II
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
#include<iostream>#include<cstdio>#include<algorithm>using namespace std;int main(){ int n, m; while(scanf("%d %d", &n, &m) != EOF) { int f[1010]; for(int i = 0;i < n; ++i) f[i] = i+1; while(m-- > 1) next_permutation(f, f+n);//函数的两个参数分别是首尾地址,会生成比当前数列大1的数列 for(int i = 0;i < n; ++i) { if(i) cout <<" "; cout << f[i]; } cout << endl; } return 0;}
0 0
- HDU 1027.Ignatius and the Princess II【全排列】【数学】【1月3】
- HDU 1027 Ignatius and the Princess II 全排列
- hdu 1027 Ignatius and the Princess II 全排列
- HDU 1027 Ignatius and the Princess II (STL全排列)
- hdu 1027 Ignatius and the Princess II (STL 全排列)
- HDU 1027 Ignatius and the Princess II 全排列
- hdu 1027 Ignatius and the Princess II(STL全排列)
- hdu 1027 Ignatius and the Princess II (全排列)
- 【HDU 1027 Ignatius and the Princess II】+ 全排列 + STL
- HDU 1027 Ignatius and the Princess II(全排列)
- hdu1027 Ignatius and the Princess II(全排列)
- HDOJ 1027Ignatius and the Princess II(全排列)
- HDOJ 1027-Ignatius and the Princess II【全排列】
- hdoj Ignatius and the Princess II (全排列)
- hdoj 1027 Ignatius and the Princess II(全排列变形)
- hdoj 1027 Ignatius and the Princess II 【全排列】【STL】
- hdoj 1027 Ignatius and the Princess II (全排列)
- hdoj1027 Ignatius and the Princess II(全排列)
- windows下搭建react native开发环境
- 理论: 图论(9): 二分图匹配解释
- 2016 目标清单
- 高手遇事的处理方法
- 字符串匹配那些事(一)http://kb.cnblogs.com/page/107856/
- HDU 1027.Ignatius and the Princess II【全排列】【数学】【1月3】
- Ubuntu 14.04 14.10 samba配置
- 【bzoj1398】Vijos1382寻找主人 Necklace 最小表示法
- 请求发送者与接收者解耦——命令模式
- vs2015
- android编程中怎么将一个按钮置于最上层
- HDU 1394 Minimum Inversion Number(循环数组求逆序数)(暴力,归并排序,线段树)
- 每日一vim(18)Text-Object
- 20.3 线程的同步