Scribd
Upload
14 views2 pages

Subset

The document presents a C program that solves the Subset Sum Problem, allowing users to input a set of numbers and a target sum. The program calculates and displays all possible combinations of the input numbers that add up to the specified sum. An example output is provided, showing the solutions for a set of eight elements with a target sum of seven.

Uploaded by

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

Subset

The document presents a C program that solves the Subset Sum Problem, allowing users to input a set of numbers and a target sum. The program calculates and displays all possible combinations of the input numbers that add up to the specified sum. An example output is provided, showing the solutions for a set of eight elements with a target sum of seven.

Uploaded by

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

Subset Sum Problem

#include <stdio.h>

int n, a[100], i, x[100], total, sol_no;

void sumOfSubset(int sum, int k, int rem);

void main() {

int rem = 0;

printf("Enter the number of elements(value of n): ");

scanf("%d", &n);

printf("Enter the elements(Set of n elements): ");

for (i = 1; i <= n; i++) {

scanf("%d", &a[i]);

rem += a[i];

printf("Enter the sum total to be computed(value of d): ");

scanf("%d", &total);

printf("The possible combinations are:\n");

sumOfSubset(0, 1, rem);

void sumOfSubset(int sum, int k, int rem)

x[k] = 1;

if (sum + a[k] == total)

printf("Solution #%d:\t", ++sol_no);

for (i = 1; i <= k; i++)

if (x[i])

printf("%d\t", a[i]);

printf("\n");

else if (sum + a[k] + a[k + 1] <= total)


Subset Sum Problem

sumOfSubset(sum + a[k], k + 1, rem - a[k]);

if ((sum + rem - a[k] >= total) && (sum + a[k + 1] <= total))

x[k] = 0;

sumOfSubset(sum, k + 1, rem - a[k]);

OUTPUT:

Enter the number of elements(value of n): 8

Enter the elements(Set of n elements): 1 2 3 4 5 6 7 8

Enter the sum total to be computed(value of d): 7

The possible combinations are:

Solution #1: 1 2 4

Solution #2: 1 6

Solution #3: 2 5

Solution #4: 3 4

Solution #5: 7

=== Code Exited With Errors ===

You might also like