{

int subsetsum(int arr[], int sum, int n)

{

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

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

{

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

{

if (i == 0)

t[i][j] = 0;

if (j == 0)

t[i][j] = 1;

}

}

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 if (arr[i - 1] > j)

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

}

return t[n][sum];

}

{

int arr[] = {1, 1, 2, 3}, sum = 0, diff = 1;

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

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

sum = sum + arr[i];

int ss_sum = ((diff + sum) / 2);

ct_of_ss_with_given_diff ob;

int result = ob.subsetsum(arr, ss_sum, n);

cout << result;

}