zoukankan      html  css  js  c++  java
  • HDU-1027Ignatius and princess II

    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
    #include<bits/stdc++.h>
    using namespace std;
    
    int main()
    {
    	int n,m,a[1010];
    	while(scanf("%d%d",&n,&m)!=EOF)
    	{
    		m--;
    		for(int i=0;i<n;i++) a[i]=i+1;
    		while(m--)
    		{
    			next_permutation(a,a+n);
    		}
    		for(int i=0;i<n-1;i++) printf("%d ",a[i]);
    		printf("%d
    ",a[n-1]);
    	}
    	
    	
    }
  • 相关阅读:
    VMware安装Centos7超详细过程
    LVS+Keepalived小试牛刀
    Spring入门之AOP篇
    Spring学习笔记及资源
    Spring入门第一例
    Mybatis学习手记(二)
    Mybatis学习手记(一)
    java web 开发入门实例
    关于JAVA编译时找不到自定义包的问题
    Java 学习笔记及资源
  • 原文地址:https://www.cnblogs.com/csushl/p/9386503.html
Copyright © 2011-2022 走看看