找零问题

// money.cpp : 定义控制台应用程序的入口点。
//

#include "stdafx.h"
#include<iostream>
using namespace std;

int coinValue[] = {0,1,5,10,25 };
#define kindsOfcoin 4                    //硬币种类数

//动态规划版本
void findMIn(int money)
{
	int *coinNum = new int[money + 1]();   //存储1...money找零最少需要的硬币的个数  
	int *remeCoin = new int[money + 1]();  //最后加入的硬币，方便后面输出是哪几个硬币  
	coinNum[0] =remeCoin[0] = 0;

	for (int i = 1; i <= money; i++)          //i面值钱，需要最少硬币个数
	{
		int minNum = i;       
		int useCoin = 0;      //这次找零，在原来的基础上需要的硬币           

		for(int j=1;j<=kindsOfcoin;j++)
			if(i>=coinValue[j])
				//需要判断i - coinValue[j]是否能找的开，如果找不开，就不需要更新。
				if ((minNum > coinNum[i - coinValue[j]] + 1) && (i == coinValue[j] || remeCoin[i - coinValue[j]] != 0))
				{
					minNum = coinNum[i - coinValue[j]] + 1;
					useCoin = coinValue[j];
				}
		coinNum[i] = minNum;
		remeCoin[i] = useCoin;
	}

	if (remeCoin[money] == 0)
		cout << "找不开零钱" << endl;
	else
	{
		cout << "需要最少的硬币个数为：" << coinNum[money] << endl;
		cout << "所用到的硬币为："<<endl;
		while (money > 0)
		{
			cout << remeCoin[money] << ‘\t‘;
			money -= remeCoin[money];
		}
	}
	delete[]coinNum;
	delete[]remeCoin;
}

int main()
{
	cout << "请输入需要找零的金额" << endl;;
	int money;
	cin >> money;
	findMIn(money);
	while (1);
    return 0;
}