By local optimal algorithms to solve global optimal solution.
Change issues:
25n+10m+5a+1b = target
n+m+a+b = count
In determining the target condition, the lowest count
By local optimal algorithms to solve global optimal solution.
Change issues:
25n+10m+5a+1b = target
n+m+a+b = count
In determining the target condition, the lowest count