Scribd
Upload
11 views3 pages

Subset Sum

Uploaded by

ppp ppp
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
11 views3 pages

Subset Sum

Uploaded by

ppp ppp
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

#include<stdio.

h>
#include<stdlib.h>

int w[10];
int x[10];
int d;

void sumSubset(int s, int k, int r) {


int i;
static int b = 1;
x[k] = 1;

if (w[k] + s == d) {
printf("\nSubset %d) ", b++);
for (i = 1; i <= k; i++) {
if (x[i] == 1) {
printf("%d\t", w[i]);
}
}
} else if (s + w[k] + w[k + 1] <= d) {
sumSubset(s + w[k], k + 1, r - w[k]);
}

if ((s + r - w[k] >= d) && (s + w[k + 1] <= d)) {


x[k] = 0;
sumSubset(s, k + 1, r - w[k]);
}
}

int main() {
int n, i, sum = 0;

printf("\nSUBSET PROBLEM\n");
printf("\nEnter the number of elements - ");
scanf("%d", &n);

printf("\nEnter the elements (in increasing order) - ");


for (i = 1; i <= n; i++) {
scanf("%d", &w[i]);
sum += w[i];
}

printf("\nEnter the subset max value required - ");


scanf("%d", &d);

if (sum < d || w[1] > d) {


printf("\nNo subsets possible!!\n");
exit(0);
}

sumSubset(0, 1, sum);

return 0;
}

You might also like