#include<stdio.h>
#include<iostream>
using namespace std;
#define max 100
int a[max];
int b[max];
int n;
void dp(int k)
{
if (k > n)
{
for (int i = 1; i <= n; i++)
if (b[i] == 1)
cout << a[i] << " ";
cout << endl;
return;
}
else
{
for (int i = 0; i <= 1; i++)
{
b[k] = i;
dp(k + 1);
}
}
}
int main()
{
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
dp(1);
}
给定集合,求其子集,涉及知识--子集树
最新推荐文章于 2024-09-27 10:56:56 发布