Embedded Files
//SUM OF SUBSET
#include <stdio.h>
#define MAX_ELEMENTS 100
void findSubsets (int arr[], int n, int sum) {
int subset [MAX_ELEMENTS];
int subsetSize = 0;
int total = 0;
int i, j;
for (i = 0; i < (1 << n); i++) {
total = 0;
subsetSize 0:
for (j = 0; j < n; j++) {
if (i & (1<< j)) {
total += arr[j];
subset [subsetSize++] = arr[j];
}
}
if (total == sum) {
printf("Subset with sum %d: ", sum);
for (j = 0; j < subsetSize; j++) {
printf("%d", subset[j]);
}
printf("\n");
}
}
int main(){
int n,i, arr[MAX_ELEMENTS], sum;
printf("Enter number of elements: "); scanf("%d", &n);
printf("Enter the elements: \n");
for (i=0; i < n; i++) {
scanf("%d", &arr[i]);
}
printf("Enter the target sum: "); scanf("%d", &sum);
findSubsets (arr, n, sum);
return 0;
}
//BINOMIAL
#include <stdio.h>
// Function for binomial coefficient table
void bin_table(int val) {
for (int i = 0; i <= val; i++) {
printf("%2d", i);
int num = 1;
for (int j = 0; j <= i; j++) {
if (i != 0 && j != 0)
num = num * (ij+1) / j;
printf("%4d", num);
}
printf("\n");
}
}
int main(){
int value;
printf("Enter the value for the binomial coefficient table: ");
scanf("%d", &value);
if (value < 0) {
printf("Invalid input. Please enter a non-negative value.\n"); return 1; // Return error code
}
bin_table(value);
return 0;
}
Page updated
Google Sites
Report abuse