-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathAssign6A.c
More file actions
69 lines (55 loc) · 1.65 KB
/
Assign6A.c
File metadata and controls
69 lines (55 loc) · 1.65 KB
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
//To find the minimum no. of coins required to make given amount and also the no. of coins of particular denomination.
#include<stdio.h>
#define INF ((int)1e+6)
#define max(a,b) ((a)>(b)?a:b)
#define min(a,b) ((a)<(b)?a:b)
int main()
{
int n,i=0,j,sum,max1=0,k=0;
printf("Enter sum->");
scanf("%d",&sum); //sum is amount of money required.
int denom[sum+1][501]; //denom array is made to store no. of coins of different denominations.
printf("Enter n->");
scanf("%d",&n); //n is no. of coins of different denominations.
int val[1000]; //val array is to store the value of denominations.
while(i<n) //while loop is to store the given data.
{
scanf("%d",&val[i]);
max1=max(max1,val[i]);
i++;
}
int result[sum+1]; //result array is to store the minimum no. of coins required for variable sum.
result[0]=0;
int temp;
for(i=1;i<=sum;i++) //nested loop for filling entries of result array.
{
temp=INF;
for(j=0;j<n;j++)
{
if(val[j]<=i && result[i-val[j]]+1<temp)
{
temp=result[i-val[j]]+1;
for(k=0;k<=min(i,max1);k++)
denom[i][k]=0;
for(k=0;k<=min(i-val[j],max1);k++) //for loop is to fill the entries of 2D array for given variable sum.
denom[i][k]=denom[i-val[j]][k];
denom[i][val[j]]+=1;
}
}
result[i]=temp;
}
if(result[sum]==INF)
printf("Denomination can't be made.");
else
{
printf("The minimum no. of coins required is %d\n",result[sum]);
printf("Following coins are needed->\n");
for(i=0;i<=min(max1,sum);i++) //for loop made for printing the no. of coins required of different denomination.
{
if(denom[sum][i]==0)
continue;
printf("%d coins are needed of denomination %d\n",denom[sum][i],i);
}
}
return 0;
}