2021-11-13硬币找钱问题

最新推荐文章于 2024-11-11 23:32:39 发布

qijingke123

最新推荐文章于 2024-11-11 23:32:39 发布

阅读量348

点赞数

文章标签： c++

本文链接：https://blog.csdn.net/qijingke123/article/details/121303256

版权

贪婪算法找零问题硬币组合 C++编程算法实现

关键词由CSDN通过智能技术生成

#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
int Coins[6];
int CoinNum = 0;
int Pay;
int CoinValue[6] = {5, 10, 20, 50, 100, 200};
int ChangeValue[7] = {0, 5, 10, 20, 50, 100, 200};
int RealMoney = CoinValue[0] - ChangeValue[0];
void getData()
{
   for (int i = 0; i < 6; ++i)
   cin>> Coins[i];
   double costt;
   cin >> costt;
   Pay = (int)(costt * 100);

}
void outputResult()
{
   if (CoinNum == 0 || Pay != 0)
   {
   cout<< "impossible" << endl;
   }
   else
   {
       cout<< CoinNum << endl;
   }
}
int contains(int a)
{
   for (int i = 0; i < 6; ++i)
       if (CoinValue[i] == a && Coins[i] > 0)
           return i;
   return -1;
}
void Greed(){
   for (int i = 5; i >= 0; --i){
       if (Coins[i] > 0) {
           for (int j = 0; j <= i; ++j){
               RealMoney = CoinValue[i] - ChangeValue[j];
               if (Pay >= RealMoney){
                   if (Coins[i] >= Pay / RealMoney){
                       int TempCoinNum = Pay / RealMoney;
                       CoinNum += TempCoinNum * 2;
                       if (contains(RealMoney) != -1){
                           TempCoinNum = min(TempCoinNum, Coins[contains(RealMoney)]);
                           CoinNum -= TempCoinNum;
                           Coins[contains(RealMoney)] -= TempCoinNum;
                       }
                       else
                           Coins[i] -= Pay / RealMoney;
                       Pay = Pay % RealMoney;
                       if (contains(CoinValue[i]) == -1)
                           break;
                   }
                   else {
                       CoinNum += Coins[i];
                       Pay = Pay - CoinValue[i] * Coins[i];
                       Coins[i] = 0;
                   }
               }
           }
       }
   }
}