贪心算法——找零钱问题

100元面值一下的找零

按实际情况分一下面值的:100,50,10,5,2,1,0.5,0.2,0.1;

程序如下:

#include<stdio.h>
#define MAXN 9
int parvalue[MAXN]={10000,5000,1000,500,200,100,50,20,10};
int num[MAXN]={0};
int exchange(int n)
{
int i,j;
for(i=0;i<MAXN;i++)
if(n>=parvalue[i]) break;//找到比n小的最大面值; 
while(n>0 && i<MAXN)
{
if(n>=parvalue[i])
{
n-=parvalue[i];
num[i]++;
}
else if(n<10 && n>=5)
{
num[MAXN-1]++;
break;
}
else
i++;
}
return 0;
}
main()
{
int i;
float m;
printf("请输入要找的零钱数:");
scanf("%f",&m);
exchange((int)100*m);
printf(" %.2f元零钱的组成: ",m);
for(i=0;i<MAXN;i++)
if(num[i]>0)
printf("%6.2f:%d张 ",(float)parvalue[i]/100.0,num[i]);
getchar();
return 0;
}


原文地址:https://www.cnblogs.com/acmwangpeng/p/5524913.html