hdu 2062 Subset sequence

Subset sequence

Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 4636    Accepted Submission(s): 2248

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

校庆杯Warm Up

 

 

Recommend

linle   |   We have carefully selected several similar problems for you:  2073 2082 2079 1111 1674 

 

推荐博客，超级详细： http://blog.csdn.net/lianqi15571/article/details/8877014#comments

 

附上代码：

 

#include <iostream>
#include <cstdio>
using namespace std;
int main()
{
    int i,n,t;
    __int64 m,c[21]= {0};
    int s[21];
    for(i=1; i<21; i++)
        c[i]=c[i-1]*(i-1)+1;
    while(~scanf("%d%I64d",&n,&m))
    {
        for(i=0; i<21; i++)
            s[i]=i;
        while(n>0&&m>0)
        {
            t=m/c[n]+(m%c[n]>0?1:0);
            if(t>0)
            {
                printf("%d",s[t]);
                for(i=t; i<=n; i++)
                    s[i]=s[i+1];
                m-=((t-1)*c[n]+1);
                if(m==0) printf("\n");
                else printf(" ");
            }
            n--;
        }
    }
    return 0;
}