Subset Sum Problem

Page 1 2 3 4 5 6 7 8 9 10


SOURCE CODE


#include”iostream.h”
#include”conio.h”
#include <>
#define MAX 10

class subset
{
private:
int n,exsetsum,set[MAX],selected[MAX];
public:
void readset();
void setsum();
};

void subset::readset()
{
int i;
cout < < "Enter the Number Of Elements In The Set : "; cin > > n;
cout < < "\n Enter The Elements Of The Set \n"; for(i=1;i < =n;i++) cin > > set[i];
cout < < "\n Enter The Expected Sum Of Subset : "; cin > > exsetsum;
}
void subset::setsum()
{
int i,j,no,sum,k,s;
no=pow(2,n);
cout < < "\n All Possible Subsets Whose Sums Is Equal Is " < < i="1;i" s="i;" sum="0;" j="1;j" k="1;"> 0)
{
if(s%2)
{
sum+=set[k];
selected[k]=1;
}
s=s/2;
k++;
}

if(sum==exsetsum)
{
for(j=1;j < =n;j++) if(selected[j]) cout < <>