-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathcoin change min coin.c
81 lines (72 loc) · 1.44 KB
/
coin change min coin.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
73
74
75
76
77
78
79
80
81
#include<stdio.h>
int min(int x,int y)
{
return (x>y?y:x);
}
void main()
{
int i,j;
int sum;
printf("Enter the sum\n");
scanf("%d",&sum);
int c;
printf("Enter the no coin\n");
scanf("%d",&c);
int coin[c+1];
for(i=1;i<=c;i++)
scanf("%d",&coin[i]);
int memo[c+1][sum+1];
for(i=1;i<=c;i++)
{
for(j=0;j<=sum;j++)
{
if(coin[i]<=j)
{
if(i==1)
{
memo[i][j]=1+memo[i][j-coin[i]];
}
else
{
if( j% ((memo[i][j-coin[i]]+1)*coin[i]) ==0 && j%(memo[i-1][j]*coin[i-1])==0 )
memo[i][j]=min(memo[i-1][j],memo[i][j-coin[i]]+1);
else if( j% ((memo[i][j-coin[i]]+1)*coin[i])==0)
memo[i][j]=memo[i][j-coin[i]]+1;
else
memo[i][j]=memo[i-1][j];
}
}
else
{
if(i==1)
memo[i][j]=0;
else
memo[i][j]=memo[i-1][j];
}
}
}
for(i=1;i<=c;i++)
{
for(j=0;j<=sum;j++)
{
printf("%d ",memo[i][j]);
}
printf("\n");
}
printf("ans=%d\n",memo[c][sum]) ;
i=c;
j=sum;
while(1)
{
if(memo[i][j]==(memo[i][j-coin[i]]+1) && (j-coin[i])>=0)
{
j=j-coin[i];
printf("%d ",coin[i]);
}
else
{
i--;
}
}
getch();
}