Given an unlimited number of coins, the value of 25 points, 10 points, 5 points and 1 points, write code calculation n there are several representations

Solution:

This is a recursive problem, and we want to figure out how to use the earlier answer (the answer to the sub-question) to calculate the Makechange (n).

public int makechange (int n,int denom)
{
int next_denom=0;
Switch (denom)
{
Case 25:
next_denom=10;
Break
Case 10:
next_denom=5;
Break
Case 5:
Next_denom=1;
Break
Case 1:
return 1;
}
int ways=0;
for (int i=0;i*denom<=n;i++)
Ways+=makechange (N-i*denom,next_denom);
return ways;
}

System.out.writeln (Makechange (100,25));

Copyright NOTICE: This article for Bo Master original article, without Bo Master permission not reproduced.

Given an unlimited number of coins, the value of 25 points, 10 points, 5 points and 1 points, write code calculation n there are several representations