zoukankan      html  css  js  c++  java
  • HDUOJ

    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
     



    #include <iostream>
    #include <cstdio>
    #include <algorithm>
    using namespace std;
    
    int main()
    {
        int n, m;
        int prem[1024];
        while(cin >> n >> m)
        {
            for(int i = 0; i < 1024; i++)
                prem[i] = i;
            m--;
            while(m--)
                next_permutation(prem+1, prem+1+n);
            printf("%d", prem[1]);
            for(int i = 2; i <= n; i++)
                printf(" %d", prem[i]);
            printf("
    ");
        }
        return 0;
    }
    


  • 相关阅读:
    Custom vs. Automation Interface
    ModBus功能码
    Computer telephony integration
    Computersupported telecommunications applications
    Petri网可覆盖性树的构造算法 whl
    petri网学习笔记stochastic petri net分类 whl
    webpy猫腻之session with reloader
    Continuous Integration and Code Review 工具
    python中的操作符重载示例
    Software version rules
  • 原文地址:https://www.cnblogs.com/kunsoft/p/5312760.html
Copyright © 2011-2022 走看看