92. 递归实现指数型枚举

#include <bits/stdc++.h>
using namespace std;
int n;
int a[16],vis[16];
int main()
{
    cin >> n;
    for (int i = 0; i < n; i ++ )
        a[i]=i+1;
    int state;
    cout<<endl;
    for(state=1;state<(1<<n);state++)
    {
        for (int j = 0; j <n; j ++ )
        {
            if((state>>j)&1)
                printf("%d ",a[j]);
        }
        cout << endl;
    }
    return 0;
}

Donate