-
Notifications
You must be signed in to change notification settings - Fork 0
/
Maximum Subset.c
72 lines (60 loc) · 955 Bytes
/
Maximum Subset.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
#include <stdio.h>
void subset(int n, int d, int w[])
{
int s,k,i,x[10];
for (i=1; i <= n; i++) x[i] = 0;
s = 0;
k = 1;
x[k] = 1;
while (1)
{
if( k <= n && x[k] == 1)
{
if ( s+w[k] == d)
{
printf("Solution is \n");
for (i = 1; i <= n; i++)
{
if (x[i] == 1)
printf("%d ",w[i]);
}
printf("\n");
x[k] = 0;
}
else if (s + w[k] < d )
{
s += w[k];
}
else
{
x[k] = 0;
}
}
else
{
k--;
while ( k >0 && x[k] == 0)
{
k--;
}
if (k == 0) break;
x[k] = 0;
s = s-w[k];
}
k = k + 1;
x[k] = 1;
}
}
void main()
{
int n,i,d,w[10];
printf("Enter the value of n");
scanf("%d",&n);
printf("Enter the set in increasing order\n");
for (i= 1; i <= n; i++)
scanf("%d",&w[i]);
printf("Enter the maximum subset value of D\n");
scanf("%d",&d);
subset(n,d,w);
getch();
}