求非空子集(定序)

来源:互联网 发布:jsp java注释 编辑:程序博客网 时间:2024/06/05 14:44
#include<stdio.h>#include<string.h>int n;int a[30];void notempty_subset(int cur){int start = cur?a[cur-1]+1 : 0;for(int i=start; i < n; ++i){a[cur] = i;for(int j = 0; j <= cur; ++j){printf("%d ",a[j]);}putchar(10);notempty_subset(cur+1);}}int main(){//freopen("out.txt","w",stdout);while(scanf("%d", &n) == 1){notempty_subset(0);}}

0 0
原创粉丝点击