zoukankan      html  css  js  c++  java
  • ACM_寻找第N小序列

    寻找第N小序列

    Time Limit: 2000/1000ms (Java/Others)

    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
    解题思路:万能STL中的next_permutation(a,a+n)可以找到第m-1个全排列。注:如果m>(n!-1),next_permutation(a,a+n)就会继续从有序序列开始再进行全排列。
    AC代码:
     1 #include<bits/stdc++.h>
     2 using namespace std;
     3 int n,m,a[1005];
     4 int main(){
     5     while(cin>>n>>m){
     6         for(int i=0;i<n;++i)a[i]=i+1;
     7         for(int i=1;i<m;++i)next_permutation(a,a+n);//第m-1次的全排列
     8         for(int i=0;i<n;++i)cout<<a[i]<<(i==n-1?'
    ':' ');
     9     }
    10     return 0;
    11 }
  • 相关阅读:
    Vivado生成及使用edf文件
    ZYNQ Block Design中总线位宽的截取与合并操作
    Modelsim问题集锦
    Questasim10.6c下载安装教程
    ZYNQ工程PL顶层创建block module报错解决
    Linux自定义应用程序及其菜单图标
    OpenWRT DNS无法解析WAN连接的内网服务器域名
    Wishbone总线从接口转Xilinx MIG (Spartan 6)
    Wishbone总线接口RAM
    Windows系统下将目录挂载为一个磁盘并分配盘符
  • 原文地址:https://www.cnblogs.com/acgoto/p/9266106.html
Copyright © 2011-2022 走看看