Subset of a set

Tag: subset

Int wtosigarray (int * a, int N) // eliminates repeated elements {int I, j, k; for (I = k = 1; I <n; I ++) {for (j = 0; j <K; j ++) {if (a [J] = A [I]) {break ;}} if (j = k) {A [k] = A [I]; k ++ ;}} return K ;}int subset (int * a, int N, int * B, int M, int cur) // set a, output a subset of M elements B {static int number = 0; If (cur = m) {number ++; For (INT I = 0; I <m; I ++) {printf ("% d", B [I]);} printf ("\ n") ;}else {for (INT I = 0; I <n; I ++) {int OK = 1; for (Int J = 0; j <cur; j ++) {If (B [J] = A [I] | B [J]> A [I]) {OK = 0 ;}} if (OK) {B [cur] = A [I]; subset (A, N, B, M, cur + 1) ;}} return number ;} int wsubset (int * a, int N, int m) {int n = wtosigarray (A, n); printf ("to single data: \ n "); for (INT I = 0; I <n; I ++) {printf ("% d", a [I]) ;}printf ("\ nsubset: \ n "); int cur = 0; int * B = (int *) malloc (sizeof (INT) * m); int number = subset (A, N, B, m, cur); Delete [] B; B = NULL; return number ;}

Subset of a set