Subset sequence

Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 4123    Accepted Submission(s): 2019

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 1 2 1 2 2 2 3 2 4 3 10

 

 

Sample Output

1 1 1 2 2 2 1 2 3 1

 

 

Author

LL

 

 

Source

 

 

Recommend

linle   |   We have carefully selected several similar problems for you:            

 

 

学习网址：

1 #include
     
       2 #include
      
        3 #include
       
         4 #include
        
          5 #include
         
           6 #include
          

q;27 while(m){28 count=0;29 t=m/c[j]-(m%c[j]==0?1:0);30 m-=t*c[j];31 m--;//去掉一个空集!!32 j--;33 for(i=1;i<=n;i++){34 if(!s[i]){35 count++;36 if(count==t+1){37 break;38 }39 }40 }41 s[i]=true;42 q.push(i);43 }44 printf("%d",q.front());45 q.pop();46 while(!q.empty()){47 printf(" %d",q.front());48 q.pop();49 }50 printf("\n");51 }52 return 0;53 }