杭电ACM HDU 2062 Subset sequence（java）

Problem Description

Consider the aggregate An= { 1, 2, …, n }. For example, A1={1}, A3={1,2,3}. A subset sequence is defined as a array of a non-empty subset. Sort all the subset sequece of An in lexicography order. Your task is to find the m-th one.

 

Input

The input contains several test cases. Each test case consists of two numbers n and m ( 0< n<= 20, 0< m<= the total number of the subset sequence of An ).

 

Output

For each test case, you should output the m-th subset sequence of An in one line.

 

Sample Input

1 12 12 22 32 43 10

 

Sample Output

111 222 1

2 3 1

import java.util.*;
public class Num2062 {
    public static void main(String args[]){
        Scanner sc = new Scanner(System.in);
        while(sc.hasNext()){
            int n=sc.nextInt();
            long m=sc.nextLong();
            List list=new LinkedList();
            List list1=new ArrayList();
            long num[]=new long[21];
            num[1]=1;num[2]=2;
            for(int i=3;i<n+1;i++){
                num[i]=num[i-1]*(i-1)+1;
            }
            list.add(0);
            for(int i=1;i<=n;i++){
                list.add(i);
            }
            for(int i=n;i>0;i--){
                if(m%num[i]==0){
                    list1.add(list.get((int) (m/num[i])));
                    list.remove(list.get((int) (m/num[i])));
                    m=num[i]-1;
                }
                else {
                    list1.add(list.get((int) (m/num[i])+1));
                    list.remove(list.get((int) (m/num[i])+1));
                    m=m%num[i]-1;
                    if(m==0)break;
                }
            }
            for(int i=0;i<list1.size();i++){
                if(i==0)System.out.print(list1.get(i));
                else System.out.print(" "+list1.get(i));
            }
            System.out.println();


        }
    }
}