杭电ACM OJ 1027 Ignatius and the Princess II 全排列的第N个 康托展开

Ignatius and the Princess II

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 9097    Accepted Submission(s): 5313

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
   
   


   
   
翻译：第一个例子 6个数 1 2 3 4 5 6的全排列的第4个 输出为 1 2 3 5 6 4
   
   
有两个方法：1.字典序算法 就是c++库的那个next——什么方法，不用看我也知道他的源码是字典序求法。所以就算你执行了n-1次，复杂度也不会太高。2.康托展开：这里提供一个更优的方法，直接通过数学规律定位这个数 详细可以看
   
   
http://blog.csdn.net/qq_36523667/article/details/78659214

   
   


   
   
代码
   
   

   
   
int calculate(int n, int want) {
    List<Integer> list = new ArrayList<>();
    for (int i = 1; i <= n; i ++) {// 1 2 3 4 5
        list.add(i);
    }

    List<Integer> resultList = new ArrayList<>();

    int mod = want - 1;//15
    for (int i = n - 1; i >= 1; i --) {
        int levelPlus = 1;
        for (int j = i; j >= 1; j --) {
            levelPlus *= j;
        }
        int b = mod % levelPlus;
        int multiple = (mod - b) / levelPlus;
        mod = b;//3
        int num = list.remove(multiple);
        resultList.add(num);
    }
    resultList.add(list.get(0));
    // TODO: 2017/11/29 好像还有最后一个值
    for (int i = 0; i < resultList.size(); i ++) {
        System.out.print(resultList.get(i) + " ");
    }
    return 0;
}
   
   

   
   
全部代码
   
   

   
   
public class IgnatiusAndThePrincessTwo1027 {
    int n;
    int want;
    IgnatiusAndThePrincessTwo1027(int n, int want) {
        this.n = n;
        this.want = want;
        calculate(n, want);
    }

    int calculate(int n, int want) {
        List<Integer> list = new ArrayList<>();
        for (int i = 1; i <= n; i ++) {// 1 2 3 4 5
            list.add(i);
        }

        List<Integer> resultList = new ArrayList<>();

        int mod = want - 1;//15
        for (int i = n - 1; i >= 1; i --) {
            int levelPlus = 1;
            for (int j = i; j >= 1; j --) {
                levelPlus *= j;
            }
            int b = mod % levelPlus;
            int multiple = (mod - b) / levelPlus;
            mod = b;//3
            int num = list.remove(multiple);
            resultList.add(num);
        }
        resultList.add(list.get(0));
        // TODO: 2017/11/29 好像还有最后一个值
        for (int i = 0; i < resultList.size(); i ++) {
            System.out.print(resultList.get(i) + " ");
        }
        return 0;
    }
    //14352

    public static void main(final String[] args) throws Exception {
        IgnatiusAndThePrincessTwo1027 i = new IgnatiusAndThePrincessTwo1027(5, 16);
    }
}