{

bool t[n + 1][sum + 1];

//initialisation

for (int i = 0; i < n + 1; i++)

{

for (int j = 0; j < sum + 1; j++)

{

if (i == 0)

t[i][j] = false;

if (j == 0)

t[i][j] = true;

}

}

// inclusion or exclusion

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

{

for (int j = 1; j < sum + 1; j++)

{

if (arr[i - 1] <= j)

t[i][j] = t[i - 1][j - arr[i - 1]] || t[i - 1][j];

else

t[i][j] = t[i - 1][j];

}

}

return t[n][sum];

{

int arr[] = {1, 5, 11, 5}, sum;

int n = sizeof(arr) / sizeof(arr[0]);

cout << "enter the number to be found" << endl;

cin >> sum;

bool result = subsetsum(arr, sum, n);

cout << result;

}